Database Paper Browser

Back to papers

Fast Search In Main Memory Databases

Summary: Develops hash-based search methods for in-memory databases achieving at most one key comparison per lookup. Introduces fast search multi-directory hashing and its generalization, controlled search multi-directory hashing, yielding linearly increasing directory size with the number of records and outperforming existing single-directory hashing approaches. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2589
Venue
SIGMOD
Year
1992
Pagerank
4.1945683e-05
Overall Rank
12,893 | 10.31%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
9 Implementation Techniques For Main Memory Database Systems 1984 SIGMOD 0.0014279444
233 A Study of Index Structures for Main Memory Database Management Systems 1986 VLDB 0.00032021526
4,086 External Perfect Hashing 1985 SIGMOD 6.4608969e-05
Previous Page 1 / 1 Next

Semantically Similar Papers