research-article

Data Partition and Parallel Evaluation of Datalog Programs

Authors:

Siu-Cheung ChauAuthors Info & Claims

IEEE Transactions on Knowledge and Data Engineering, Volume 7, Issue 1

Pages 163 - 176

https://doi.org/10.1109/69.368511

Published: 01 February 1995 Publication History

Abstract

Parallel bottom-up evaluation provides an alternative for the efficient evaluation of logic programs. Existing parallel evaluation strategies are neither effective nor efficient in determining the data to be transmitted among processors. In this paper, we propose a different strategy, for general Datalog programs, that is based on the partitioning of data rather than that of rule instantiations. The partition and processing schemes defined in this paper are more general than those in existing strategies. A parallel evaluation algorithm is given based on the semi-naive bottom-up evaluation. A notion of potential usefulness is recognized as a data transmission criterion to reduce, both effectively and efficiently, the amount of data transmitted. Heuristics and algorithms are proposed for designing the partition and processing schemes for a given program. Results from an experiment show that the strategy proposed in this paper has many promising features.

References

[1]

F. Bancilhon and R. Ramakrishnan, “An amateur’s introduction to recursive query processing strategies,” Proc. ACM SIGMOD Conference, pp. 16-52, 1986.

Digital Library

[2]

J-P Cherney and C. Maindrevelle, “A parallel strategy for transitive closure using double hash-based clustering,” Proc. of 16th VLDB, Brisbane, Australia, pp. 347-358, 1990.

Digital Library

[3]

S. R. Cohen and O. Wolfson, “Why a single parallelization strategy is not enough in knowledge bases,” Proc. Symp. on PODS, Philadelphia, Penn., pp. 200-216, March, 1989.

Digital Library

[4]

S.K. Debray and N.W. Lin, “Static estimation of query sizes in Horn programs,” ICDT Conf. Springer-Verlag Lecture Notes in Computer Science 470, pp. 514-528, 1990.

Digital Library

[5]

G. Dong, “On distributed processibility of logic programs by decomposing databases,” Proc. ACM SIGMOD Conference, Portland, OR, pp. 26-35, June, 1989.

Digital Library

[6]

S. Ganguly, A. Silberschatz, and S. Tsur, “A framework for the parallel processing of datalog queries,” Proc. ACM SIGMOD Conference, Atlantic City, NJ, pp.143-152, May, 1990.

Digital Library

[7]

J.W. Lloyd, Foundations of Logic Programming, Second, Extended Edition, Springer-Verlag, 1987.

Digital Library

[8]

J. Seib and G. Lausen, “Parallelizing Datalog programs by generalized pivoting,” Proc. Symp. on PODS, Denver, Co., pp. 241-251, May, 1991.

Digital Library

[9]

J. D. Ullman, Principles of database and knowledge-base systems, Vol. 1, Computer Science Press, Rockville, MD, 1988.

Digital Library

[10]

J.L. Wolf, D.M. Dias, P.S. Yu, and J. Turek, “An effective algorithm for parallelizing hash joins in the presence of data skew,” IEEE Conf. on Data Engineering, pp. 200-209, 1991.

Digital Library

[11]

O. Wolfson, W. Zhang, H. Butani, A. Kawaguchi, and K. Mok, “A methodology for evaluating parallel graph algorithms and its application to single source reachability,” Technical report, Dept. of EECS, UIC, 1992.

[12]

O. Wolfson and A. Silberschatz, “Distributed processing of logic programs,” Proc. ACM SIGMOD Conference, Chicago, IL., pp.329-336, 1988.

Digital Library

[13]

O. Wolfson and A. Ozeri, “A new paradigm for parallel and distributed rule-processing,” Proc. ACM SIGMOD Conference, Atlantic City, NJ, May, pp. 133-142, 1990.

Digital Library

[14]

O. Wolfson, “Sharing the load of logic program evaluation,” Proc. Int’l. Symp. on Databases in Parallel and Distributed Systems, Dec., 1988.

Digital Library

[15]

W. Zhang, K. Wang, and S-C Chau, “Data partition and parallel evaluation of datalog programs,” Technical report, Dept. of Math. and CS, Univ. of Lethbridge, 1992.

Cited By

