Indexing the Edges – A simple and yet efficient approach to high-dimensional indexing
Summary: iMinMax(θ): a tunable index mapping d‑dim points to one dimension via each point's min/max coordinate under knob θ, producing adaptable 1D embeddings. Range queries become ≤d 1D subqueries with pruning; simple approach empirically outperforms Pyramid. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Beng Chin Ooi
- 2. Kian-Lee Tan
- 3. Cui Yu
- 4. Stephane Bressan
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 262 | Efficient Progressive Skyline Computation | 2001 | VLDB | 0.00029987552 |
| 1,010 | HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces | 2018 | VLDB | 0.00014652858 |
| 3,300 | Indexing the Distance: An Efficient Method to KNN Processing | 2001 | VLDB | 7.2516103e-05 |
| 3,401 | Towards Self-Tuning Data Placement in Parallel Database Systems | 2000 | SIGMOD | 7.1400085e-05 |
| 4,278 | Similarity Query Processing for High-Dimensional Data | 2020 | VLDB | 6.2953764e-05 |
| 6,074 | Pigeonring: A Principle for Faster Thresholded Similarity Search | 2019 | VLDB | 5.2242306e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 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.0032169493 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 79 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB | 0.00056242144 |
| 931 | The Pyramid-Technique: Towards Breaking the Curse of Dimensionality | 1998 | SIGMOD | 0.00015238406 |
Previous
Page 1 / 1
Next