The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
Summary: Introduce the "selfish models" property: when containment reduces to enumerating a bounded set of models of the antecedent and testing the consequent, it gives decidability and complexity upper bounds. Used to uniformly recover known results and derive two new FO containment upper bounds. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Hubie Chen
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 48 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00069720859 |
| 82 | Answering Queries Using Views (Extended Abstract) | 1995 | PODS | 0.00054402763 |
| 3,003 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS | 7.7388586e-05 |
| 4,553 | View-Based Query Containment | 2003 | PODS | 6.091702e-05 |
| 12,031 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next