DBScholar

Back to papers

Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations

Summary: Generic incremental maintenance for arbitrary join queries combines delta queries, materialized-view trees, and heavy–light partitioning, enabling constant-delay output enumeration after tuple updates. Introduces maintenance width to characterize update time and optimize the partition threshold. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
2035
Venue
PODS
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,160 | 30.30%
DOI
10.1145/3801905

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{abokhamis_pods26,
        address = {New York, NY, USA},
        series = {{PODS} '26},
        title = {{Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations}},
        url = {https://dl.acm.org/doi/10.1145/3801905},
        doi = {10.1145/3801905},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Abo-Khamis, Mahmoud and Chmielewski, Eden and Draghici, Andrei and Kara, Ahmet and Olteanu, Dan},
        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 14 of 14 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers