DBScholar

Back to papers

Efficient Processing of Window Queries in The Pyramid Data Structure

Summary: Introduces the incomplete pyramid, a variant of the pyramid spatial index, and algorithms for exist/report window queries running in O(n log log T) time for an n×n window in a T×T space. Thus query cost scales almost linearly with window diameter n, not its area n^2. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
906
Venue
PODS
Year
1990
Pagerank
7.2125892e-05
Overall Rank
3,668 | 74.84%
DOI
10.1145/298514.298579

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{aref_pods90,
        address = {New York, NY, USA},
        series = {{PODS} '90},
        title = {{Efficient Processing of Window Queries in The Pyramid Data Structure}},
        url = {https://dl.acm.org/doi/10.1145/298514.298579},
        doi = {10.1145/298514.298579},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Aref, Walid G. and Samet, Hanan},
        year = {1990}
}

Incoming Citations (Sorted by Pagerank)

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