The Reconstruction And Optimization Of Trie Hashing Functions

Summary: Extends Litwin's 1980 trie hashing with persistent metadata to recover the hashing function after crashes by saving state on storage. It provides reconstruction and optimization algorithms and a formal analysis of trie structure to prove correctness. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 7592
Venue: VLDB
Year: 1983
Pagerank: 5.1725247e-05
Overall Rank: 13,066 | 9.20%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

1. Leen Torenvliet
2. P. van Emde Boas

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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
1,203	Trie Hashing	1981	SIGMOD	0.00011782167

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
13,008	Order Preserving Linear Hashing Using Dynamic Key Statistics	1986	PODS	5.1725247e-05
494	Interpolation-Based Index Maintenance	1983	PODS	0.0001757322
5,533	A Mapping Function for the Directory of a Multidimensional Extendible Hashing	1984	VLDB	6.2446444e-05
4,982	A Multidimensional Digital Hashing Scheme for Files With Composite Keys	1985	SIGMOD	6.4830476e-05
8,867	Hashing in Practice, Analysis of Hashing and Universal Hashing	1988	SIGMOD	5.4195911e-05
8,250	A Dynamic Hash File for Random and Sequential Accessing	1983	VLDB	5.5236513e-05
4,929	The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space	2012	PODS	6.5050788e-05
4,335	Balanced Multidimensional Extendible Hash Tree	1986	PODS	6.8281849e-05
8,825	On Searching Compressed String Collections Cache-Obliviously	2008	PODS	5.4281865e-05
1,203	Trie Hashing	1981	SIGMOD	0.00011782167