Large database search using content addressable memory and hash

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

06889225

ABSTRACT:
A hash-CAM (H-CAM) which may work with a controller and a memory containing a database of either search values and associate content or associate content by itself The H-CAM includes at least one set of paired hash units and CAM units and at least one logic unit. The CAM units hold values known to cause hash collisions in the respectively paired hash units, and the logic unit prioritizes the hash and CAM unit outputs to a single address value usable to access the memory and obtain a search result at the controller that is not the result of a hash collision. The H-CAM may optionally include a search data storage to store the search values, so that they need not be stored in the memory, and a comparator to determine and handle newly determined hash collisions.

REFERENCES:
patent: 5390359 (1995-02-01), Damerau
patent: 5414704 (1995-05-01), Spinney
patent: 6145064 (2000-11-01), Long et al.
patent: 6343289 (2002-01-01), Hunter et al.
patent: 6665297 (2003-12-01), Hariguchi et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Large database search using content addressable memory and hash does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-3432408

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.