Logical query optimization by proof-tree transformation

DOI10.1016/0022-0000(93)90025-RzbMath0808.68057OpenAlexW2021790877MaRDI QIDQ686647

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 optimizationproof treelogical rules

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (5)

Generalization of ZYT-linearizability for bilinear datalog programs ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ The pushdown method to optimize chain logic programs ⋮ Magic sets for disjunctive Datalog programs ⋮ GRAMMARS AND AUTOMATA TO OPTIMIZE CHAIN LOGIC QUERIES

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
• Unnamed Item
• Unnamed Item

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