DBScholar

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
2651
Venue
SIGMOD
Year
1992
Pagerank
5.093636e-05
Overall Rank
13,087 | 10.22%
DOI
10.1145/130283.130317

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{analyti_sigmod92,
        title = {{FAST SEARCH IN MAIN MEMORY DATABASES}},
        author = {Analyti, Anastasia and Pramanik, Sakti},
        series = {{SIGMOD} '92},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/130283.130317},
        url = {https://dl.acm.org/doi/10.1145/130283.130317},
        year = {1992}
}

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
7 Implementation Techniques For Main Memory Database Systems 1984 SIGMOD 0.00083340894
219 A Study of Index Structures for Main Memory Database Management Systems 1986 VLDB 0.00024293529
5,150 External Perfect Hashing 1985 SIGMOD 6.3458215e-05
Previous Page 1 / 1 Next

Semantically Similar Papers