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)
Incoming Non-self Citations Over Time
Authors
- 1. Witold Litwin (INRIA)
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.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,312 | A Multikey Hashing Scheme Using Predicate Trees | 1984 | SIGMOD | 6.1839337e-05 |
| 5,508 | The Interpolation-Based Grid File | 1985 | PODS | 6.0988906e-05 |
| 5,899 | HydraList: A Scalable In-Memory Index Using Asynchronous Updates and Partial Replication | 2020 | VLDB | 5.9521778e-05 |
| 6,376 | Analysis of Bounded Disorder file organization | 1988 | PODS | 5.8064898e-05 |
| 8,553 | A Dynamic Hash File for Random and Sequential Accessing | 1983 | VLDB | 5.3158185e-05 |
| 9,116 | Compact O-Complete Trees | 1988 | VLDB | 5.2258409e-05 |
| 13,535 | Query Processing on Personal Computers: A Pragmatic Approach (Extended Abstract) | 1984 | VLDB | 4.9769913e-05 |
| 13,538 | A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table | 1984 | VLDB | 4.9769913e-05 |
| 13,550 | The Reconstruction and Optimization of Trie Hashing Functions | 1983 | VLDB | 4.9769913e-05 |
| 13,563 | An Implementation of Impure Surrogates | 1982 | VLDB | 4.9769913e-05 |
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 |
|---|---|---|---|---|
| 3,024 | Distribution-Dependent Hashing Functions and Their Characteristics | 1975 | SIGMOD | 7.7362766e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,409 | Cascade Hashing | 1984 | VLDB |
| 2 | 5,312 | A Multikey Hashing Scheme Using Predicate Trees | 1984 | SIGMOD |
| 3 | 2,798 | Unified Dynamic Hashing | 1984 | VLDB |
| 4 | 13,383 | Fast Search In Main Memory Databases | 1992 | SIGMOD |
| 5 | 13,491 | Order Preserving Linear Hashing Using Dynamic Key Statistics | 1986 | PODS |
| 6 | 3,930 | A Single-File Version of Linear Hashing with Partial Expansions | 1982 | VLDB |
| 7 | 5,708 | A Mapping Function for the Directory of a Multidimensional Extendible Hashing | 1984 | VLDB |
| 8 | 4,445 | Balanced Multidimensional Extendible Hash Tree | 1986 | PODS |
| 9 | 522 | Interpolation-Based Index Maintenance | 1983 | PODS |
| 10 | 13,550 | The Reconstruction and Optimization of Trie Hashing Functions | 1983 | VLDB |