Hilbert R-tree: An Improved R-tree Using Fractals
Summary: Introduces the Hilbert R-tree, ordering rectangles by Hilbert values of their centers to enable deferred splitting and controllable high space utilization. A 2-to-3 split policy balances insertion and search costs, achieving up to 28% savings over R*-trees. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ibrahim Kamel (University of Maryland)
- 2. Christos Faloutsos (University of Maryland)
BibTeX Citation
@article{kamel_vldb94,
title = {{Hilbert R-tree: An Improved R-tree Using Fractals}},
author = {Kamel, Ibrahim and Faloutsos, Christos},
journal = {PVLDB},
series = {{VLDB} '94},
year = {1994}
}
Incoming Citations (Sorted by Pagerank)
Showing 40 of 40 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,373 | A Model for the Prediction of R-tree Performance | 1996 | PODS |
| 2 | 7,151 | Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability | 2018 | VLDB |
| 3 | 42 | The R+-Tree: A Dynamic Multi-Dimensional Index for Objects | 1987 | VLDB |
| 4 | 5,202 | Filter Trees for Managing Spatial Data Over a Range of Size Granularities | 1996 | VLDB |
| 5 | 3,593 | The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree | 2004 | SIGMOD |
| 6 | 1,202 | Fractals for Secondary Key Retrieval | 1989 | PODS |
| 7 | 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD |
| 8 | 1,814 | Analysis Of Object Oriented Spatial Access Methods | 1987 | SIGMOD |
| 9 | 2,974 | A Revised R*-tree in Comparison with Related Index Structures | 2009 | SIGMOD |
| 10 | 9,234 | On Optimal Node Splitting for R-trees | 1998 | VLDB |