DBScholar

Back to papers

Balanced Multidimensional Extendible Hash Tree

Summary: Order-preserving multidimensional extendible hashing with a hierarchical, B-tree–like directory that grows nearly linearly with insertions irrespective of key distribution. Guarantees ≤3 disk I/Os for exact-match (dirs ≤2^s) and supports grid-file–style range/partial queries in O(n_r) via a d‑dimensional extendible array. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
769
Venue
PODS
Year
1986
Pagerank
6.7463723e-05
Overall Rank
4,357 | 70.11%
DOI
10.1145/6012.6015

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{otoo_pods86,
        address = {New York, NY, USA},
        series = {{PODS} '86},
        title = {{Balanced Multidimensional Extendible Hash Tree}},
        url = {https://dl.acm.org/doi/10.1145/6012.6015},
        doi = {10.1145/6012.6015},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Otoo, Ekow J.},
        year = {1986}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers