DBScholar

Back to papers

On the Analysis of Indexing Schemes

Summary: Introduces a formal framework for indexing workloads (dataset + query set) that quantifies efficiency via storage redundancy and access overhead. Presents upper and lower bounds and trade-offs for multi-dimensional range and set-query indexing. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1121
Venue
PODS
Year
1997
Pagerank
0.00010536001
Overall Rank
1,512 | 89.63%
DOI
10.1145/263661.263688

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{hellerstein_pods97,
        address = {New York, NY, USA},
        series = {{PODS} '97},
        title = {{On the Analysis of Indexing Schemes}},
        url = {https://dl.acm.org/doi/10.1145/263661.263688},
        doi = {10.1145/263661.263688},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Hellerstein, Joseph M. and Koutsoupias, Elias and Papadimitriou, Christos H.},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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