Conference paper
Parallel Evaluation of Recursive Rule Queries
Stavros S. Cosmadakis, Paris C. Kanellakis
SIGMOD/PODS 1986
Conference paper
On Datalog vs. polynomial time
Abstract
We show that certain monotonie polynomial time queries are not expressible in variants of Datalog. The proof techniques include lower bounds for monotone circuit size and a "Pumping Lemma" for Datalog queries.
Related
Conference paper
On rewriting Xpath Queries Using Views
Foto Afrati, Rada Chirkova, et al.
EDBT 2009
Conference paper
Tools for datalog boundedness
Gerd G. Hillebrand, Paris C Kanellakis, et al.
SIGMOD/PODS/ 1991
Conference paper
Constraint-based query optimization for spatial databases
Richard Helm, Kim Marriott, et al.
SIGMOD/PODS/ 1991