This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Evaluation of Relational Join Algorithms in a Pipelined Query Processing Environment
June 1988 (vol. 14 no. 6)
pp. 838-848

A query processing strategy which is based on pipelining and data-flow techniques is presented. Timing equations are developed for calculating the performance of four join algorithms: nested block, hash, sort-merge, and pipelined sort-merge. They are used to execute the join operation in a query in distributed fashion and in pipelined fashion. Based on these equations and similar sets of equations developed for other relational algebraic operations, the performance of query execution was evaluated using the different join algorithms. The effects of varying the values of processing time, I/O time, communication time, buffer size, and join selectively on the performance of the pipelined join algorithms are investigated. The results are compared to the results obtained by employing the same algorithms for executing queries using the distributed processing approach which does not exploit the vertical concurrency of the pipelining approach. These results establish the benefits of pipelining

[1] E. Babb, "Implementing a relational database by means of specialized hardware,"ACM TODS, vol. 4, no. 1, pp. 1-29, Mar. 79.
[2] H. Boral and D. J. Dewitt, "Design considerations for dataflow database machines," inProc. ACM-SIGMOD, 1980.
[3] S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems, McGraw-Hill, New York, 1984.
[4] C. J. Date,An Introduction to Database Systems, vol. II. Reading, MA: Addison-Wesley, 1983.
[5] D. J. Dewitt and P. Hawthorn, "A performance evaluation of data-base machine architectures," Dep. Comput. Sci., Univ. Wisconsin, Madison, Tech. Rep. 437, June 1981.
[6] D. J. DeWittet al., "Implementation techniques for main memory databases," inProc. ACM Sigmod(Boston, MA), June 18-21, 1984, pp. 1-8.
[7] S. Finkelstein, "Common expression analysis in database applications," inProc. 1982 ACM-SIGMOD Int. Conf. Management of Data, Orlando, FL, June 1982.
[8] D. H. Fishman, M. Lai, and K. Wilkinson, "Overview of the Jasmin database machine," inProc. SIGMOD '84, alsoSIGMOD Rec., vol. 14, no. 2, pp. 234-238, 1984.
[9] W. Kim, D. Gajski, and D. Kuck, "A parallel pipelined relational query processor,"ACM Trans. Database Syst., June 1984.
[10] H. Lu and M. Gary, "Some experimental results on distributed join algorithms in a local network," inProc. VLDB Conf., 1985, pp. 76- 84.
[11] J. B. Rothnie, P. A. Bernstein, S. Fox, N. Goodman, M. Hammer, T. A. Lansers, C. Reeve, D. W. Shipman, and E. Wong, "Introduction to a system for distributed databases (SDD-1),"ACM TODS, vol. 5, no. 1, pp. 1-17, Mar. 1980.
[12] T. Sellis and L. Shapiro, "Optimization of extended database query languages," inProc. 1985 ACM-SIGMOD Int. Conf. Management of Data, Austin, TX, May 1985.
[13] D. Shaw, "A hierarchical associative architecture for the parallel evaluation of relational algebraic database primitives," Report No. STAN-CS-79-778, Dep. Comput. Sci., Stanford Univ., Oct. 1979.
[14] R. K. Shultz and R. J. Zingg, "Response time analysis of multiprocessor computers for database support,"ACM Trans. Database Syst., Mar. 1984.
[15] J. M. Smith and P. Y.-T. Chang, "Optimizing the performance of a relational algebra database interface,"Commun. ACM, vol. 18, no. 10, pp. 568-579, 1975.
[16] M. Stonebraker,et al., "The design and implementation of INGRES,"ACM Trans. Database Syst., vol. 1, no. 3, Sept. 1976.
[17] M. Stonebraker and E. Neuhold, "A distributed database version of INGRES," inProc. of 1977 Berkeley Workshop Distributed Data Management and Computer Networks, pp. 19-38.
[18] S. Y. W. Su, K. P. Mikkilineni, R. Liurzi, and R. Chow, "A distributed query processing strategy based on decomposition, pipelining, intermediate result sharing techniques," inProc. COMDEC-86.
[19] P. Valduriez and G. Gardarin, "Join and semi-join algorithms for a multiprocessor database machine,"ACM Trans. Database Syst., vol. 9, no. 1, pp. 133-161, 1984.
[20] D. Williamset al., "R*: An overview of the architecture,"IBM Corp., Res. Rep. RJ 3325, Oct. 2, 1981.
[21] E. Wong and K. Youssefi, "Decomposition: A strategy for query processing,"ACM Trans. Database Syst., vol. 1, no. 3, Sept. 1976.

Index Terms:
relational databases; distributed databases; timing equations; relational join algorithms; pipelined query processing environment; nested block; hash; sort-merge; pipelined sort-merge; query execution; distributed processing; database theory; distributed databases; merging; performance evaluation; pipeline processing; relational databases; sorting
Citation:
K.P. Mikkilineni, S.Y.W. Su, "An Evaluation of Relational Join Algorithms in a Pipelined Query Processing Environment," IEEE Transactions on Software Engineering, vol. 14, no. 6, pp. 838-848, June 1988, doi:10.1109/32.6162
Usage of this product signifies your acceptance of the Terms of Use.