DBScholar

Back to papers

(Almost) Optimal Parallel Block Access for Range Queries

Summary: Tiling/striping scheme for multidimensional range queries on 2^q×2^q block grids with k=2^t disks that achieves at most ceil(m/k)+O(log k) parallel block accesses and extends to higher dimensions. Empirically within 0.5 of ceil(m/k) on average, worst-case +3; bound essentially optimal and extendable to some composite k. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1210
Venue
PODS
Year
2000
Pagerank
5.8212982e-05
Overall Rank
6,619 | 54.59%
DOI
10.1145/335168.335224

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{atallah_pods00,
        address = {New York, NY, USA},
        series = {{PODS} '00},
        title = {{(Almost) Optimal Parallel Block Access for Range Queries}},
        url = {https://dl.acm.org/doi/10.1145/335168.335224},
        doi = {10.1145/335168.335224},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Atallah, Mikhail J. and Prabhakar, Sunil},
        year = {2000}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers