Logical query optimization by proof-tree transformation

DOI10.1016/0022-0000(93)90025-RzbMATH Open0808.68057OpenAlexW2021790877MaRDI QIDQ686647FDOQ686647

Raghu Ramakrishnan, Yehoshua Sagiv, Moshe Y. Vardi, 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)

Cites Work

• Parallel complexity of logical query programs
• Undecidable optimization problems for database logic programs
• Commutativity and its role in the processing of linear recursion
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• 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
• GRAMMARS AND AUTOMATA TO OPTIMIZE CHAIN LOGIC QUERIES
• The pushdown method to optimize chain logic programs

Recommendations

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

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)