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)
Incoming Non-self Citations Over Time
Authors
- 1. Walid G. Aref
- 2. Hanan Samet
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,580 | The New Casper: Query Processing for Location Services without Compromising Privacy | 2006 | VLDB | 0.00011270239 |
| 3,147 | Searchlight: Enabling Integrated Search and Exploration over Large Multidimensional Data | 2015 | VLDB | 7.4771804e-05 |
| 6,900 | Kamel: A Scalable BERT-based System for Trajectory Imputation | 2024 | VLDB | 4.8925595e-05 |
| 7,203 | Indexing Methods for Moving Object Databases: Games and Other Applications | 2013 | SIGMOD | 4.8019323e-05 |
| 7,693 | Processing and Optimizing Main Memory Spatial-Keyword Queries | 2016 | VLDB | 4.6759281e-05 |
| 10,757 | Polaris: An Interactive and Scalable Data Infrastructure for Polar Science | 2025 | VLDB | 4.1945683e-05 |
| 10,813 | A Demonstration of Polaris: An Interactive and Scalable Data Infrastructure for Polar Science | 2025 | VLDB | 4.1945683e-05 |
| 11,718 | A Demonstration of Sya: A Spatial Probabilistic Knowledge Base Construction System | 2018 | SIGMOD | 4.1945683e-05 |
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
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,633 | Compressed Spatial Hierarchical Bitmap (cSHB) Indexes for Efficiently Processing Spatial Range Query Workloads | 2015 | VLDB | 4.3131863e-05 |
| 8,546 | I/O-Efficient Planar Range Skyline and Attrition Priority Queues | 2013 | PODS | 4.4937074e-05 |
| 10,921 | Optimal (Multiway) Spatial Joins | 2024 | PODS | 4.1945683e-05 |
| 76 | Spatial Query Processing in an Object-Oriented Database System | 1986 | SIGMOD | 0.00057303551 |
| 931 | The Pyramid-Technique: Towards Breaking the Curse of Dimensionality | 1998 | SIGMOD | 0.00015238406 |
| 3,800 | Time-Parameterized Queries in Spatio-Temporal Databases | 2002 | SIGMOD | 6.7585633e-05 |
| 12,751 | Algorithms for Querying by Spatial Structure | 1998 | VLDB | 4.1945683e-05 |
| 1,479 | Towards an Analysis of Range Query Performance in Spatial Data Structures | 1993 | PODS | 0.00011749057 |
| 8,894 | Are Window Queries Representative For Arbitrary Range Queries? | 1996 | PODS | 4.4274507e-05 |
| 6,076 | Window Query-Optimal Clustering of Spatial Objects | 1995 | PODS | 5.223696e-05 |