Memory architecture and method of data organization optimized fo

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395425, 364DIG2, 364955, 364958, G06F 1202

Patent

active

053393988

ABSTRACT:
A hashing data storage and retrieval arrangement whose storage capacity is unaffected by collisions. A first memory serves as a hash index table, for storing pointers at each address location corresponding to a hash value generated by hashing a key data word. Each pointer is the address of a location in a second memory, which has a separate storage location for each key data word, its associated data, and a further pointer which is the address of the next key data word resulting from a collision during hashing. Preferably a pipeline register between the two memories permits hashing of a subsequent key data word while accessing of the second memory is still in progress.

REFERENCES:
patent: 4215402 (1980-07-01), Mitchell et al.
patent: 4290105 (1981-09-01), Cichelli et al.
patent: 4611272 (1986-09-01), Lomet
patent: 4730249 (1988-03-01), O'Quin, II et al.
patent: 4736287 (1988-04-01), Druke et al.
patent: 4807122 (1989-02-01), Baba
patent: 4897785 (1990-01-01), Zuger
patent: 4916658 (1990-04-01), Lee et al.
Horowitz et al., Fund. of Data Structuers in Pascal 1987, pp. 452-467.
Ralston et al., "Encyclopedia of Computer Science", 1976 p. 267.
I.E.E.E. Software 5 (1988) Jul., No. 4, New York, N.Y. USA "Multikey, Exensible Hashing for Relational Databases", pp. 77-85.

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

Memory architecture and method of data organization optimized fo does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Memory architecture and method of data organization optimized fo, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory architecture and method of data organization optimized fo will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-959627

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