The Complexity of Boolean Conjunctive Queries with Intersection Joins
Summary: Reduce BCQs with intersection joins to disjunctions of equality-join BCQs, yielding ij-width that exactly captures their complexity. Define iota-acyclicity (alpha-acyclicity analogue) characterising near-linear evaluation; non-iota queries are triangle-hard. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mahmoud Abo Khamis
- 2. George Chichirim
- 3. Antonia Kormpa
- 4. Dan Olteanu
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 |
| 8,437 | Insert-Only versus Insert-Delete in Dynamic Query Evaluation | 2024 | PODS | 4.5138778e-05 |
| 10,921 | Optimal (Multiway) Spatial Joins | 2024 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 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 | Pagerank |
|---|---|---|---|---|
| 10,899 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS | 4.1945683e-05 |
| 7,069 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS | 4.8438319e-05 |
| 2,296 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS | 9.0776226e-05 |
| 4,432 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS | 6.1938383e-05 |
| 8,966 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4193184e-05 |
| 5,962 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2536266e-05 |
| 2,243 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.2166927e-05 |
| 5,553 | On the Complexity of Join Predicates | 2001 | PODS | 5.439162e-05 |
| 3,515 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0220813e-05 |
| 8,159 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5729025e-05 |