Skip to main content
SpringerLink
Log in

Practical behavior of parallelization strategies for Datalog

  • Query Processing I
  • Conference paper
  • First Online:
Deductive and Object-Oriented Databases (DOOD 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1013))

Included in the following conference series:

  • 226 Accesses

Abstract

We present a behavior study on a very important class of known parallelization strategies for evaluating Datalog, the bottom-up rule instantiations partitioning paradigm. Its basic algorithm specialization is observed and some variations are tried out in order to obtain a comprehensive set of implementation results. We make careful observations on the impact of some of the factors that might influence the behavior of the algorithms. Particularly, important issues related to inter-site data transfers are analyzed and the practical results obtained show that this is clearly a fundamental factor to achieve acceptable performances. We also show that the usually considered analytical models may not explain the actual behavior of the algorithms.

This work was supported in part by CNPq

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal and H.V. Jagadish, “Multiprocessor Transitive Closure Algorithms”, Proc. Intl. Symp. on Databases in Parallel and Distributed Systems, 1988, pp 56–66.

    Google Scholar 

  2. D.A. Bell, J. Shao and M.E.C. Hull, “A Pipelined Strategy for Processing Recursive Queries in Parallel”, Data & Knowledge Engineering, 6(5), 1991, pp 367–391.

    Google Scholar 

  3. F. Cacace, S. Ceri and M.A.W. Houtsma, “A Survey of Parallel Execution Strategies for Transitive Closure and Logic Programs”, Distributed and Parallel Databases, 1(4), 1993, pp 337–382.

    Google Scholar 

  4. J.-P. Cheiney, S. Lifschitz and P. Picouet, “A Centralized Communication Approach for the Parallel Shared-Nothing Evaluation of Datalog” Proc. Brazilian Symposium on Database Systems, 1994, pp 51–64.

    Google Scholar 

  5. S.R. Cohen and O. Wolfson, “Why a Single Parallelization Strategy is not Enough in Knowledge Bases”, Proc. ACM Symp. on Principles of Database Systems, 1989, pp 200–216.

    Google Scholar 

  6. S. Dar and R. Ramakrishnan, “A Performance Study of Transitive Closure Algorithms”, Proc. ACM-SIGMOD Intl. Conf. on Management of Data, 1994, pp 454–465.

    Google Scholar 

  7. D. Dewitt and J. Gray, “Parallel Database Systems: the Future of High Performance Database Systems”, Communications of the ACM, 35(6), 1992, pp 85–98.

    Google Scholar 

  8. D.G. Feitelson and L. Rudolph, “Distributed Hierarchical Control for Parallel Processing”, IEEE Computer, 1990, pp 65–77.

    Google Scholar 

  9. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek and V. Sunderam “PVM3 User's Guide and Reference Manual”, Oak Ridge National Laboratory TM-12187, 1994.

    Google Scholar 

  10. S. Ganguly, A. Silberschatz and S. Tsur “A Framework for the Parallel Processing of Datalog Queries”, Proc. ACM-SIGMOD Intl. Conf. on Management of Data, 1990, pp 143–152.

    Google Scholar 

  11. M.A.W Houtsma, P.M.G. Apers and S. Ceri, “Distributed Transitive Closure Computations: the Disconnection Set Approach”, Proc. Intl. Conf. Very Large Databases, 1990, pp 335–346.

    Google Scholar 

  12. M.A.W Houtsma, A.N. Wilschut and J. Flokstra, “Implementation and Evaluation of a Parallel Transitive Closure Algorithms on PRISMA/DB”, Proc. Intl. Conf. Very Large Databases, 1993, pp 206–217.

    Google Scholar 

  13. G. Hulin, “Parallel Processing of Recursive Queries in Distributed Architectures”, Proc. Intl. Conf. on Very Large Data Bases, 1989, pp 87–96.

    Google Scholar 

  14. P.C. Kanellakis, “Logic Programming and Parallel Complexity”, Foundations of Deductive Databases and Logic Programming, Ed J. Minker, Morgan Kauffman, 1988, pp 547–585.

    Google Scholar 

  15. S. Lifschitz and V. Vianu, “A Probabilistic View of Datalog Parallelization”, Proc. Intl. Conf. on Database Theory, 1995, pp 294–307. (extended version to appear in Theoretical Computer Science)

    Google Scholar 

  16. N. Goodman, S. Rozen and L. Stein, “Requirements for a Deductive Query Language in a Genome-Mapping Database”, Applications of Logic Databases, Ed. R. Ramakrishnan, Kluwer Academic Publishers, 1995, pp 259–276.

    Google Scholar 

  17. J. Seib and G. Lausen, “Parallelizing Datalog Programs by Generalized Pivoting”, Proc. ACM Symp. on Principles of Database Systems, 1991, pp 78–87.

    Google Scholar 

  18. J. Shao, D.A. Bell and M.E.C. Hull, “Combining Rule Decomposition and Data Partitioning in Parallel Datalog Program Processing”, Proc. Intl. Conf. on Parallel and Distributed Information Systems, 1991, pp 106–115.

    Google Scholar 

  19. M. Stonebraker, “The Case for Shared Nothing”, Database Engineering, 9(1), 1986, pp 4–9.

    Google Scholar 

  20. S. Tsur, “Deductive Databases in Action”, Proc. ACM Symp. on Principles of Database Systems, 1991, pp 142–153.

    Google Scholar 

  21. J.D. Ullman, “Bottom-up beats Top-down for Datalog”, Proc. ACM Symp. on Principles of Database Systems, 1989, pp 140–149.

    Google Scholar 

  22. J.D. Ullman and A. Van Gelder, “Parallel Complexity of Logic Query Programs”, Algorithmica, 3, 1988, pp 5–42.

    Google Scholar 

  23. P. Valduriez, “Parallel Database Systems: Open Problems and New Issues”, Distributed and Parallel Databases, 1(2), 1993, pp 137–165.

    Google Scholar 

  24. P. Valduriez and S. Khoshafian, “Parallel Evaluation of the Transitive Closure of a Database Relation”, Intl. Journal of Parallel Programming, 17(1), 1988, pp 19–42.

    Google Scholar 

  25. A. Van Gelder, “A Message Passing Framework for Logical Query Evaluation”, Proc. ACM-SIGMOD Intl. Conf. on Management of Data, 1986, pp 155–165.

    Google Scholar 

  26. O. Wolfson, “Sharing the Load of Logic-Programming Evaluation ”, Proc. Intl. Symp. on Databases in Parallel and Distributed Systems, 1988, pp 46–55.

    Google Scholar 

  27. O. Wolfson and A. Ozeri, “A New Paradigm for Parallel and Distributed Rule-Processing”, Proc. ACM-SIGMOD Intl. Conf. on Management of Data, 1990, pp 133–142.

    Google Scholar 

  28. O. Wolfson and A. Silberschatz, “Distributed Processing of Logic Programming”, Proc. ACM-SIGMOD Intl. Conf. on Management of Data, 1988, pp 329–336.

    Google Scholar 

  29. O. Wolfson, W. Zhang, H. Butani, A. Kawaguchi and K. Mok “A Methodology for Evaluating Parallel Graph Algorithms and its Applications to Single Source Reachability”, Proc. Intl. Conf. on Parallel and Distributed Information Systems, 1993, pp 243–250.

    Google Scholar 

  30. W. Zhang, K. Wang and S-C. Chau, “Data Partition: a Practical Parallel Evaluation of Datalog Programs”, Proc. Intl. Conf. on Parallel and Distributed Information Systems, 1991, pp 98–105.

    Google Scholar 

  31. X. Zhou, Y. Zhang and M.E. Orlowska, “A New Fragmentation Scheme for Recursive Query Processing”, Data & Knowledge Engineering, 13, 1994, pp 177–192.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Brasil

    Sérgio Lifschitz, Rubens N. Melo & Esther Pacitti

Authors
  1. Sérgio Lifschitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rubens N. Melo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Esther Pacitti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tok Wang Ling Alberto O. Mendelzon Laurent Vieille

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lifschitz, S., Melo, R.N., Pacitti, E. (1995). Practical behavior of parallelization strategies for Datalog. In: Ling, T.W., Mendelzon, A.O., Vieille, L. (eds) Deductive and Object-Oriented Databases. DOOD 1995. Lecture Notes in Computer Science, vol 1013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60608-4_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-60608-4_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60608-6

  • Online ISBN: 978-3-540-48460-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation