This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design and Implementation of a Semantic Query Optimizer
September 1989 (vol. 1 no. 3)
pp. 344-361

The authors describe a scheme to utilize semantic knowledge in optimizing a user-specified query. The semantics is represented as function-free clauses in predicate logic. The scheme uses a graph-theoretic approach to identify redundant joins and restrictions present in a given query while adding additional profitable specifications to it. Dynamic and heuristic interaction of three entities-schema, semantics, and query-forms the basis of the algorithm. The implementation architecture of the algorithm and test results on a representative set of data are presented. Issues associated with updating of semantic constraints are addressed, and an algorithm for semantic maintenance is introduced.

[1] A. V. Aho, Y. Sagiv, and J. D. Ullman, "Equivalences among relational expressions,"SIAM J. Comput., vol. 8, pp. 218-246, 1979.
[2] M. M. Astrahanet al., "System R: Relational approach to database management,"Trans. Database Syst., vol. 1, no. 1, pp. 97-137, 1976.
[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] M. W. Blasgen and K. P. Eswaran, "Storage access in relational databases,"IBM Syst. J., vol. 16, no. 4, 1977.
[5] U. S. Chakravarthy, D. Fishman, and J. Minker, "Semantic query optimization in expert systems and database systems," inProc. First Workshop Expert Database Systems, Kiawah Island, SC, Oct. 1984; also inExpert Database Systems, L. Kerschberg, Ed. New York: Benjamin/Cummins, 1986.
[6] U. S. Chakravarthy and J. Minker, "Multiple query processing in deductive databases,"Univ. Maryland, Tech. Rep. TR-1154, Aug. 1985.
[7] U. S. Chakravarthy, J. Minker, and J. Grant, "Semantic query optimization: Additional constraints and controil strategies," inProc. 1st Int. Conf. Expert Database Syst., Charleston, SC, L. Kershberg, Ed., Apr. 1986, pp. 259-269.
[8] R. Epstein, M. Stonebraker, and E. Wong, "Distributed query processing in a relational data base system," inProc. 1978 ACM SIGMOD Int. Conf. Management of Data. New York: ACM Press, May 1978, pp. 169-180.
[9] G. Gentzen, "Untersuchugenüber das logische schliessen," inThe Collected Papers of Gerhard Gentzen, M. E. Szabo, Ed. Amsterdam; The Netherlands: North-Holland, 1934, pp. 68- 132.
[10] J.Grant and J. Minker, "Optimization in deductive and conventional database systems," inAdvances in Database Theory, VoI. 1, H. Gallaire, J. Minker, and J. M. Nicolas, Eds. New York: Plenum, 1980.
[11] L. R. Gotlieb, "Computing joins of relations,"ACM SIGMOD Int. Symp. Management Data, 1975, pp. 55-63.
[12] M. Hammer and S. B. Zdonik, Jr., "Knowledge based query processing," inProc. VLDB, 1980, pp. 137-147.
[13] H. B. Hunt and D. J. Rosenkrantz, "The complexity of testing predicate locks," inProc. ACM SIGMOD, 1979, pp. 127-133.
[14] A. R. Hevner and S. B. Yao, "Query processing in distributed database systems,"IEEE Trans. Software Eng., vol. 5, pp, 177-187, May 1979.
[15] M. Jarke, "External semantic query simplification: A graph-theoretic approach and its implementation in Prolog," inProc. 1st Int. Conf. Expert Database Syst., Kiawah, Isl., SC, Oct. 1984, pp. 467-482.
[16] M. Jarke, J. Clifford, and Y. Vassiliou, "An optimizing prolog front-end to a relational query system," inProc. ACM-SIGMOD 1984 Int. Conf. Management of Data, Boston, MA, June 1984, pp. 296-306.
[17] W. Kim, "Relational database systems,"ACM Comput. Surveys, vol. 11, pp. 185-210, 1979.
[18] J. J. King, "QUIST: A system for semantic query optimization in relational databases," inProc. VLDB, 1981, pp. 510-517.
[19] A. Klug, "On conjunctive queries containing inequalities,"JACM, vol. 35, pp. 146-160, Jan. 1988.
[20] R. Kowalski, "Logic for problem solving,"Artificial Intelligence Series, The Computer Science Library, 1983.
[21] R. Krishnamurthy, H. Boral, and C. Zaniolo, "Optimization of nonrecursive queries," inProc. 12th Int. Conf. Very Large Data Bases, Aug. 1986, pp. 128-137.
[22] R. Kung, E. Hanson, Y. Ioannidis, T. Sellis, L. Shapiro, and M. Stonebraker, "Heuristic search in data base systems," inProc. 1st Int. Workshop Expert Data Base Systems, Kiawah Island, SC, Oct. 1984.
[23] D. Maier,The Theory of Relational Databases. New York: Computer Science, 1983.
[24] Z. Manna,Mathematical Theory of Computation. New York: McGraw-Hill, 1974.
[25] E. Mendelson,Introduction to Mathematical Logic. Princeton, NJ: Van Nostrand, 1964.
[26] M. Morgenstern, "The role of constraints in database, expert systems, and knowledge representation," inProc. 1st Int. Conf. Expert Database Syst., Kiawah Isl., SC, Oct. 1984, pp. 207-223.
[27] F. P. Palermo, "A database search problem," inInformation Systems COINS IV, J. T. Tou, Ed. New York: Plenum.
[28] J. M. Nicholas and K. Yazdanian, "Integrity checking in deductive databases," inLogic and Databases, H. Galliere and J. Minker, Eds. New York: Plenum, 1978.
[29] X. Qian and D. R. Smith, "Reformulation: an approach to efficient constraint validation," inProc. VLDB, 1987.
[30] D. J. Rosenkrantz and H. B. Hunt, "Processing conjunctive predicates and queries," inProc. VLDB, 1980, pp. 64-72.
[31] T. K. Sellis, "Global query optimization," inProc. ACM SIGMOD, May 1986, pp. 191-205.
[32] S. T. Shenoy and Z. M. Ozsoyoglu, "A system for semantic query optimization," inProc. ACM SIGMOD, May 1987, pp. 181-195.
[33] S. Shekar, J. Srivastava, and S. Dutta, "A formal model of trade-off between optimization and execution costs in semantic query optimization," inProc. VLDB, Aug. 1988, pp. 457-467.
[34] M. Siegel, "Automatic rule derivation for semantic query optimization," Boston Univ., Tech. Rep. 87-012, 1987.
[35] M. Siegel, "Automatic rule derivation for semantic query optimization," inProc. 2nd Int. Conf. Expert Database Syst., Tysons Corners, VA, 1988, pp. 371-385.
[36] M. Stonebraker,et al., "The design and implementation of INGRES,"ACM Trans. Database Syst., vol. 1, no. 3, Sept. 1976.
[37] L. Sterling and E. Shapiro,The Art of Prolog. Cambridge, MA: M.I.T. Press, 1986.
[38] X. Sun, N. Kamel, and L. M. Ni, "Solving implication problems in database applications," inProc. ACM SIGMOD, May 1989, pp. 185- 192.
[39] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[40] E. Wong and K. Youssefi, "Decomposition: A strategy for query processing,"ACM Trans. Database Syst., vol. 1, no. 3, Sept. 1976.
[41] S. B. Yao, "Optimization of query evaluation algorithms,"ACM Trans. Database Syst., vol. 4, no. 2, pp. 133-155, June 1979.
[42] T. C. Yu and Z. M. Ozsoyoglu, "On determining tree query membership of a distributed query," inProc. INFOR, Aug. 1983, pp. 261-281.

Index Terms:
semantic query optimizer; semantic knowledge; user-specified query; function-free clauses; predicate logic; graph-theoretic approach; redundant joins; schema; semantics; semantic maintenance; graph theory; optimisation; relational databases
Citation:
S.T. Shenoy, Z.M. Ozsoyoglu, "Design and Implementation of a Semantic Query Optimizer," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 3, pp. 344-361, Sept. 1989, doi:10.1109/69.87980
Usage of this product signifies your acceptance of the Terms of Use.