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
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,162 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 4.8132423e-05 |
| 7,795 | ForBackBench: A Benchmark for Chasing vs. Query-Rewriting | 2022 | VLDB | 4.6482625e-05 |
| 10,898 | Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization | 2024 | PODS | 4.1945683e-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,442 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00011956109 |
| 1,557 | Beyond Worst-case Analysis for Joins with Minesweeper | 2014 | PODS | 0.00011392493 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,410 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS | 4.5204725e-05 |
| 1,038 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014492414 |
| 11,324 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS | 4.1945683e-05 |
| 9,740 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 4.2936538e-05 |
| 1,952 | Deciding Containment for Queries with Complex Objects (Extended Abstract) | 1997 | PODS | 9.9677831e-05 |
| 10,919 | Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity | 2024 | PODS | 4.1945683e-05 |
| 4,048 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS | 6.4968603e-05 |
| 1,328 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012565612 |
| 6,949 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS | 4.8898337e-05 |
| 2,796 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.1112658e-05 |