DBScholar

Back to papers

Approximate Query Processing under Updates

Summary: Allowing small approximation yields an AQP algorithm that maintains any free-connex aggregation query in O(log n) amortized time per insertion-only update. Works in a general semiring (count/sum/avg/max/distinct), gives large practical speedups with 10% error, and logarithmic bounds for fully dynamic updates ruled out by lower bounds. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
7546
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,342 | 29.05%
DOI
10.1145/3769760

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{dai_sigmod26,
        title = {{Approximate Query Processing under Updates}},
        author = {Dai, Binyang and Yi, Ke},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3769760},
        url = {https://dl.acm.org/doi/10.1145/3769760},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 22 of 22 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
9 Online Aggregation 1997 SIGMOD 0.00077458002
17 Provenance Semirings 2007 PODS 0.00059843817
18 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059284255
358 FAQ: Questions Asked Frequently 2016 PODS 0.00020243592
363 Approximate Query Processing: Taming the TeraBytes! A Tutorial 2001 VLDB 0.0002005475
375 Incremental Maintenance of Views with Duplicates 1995 SIGMOD 0.00019681204
438 DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views 2012 VLDB 0.00018471721
636 Answering Conjunctive Queries under Updates 2017 PODS 0.0001551856
816 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00013827772
860 Aggregation and Ordering in Factorised Databases 2013 VLDB 0.00013560445
960 Incremental Query Evaluation in a Ring of Databases 2010 PODS 0.00012945163
1,108 Approximate Query Processing: No Silver Bullet 2017 SIGMOD 0.00012145154
1,549 AJAR: Aggregations and Joins over Annotated Relations 2016 PODS 0.00010390168
1,876 Flow-Loss: Learning Cardinality Estimates That Matter 2021 VLDB 9.5717543e-05
3,136 Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries 2020 PODS 7.7210541e-05
3,206 Incremental View Maintenance with Triple Lock Factorization Benefits 2018 SIGMOD 7.6367549e-05
3,338 Robust Query Driven Cardinality Estimation under Changing Workloads 2023 VLDB 7.5068221e-05
4,865 DBSP: Automatic Incremental View Maintenance for Rich Query Languages 2023 VLDB 6.4731692e-05
4,985 Change Propagation Without Joins 2023 VLDB 6.412102e-05
6,332 Maintaining Acyclic Foreign-Key Joins under Updates 2020 SIGMOD 5.9107433e-05
6,732 Insert-Only versus Insert-Delete in Dynamic Query Evaluation 2024 PODS 5.7885064e-05
9,845 Towards Update-Dependent Analysis of Query Maintenance 2025 PODS 5.2094004e-05
Previous Page 1 / 1 Next

Semantically Similar Papers