An experimental performance study of a pipelined recursive query processing strategy

  • Authors:
  • J. Shao;D. A. Bell;M. E. C. Hull

  • Affiliations:
  • Department of Computing Science, University of Ulster at Jordanstown, Co. Antrim, N. Ireland, U.K.;Department of Computing Science, University of Ulster at Jordanstown, Co. Antrim, N. Ireland, U.K.;Department of Computing Science, University of Ulster at Jordanstown, Co. Antrim, N. Ireland, U.K.

  • Venue:
  • DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

In [16] a pipelined strategy is presented for processing recursive queries in deductive database systems. As a follow-up, this paper studies the run-time performance of the proposed strategy. The algorithm, introduced informally by examples in this paper, is coded in occam2 and runs on a network of transputers. A wide range of recursive queries and database structures are used as benchmarks in this study. Both the speedup factors achieved and the elapsed time spent by the strategy in answering recursive queries are analysed. Experimental results show that it is possible to achieve significant performance improvement when queries are evaluated in parallel, and provide insights into the success of this strategy in meeting the primary objective of focusing on relevant data.