scientific article; zbMATH DE number 176243

MaRDI QIDQ4035347zbMATH OpenFDO

Authors Guozhu Dong

Publication date 18 May 1993

zbMATH Keywords

addressably linearizabledeductive databasespositive programmed grammar

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Formal languages and automata (68Q45)

Recommendations

• Linearisability on Datalog programs
• On decompositions of chain datalog programs into P (left-)linear 1-rule components
• Grammars and automata to optimize chain logic queries
• The pushdown method to optimize chain logic programs
• Parallel complexity of logical query programs

Cited in

(9)

• Bounds in the propagation of selection into logic programs
• Linearisability on Datalog programs
• Generalization of ZYT-linearizability for bilinear datalog programs
• On the data complexity of consistent query answering over graph databases
• On decompositions of chain datalog programs into P (left-)linear 1-rule components
• The pushdown method to optimize chain logic programs
• Grammars and automata to optimize chain logic queries
• On the index of positive programmed formal languages
• Corrections to: ``On the data complexity of consistent query answering over graph databases

Describes a project that uses

Uses Software

• Datalog

This page was built for publication:

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