Database Paper Browser

Back to papers

On Datalog vs. Polynomial Time

Summary: Proves existence of monotone PTIME queries not expressible in several Datalog variants. Uses monotone circuit lower bounds and a novel "Pumping Lemma" for Datalog to pinpoint inherent expressiveness limitations. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
921
Venue
PODS
Year
1991
Pagerank
5.2415551e-05
Overall Rank
6,031 | 58.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
12,792 Combinatorial Games in Database Theory 1995 PODS 4.1945683e-05
12,826 Bounded Arity Datalog(!=) Queries on Graphs (Extended Abstract) 1994 PODS 4.1945683e-05
12,884 Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations 1992 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
172 Decidability And Expressiveness Aspects Of Logic Queries 1987 PODS 0.00038808816
2,310 Inductive Pebble Games And The Expressive Power Of Datalog 1989 PODS 9.0580784e-05
3,888 On the Expressive Power of Datalog: Tools and a Case Study 1990 PODS 6.6634475e-05
Previous Page 1 / 1 Next

Semantically Similar Papers