Distributed Processing Of Logic Programs

Summary: Predicate decomposability enables parallel evaluation of logic programs with no inter-processor communication. Fully characterizes sirups (nonrecursive, linear, simple chain) decomposability: nonrecursive always decomposable; identifies which linear and chain cases work; provides two sufficient conditions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2411
Venue: SIGMOD
Year: 1988
Pagerank: 6.2423944e-05
Overall Rank: 4,367 | 69.66%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Ouri Wolfson
2. Avi Silberschatz

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 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
2,227	A New Paradigm For Parallel And Distributed Rule-Processing	1990	SIGMOD	9.2521507e-05
3,143	Dynamically Distributed Query Evaluation	2001	PODS	7.4881474e-05
3,207	Big Data Analytics with Datalog Queries on Spark	2016	SIGMOD	7.3847098e-05
3,860	On Distributed Processibility of Datalog Queries by Decomposing Databases	1989	SIGMOD	6.6864693e-05
4,225	Why A Single Parallelization Strategy Is Not Enough In Knowledge Bases	1989	PODS	6.3396067e-05
5,927	Parallelizing Datalog Programs by Generalized Pivoting	1991	PODS	5.2666195e-05
8,884	Optimizing Parallel Recursive Datalog Evaluation on Multicore Machines	2022	SIGMOD	4.4243024e-05
11,133	The Vadalog Parallel System: Distributed Reasoning with Datalog+/-	2024	VLDB	4.1905499e-05
12,916	Deductive Databases in Action	1991	PODS	4.1905499e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
16	MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract)	1986	PODS	0.00099936325
79	An Amateur's Introduction to Recursive Query Processing Strategies	1986	SIGMOD	0.00056010993
541	Parallel Evaluation of Recursive Rule Queries	1986	PODS	0.00020586706
1,200	Data Independent Recursion in Deductive Databases	1986	PODS	0.00013342243
1,532	The Parallel Complexity of Simple Chain Queries (Extended Abstract)	1987	PODS	0.00011466849
1,611	One-Sided Recursions	1987	PODS	0.00011146101
1,636	Bounds on the Propagation of Selection into Logic Programs	1987	PODS	0.00011058643
2,212	A Decidable Class of Bounded Recursions	1987	PODS	9.2818302e-05
2,740	Database Theory: Past and Future	1987	PODS	8.1989773e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,324	Commutativity And Its Role In The Processing Of Linear Recursion	1989	VLDB	6.279813e-05
4,225	Why A Single Parallelization Strategy Is Not Enough In Knowledge Bases	1989	PODS	6.3396067e-05
2,134	Incremental Evaluation of Rules and its Relationship to Parallelism	1991	SIGMOD	9.4690121e-05
11,839	Logical Aspects of Massively Parallel and Distributed Systems	2016	PODS	4.1905499e-05
7,018	Hard problems for simple logic programs	1990	SIGMOD	4.8555836e-05
2,087	A Framework for the Parallel Processing of Datalog Queries	1990	SIGMOD	9.5715836e-05
11,444	Deciding Boundedness of Monadic Sirups	2021	PODS	4.1905499e-05
5,927	Parallelizing Datalog Programs by Generalized Pivoting	1991	PODS	5.2666195e-05
2,227	A New Paradigm For Parallel And Distributed Rule-Processing	1990	SIGMOD	9.2521507e-05
3,860	On Distributed Processibility of Datalog Queries by Decomposing Databases	1989	SIGMOD	6.6864693e-05