DBScholar

Back to papers

Deciding Containment for Queries with Complex Objects (Extended Abstract)

Summary: Decidable containment and weak-equivalence for a conjunctive query language over complex objects via translation to novel 'simulation' and 'strong simulation' conditions on CQs (conditions involve arbitrary quantifier alternations). Shows simulation/strong-simulation checking is NP-complete, yields NP-completeness of CQ equivalence with grouping/aggregates, and identifies that weak-equivalence collapses to full equivalence when answers cannot contain empty sets. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
h775bb99da1ffbca5
Venue
PODS
Year
1997
Pagerank
9.5417632e-05
Overall Rank
1,827 | 87.76%
DOI
10.1145/263661.263665

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{levy_pods97,
        address = {New York, NY, USA},
        series = {{PODS} '97},
        title = {{Deciding Containment for Queries with Complex Objects (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/263661.263665},
        doi = {10.1145/263661.263665},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Levy, Alon Y. and Suciu, Dan},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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