Learning Transformation Rules for Semantic Query Optimization: A Data-Driven Approach

IEEE Transactions on Knowledge and Data Engineering

Volumn 5, Issue 6, 1993, Pages 950-964

  Shekhar, Shashi ^a   Kohli, Ashim ^a   Coyle, Mark ^a   Hamidzadeh, Babak ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Data; discovery in databases; learning; rule discovery; semantic query optimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; DATA HANDLING; LEARNING SYSTEMS; OPTIMIZATION; QUERY LANGUAGES;

CLOSURE ALGORITHMS; DATABASE SYSTEM ADMINISTRATOR; INTEGRITY CONSTRAINTS; RULE DISCOVERY; SEMANTIC QUERY OPTIMIZATION; TRANSFORMATION RULES;

DATABASE SYSTEMS;

EID: 0027866831     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.250077     Document Type: Article

References (42)

1. J. J. King, “QUIST: A system for semantic query optimization in relational databases,” in Proc. 7th VLDB Conf., 1981.
2. M. Hammer and S. Zdonik, “Knowledge based query processing,” in Proc. 6th Conf. VLDB, 1980.
3. S. T. Shenoy and Z. M. Ozsoyoglu, “Design and implementation of a semantic query optimizer,” IEEE Trans. Knowledge and Data Engineering, pp. 362–375, 1989.
4. H. H. Pang, H. J. Lu, and B. C. Ooi, “An efficient semantic query optimization algorithm,” in Proc. Data Eng. Conf., IEEE, 1991.
5. G. M. Lohman, “Panel discussion on semantic query optimization,” in Proc. Data Eng. Conf., 1985.
6. S. Shekhar, J. Srivastava, and S. Dutta, “A formal model of tradeoffs between execution and optimization costs in semantic query optimization,” in Intl. Conf. Very Large Databases (VLDB) (reprinted in N. H. J. D. K. E. 1993), 1988.
7. C. T. Yu and W. Sun, “Automatic knowledge acquisition and maintenance for semantic query optimization,” IEEE Trans. Knowledge and Data Processing, pp. 362–375, 1989.
8. S. T. Shenoy and Z. M. Ozsoyoglu, “A system for semantic query optimization,” in Proc. ACM-SIGMOD, pp. 181–195, 1987.
9. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Bell Telephone Lab., 1974.
10. M. Siegel, “Automatic rule derivation for semantic query optimization,” Ph.D. diss., Boston Univ., 1988.
11. M. Siegel, “Automatic rule derivation for semantic query optimization,” in Proc. 2nd Int. Conf. Expert Database Syst., pp. 371–385, George Mason Foundation, 1988.
12. M. Siegel, E. Sciore, and S. Salveter, “Rule discovery for query optimization,” Knowledge Discovery in Databases, AAAI Press, 1991.
13. C. L. Chang, “DEDUCE 2: Further investigations of deduction in relational data bases,” in Logic and Data Bases, J. Minker, Ed. New York: Plenum, 1978, 201–236.
14. J. M. Nicolas, “Logic for improving integrity checking in relational databases,” Acta Informtica, vol. 18, pp. 227–253, Springer-Verlag, 1982.
15. R. S. Michalski, “A theory and methodology of inductive learning,” in Machine Learning: An Artificial Intelligence Approach. T. M. Mitchell, Ed. Los Altos, CA: Morgan Kaufmann, 1986.
16. R. S. Michalski and R. E. Stepp, “Learning from observation: Conceptual clustering,” in Machine Learning: An Artificial Intelligence Approach, T. M. Mitchell, Ed. Palo Alto, CA: Tioga, 1983, pp. 331–363.
17. J. R. Quinlan, “Probabilistic decision trees,” in Machine Learning: An Aritificial Intelligence Approach, Yves Kodratoff, Ed. San Mateo, CA: Morgan Kaufmann, 1990, pp. 140–152.
18. S. C. Shapiro, Encyclopedia of Artificial Intelligence. New York: Wiley-Interscience, 1990.
19. R. R. Sokal and R. H. Sneath, Principles of Numerical Taxonomy. San Francisco, CA: W. H. Freeman, 1963.
20. R. M. Cormark, “A review of classification,” J. Roy Stat. Soc., Series A, pp. 134–321, 1971.
21. M. R. Anderberg, Clustering Analysis. New York: Academic, 1973.
22. J. C. Gower, “A comparison of some methods of cluster analysis,” Biometrics, vol. 23, pp. 623–637. 1967.
23. E. Diday and J. C. Simon, “Clustering analysis,” Communication and Cybernetics. New York: Springer-Verlag, 1976.
24. R. S. Michalski, “Knowledge acquisition through conceptual clustering: A theoretical framework and an algorithm for partitioning data into conjunctive concepts,” in J. Pol. Anal. Inform. Syst., vol. 4, pp. 219–244, 1980.
25. P. Langley and S. Sage, “Conceptual clustering as discrimination learning,” in Proc. 5th Biennial Conf. Canadian Soc. Computational Studies Intell., pp. 95–98, 1984.
26. D. Fisher, “A hierarchical conceptual clustering algorithm,” Tech. Rep., Dept. Infor. Comput. Sci., Univ. CA, Irvine, 1984.
27. S. J. Hanson, “Conceptual clustering and categorization: Bridging the gap between induction and causal models,” in Machine Learning: An Artificial Intelligence Approach, Yves Kodratoff, Ed. San Mateo, CA: Morgan Kaufmann, 1990, pp. 235–268.
28. S. P. Ghosh, “Statistics metadata: Linear regression analysis,” in Foundations of Data Organization, Katsumi Tanaka, Ed. New York: Plenum, 1987, pp. 3–17.
29. P. Langley, J. Zytkow, H. Simon, and G. Bradshaw, “Rediscovering chemistry with the BACON system,” in Machine Learning: An Artificial Intelligence Approach, T. M. Mitchell, Ed. Palo Alto. CA: Tioga, 1983, pp. 307–330.
30. J. Zytkow and J. Baker, “Interactive mining of regularities in databases,” Knowledge Discovery in Databases, AAAI Press, 1991.
31. D. B. Lenat, “The role of heuristics in learning by discovery: Three case studies,” in Machine Learning: An Artificial Intelligence Approach , T. M. Mitchell, Ed. Palo Alto, CA: Tioga, 1983.
32. P. Langley, J. Zytkow, H. Simon, and G. Bradshaw, “The search for regularity: Four aspects of scientific discovery,” in Machine Learning: An Artificial Intelligence Approach, T. M. Mitchell, Ed. Los Altos, CA: Morgan Kaufmann, 1986, pp. 425–469.
33. R. Elmasri and G. Wiederhold, “Data model integration using the structural model,” in Proc. Int. Conf Management Data, ACM SIGMOD, 1979.
34. M. Hammer and D. McLeod, “Semantic integrity in a relational data base system,” VLDB, 1975.
35. K. Eswaran and D. D. Chamberlin, “Functional specifications of a subsystem for database integrity,” VLDB, 1975.
36. E. Codd, “Extending the database relational model to capture more meaning,” TODS, vol. 4, no. 4, Dec. 1979.
37. P. Chen, “The entity relationship mode—Toward a unified view of data,” TODS vol. 4, no. 4, Mar. 1976.
38. J. Schmidt and J. Swenson, “On the semantics of the relational model,” SIGMOD, 1975.
39. K. Y. Whang and R. Krishnamurthy, “The multilevel grid file—A dynamic hierarchical multidimensional file structure,” Int. Symp. Database Syst. Advanced Applications, Tokyo, Japan, April 1991.
40. M. V. Mannino. P. Chu, and T. Sager, “Statistical profile estimation in database systems,” Comput. Surveys, vol. 20, no. 3, ACM, Sept. 1988.
41. K. Whang, S. Kim, and G. Wiederhold, “Dynamic maintenance of data distribution for selectivity estimation,” Dept, of Comput. Sci., Stanford Univ., Sept. 1991.
42. L. F. Mackert and G. M. Lohman, “R* optimizer validation and performance evaluation for local queries,” in Proc. ACM-SIGMOD, pp. 84–95, ACM, 1986.