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)
Incoming Non-self Citations Over Time
Authors
- 1. David B. Lomet (IBM)
BibTeX Citation
@inproceedings{lomet_sigmod83,
title = {{A HIGH PERFORMANCE, UNIVERSAL, KEY ASSOCIATIVE ACCESS METHOD}},
author = {Lomet, David B.},
series = {{SIGMOD} '83},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/582192.582213},
url = {https://dl.acm.org/doi/10.1145/582192.582213},
year = {1983}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,357 | Balanced Multidimensional Extendible Hash Tree | 1986 | PODS | 6.7463723e-05 |
| 5,185 | A Multikey Hashing Scheme Using Predicate Trees | 1984 | SIGMOD | 6.3281371e-05 |
| 5,577 | A Mapping Function for the Directory of a Multidimensional Extendible Hashing | 1984 | VLDB | 6.1661217e-05 |
Previous
Page 1 / 1
Next
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 |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,848 | A Single-File Version of Linear Hashing with Partial Expansions | 1982 | VLDB |
| 2 | 253 | A Class of Data Structures for Associative Searching | 1984 | PODS |
| 3 | 8 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD |
| 4 | 5,120 | Multi-Disk B-trees | 1991 | SIGMOD |
| 5 | 5,047 | A Multidimensional Digital Hashing Scheme for Files With Composite Keys | 1985 | SIGMOD |
| 6 | 5,577 | A Mapping Function for the Directory of a Multidimensional Extendible Hashing | 1984 | VLDB |
| 7 | 3,115 | Extendible Hashing for Concurrent Operations and Distributed Data | 1983 | PODS |
| 8 | 14,549 | Multi-Table Search For B-Tree Files | 1979 | SIGMOD |
| 9 | 5,185 | A Multikey Hashing Scheme Using Predicate Trees | 1984 | SIGMOD |
| 10 | 4,357 | Balanced Multidimensional Extendible Hash Tree | 1986 | PODS |