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,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 4.8086254e-05 |
| 8,428 | Insert-Only versus Insert-Delete in Dynamic Query Evaluation | 2024 | PODS | 4.5095504e-05 |
| 10,925 | Optimal (Multiway) Spatial Joins | 2024 | PODS | 4.1905499e-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,903 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS | 4.1905499e-05 |
| 7,064 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS | 4.8391823e-05 |
| 2,298 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS | 9.0746479e-05 |
| 4,430 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS | 6.1879319e-05 |
| 8,972 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4150824e-05 |
| 5,963 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2485815e-05 |
| 2,246 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.2039096e-05 |
| 5,561 | On the Complexity of Join Predicates | 2001 | PODS | 5.4346872e-05 |
| 3,519 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0181381e-05 |
| 8,163 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5685178e-05 |