Conjunctive Queries on Probabilistic Graphs: Combined Complexity
Summary: Classifies combined complexity of conjunctive queries on probabilistic binary instances (probabilistic graph homomorphism/CSP), pinpointing which features—labels, disconnectedness, branching, edge directions—make evaluation tractable or #P-hard. Combines automata→d‑DNNF and β‑acyclic lineage compilations for tractable cases and X‑property, graded DAGs and coding reductions for hardness, yielding a rich complexity map. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Antoine Amarilli (Télécom Paris; Université Paris-Saclay)
- 2. Mikaël Monet (INRIA; Télécom Paris; Université Paris-Saclay)
- 3. Pierre Senellart (INRIA; PSL University; École normale supérieure)
BibTeX Citation
@inproceedings{amarilli_pods17,
address = {New York, NY, USA},
series = {{PODS} '17},
title = {{Conjunctive Queries on Probabilistic Graphs: Combined Complexity}},
url = {https://dl.acm.org/doi/10.1145/3034786.3056121},
doi = {10.1145/3034786.3056121},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Amarilli, Antoine and Monet, Mikaël and Senellart, Pierre},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,747 | New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins | 2020 | PODS | 6.4374568e-05 |
| 7,466 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 5.5199634e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 794 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00013941847 |
| 1,599 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010117703 |
| 5,474 | Running Tree Automata on Probabilistic XML | 2009 | PODS | 6.1176063e-05 |
| 6,653 | Queries with Difference on Probabilistic Databases | 2011 | VLDB | 5.7196642e-05 |
| 7,794 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 5.451528e-05 |
| 8,254 | Symmetric Weighted First-Order Model Counting | 2015 | PODS | 5.3678689e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,569 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS |
| 2 | 1,735 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 3 | 4,389 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB |
| 4 | 2,860 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD |
| 5 | 12,839 | Query Evaluation with Soft-Key Constraints | 2008 | PODS |
| 6 | 4,262 | Maximally Joining Probabilistic Data | 2007 | PODS |
| 7 | 8,793 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS |
| 8 | 7,794 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS |
| 9 | 7,466 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS |
| 10 | 1,065 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS |