The PH-Tree – A Space-Efficient Storage Structure and Multi-Dimensional Index
Summary: PH-tree (PATRICIA-hypercube-tree) is a space-efficient, multi-dimensional storage/index built from PATRICIA-tries and hypercubes. Prefix sharing yields compact storage; it outperforms KD-tree for space, queries, and updates on large data, scaling beyond 10^7 entries and even showing super-constant timing on skewed datasets. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,895 | Fast and Adaptive Indexing of Multi-Dimensional Observational Data | 2016 | VLDB | 4.427268e-05 |
| 11,905 | Supporting Data Uncertainty in Array Databases | 2015 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 5 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD | 0.0018397217 |
| 354 | Hilbert R-tree: An Improved R-tree Using Fractals | 1994 | VLDB | 0.00026137988 |
| 3,714 | An Efficient Query Indexing Mechanism for Filtering Geo-Textual Data | 2013 | SIGMOD | 6.8223298e-05 |
| 4,672 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD | 6.0085156e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,065 | The HV-tree: a Memory Hierarchy Aware Version Index | 2010 | VLDB | 4.5937864e-05 |
| 1,809 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD | 0.00010483957 |
| 1,925 | The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation | 2000 | VLDB | 0.00010073407 |
| 12,294 | Worst-Case Efficient Range Search Indexing | 2009 | PODS | 4.1945683e-05 |
| 5 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD | 0.0018397217 |
| 7,550 | The hcC-tree: An Efficient Index Structure For Object Oriented Databases | 1994 | VLDB | 4.713674e-05 |
| 4,612 | Filter Trees for Managing Spatial Data Over a Range of Size Granularities | 1996 | VLDB | 6.0484423e-05 |
| 931 | The Pyramid-Technique: Towards Breaking the Curse of Dimensionality | 1998 | SIGMOD | 0.00015238406 |
| 8,077 | Hyperion: Building the Largest In-memory Search Tree | 2019 | SIGMOD | 4.59165e-05 |
| 9,767 | Adaptive Indexing of Objects with Spatial Extent | 2023 | VLDB | 4.2856106e-05 |