Database Paper Browser

Back to papers

Attacking Diophantus: Solving a Special Case of Bag Containment

Summary: Shows decidability (in Π^P_2) of bag-containment for projection-free CQs contained in arbitrary CQs, settling a major open special case under multiset semantics. Reduces a special Diophantine-inequality case to linear inequalities, revealing core obstacles for the general bag-containment question. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1751
Venue
PODS
Year
2019
Pagerank
7.2431594e-05
Overall Rank
3,307 | 77.00%
DOI
10.1145/3294052.3319689

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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