Database Paper Browser

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
770
Venue
PODS
Year
1986
Pagerank
6.2898839e-05
Overall Rank
4,286 | 70.19%
DOI
-

Incoming Non-self Citations Over Time

Authors

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