Arithmetic for parallel linear recursive query evaluation in deductive databases

  • Jerome Robinson
  • Shutian Lin
Paper Sessions Databases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 694)


An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential for parallel processing. It has advantages over other approaches using state-of-the-art parallel processing technology to improve processing speed. In the arithmetic approach, we identify two kind of parallelism, namely bridge node parallelism and formula parallelism. In this paper, the arithmetic foundations and algorithm to exploit formula parallelism were given. The algorithm is fully parallel.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Agrawal, Rakesh; and Devanbu, Prem, “Moving Selections into Linear Least Fixpoint Queries”, IEEE 4th Conference on Data Engineering, 1988, pp 452–461.Google Scholar
  2. Cacace, Filippo; Ceri, Stefano; and Houtsma, Maurice A.W., “An Overview of Parallel Strategies for Transitive Closure on Algebraic Machines”, Proc PRISMA 90, pp 48–66.Google Scholar
  3. Greco, Sergio; and Zaniolo, Carlo, “Optimisation of Linear Logic Programs using Counting Methods”, Proc EDBT 92 (LNCS 580), pp 72–87.Google Scholar
  4. Han, Jiawei; Qadah, Ghassen, and Chaou, Chinying, “The Processing and Evaluation of Transitive Closure Queries”, Intl Conf on Extending Database Technology — EDBT 88, Venice, 1988, pp 49–75.Google Scholar
  5. Han, Jiawei, “Compiling General Linear Recursions by Variable Connection Graph Analysis”, Comput. Intell. 5, pp12–31, 1989.Google Scholar
  6. Henschen, Lawrence; and Naqvi, Shamim A., “On Compiling Queries In Recursive First-Order Databases”, JACM, 31(1), January 1984, pp 47–85.CrossRefMathSciNetGoogle Scholar
  7. Hulin, Guy, “Parallel Processing of Recursive Queries in Distributed Architectures”, VLDB Conf 1989, pp 87–96.Google Scholar
  8. Lavington, Simon; Robinson, Jerome; and Mok, Kai-Yau, “A High Performance Relational Algebraic Processor for Large Knowledge Bases”, Proc VLSI for AI Conference, Oxford, 1988. Kluwer Academic, 1989, pp 133–143.Google Scholar
  9. Lavington, S.H. Waite, M.E. Robinson, J. & Dewhurst N.E.J, “Exploiting Parallelism in Primitives operations on bulk data types”, PARLE'92, Paris, June 1992.Google Scholar
  10. Niven I., Zuckerman H. Montgomery H., “An Introduction to the Theory of Numbers”, Fifth Ed. Published by Jojn Wiley & Sons, Inc. 1991.Google Scholar
  11. Robinson, J.; Lavington, S., “A Transitive Closure and Magic Functions Machine”, Proc 2nd Intl Symposium on Databases in Parallel & Distributed Systems, IEEE Press, July 1990, pp 44–54.Google Scholar
  12. Sacca, Domenico; and Zaniolo, Carlo, “Magic Counting Methods”, Proc ACM SIGMOD 1987, pp 49–59.Google Scholar
  13. Van Gelder, Allen, “A Message Passing Framework for Logical Query Evaluation” Proc ACM SIGMOD 15 (2), 1986, pp 155–165.Google Scholar
  14. Wolfson, Ouri; and Silberschatz, Avi, “Distributed Processing of Logic Programs”, Proc ACM SIGMOD 88, pp 329–336.Google Scholar
  15. Wu, Ching-Shyan; and Henschen, Lawrence, “Answering Linear Recursive Queries in Cyclic Databases”, FGCS 88, Vol 2, pp 727–734.Google Scholar
  16. Wu, Ching-Shyan, “An Algorithmic Approach for Handling Cyclic and Non-cyclic Linear Recursive Queries in Horn Databases,” Ph.D thesis EECS, Northwestern Univ March 1988.Google Scholar
  17. Youn, Cheong; Henschen, Lawrence J.; and Han, Jiawei, “Classification of Recursive Formulas in Deductive Databases”, Proc ACM SIGMOD 88, pp 320–328.Google Scholar
  18. Yu, C. Y.; and Zhang, Weining, “Efficient Recursive Query Processing using Wavefront Methods”, IEEE 1987 Third Intl Conf on Data Engineering.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Jerome Robinson
    • 1
  • Shutian Lin
    • 1
  1. 1.Department of Computer ScienceUniversity of EssexColchesterUK

Personalised recommendations