Qayyum OYu W(2024)Coordination-Free Replicated Datalog Streams with Application-Specific AvailabilityAdvances in Databases and Information Systems10.1007/978-3-031-70626-4_11(155-169)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-70626-4_11
Hu PMotik BHorrocks I(2022)Modular materialisation of Datalog programsArtificial Intelligence10.1016/j.artint.2022.103726308:COnline publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1016/j.artint.2022.103726
Yang MShkapsky AZaniolo C(2017)Scaling up the performance of more powerful Datalog systems on multicore machinesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-016-0448-z26:2(229-248)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s00778-016-0448-z
Show More Cited By

Index Terms

Data Partition and Parallel Evaluation of Datalog Programs
1. Information systems
  1. Data management systems
    1. Query languages
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query languages (principles)

Recommendations

Machine Independent AND and OR Parallel Execution of Logic Programs: Part II-Compiled Execution

In pt.I, we presented a binding environment for the ANDand OR parallel execution of logic programs. This environment was instrumental inrendering a compiler for the AND and OR parallel execution of logic programs machineindependent. In this paper, we ...
Machine Independent AND and OR Parallel Execution of Logic Programs: Part I-The Binding Environment

We describe a binding environment for the AND and OR parallel execution of logicprograms that is suitable for both shared and nonshared memory multiprocessors. Thebinding environment was designed with a view of rendering a compiler using this ...
Implementation of a parallel Prolog interpreter on multiprocessors
IPPS '91: Proceedings of the Fifth International Parallel Processing Symposium

Describes the implementation of the Reduce-OR process model for the parallel execution of logic programs in an interpreter for parallel Prolog. The interpreter supports full OR and independent AND parallelism in logic programs on both shared and ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Knowledge and Data Engineering

IEEE Transactions on Knowledge and Data Engineering Volume 7, Issue 1

February 1995

192 pages

ISSN:1041-4347

Issue’s Table of Contents

Copyright © Copyright © 1995 IEEE. All Rights Reserved.

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 February 1995

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Qayyum OYu W(2024)Coordination-Free Replicated Datalog Streams with Application-Specific AvailabilityAdvances in Databases and Information Systems10.1007/978-3-031-70626-4_11(155-169)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-70626-4_11
Hu PMotik BHorrocks I(2022)Modular materialisation of Datalog programsArtificial Intelligence10.1016/j.artint.2022.103726308:COnline publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1016/j.artint.2022.103726
Yang MShkapsky AZaniolo C(2017)Scaling up the performance of more powerful Datalog systems on multicore machinesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-016-0448-z26:2(229-248)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s00778-016-0448-z
Rogala MHidders JSroka J(2016)DatalogRAProceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems10.1145/2960414.2960417(1-6)Online publication date: 24-Jun-2016
https://dl.acm.org/doi/10.1145/2960414.2960417
Seo JPark JShin JLam M(2013)Distributed socialiteProceedings of the VLDB Endowment10.14778/2556549.25565726:14(1906-1917)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.14778/2556549.2556572
Bu YHowe BBalazinska MErnst M(2012)The HaLoop approach to large-scale iterative data analysisThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-012-0269-721:2(169-190)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1007/s00778-012-0269-7
Bădică CBraubach LPaschke A(2011)Rule-based distributed and agent systemsProceedings of the 5th international conference on Rule-based reasoning, programming, and applications10.5555/2032787.2032792(3-28)Online publication date: 19-Jul-2011
https://dl.acm.org/doi/10.5555/2032787.2032792
Bu YHowe BBalazinska MErnst M(2010)HaLoopProceedings of the VLDB Endowment10.14778/1920841.19208813:1-2(285-296)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.14778/1920841.1920881
Perri SRicca FSirianni MPetersen LPontelli E(2010)A parallel ASP instantiator based on DLVProceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming10.1145/1708046.1708060(73-82)Online publication date: 19-Jan-2010
https://dl.acm.org/doi/10.1145/1708046.1708060
Wandelt SMoeller R(2010)Distributed island-based query answering for expressive ontologiesProceedings of the 5th international conference on Advances in Grid and Pervasive Computing10.1007/978-3-642-13067-0_48(461-470)Online publication date: 10-May-2010
https://dl.acm.org/doi/10.1007/978-3-642-13067-0_48

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents