DBScholar

Back to papers

Waffle: A Workload-Aware and Query-Sensitive Framework for Disk-Based Spatial Indexing

Summary: Waffle is a workload-aware, query-sensitive disk spatial index balancing update and query performance for dynamic data. It unifies space/data partitioning with optimal static bulk loading, overlap-free updates, and adaptive workload-driven maintenance. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
h7665b705f07b7db4
Venue
VLDB
Year
2023
Pagerank
5.3248747e-05
Overall Rank
8,391 | 43.76%
DOI
10.14778/3574245.3574253
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{moti_vldb23,
        title = {{Waffle: A Workload-Aware and Query-Sensitive Framework for Disk-Based Spatial Indexing}},
        author = {Moti, Moin Hussain and Simatis, Panagiotis and Papadias, Dimitris},
        journal = {PVLDB},
        series = {{VLDB} '23},
        volume = {16},
        number = {4},
        pages = {670--683},
        doi = {10.14778/3574245.3574253},
        url = {https://doi.org/10.14778/3574245.3574253},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 27 of 27 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.0019892478
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0011386412
8 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.00081207565
28 Nearest Neighbor Queries 1995 SIGMOD 0.00051134355
40 The Case for Learned Index Structures 2018 SIGMOD 0.00046249672
44 The R+-Tree: A Dynamic Multi-Dimensional Index for Objects 1987 VLDB 0.00045231517
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.0004024707
116 Direct Spatial Search on Pictorial Databases Using Packed R-trees 1985 SIGMOD 0.00031562001
146 Efficient Processing of Spatial Joins Using R-trees 1993 SIGMOD 0.000289618
282 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00022250557
338 Hilbert R-tree: An Improved R-tree Using Fractals 1994 VLDB 0.0002058961
576 Indexing the Positions of Continuously Moving Objects 2000 SIGMOD 0.00016130425
681 Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases 2004 VLDB 0.00014792999
870 Learning Multi-dimensional Indexes 2020 SIGMOD 0.0001332034
990 The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries 2003 VLDB 0.00012637792
1,190 Tsunami: A Learned Multi-dimensional Index for Correlated Data and Skewed Workloads 2021 VLDB 0.00011564169
1,445 LISA: A Learned Index Structure for Spatial Data 2020 SIGMOD 0.00010607118
1,574 Reverse kNN Search in Arbitrary Dimensionality 2004 VLDB 0.00010164216
1,729 Closest Pair Queries in Spatial Databases 2000 SIGMOD 9.761101e-05
1,884 Effectively Learning Spatial Indices 2020 VLDB 9.422145e-05
1,915 The LSD tree: spatial access to multidimensional point and non-point objects 1989 VLDB 9.368237e-05
2,029 Optimizing Multidimensional Index Trees for Main Memory Access 2001 SIGMOD 9.1470713e-05
2,262 Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring 2005 SIGMOD 8.7350282e-05
2,750 The Spatial Skyline Queries 2006 VLDB 8.0423781e-05
3,044 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD 7.7045269e-05
3,678 The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree 2004 SIGMOD 7.0857938e-05
5,878 A Benchmark for Evaluating Moving Object Indexes 2008 VLDB 5.9442479e-05
Previous Page 1 / 1 Next

Semantically Similar Papers