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
13509
Venue
VLDB
Year
2023
Pagerank
5.4677285e-05
Overall Rank
8,200 | 43.75%
DOI
10.14778/3574245.3574253

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.0020210012
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
8 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.00082404462
28 Nearest Neighbor Queries 1995 SIGMOD 0.00052102434
42 The R+-Tree: A Dynamic Multi-Dimensional Index for Objects 1987 VLDB 0.00046170812
43 The Case for Learned Index Structures 2018 SIGMOD 0.00046060254
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040719947
116 Direct Spatial Search on Pictorial Databases Using Packed R-trees 1985 SIGMOD 0.0003221055
145 Efficient Processing of Spatial Joins Using R-trees 1993 SIGMOD 0.00029548428
277 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00022537944
329 Hilbert R-tree: An Improved R-tree Using Fractals 1994 VLDB 0.00021068647
560 Indexing the Positions of Continuously Moving Objects 2000 SIGMOD 0.00016525569
665 Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases 2004 VLDB 0.00015167291
873 Learning Multi-dimensional Indexes 2020 SIGMOD 0.00013481915
957 The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries 2003 VLDB 0.00012962576
1,174 Tsunami: A Learned Multi-dimensional Index for Correlated Data and Skewed Workloads 2021 VLDB 0.00011817414
1,418 LISA: A Learned Index Structure for Spatial Data 2020 SIGMOD 0.00010835539
1,612 Reverse kNN Search in Arbitrary Dimensionality 2004 VLDB 0.00010218134
1,685 Closest Pair Queries in Spatial Databases 2000 SIGMOD 0.00010017073
1,840 Effectively Learning Spatial Indices 2020 VLDB 9.6404567e-05
1,877 The LSD tree: spatial access to multidimensional point and non-point objects 1989 VLDB 9.5658249e-05
1,978 Optimizing Multidimensional Index Trees for Main Memory Access 2001 SIGMOD 9.3627341e-05
2,205 Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring 2005 SIGMOD 8.9591376e-05
2,689 The Spatial Skyline Queries 2006 VLDB 8.2559825e-05
2,974 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD 7.9083221e-05
3,593 The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree 2004 SIGMOD 7.2750277e-05
5,740 A Benchmark for Evaluating Moving Object Indexes 2008 VLDB 6.1035012e-05
Previous Page 1 / 1 Next

Semantically Similar Papers