Tight bounds for 2-dimensional indexing schemes
Summary: Shows the Fibonacci workload (grid rotated by the golden ratio) forces worst-case access overhead B even with storage redundancy up to c·log n, and extends this lower bound to random point sets under redundancy < c·log log n. Matches this up to constants with a universal 2D indexing scheme achieving O(log n) redundancy and constant access overhead, and connects indexability limits to fractal (Hausdorff) dimension. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Elias Koutsoupias (University of California Los Angeles)
- 2. David Scot Taylor (University of California Los Angeles)
BibTeX Citation
@inproceedings{koutsoupias_pods98,
address = {New York, NY, USA},
series = {{PODS} '98},
title = {{Tight bounds for 2-dimensional indexing schemes}},
url = {https://dl.acm.org/doi/10.1145/275487.275494},
doi = {10.1145/275487.275494},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Koutsoupias, Elias and Taylor, David Scot},
year = {1998}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,529 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS | 0.00010482997 |
| 4,730 | A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries | 1998 | PODS | 6.5348792e-05 |
| 8,937 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS | 5.3483178e-05 |
| 11,632 | Data-Independent Space Partitionings for Summaries | 2021 | PODS | 5.093636e-05 |
| 12,303 | Indexability of 2D Range Search Revisited: Constant Redundancy and Weak Indivisibility | 2012 | PODS | 5.093636e-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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,619 | (Almost) Optimal Parallel Block Access for Range Queries | 2000 | PODS |
| 2 | 6,753 | Optimal Indexing Using Near-Minimal Space [Extended Abstract] | 2003 | PODS |
| 3 | 8,937 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS |
| 4 | 1,611 | Indexing Moving Points (Extended Abstract) | 2000 | PODS |
| 5 | 11,751 | On the I/O Complexity of the k-Nearest Neighbors Problem | 2020 | PODS |
| 6 | 6,160 | New Results on Two-dimensional Orthogonal Range Aggregation in External Memory | 2011 | PODS |
| 7 | 4,730 | A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries | 1998 | PODS |
| 8 | 1,512 | On the Analysis of Indexing Schemes | 1997 | PODS |
| 9 | 12,303 | Indexability of 2D Range Search Revisited: Constant Redundancy and Weak Indivisibility | 2012 | PODS |
| 10 | 1,529 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS |