Database Paper Browser

Back to papers

Hilbert R-tree: An Improved R-tree Using Fractals

Summary: Hilbert R-tree uses deferred splitting via a Hilbert-based node ordering to cluster similar rectangles and reduce MBR area/perimeter. The 2D-c sorting with a 2-to-3 split policy delivers high space utilization and up to 28% savings over the R*-tree on real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8219
Venue
VLDB
Year
1994
Pagerank
0.00026091196
Overall Rank
356 | 97.53%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 40 of 40 citing papers.

Rank Citing Paper Year Venue Pagerank
48 Nearest Neighbor Queries 1995 SIGMOD 0.0006954126
141 Selectivity Estimation Without the Attribute Value Independence Assumption 1997 VLDB 0.00041819767
471 FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets 1995 SIGMOD 0.00022348285
665 Fast Nearest Neighbor Search in Medical Image Databases 1996 VLDB 0.00018437125
1,199 Hadoop-GIS: A High Performance Spatial Data Warehousing System over MapReduce 2013 VLDB 0.00013358019
1,499 Efficient Searching with Linear Constraints (Extended Abstract) 1998 PODS 0.00011643887
1,519 A Model for the Prediction of R-tree Performance 1996 PODS 0.00011535609
1,749 Distributed Trajectory Similarity Search 2017 VLDB 0.00010684148
1,923 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 0.00010079134
1,987 Optimizing Multidimensional Index Trees for Main Memory Access 2001 SIGMOD 9.8561164e-05
2,108 LISA: A Learned Index Structure for Spatial Data 2020 SIGMOD 9.5283642e-05
2,285 Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data 2001 SIGMOD 9.1097273e-05
2,676 Effectively Learning Spatial Indices 2020 VLDB 8.326321e-05
2,978 Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension 1995 VLDB 7.7848117e-05
3,259 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD 7.3101573e-05
3,497 Cubetree: Organization of and Bulk Incremental Updates on the Data Cube 1997 SIGMOD 7.0372261e-05
3,653 The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree 2004 SIGMOD 6.8725114e-05
4,032 Spatial Online Sampling and Aggregation 2016 VLDB 6.5131946e-05
4,613 Filter Trees for Managing Spatial Data Over a Range of Size Granularities 1996 VLDB 6.0427196e-05
4,683 Supporting Frequent Updates in R-Trees: A Bottom-Up Approach 2003 VLDB 5.9940496e-05
4,778 TOUCH: In-Memory Spatial Join by Hierarchical Data-Oriented Partitioning 2013 SIGMOD 5.9259497e-05
5,987 External Memory Algorithms 1998 PODS 5.2399221e-05
6,001 FACET: Robust Counterfactual Explanation Analytics 2023 SIGMOD 5.2365238e-05
6,098 Two-dimensional Substring Indexing 2001 PODS 5.2078399e-05
6,806 LMSFC: A Novel Multidimensional Index based on Learned Monotonic Space Filling Curves 2023 VLDB 4.917024e-05
7,046 Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability 2018 VLDB 4.8471584e-05
7,202 Indexing Methods for Moving Object Databases: Games and Other Applications 2013 SIGMOD 4.7975642e-05
7,772 K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization 2007 VLDB 4.6509661e-05
8,352 Accelerating Pathology Image Data Cross-Comparison on CPU-GPU Hybrid Systems 2012 VLDB 4.5333481e-05
8,354 Waffle: A Workload-Aware and Query-Sensitive Framework for Disk-Based Spatial Indexing 2023 VLDB 4.5329424e-05
8,675 The PH-Tree – A Space-Efficient Storage Structure and Multi-Dimensional Index 2014 SIGMOD 4.4654743e-05
8,704 Incremental Partitioning for Efficient Spatial Data Analytics 2022 VLDB 4.4596039e-05
9,021 On Optimal Node Splitting for R-trees 1998 VLDB 4.4049428e-05
9,114 R-Tree Based Indexing of Now-Relative Bitemporal Data 1998 VLDB 4.3887024e-05
9,173 Similarity Query Processing Using Disk Arrays 1998 SIGMOD 4.3807204e-05
9,209 Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree 2007 CIDR 4.3691119e-05
9,532 An Experimental Evaluation and Investigation of Waves of Misery in R-trees 2022 VLDB 4.3232695e-05
10,516 SwiftSpatial: Spatial Joins on Modern Hardware 2025 SIGMOD 4.1905499e-05
11,129 High-Performance Spatial Data Analytics: Systematic R&D for Scale-Out and Scale-Up Solutions from the Past to Now 2024 VLDB 4.1905499e-05
11,139 Efficient Cost Modeling of Space-filling Curves 2024 VLDB 4.1905499e-05
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.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0032118946
5 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.0018380955
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016113151
24 The R+-Tree: A Dynamic Index For Multi-Dimensional Objects 1987 VLDB 0.00083300888
56 Direct Spatial Search on Pictorial Databases Using Packed R-trees 1985 SIGMOD 0.00065500256
75 Spatial Query Processing in an Object-Oriented Database System 1986 SIGMOD 0.00057450043
290 Linear Clustering of Objects with Multiple Attributes 1990 SIGMOD 0.00028845557
721 Optimization Strategies for Spatial Query Processing 1991 VLDB 0.00017530857
1,009 The BANG file: a new kind of grid file 1987 SIGMOD 0.00014658958
1,250 Fractals for Secondary Key Retrieval 1989 PODS 0.00013037936
2,592 Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data 1991 SIGMOD 8.4841264e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
1,519 A Model for the Prediction of R-tree Performance 1996 PODS 0.00011535609
7,046 Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability 2018 VLDB 4.8471584e-05
24 The R+-Tree: A Dynamic Index For Multi-Dimensional Objects 1987 VLDB 0.00083300888
4,613 Filter Trees for Managing Spatial Data Over a Range of Size Granularities 1996 VLDB 6.0427196e-05
3,653 The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree 2004 SIGMOD 6.8725114e-05
1,250 Fractals for Secondary Key Retrieval 1989 PODS 0.00013037936
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016113151
2,033 Analysis Of Object Oriented Spatial Access Methods 1987 SIGMOD 9.7315522e-05
3,259 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD 7.3101573e-05
9,021 On Optimal Node Splitting for R-trees 1998 VLDB 4.4049428e-05