Database Paper Browser

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
2139
Venue
SIGMOD
Year
1981
Pagerank
0.00017483181
Overall Rank
730 | 94.93%
DOI
-

Incoming Non-self Citations Over Time

Authors

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
948 Distribution-Dependent Hashing Functions and Their Characteristics 1975 SIGMOD 0.00015112484
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
1,525 Cascade Hashing 1984 VLDB 0.00011513634
1,723 Unified Dynamic Hashing 1984 VLDB 0.00010753629
4,952 A Multikey Hashing Scheme Using Predicate Trees 1984 SIGMOD 5.8091931e-05
12,893 Fast Search In Main Memory Databases 1992 SIGMOD 4.1945683e-05
12,997 Order Preserving Linear Hashing Using Dynamic Key Statistics 1986 PODS 4.1945683e-05
1,708 A Single-File Version Of Linear Hashing With Partial Expansions 1982 VLDB 0.00010815668
5,363 A Mapping Function for the Directory of a Multidimensional Extendible Hashing 1984 VLDB 5.5471634e-05
4,286 Balanced Multidimensional Extendible Hash Tree 1986 PODS 6.2898839e-05
255 Interpolation-Based Index Maintenance 1983 PODS 0.00030498284
13,055 The Reconstruction And Optimization Of Trie Hashing Functions 1983 VLDB 4.1945683e-05