A High Performance, Universal, Key Associative Access Method

Summary: Introduces the DL-tree, a universal key-access method uniting digital B-trees and extendible hashing. Root-addressed, multipage nodes hold data/index entries; as the tree grows, it doubles and migrates data to upper pages, keeping data near the root. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2216
Venue: SIGMOD
Year: 1983
Pagerank: 6.340632e-05
Overall Rank: 4,224 | 70.65%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. David B. Lomet

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,279	Balanced Multidimensional Extendible Hash Tree	1986	PODS	6.2850695e-05
4,957	A Multikey Hashing Scheme Using Predicate Trees	1984	SIGMOD	5.8036922e-05
5,372	A Mapping Function for the Directory of a Multidimensional Extendible Hashing	1984	VLDB	5.5424242e-05

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,708	A Single-File Version Of Linear Hashing With Partial Expansions	1982	VLDB	0.00010802316
217	A Class of Data Structures for Associative Searching	1984	PODS	0.00033533621
5	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD	0.0018380955
5,217	Multi-Disk B-trees	1991	SIGMOD	5.621547e-05
4,493	A Multidimensional Digital Hashing Scheme for Files With Composite Keys	1985	SIGMOD	6.1371575e-05
1,903	Extendible Hashing for Concurrent Operations and Distributed Data	1983	PODS	0.00010149071
5,372	A Mapping Function for the Directory of a Multidimensional Extendible Hashing	1984	VLDB	5.5424242e-05
14,362	Multi-Table Search For B-Tree Files	1979	SIGMOD	-
4,957	A Multikey Hashing Scheme Using Predicate Trees	1984	SIGMOD	5.8036922e-05
4,279	Balanced Multidimensional Extendible Hash Tree	1986	PODS	6.2850695e-05