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)

Paper ID: 4831
Venue: SIGMOD
Year: 2014
Pagerank: 5.3857754e-05
Overall Rank: 8,680 | 40.45%
DOI: 10.1145/2588555.2588564

Incoming Non-self Citations Over Time

Authors

1. Tilmann Zäschke (ETH Zurich)
2. Christoph Zimmerli (ETH Zurich)
3. Moira C. Norrie (ETH Zurich)

BibTeX Citation

@inproceedings{zaschke_sigmod14,
        title = {{The PH-Tree – A Space-Efficient Storage Structure and Multi-Dimensional Index}},
        author = {Zäschke, Tilmann and Zimmerli, Christoph and Norrie, Moira C.},
        series = {{SIGMOD} '14},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2588555.2588564},
        url = {https://dl.acm.org/doi/10.1145/2588555.2588564},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,034	Fast and Adaptive Indexing of Multi-Dimensional Observational Data	2016	VLDB	5.3274671e-05
12,104	Supporting Data Uncertainty in Array Databases	2015	SIGMOD	5.093636e-05

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.0020210012
8	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD	0.00082404462
329	Hilbert R-tree: An Improved R-tree Using Fractals	1994	VLDB	0.00021068647
3,646	An Efficient Query Indexing Mechanism for Filtering Geo-Textual Data	2013	SIGMOD	7.2282847e-05
4,914	A General Solution of the n-dimensional B-tree Problem	1995	SIGMOD	6.4477987e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,207	The HV-tree: a Memory Hierarchy Aware Version Index	2010	VLDB
2	1,813	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD
3	1,778	The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation	2000	VLDB
4	12,489	Worst-Case Efficient Range Search Indexing	2009	PODS
5	8	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD
6	7,678	The hcC-tree: An Efficient Index Structure For Object Oriented Databases	1994	VLDB
7	5,202	Filter Trees for Managing Spatial Data Over a Range of Size Granularities	1996	VLDB
8	864	The Pyramid-Technique: Towards Breaking the Curse of Dimensionality	1998	SIGMOD
9	8,015	Hyperion: Building the Largest In-memory Search Tree	2019	SIGMOD
10	9,887	Adaptive Indexing of Objects with Spatial Extent	2023	VLDB