Logical query optimization by proof-tree transformation

DOI10.1016/0022-0000(93)90025-RMaRDI QIDQ686647zbMATH OpenOpenAlexFDO

Authors Moshe Y. Vardi, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman

Publication date 10 October 1993

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(93)90025-r

zbMATH Keywords

program optimizationlogical rulesproof tree

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On the efficiency of transforming database logic programs
• Basic transformation operations which preserve computed answer substitutions of logic programs
• Transformations of logic programs
• Representing proof transformations for program optimization
• Query optimization using rewrite rules

Cites work

• scientific article; zbMATH DE number 4147465 (Why is no real title available?)
• scientific article; zbMATH DE number 3956409 (Why is no real title available?)
• Commutativity and its role in the processing of linear recursion
• Parallel complexity of logical query programs
• Undecidable optimization problems for database logic programs

Cited in

(6)

• Grammars and automata to optimize chain logic queries
• Generalization of ZYT-linearizability for bilinear datalog programs
• On the equivalence of recursive and nonrecursive Datalog programs
• On the efficiency of transforming database logic programs
• Magic sets for disjunctive Datalog programs
• The pushdown method to optimize chain logic programs

This page was built for publication: Logical query optimization by proof-tree transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686647)