DBScholar

Back to papers

Semantic Query Optimization in Datalog Programs (Extended Abstract)

Summary: Characterizes when semantic query optimization for arbitrary Datalog is decidable: possible iff order constraints and negated EDB subgoals appear only inside recursive rules and not in integrity constraints. If such features occur in ic's it's undecidable; yields new (un)decidability results for Datalog→UCQ containment. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1064
Venue
PODS
Year
1995
Pagerank
8.0012184e-05
Overall Rank
2,883 | 80.23%
DOI
10.1145/212433.220207

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{levy_pods95,
        address = {New York, NY, USA},
        series = {{PODS} '95},
        title = {{Semantic Query Optimization in Datalog Programs (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/212433.220207},
        doi = {10.1145/212433.220207},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Levy, Alon Y. and Sagiv, Yehoshua},
        year = {1995}
}

Incoming Citations (Sorted by Pagerank)

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