DBScholar

Back to papers

Trie Hashing

Summary: Trie Hashing introduces an ordered, dynamic hashing scheme for disk-resident records. It supports high-insert workloads at ~70% load, with a search that completes in a single disk access for files with millions of records, unmatched by prior ordered-file hashers. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2201
Venue
SIGMOD
Year
1981
Pagerank
0.00011605619
Overall Rank
1,221 | 91.63%
DOI
10.1145/582318.582322

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{litwin_sigmod81,
        title = {{Trie Hashing}},
        author = {Litwin, Witold},
        series = {{SIGMOD} '81},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582318.582322},
        url = {https://dl.acm.org/doi/10.1145/582318.582322},
        year = {1981}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 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
Previous Page 1 / 1 Next

Semantically Similar Papers