On the efficiency of transforming database logic programs

DOI10.1006/JCSS.1995.1054MaRDI QIDQ1900919zbMATH OpenOpenAlexFDO

Authors Yatin P. Saraiya

Publication date 25 October 1995

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

Full work available at URL https://doi.org/10.1006/jcss.1995.1054

zbMATH Keywords

conjunctive queriesdeductive databases\(k\)-containment problem

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• Logical query optimization by proof-tree transformation
• scientific article; zbMATH DE number 2090114
• Transformations of logic programs
• Transformations of logic programs
• scientific article; zbMATH DE number 62656
• Logic Programming
• Efficient and Scalable Induction of Logic Programs Using a Deductive Database System
• Transformation of logic programs to FP programs based on dataflows
• scientific article; zbMATH DE number 1182730

Cited in

(12)

• scientific article; zbMATH DE number 1182730 (Why is no real title available?)
• A transformation system for deductive database modules with perfect model semantics
• Generalization of ZYT-linearizability for bilinear datalog programs
• Designing deductive databases
• scientific article; zbMATH DE number 1696849 (Why is no real title available?)
• scientific article; zbMATH DE number 5855088 (Why is no real title available?)
• scientific article; zbMATH DE number 2090114 (Why is no real title available?)
• Linearisability on Datalog programs
• scientific article; zbMATH DE number 1759710 (Why is no real title available?)
• The complexity of higher-order queries
• Containment and Optimization of Object-Preserving Conjunctive Queries
• Logical query optimization by proof-tree transformation

This page was built for publication: On the efficiency of transforming database logic programs

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