Window Query-Optimal Clustering of Spatial Objects
Summary: Defines static window-query optimal clustering: partition known spatial data into capacity-cb buckets to minimize expected bucket accesses, yielding a lower bound for spatial indexes. Poly-time for cb=2, NP-hard for cb≥3; simulated annealing shows dynamic structures and packed R-tree ≈20% worse than optimum. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Bernd-Uwe Pagel
- 2. Hans-Werner Six
- 3. Mario Winter
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,528 | A Model for the Prediction of R-tree Performance | 1996 | PODS | 0.00011497734 |
| 3,255 | A Revised R*-tree in Comparison with Related Index Structures | 2009 | SIGMOD | 7.3160522e-05 |
| 8,474 | Adaptive Index Structures | 2002 | VLDB | 4.5029015e-05 |
| 8,894 | Are Window Queries Representative For Arbitrary Range Queries? | 1996 | PODS | 4.4274507e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 399 | Randomized Algorithms For Optimizing Large Join Queries | 1990 | SIGMOD | 0.00024315433 |
| 566 | Query Optimization by Simulated Annealing | 1987 | SIGMOD | 0.00019970535 |
| 668 | The Sequoia 2000 Storage Benchmark | 1993 | SIGMOD | 0.00018430721 |
| 784 | Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques | 1989 | SIGMOD | 0.00016675823 |
| 1,479 | Towards an Analysis of Range Query Performance in Spatial Data Structures | 1993 | PODS | 0.00011749057 |
| 2,144 | The LSD tree: spatial access to multidimensional point and non-point objects | 1989 | VLDB | 9.4416732e-05 |
| 4,404 | A Decomposition-Based Simulated Annealing Technique for Data Clustering | 1994 | PODS | 6.2167147e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,546 | I/O-Efficient Planar Range Skyline and Attrition Priority Queues | 2013 | PODS | 4.4937074e-05 |
| 9,018 | On Optimal Node Splitting for R-trees | 1998 | VLDB | 4.4091374e-05 |
| 12,751 | Algorithms for Querying by Spatial Structure | 1998 | VLDB | 4.1945683e-05 |
| 5,990 | On the Optimality of Clustering Properties of Space Filling Curves | 2012 | PODS | 5.2424347e-05 |
| 10,921 | Optimal (Multiway) Spatial Joins | 2024 | PODS | 4.1945683e-05 |
| 3,615 | Efficient Processing of Window Queries in The Pyramid Data Structure | 1990 | PODS | 6.9127616e-05 |
| 3,800 | Time-Parameterized Queries in Spatio-Temporal Databases | 2002 | SIGMOD | 6.7585633e-05 |
| 8,601 | The Impact of Global Clustering on Spatial Database Systems | 1994 | VLDB | 4.4875358e-05 |
| 8,894 | Are Window Queries Representative For Arbitrary Range Queries? | 1996 | PODS | 4.4274507e-05 |
| 1,479 | Towards an Analysis of Range Query Performance in Spatial Data Structures | 1993 | PODS | 0.00011749057 |