Database Paper Browser

Back to papers

The Parallel Complexity of Simple Chain Queries (Extended Abstract)

Summary: Classifies the parallel complexity of simple chain DATALOG queries (variants of transitive closure), proving some variants are in NC while others are P-complete. Provides a taxonomy to guide which recursive DATALOG programs admit efficient massively-parallel evaluation and compiler/implementation strategies. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
795
Venue
PODS
Year
1987
Pagerank
0.00011466849
Overall Rank
1,532 | 89.36%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank Citing Paper Year Venue Pagerank
1,636 Bounds on the Propagation of Selection into Logic Programs 1987 PODS 0.00011058643
1,687 Automata Theory for Database Theoreticians 1989 PODS 0.0001090256
2,087 A Framework for the Parallel Processing of Datalog Queries 1990 SIGMOD 9.5715836e-05
2,473 Graph-Theoretic Methods In Database Theory 1990 PODS 8.7048914e-05
4,225 Why A Single Parallelization Strategy Is Not Enough In Knowledge Bases 1989 PODS 6.3396067e-05
4,367 Distributed Processing Of Logic Programs 1988 SIGMOD 6.2423944e-05
5,927 Parallelizing Datalog Programs by Generalized Pivoting 1991 PODS 5.2666195e-05
6,751 Can Datalog be approximated? 1994 PODS 4.9352222e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers