Semantic Query Optimization in Datalog Programs.
Alon Y. Levy, Yehoshua Sagiv · Symposium on Principles of Database Systems · 1994
Semantic query optimization refers to the process of using integrity constraints (ic ‘s) in order to optimize the evaluation of queries. The process is well understood in the case of unions of select-project-join queries (i. e., nonrecursive datalog). For arbitrary datalog programs, however, the issue has largely remained an unsolved problem. This paper studies this problem and shows when semantic query optimization can be completely done in recursive rules provided that order constraints and negated EDB subgoals appear only in the recursive rules, but not in the it’s. If either order constraints or negated EDB subgoals are introduced in it’s, then the problem of semantic query optimization becomes undecidable. Since semantic query optimization is closely related to the containment problem of a datalog program in a union of conjunctive queries, our results also imply new decidability and undecidability results for that problem when order constraints and negated EDB subgoals are used.