Bounded arity Datalog () queries on graphs

DOI10.1006/JCSS.1997.1521MaRDI QIDQ1376404zbMATH OpenOpenAlexFDO

Authors Foto N. Afrati

Publication date 11 June 1998

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

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

zbMATH Keywords

Datalogextensional database

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On the expressive power of Datalog: tools and a case study.
• Undecidable boundedness problems for datalog programs
• On datalog vs polynomial time
• Inherent complexity of recursive queries

Cites work

• scientific article; zbMATH DE number 176244 (Why is no real title available?)
• scientific article; zbMATH DE number 1555183 (Why is no real title available?)
• An observation on time-storage trade off
• Bounds in the propagation of selection into logic programs
• Datalog vs first-order logic
• Horn clause queries and generalizations
• On the equivalence of recursive and nonrecursive Datalog programs
• The directed subgraph homeomorphism problem
• Undecidable optimization problems for database logic programs

Cited in

(3)

• Inherent complexity of recursive queries
• On the expressive power of Datalog: tools and a case study.
• Directed st-Connectivity Is Not Expressible in Symmetric Datalog

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Bounded arity Datalog \((\neq)\) queries on graphs

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