This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimization Strategies for Relational Queries
October 1989 (vol. 15 no. 10)
pp. 1217-1235

[1] M. M. Astrahan, W. Kim, and M. Schkolnick, "Performance of the System R access path selection algorithm," inInformation Processing 80. New York: Elsevier North-Holland, 1980, pp. 487-491.
[2] S. Bergamaschi and M. R. Scalas, "Choice of the optimal number of blocks for data access by an index,"Inform. Syst., vol. 11, no. 3, pp. 199-209, 1986.
[3] P. A. Bernstein, N. Goodman, E. Wong, G. L. Reeve, and J. Rothmie, "Query processing in a system for distributed database (SDD-I),"ACM Trans. Database Syst., vol. 6, Dec. 1981.
[4] D. Bitton and D. J. Dewitt, "Duplicate record elimination in large data files,"ACM Trans. Database Syst., pp. 255-265, June 1983.
[5] A. Cardenas, "Analysis and performance of inverted data-base structures,"Commun. ACM, vol. 18, no. 5, pp. 253-263, 1975.
[6] S. Christodoulakis, "Implications of certain assumptions in database performance evaluation,"ACM Trans. Database Syst.vol. 9, no. 2, pp. 163-186, June 1984.
[7] P. Ciaccia, D. Maio, and P. Tiberio. "A unifying approach to evaluating block accesses in database organizations,"Inform. Processing Lett., vol. 28, no. 5, pp, 253-257, Aug 1988.
[8] U. Dayalel al., "PROBE: A research project in knowledge-oriented database systems: Preliminary analysis," CCA, Cambridge, MA, Tech. Rep. CCA-85-03, July 1985.
[9] M. Jarke and J. Koch, "Query optimization in database systems,"ACM Comput. Surveys, vol. 16, no. 2, June 1984.
[10] W. Kim, "A new way to compute the product and join of relations," inACM SIGMOD Conf. Proc., Santa Monica, CA, 1980, pp. 179- 187.
[11] W. Kim, "On optimizing an SQL-like nested query,"ACM Trans. Database Syst., vol. 7, no. 3, pp. 443-469, Sept. 1982.
[12] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[13] D. Maio, M. R. Scalas, and P. Tiberio, "On estimating access costs in relational databases,"Inform. Processing Lett., vol. 19, no. 3, pp. 157-161, 1984.
[14] M. V. Mannino, P. C. Chu, and T. Sager, "Statistical profile estimation in database systems,"ACM Comput. Surveys, vol. 20, no. 3, pp. 191-221, Sept. 1988.
[15] M. Muralikrishna, "Optimization of multiple-disjunct queries in a relational database system," Univ. Wisconsin, Madison, Tech. Rep. TR 750, Feb. 1988.
[16] E. Neuhold and M. Stonebraker, Eds., "Future directions in DBMS research," Technical Int. Comput. Sci. Inst., Berkeley, CA, Tech: Rep. TR-88-001, May 1988.
[17] M. R. Scalas and P. Tiberio, "The use of nested-block method for computing joins," inProc. IEEE COMPSAC, Chicago, IL, Nov. 1983, pp. 455-463.
[18] P. Selinger,et al., "Access path selection in a relational data base system," inProc. 1979 ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, June 1979.
[19] 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.
[20] K.-Y. Whang, G. Wiederhold, and D. Sagalowicz, "Separability-- An approach to physical database design,"IEEE Trans. Comput., vol. C-33, no. 3, Mar. 1984.
[21] E. Wong and K. Youssefi, "Decomposition: A strategy for query processing,"ACM Trans. Database Syst., vol. 1, no. 3, Sept. 1976.
[22] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.
[23] S. B. Yao, "Optimization of query evaluation algorithms,"ACM Trans. Database Syst., vol. 4, no. 2, pp. 133-155, June 1979.

Index Terms:
Disjunctive expressions; join algorithms; query models; query optimisation; relational databasesa
Citation:
P. Ciaccia, M.R. Scalas, "Optimization Strategies for Relational Queries," IEEE Transactions on Software Engineering, vol. 15, no. 10, pp. 1217-1235, Oct. 1989, doi:10.1109/TSE.1989.559773
Usage of this product signifies your acceptance of the Terms of Use.