scientific article; zbMATH DE number 1405452

MaRDI QIDQ4938426zbMATH OpenFDO

Authors Georg Gottlob, Christos Papadimitriou

Publication date 26 September 2000

zbMATH Keywords

database query languagedatalog

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Database theory (68P15)

Recommendations

• On the complexity of single-rule datalog queries.
• Inherent complexity of recursive queries
• The parallel complexity of single rule logic programs
• scientific article; zbMATH DE number 638303
• Parallel complexity of logical query programs

Cited in

(6)

• Inherent complexity of recursive queries
• A single recursive predicate is sufficient for pure datalog
• On the complexity of queries in the logical data model
• On the complexity of single-rule datalog queries.
• The Complexity of Datalog on Linear Orders
• The parallel complexity of single rule logic programs

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 Q4938426)