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
- 3010
- Venue
- SIGMOD
- Year
- 1998
- Pagerank
- 0.0001523035
- Overall Rank
- 929 | 93.55%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 428 |
The Onion Technique: Indexing for Linear Optimization Queries |
2000 |
SIGMOD |
0.0002349868 |
| 1,013 |
HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces |
2018 |
VLDB |
0.00014632051 |
| 1,240 |
Multi-dimensional Selectivity Estimation Using Compressed Histogram Information |
1999 |
SIGMOD |
0.00013090678 |
| 1,878 |
ArrayStore: A Storage Manager for Complex Parallel Array Processing |
2011 |
SIGMOD |
0.00010229691 |
| 2,676 |
Effectively Learning Spatial Indices |
2020 |
VLDB |
8.326321e-05 |
| 2,744 |
Indexing Large Trajectory Data Sets With SETI* |
2003 |
CIDR |
8.1917832e-05 |
| 3,199 |
Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search |
2020 |
VLDB |
7.3999833e-05 |
| 3,301 |
Indexing the Distance: An Efficient Method to KNN Processing |
2001 |
VLDB |
7.2450912e-05 |
| 3,418 |
General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows |
2002 |
SIGMOD |
7.1129681e-05 |
| 3,522 |
FTW: Fast Similarity Search under the Time Warping Distance |
2005 |
PODS |
7.0086323e-05 |
| 4,273 |
Similarity Query Processing for High-Dimensional Data |
2020 |
VLDB |
6.2932217e-05 |
| 4,663 |
Towards Effective Indexing for Very Large Video Sequence Database |
2005 |
SIGMOD |
6.0066508e-05 |
| 5,883 |
Ranked Subsequence Matching in Time-Series Databases |
2007 |
VLDB |
5.2865165e-05 |
| 6,080 |
Pigeonring: A Principle for Faster Thresholded Similarity Search |
2019 |
VLDB |
5.219249e-05 |
| 6,778 |
A New Method for Similarity Indexing of Market Basket Data |
1999 |
SIGMOD |
4.9237313e-05 |
| 7,006 |
Indexing the Edges – A simple and yet efficient approach to high-dimensional indexing |
2000 |
PODS |
4.8606861e-05 |
| 8,645 |
A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases |
2006 |
SIGMOD |
4.4725847e-05 |
| 8,813 |
Indexing Images in Oracle8i |
2000 |
SIGMOD |
4.4396055e-05 |
| 9,209 |
Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree |
2007 |
CIDR |
4.3691119e-05 |
| 9,863 |
Continuous Query Processing in Data Streams Using Duality of Data and Queries |
2006 |
SIGMOD |
4.2636378e-05 |
| 12,099 |
QuEval: Beyond high-dimensional indexing a la carte |
2013 |
VLDB |
4.1905499e-05 |
| 12,727 |
GHOST: Fine Granularity Buffering of Index |
1999 |
VLDB |
4.1905499e-05 |
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.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,010 |
A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries |
1998 |
PODS |
5.7545425e-05 |
| 8,559 |
Contorting High Dimensional Data for Efficient Main Memory KNN Processing |
2003 |
SIGMOD |
4.4893996e-05 |
| 7,770 |
Modeling High-Dimensional Index Structures using Sampling |
2001 |
SIGMOD |
4.6515743e-05 |
| 12,756 |
Fast High-Dimensional Data Search in Incomplete Databases |
1998 |
VLDB |
4.1905499e-05 |
| 8,675 |
The PH-Tree – A Space-Efficient Storage Structure and Multi-Dimensional Index |
2014 |
SIGMOD |
4.4654743e-05 |
| 8,645 |
A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases |
2006 |
SIGMOD |
4.4725847e-05 |
| 1,183 |
On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) |
1999 |
PODS |
0.00013444058 |
| 12,302 |
Worst-Case Efficient Range Search Indexing |
2009 |
PODS |
4.1905499e-05 |
| 9,209 |
Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree |
2007 |
CIDR |
4.3691119e-05 |
| 7,006 |
Indexing the Edges – A simple and yet efficient approach to high-dimensional indexing |
2000 |
PODS |
4.8606861e-05 |