DBScholar

Back to papers

Conjunctive-Query Containment and Constraint Satisfaction

Summary: Shows that conjunctive-query containment and constraint satisfaction coincide as homomorphism problems A→B, unifying CQ containment with the CSP perspective. Proves three families of non‑uniform tractable CSPs uniformize—Boolean (via binarization), Datalog with bounded distinct variables, and bounded-treewidth queries—yielding PTIME cases for CQ containment. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
h01625d5464c4430a
Venue
PODS
Year
1998
Pagerank
0.00019248147
Overall Rank
390 | 97.38%
DOI
10.1145/275487.275511

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kolaitis_pods98,
        address = {New York, NY, USA},
        series = {{PODS} '98},
        title = {{Conjunctive-Query Containment and Constraint Satisfaction}},
        url = {https://dl.acm.org/doi/10.1145/275487.275511},
        doi = {10.1145/275487.275511},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kolaitis, Phokion G. and Vardi, Moshe Y.},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 31 of 31 citing papers.

Rank Citing Paper Year Venue Pagerank
17 Provenance Semirings 2007 PODS 0.00059752575
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021246
818 Hypertree Decompositions: Questions and Answers 2016 PODS 0.0001366708
1,812 Joins via Geometric Resolutions: Worst-case and Beyond 2015 PODS 9.5803973e-05
1,916 The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing 2014 SIGMOD 9.3837729e-05
2,365 Hypertree Decompositions and Tractable Queries 1999 PODS 8.5654557e-05
2,418 The Semiring Framework for Database Provenance 2017 PODS 8.4928222e-05
2,591 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 8.2468757e-05
2,594 Computing Cores for Data Exchange: New Algorithms and Practical Solutions 2005 PODS 8.2426092e-05
2,728 Weighted Hypertree Decompositions and Optimal Query Plans 2004 PODS 8.0895728e-05
2,881 On the minimization of XPath queries 2003 VLDB 7.9134117e-05
3,297 Automated Verification of Query Equivalence Using Satisfiability Modulo Theories 2019 VLDB 7.4452842e-05
4,189 Processing Queries on Tree-Structured Data Efficiently 2006 PODS 6.7459542e-05
4,240 On the Efficiency of Checking Perfect Privacy 2006 PODS 6.7094069e-05
4,266 A Web Odyssey: from Codd to XML 2001 PODS 6.6972871e-05
4,270 On Preservation under Homomorphisms and Unions of Conjunctive Queries 2004 PODS 6.6941102e-05
4,514 View-Based Query Containment 2003 PODS 6.5650143e-05
6,264 General and Fractional Hypertree Decompositions: Hard and Easy Cases 2018 PODS 5.8308708e-05
6,404 Constraint Satisfaction and Database Theory: a Tutorial 2000 PODS 5.796156e-05
7,140 Semantic Acyclicity on Graph Databases 2013 PODS 5.6005794e-05
7,186 The Parameterized Complexity of Database Queries 2001 PODS 5.5912387e-05
7,292 Computing the Difference of Conjunctive Queries Efficiently 2023 SIGMOD 5.5642569e-05
7,466 Probabilistic Query Evaluation: The Combined FPRAS Landscape 2023 PODS 5.5199634e-05
8,091 Ranked Enumeration of Minimal Triangulations 2019 PODS 5.3942942e-05
9,169 Efficient Approximations of Conjunctive Queries 2012 PODS 5.2141412e-05
9,516 Efficiently Enumerating Minimal Triangulations 2017 PODS 5.1690578e-05
10,396 Query Answering Under Volume-Based Diversity Functions 2026 PODS 4.9793485e-05
11,298 STsCache: An Efficient Semantic Caching Scheme for Time-series Data Workloads Based on Hybrid Storage 2025 VLDB 4.9793485e-05
11,488 Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity 2024 PODS 4.9793485e-05
11,746 Collective Grounding: Applying Database Techniques to Grounding Templated Models 2023 VLDB 4.9793485e-05
12,520 The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity 2013 PODS 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
72 Answering Queries Using Views (Extended Abstract) 1995 PODS 0.00037549176
301 Answering Queries Using Templates With Binding Patterns (Extended Abstract) 1995 PODS 0.00021682744
794 On the Complexity of Bounded-Variable Queries 1995 PODS 0.00013941847
Previous Page 1 / 1 Next

Semantically Similar Papers