BOOK-CHAPTER
On the Complexity of Single-Rule Datalog Queries
Georg GottlobChristos H. Papadimitriou
Year: 1999 Lecture notes in computer science Pages: 201-222 Publisher: Springer Science+Business Media
Keywords:
Datalog P Computer science PSPACE EXPTIME Programming language Theoretical computer science Semantics (computer science) Expressive power Deductive database Time complexity Conjunctive query Logic programming Complexity class Computational complexity theory Database Algorithm Relational database
Metrics
2
Cited By
0.36
FWCI (Field Weighted Citation Impact)
35
Refs
0.56
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Logic, Reasoning, and Knowledge
Physical Sciences → Computer Science → Artificial Intelligence
Logic, programming, and type systems
Physical Sciences → Computer Science → Artificial Intelligence
Semantic Web and Ontologies
Physical Sciences → Computer Science → Artificial Intelligence
Related Documents
JOURNAL ARTICLE
On the complexity of single-rule datalog queries
Georg GottlobChristos H. Papadimitriou
Journal: Information and Computation Year: 2003 Vol: 183 (1)Pages: 104-122
JOURNAL ARTICLE
Precise complexity analysis for efficient datalog queries
Year: 2010 Vol: 12 Pages: 35-44
JOURNAL ARTICLE
The Complexity of Why-Provenance for Datalog Queries
Marco CalauttiEster LivshitsAndréas PierisMarkus Schneider
Journal: Proceedings of the ACM on Management of Data Year: 2024 Vol: 2 (2)Pages: 1-16
JOURNAL ARTICLE
Optimizing existential datalog queries
Raghu RamakrishnanCatriel BeeriRavi Krishnamurthy
Year: 1988 Pages: 89-102