Database Paper Browser

Back to papers

On Distributed Processibility of Datalog Queries by Decomposing Databases

Summary: Decompose DBs into subdatabases; evaluate Datalog by unioned results. Two classes: disjoint distributive (connectivity) and bounded distributive fixed size; three views: bounded recursion, 1-bounded-recursive, and constant parallelism with no IPC. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2426
Venue
SIGMOD
Year
1989
Pagerank
6.6864693e-05
Overall Rank
3,860 | 73.18%
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
2,087 A Framework for the Parallel Processing of Datalog Queries 1990 SIGMOD 9.5715836e-05
2,134 Incremental Evaluation of Rules and its Relationship to Parallelism 1991 SIGMOD 9.4690121e-05
3,143 Dynamically Distributed Query Evaluation 2001 PODS 7.4881474e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers