Generalization of ZYT-linearizability for bilinear datalog programs

DOI10.1016/S0890-5401(03)00172-XMaRDI QIDQ1887164zbMATH OpenOpenAlexFDO

Authors Ji-Hoon Kang, Ki-Hyung Hong, Kyu-Young Whang, Jung Wan Cho

Publication date 23 November 2004

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0890-5401(03)00172-x

zbMATH Keywords

Deductive databasesDatalog programsLinearizabilityBilinear rules

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Linearisability on Datalog programs
• scientific article; zbMATH DE number 176243
• A semantic approach to optimize linear datalog programs
• On decompositions of chain datalog programs into P (left-)linear 1-rule components
• scientific article; zbMATH DE number 638303

Cites work

• Argument reduction by factoring
• Conjunctive-query containment and constraint satisfaction
• Logical query optimization by proof-tree transformation
• On the efficiency of transforming database logic programs
• Undecidable optimization problems for database logic programs

Cited in

(2)

• Linearisability on Datalog programs
• A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Generalization of ZYT-linearizability for bilinear datalog programs

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