Bounded arity Datalog \((\neq)\) queries on graphs

DOI10.1006/jcss.1997.1521zbMath0889.68049OpenAlexW2002729873MaRDI QIDQ1376404

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)

Related Items (1)

Inherent complexity of recursive queries

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• On the equivalence of recursive and nonrecursive Datalog programs
• The directed subgraph homeomorphism problem
• An observation on time-storage trade off
• Datalog vs first-order logic
• Bounds in the propagation of selection into logic programs
• Undecidable optimization problems for database logic programs
• Horn clause queries and generalizations

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