DBScholar

Back to papers

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)

Paper ID
1129
Venue
PODS
Year
1998
Pagerank
6.9814651e-05
Overall Rank
3,972 | 72.75%
DOI
10.1145/275487.275494

Incoming Non-self Citations Over Time

Authors

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.

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