Tractability Beyond beta-Acyclicity for Conjunctive Queries with Negation
Summary: Introduce nest-set width, a novel hypergraph parameter that strictly generalizes beta-acyclicity while preserving useful decomposability properties. Prove boolean conjunctive query evaluation with negation is polytime for bounded nest-set width and SAT is FPT parameterized by it. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Matthias Lanzinger (University of Oxford; Vienna University of Technology)
BibTeX Citation
@inproceedings{lanzinger_pods21,
address = {New York, NY, USA},
series = {{PODS} '21},
title = {{Tractability Beyond beta-Acyclicity for Conjunctive Queries with Negation}},
url = {https://dl.acm.org/doi/10.1145/3452021.3458308},
doi = {10.1145/3452021.3458308},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Lanzinger, Matthias},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 5.6852987e-05 |
| 7,867 | ForBackBench: A Benchmark for Chasing vs. Query-Rewriting | 2022 | VLDB | 5.5277527e-05 |
| 10,020 | Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization | 2024 | PODS | 5.1757914e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,109 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00012142685 |
| 1,699 | Beyond Worst-case Analysis for Joins with Minesweeper | 2014 | PODS | 9.975915e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,626 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS |
| 2 | 2,678 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 3 | 11,523 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS |
| 4 | 9,864 | Tractable Database Design through Bounded Treewidth | 2006 | PODS |
| 5 | 1,777 | Deciding Containment for Queries with Complex Objects (Extended Abstract) | 1997 | PODS |
| 6 | 11,140 | Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity | 2024 | PODS |
| 7 | 3,801 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS |
| 8 | 814 | Hypertree Decompositions: Questions and Answers | 2016 | PODS |
| 9 | 7,029 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS |
| 10 | 2,330 | Hypertree Decompositions and Tractable Queries | 1999 | PODS |