DBScholar

Back to papers

Bag Query Containment and Information Theory

Summary: Establishes a tight link between information inequalities and bag-semantic conjunctive-query containment: many-one equivalence between validity of generalized information inequalities and containment when the containing CQ is acyclic. Also isolates a decidable case: an EXPTIME algorithm for containment when the containing CQ is chordal and admits a simple junction tree. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1808
Venue
PODS
Year
2020
Pagerank
7.3981641e-05
Overall Rank
3,457 | 76.29%
DOI
10.1145/3375395.3387645

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{khamis_pods20,
        address = {New York, NY, USA},
        series = {{PODS} '20},
        title = {{Bag Query Containment and Information Theory}},
        url = {https://dl.acm.org/doi/10.1145/3375395.3387645},
        doi = {10.1145/3375395.3387645},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Khamis, Mahmoud Abo and Kolaitis, Phokion G. and Ngo, Hung Q. and Suciu, Dan},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers