Search engine for large database search using hash pointers

Details Search engine for large database search using hash pointers Search engine for large database search using hash pointers

2005-07-12

2005-07-12

Rones, Charles (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

06917934

ABSTRACT:
A search engine (100) having a controller (112), a memory (114), and a hash pointer unit (110). The memory (114) includes a database of search data and associate content, and the controller (112) uses individual search values to access the memory (114) to obtain individual search results. The controller (112) includes a hash function (116) that generates a hash value from a, typically large, search value into a, typically smaller, hash value that may be a hash collision. The controller (112) converts the hash value into a hash address which is communicated to the hash pointer unit (110), which receives the hash address and provides a hash pointer that is communicated to and used by the memory to look up respective search results. In this manner hash collisions are avoided and the size of the memory (114) is not a function of the degree of multi-way set-associativity used.

REFERENCES:
patent: 6434662 (2002-08-01), Greene et al.

Affiliated with

Also associated with

Rating

Search engine for large database search using hash pointers does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Search engine for large database search using hash pointers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search engine for large database search using hash pointers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3429584