Abstract
Parallelism is a promising approach to high performance data management. In a highly parallel data server with declustered data placement, an important issue is to exploit parallelism in processing complex queries such as recursive queries. In this paper, we consider the transitive closure of a database relation as a paradigm to study parallel recursive query processing. And we propose two new parallel algorithms for evaluating the transitive closure of a relation in a parallel data server. Performance comparisons based on an analytical model indicate the superior response time of the parallel algorithms over their centralized version. With one hundred nodes, performance gain is between one and two orders of magnitude. One parallel algorithm provides superior response time while the other exhibits better response time/total time trade-off.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Boral and D. J. DeWitt, Database Machines: an Idea Whose Time has Passed? a Critique of the Future of Database Machines,Int. Workshop on Database Machines, Munich, (September 1983).
H. C. Du Distributing a Database for Parallel Processing in NP-hard,ACM SIGMOD Record, Vol. 14, No. 1, (March 1984).
H. Boral, Parallelism and Data Management,Int. Conf. on Databases, Jerusalem, (June 1988).
M. Stonebraker, The Case for Shared Nothing,Database, Engineering, Vol. 9, No. 1 (March 1986).
P. M. Neches, The Anatomy of a Database Computer System,COMPCON Int. Conf., San Francisco, (February 1985).
D. J. DeWittet al. GAMMA-a High Performance Dataflow Database Machine,Int. Conf. on VLDB, Kyoto, (August 1986).
M. Livny, S. Khoshafian, and H. Boral, Multi-Disk Management Algorithms,ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Banff, Alberta, (May 1987).
D. Bitton, H. Boral, D. J. DeWitt, and W. K. Wilkinson, Parallel Algorithms for the Execution of Relational Database Operations,ACM TODS, Vol. 8, No. 3, (September 1983).
P. Valduriez and G. Gardarin, Join and Semijoin Algorithms for a Multiprocessor Database Machine,ACM TODS, Vol. 9, No. 1, (March 1984).
D. J. DeWitt and Gerber, Multiprocessor Hash-based Join Algorithms,Int. Conf. on VLDB, Stockhol, (August 1985).
S. Khoshafian and P. Valduriez, Parallel Execution Strategies for Declustered Databases,5th Int. Workshop on Database Machines, Karuizawa, Japan, (October 1987).
F. Banilhon and R. Ramakrishan, An Amateur's Introduction to Recursive Query Processing Strategies,ACM-SIGMOD Int. Conf., Washington, D.C., (May 1986).
P. Valduriez and H. Boral, Evaluation of Recursive Queries Using Join Indices,1st Int. Conf. on Expert Database Systems, Charleston, South Carolina, (April 1986).
Y. E. Ioannidis, On the Computation of the Transitive Closure of Relational Operators,Int. Conf. on VLDB, Kyoto, (August 1986).
H. Lu, K. Mikkilineni, and J. P. Richardson, Design and Analysis of Algorithms to Compute the Transitive Closure of a Database Relation,IEEE Int. Conf. on Data Engineering, Los Angeles, (February 1987).
H. V. Jagadish, R. Agrawal, and L. Ness, A Study of Transitive Closure as a Recursion Mechanism,ACM-SIGMOD Int. Conf., San Francisco, (May 1987).
R. Agrawal and H. V. Jagadish, Direct Algorithms for Computing the Transitive Closure of Database Relations,Int. Conf. on VLDB, Brighton, England, (September 1987).
M. J. Quinn and N. Deo, Parallel Graph Algorithms,Computing Surveys, Vol. 16, No. 3, (September 1984).
D. A. Schneider and M. J. Skarpelos, Design and Implementation of a Distributed Transitive Closure Algorithm, Unpublished Manuscrip, U. of Wisconsin, Madison, (May 1986).
P. Valduriez, S. Khoshafian, Transitive Closure of Transitively Closed Relations,2nd Int. Conf. on Expert Database Systems, Tysons Corner, Virginia, (April 1988).
G. Copeland, W. Alexander, E. Boughter, and T. Keller, Data Placement in Bubba,ACM SIGMOD Int. Conf., Chicago, Illinois, (May 1988).
P. Valduriez, Join Indices,ACM TODS, Vol. 12, No. 2, (June 1987).
K. Bratbergsengen, Hashing Methods and Relational Algebra Operations,Int. Conf. on VLDB, Singapore, (August 1984).
M. Kitsuregawaet al., Application of Hash to Data Base Machine and Its Architecture, New Generation Computing, Vol. 1, (1983).
Additional information
This work had been done within the Advanced Computer Architecture Program, Microelectronics and Computer Technology Corporation, Austin, Texas. The current affiliation of Setrag Khoshafian is Ashton-Tate, Walnut Creek, California.
Rights and permissions
About this article
Cite this article
Valduriez, P., Khoshfian, S. Parallel evaluation of the transitive closure of a database relation. Int J Parallel Prog 17, 19–42 (1988). https://doi.org/10.1007/BF01379321
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01379321