Forming linked lists using content addressable memory

Details Forming linked lists using content addressable memory Forming linked lists using content addressable memory

1996-10-18

1999-11-30

Choules, Jack M.

Data processing: database and file management or data structures

Database design

Data structure types

711108, 711118, 707 1, G06F 1730

Patent

active

059959673

ABSTRACT:
A linked list structure in a computing system includes a first entry and additional entries. Each additional entry includes a link reference to a prior entry in the linked list. The link reference for each additional entry all are stored within a content addressable memory. Each additional entry is accessible by performing a content search using the link reference to the prior entry. The linked list is traversed by accessing the first entry in the linked list. A second entry in the linked list is accessed by searching the content addressable memory with an index of the first entry. A third entry in the linked list is accessed by searching the content addressable memory with an index of the second entry.

REFERENCES:
patent: 3848234 (1974-11-01), MacDonald
patent: 4366551 (1982-12-01), Holtz et al.
patent: 4785398 (1988-11-01), Joyce et al.
patent: 5283882 (1994-02-01), Smith et al.
patent: 5657472 (1997-08-01), Van Loo et al.

Affiliated with

Also associated with

Rating

Forming linked lists using content addressable memory does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Forming linked lists using content addressable memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Forming linked lists using content addressable memory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1687302