This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Common Subexpression Processing in Multiple-Query Processing
May/June 1998 (vol. 10 no. 3)
pp. 493-499

Abstract—The efficiency of common subexpression identification is critical to the performance of multiple-query processing. In this paper, we develop a multigraph for representing and facilitating the processing of multiple queries. In addition to the traditional multiple-query processing approaches in exploiting common subexpressions for identical and subsumption cases, the proposed multigraph processing also covers the overlap case. A performance study shows the viability of this technique when compared to an earlier multigraph approach.

[1] U.S. Chakravarthy and J. Minker, "Multiple Query Processing in Deductive Databases Using Query Graphs," Proc. 12th Conf. VLDB, pp. 384-391, 1986.
[2] S. Chakravarthy,“Divide and conquer: A basis for augmenting a conventional query optimizer with multiple query processing capabilities,” Proc. Seventh Int’l Conf. Data Eng., pp. 482-490,Kobe, Japan, Apr. 1991.
[3] F.-C.F. Chen and M.H. Eich, "Decomposition and Common Subexpression Processing in Multiple-Query Processing," Southern Methodist Univ. Technical Report 94-CSE-30, Aug. 1994.
[4] S. Finkelstein,“Common expression analysis in database applications,” Proc. ACM-SIGMOD Int’l Conf. Management of Data,Orlando, Fla., 1982.
[5] G. Graefe, "Sort-Merge-Join: An Idea Whose Time Has(h) Passed?" Proc. IEEE Int'l Conf. Data Eng., pp. 406-417, 1994.
[6] P.A.V. Hall, "Optimization of Single Expression in a Relational Database System," IBM J. Research and Development, vol. 20, no. 3, May 1976.
[7] W. Hong and E. Wong, "Multiple Query Optimization Through State Transition and Decomposition," Univ. of California at Berkeley Electronics Research Laboratory Memorandum No. UCB/ERL M89/25, 1989.
[8] M. Jarke, "Common Subexpression Isolation in Multiple Query Optimization," Query Processing in Database Systems, Springer-Verlag, New York, 1985.
[9] J. Park and A. Segev,“Using common subexpressions to optimize multiple queries,” Proc. Fourth Int’l Conf. Data Engineering,Los Angeles, 1988.
[10] D.J. Rosenkrantz and H.B Hunt III, "Processing Conjunctive Predicates and Queries," Proc. IEEE Int'l Conf. Data Eng., 1980.
[11] A. Rosenthal and S. Chakravarthy,“Anatomy of a modular multiple query optimizer,” Proc. Int’l Conf. Very Large Data Bases, pp. 230-239,Los Angeles, Sept. 1988.
[12] T.K. Sellis,“Multiple query optimization,” ACM Trans. Database Systems, vol. 13, pp. 23-52, 1988.
[13] E. Wong and K. Youssef, "Decomposition—A Strategy for Query Processing," ACM Trans. Database Systems, vol. 1, no. 3, Sept. 1976.

Index Terms:
Query optimization, query processing, multiple query processing, subexpression identification, select-project-join, databases.
Citation:
Fa-Chung Fred Chen, Margaret H. Dunham, "Common Subexpression Processing in Multiple-Query Processing," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 3, pp. 493-499, May-June 1998, doi:10.1109/69.687980
Usage of this product signifies your acceptance of the Terms of Use.