Database Paper Browser

Back to papers

The Pyramid-Technique: Towards Breaking the Curse of Dimensionality

Summary: Pyramid-Technique: a high-dim index for L_max range queries, using 2^d pyramids with slices-as-pages. Maps to 1D for B+-tree indexing; experiments show up to 14x fewer page accesses and 2500x faster time vs X-tree/Hilbert R-tree. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3009
Venue
SIGMOD
Year
1998
Pagerank
0.00015238406
Overall Rank
931 | 93.53%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 22 of 22 citing papers.

Rank Citing Paper Year Venue Pagerank
430 The Onion Technique: Indexing for Linear Optimization Queries 2000 SIGMOD 0.00023463938
1,010 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014652858
1,241 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00013097578
1,876 ArrayStore: A Storage Manager for Complex Parallel Array Processing 2011 SIGMOD 0.00010239284
2,678 Effectively Learning Spatial Indices 2020 VLDB 8.3252088e-05
2,738 Indexing Large Trajectory Data Sets With SETI* 2003 CIDR 8.2005452e-05
3,183 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 7.4228241e-05
3,300 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.2516103e-05
3,417 General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows 2002 SIGMOD 7.1195863e-05
3,518 FTW: Fast Similarity Search under the Time Warping Distance 2005 PODS 7.0153323e-05
4,278 Similarity Query Processing for High-Dimensional Data 2020 VLDB 6.2953764e-05
4,666 Towards Effective Indexing for Very Large Video Sequence Database 2005 SIGMOD 6.0124339e-05
5,878 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 5.2916009e-05
6,074 Pigeonring: A Principle for Faster Thresholded Similarity Search 2019 VLDB 5.2242306e-05
6,778 A New Method for Similarity Indexing of Market Basket Data 1999 SIGMOD 4.9284526e-05
7,005 Indexing the Edges – A simple and yet efficient approach to high-dimensional indexing 2000 PODS 4.8654221e-05
8,647 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD 4.4768766e-05
8,814 Indexing Images in Oracle8i 2000 SIGMOD 4.4435503e-05
9,207 Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree 2007 CIDR 4.3733038e-05
9,864 Continuous Query Processing in Data Streams Using Duality of Data and Queries 2006 SIGMOD 4.2675822e-05
12,091 QuEval: Beyond high-dimensional indexing a la carte 2013 VLDB 4.1945683e-05
12,718 GHOST: Fine Granularity Buffering of Index 1999 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
5 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.0018397217
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016162015
129 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.0004429571
231 A Retrieval Technique for Similar Shapes 1991 SIGMOD 0.00032163466
284 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00028994728
1,183 A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space 1997 PODS 0.00013455596
1,755 Efficient User-Adaptable Similarity Search in Large Multimedia Databases 1997 VLDB 0.00010669106
2,579 Data Warehousing and OLAP for Decision Support 1997 SIGMOD 8.5071315e-05
3,555 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD 6.9772546e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
5,013 A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries 1998 PODS 5.7598528e-05
8,562 Contorting High Dimensional Data for Efficient Main Memory KNN Processing 2003 SIGMOD 4.4937074e-05
7,771 Modeling High-Dimensional Index Structures using Sampling 2001 SIGMOD 4.6560482e-05
12,747 Fast High-Dimensional Data Search in Incomplete Databases 1998 VLDB 4.1945683e-05
8,679 The PH-Tree – A Space-Efficient Storage Structure and Multi-Dimensional Index 2014 SIGMOD 4.4697591e-05
8,647 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD 4.4768766e-05
1,182 On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) 1999 PODS 0.00013455963
9,207 Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree 2007 CIDR 4.3733038e-05
12,294 Worst-Case Efficient Range Search Indexing 2009 PODS 4.1945683e-05
7,005 Indexing the Edges – A simple and yet efficient approach to high-dimensional indexing 2000 PODS 4.8654221e-05