Computing the Difference of Conjunctive Queries Efficiently
Summary: Push-down the difference operator via structure-aware rewriting to near-linear time in input+output size for a broad class of conjunctive-query differences. Hardness for remaining cases; heuristics; speedups vs SQL on graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiao Hu (University of Waterloo)
- 2. Qichen Wang (Hong Kong Baptist University)
BibTeX Citation
@inproceedings{hu_sigmod23,
title = {{Computing the Difference of Conjunctive Queries Efficiently}},
author = {Hu, Xiao and Wang, Qichen},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3589298},
url = {https://dl.acm.org/doi/10.1145/3589298},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,434 | Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees | 2025 | SIGMOD | 5.8799421e-05 |
| 6,444 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 5.8774519e-05 |
| 9,720 | Avoiding Materialisation for Guarded Aggregate Queries | 2025 | VLDB | 5.2319816e-05 |
| 10,020 | Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization | 2024 | PODS | 5.1757914e-05 |
| 10,170 | Towards Parameterized Hardness on Maintaining Conjunctive Queries | 2026 | PODS | 5.093636e-05 |
| 10,296 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD | 5.093636e-05 |
| 11,183 | Relational Algorithms for Top-k Query Evaluation | 2024 | SIGMOD | 5.093636e-05 |
| 11,338 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,854 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS |
| 2 | 8,235 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD |
| 3 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 4 | 1,860 | Querying Multiple Features of Groups in Relational Databases | 1996 | VLDB |
| 5 | 14,482 | EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract) | 1984 | SIGMOD |
| 6 | 6,678 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 7 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 8 | 7,858 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS |
| 9 | 5,383 | Compressed Representations of Conjunctive Query Results | 2018 | PODS |
| 10 | 6,072 | Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited | 1989 | SIGMOD |