By Topic

An experimental performance study of a pipelined recursive query processing strategy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shao, J. ; Dept. of Comput. Sci., Ulster Univ., Jordanstown, UK ; Bell, D.A. ; Hull, M.E.C.

The run-time performance of a strategy (previously proposed by the authors, J. Shao et al., 1989) for processing recursive queries in deductive database system is studied. The algorithm, introduced informally by examples, is coded in occam2 and runs on a network of transputers. A wide range of recursive queries and database structures are used as benchmarks. Both the speedup factors achieved and the elapsed time spent by the strategy in answering recursive queries are analyzed. Experimental results show that it is possible to achieve significant performance improvements when queries are evaluated in parallel. These results provide insights into the success of this strategy in meeting the primary objective of focusing on relevant data

Published in:

Databases in Parallel and Distributed Systems, 1990, Proceedings. Second International Symposium on

Date of Conference:

2-4 Jul 1990