Skip to main content

An experimental distributed deductive database system

  • Implementation
  • Conference paper
  • First Online:
Book cover 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:

  • 230 Accesses

Abstract

In this paper we describe a distributed environment for the evaluation of data intensive queries through deductive rules. The distributed database query answering system has been developed on the IBM SP (POWERParallel) available in Argonne National Laboratory. Beyond acting as a testbed, experiments with the system demonstrate that it offers significantly improved performance over single processor approaches. It provides a reconfigurable testbed to immediately evaluate new distribution strategies without writing additional low level code. Furthermore, changing application programs is as easy as changing a top-down Prolog program. With the distribution transformation algorithm, tuning the distribution of new application programs becomes a short process.

Support was provided by the National Science Foundation, under grant Nr. IRI-92-10220.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. U.S. Chakravarthy, J. Grant, and J. Minker. Logic based approach to semantic query optimization. ACM Transactions on Database Systems, 15(2):162–207, June 1990.

    Google Scholar 

  2. K.M. Chandy and C. Kesselman. CC++: A declarative, concurrent, object oriented programming notation. Technical Report CS-92-01, California Institute of Technology, 1992. CC++ is avialable from http://www.compbio.caltech.edu/ccpp.

    Google Scholar 

  3. T. Gaasterland. Generating Cooperative Answers in Deductive Databases. PhD thesis, University of Maryland, Department of Computer Science, 1992. CS-TR-2968.

    Google Scholar 

  4. A. Van Gelder. The alternating fixpoint of logic programs with negation. In Proc. Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principels of Database Systems, pages 1–10, Philadelphia, Pennsylvania, March 1989. ACM Press.

    Google Scholar 

  5. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R.A. Kowalski and K.A. Bowen, editors, Proc. 5 th International Conference and Symposium on Logic Programming, pages 1070–1080, Seattle, Washington, August 15–19 1988.

    Google Scholar 

  6. T. Gaasterland and J. Lobo. Using semantic information for processing negation and disjunction in logic programs. In Proc. of Seventh International Symposium on Methodologies for Intelligent Systems, Trondheim, Norway, June 1993.

    Google Scholar 

  7. S. Ganguly, A. Silberschatz, and S. Tsur. A framework for the parallel processing of datalog queries. In SIGMOD, pages 143–152, ACM Press, 1990.

    Google Scholar 

  8. S-T. Huang. Detecting termination of distributed computations by external agents. In Proceeding of the 9th International Conference of Distributed Computing Systems, pages 79–84. 1989.

    Google Scholar 

  9. D. B. Kemp and P. J. Stukey. Semantics of logic programs with aggregates. In V. Saraswat and K. Ueda, editors, Proc. of the International Symposium on Logic Programming, pages 387–401, Cambridge, Massachusetts, October 1991. MIT Press.

    Google Scholar 

  10. J. Lobo and J. Minker. A metaprogramming approach to semantically optimize queries in deductive databases. In L. Kerschberg, editor, Proceedings of The Second International Conference on Expert Database Systems, pages 387–420, Tysons Corner, Virginia, April 1988.

    Google Scholar 

  11. R. Manthey and F. Bry. Satchmo: A theorem prover implemented in prolog. In E.L. Lusk and R.A. Overbeek, editors, Proc. 9 th International Conference on Automated Deduction, pages 415–434, Argonne, IL, 23–26, May 1988.

    Google Scholar 

  12. A. Van Gelder. Negation as failure using tight derivations for general logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 1149–176. Morgan Kaufmann, 1988.

    Google Scholar 

  13. A. Van Gelder, K.A. Ross, and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. In Proc. 7 th Symposium on Principles of Database Systems, pages 221–230, 1988.

    Google Scholar 

  14. O. Wolfson and A. Ozeri. Parallel and distributed precessing of rules by data-reduction. IEEE Transactions on Knowledge and Data Engineering, 5(3):523–530, 1993.

    Google Scholar 

  15. O. Wolfson, W. Zhang, H. Butani, A. Kawaguchi, and K. Mok. Parallel processing of graph reachabilty in databases. International Journal of Parallel Programming, 21(4):269–302, 1992. Volume appeared in 1993.

    Google Scholar 

  16. W. Zhang, K. Wang, and S-C. Chau. Data partition and parallel evaluation of datalog programas. IEEE Transactions on Knowledge and Data Engineering, 7(1):163–176, February 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Robles, C., Lobo, J., Gaasterland, T. (1995). An experimental distributed deductive database system. 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_38

Download citation

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

  • 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