DBScholar

Back to papers

Hashing in Practice, Analysis of Hashing and Universal Hashing

Summary: Links analytical hashing theory to practical performance on real files—covering successful, unsuccessful, and worst-case probe lengths. Shows that a specific class of hash functions (universal hashing) yields analytical performance in practice; experiments on real data strongly support the claim. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2453
Venue
SIGMOD
Year
1988
Pagerank
5.336928e-05
Overall Rank
8,995 | 38.29%
DOI
10.1145/50202.50223

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ramakrishna_sigmod88,
        title = {{Hashing in Practice, Analysis of Hashing and Universal Hashing}},
        author = {Ramakrishna, M.V.},
        series = {{SIGMOD} '88},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/50202.50223},
        url = {https://dl.acm.org/doi/10.1145/50202.50223},
        year = {1988}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
8,880 Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity 2022 SIGMOD 5.3524255e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2,961 Distribution-Dependent Hashing Functions and Their Characteristics 1975 SIGMOD 7.9173938e-05
6,242 Analysis of Bounded Disorder file organization 1988 PODS 5.9425753e-05
Previous Page 1 / 1 Next

Semantically Similar Papers