
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Xubo Zhang, Z. Meral Ozsoyoglu, "Implication and Referential Constraints: A New Formal Reasoning," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 6, pp. 894910, NovemberDecember, 1997.  
BibTex  x  
@article{ 10.1109/69.649315, author = {Xubo Zhang and Z. Meral Ozsoyoglu}, title = {Implication and Referential Constraints: A New Formal Reasoning}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {9}, number = {6}, issn = {10414347}, year = {1997}, pages = {894910}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.649315}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Implication and Referential Constraints: A New Formal Reasoning IS  6 SN  10414347 SP894 EP910 EPD  894910 A1  Xubo Zhang, A1  Z. Meral Ozsoyoglu, PY  1997 KW  Semantic integrity constraints KW  implication constraints KW  referential constraints KW  query containment KW  semantic query optimization KW  refutation KW  database system. VL  9 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—In this paper, we address the issue of reasoning with two classes of commonly used semantic integrity constraints in database and knowledgebase systems: implication constraints and referential constraints. We first consider a central problem in this respect, the
[1] A.V. Aho, Y. Sagiv, and J.D. Ullman, "Equivalences Among Relational Expressions," SIAM J. Computing, vol. 8, no. 2, pp. 218246, May 1979.
[2] A.V. Aho, Y. Sagiv, and J.D. Ullman, Efficient Optimization of a Class of Relational Expressions ACM Trans. Database Systems, vol. 4, no. 4, pp. 435454, Dec. 1979.
[3] M.A. Casanova, R. Fagin, and C.H. Papadimitriou, "Inclusion Dependencies and Their Interactions with Functional Dependencies," J. Computer and System Sciences, vol. 28, 1984.
[4] A.K. Chandra and P.M. Merlin, “Optimal Implementation of Conjunctive Queries in Relational Databases,” Proc. Ninth Ann. ACM Symp. Theory of Computing, pp. 7790, 1977.
[5] U.S. Chakravarthy, J. Grant, and J. Minker, “Logicbased Approach to Semantic Query Optimization,” ACM Trans. Database Systems, vol. 15, no. 2, pp. 162–207, 1990.
[6] C.L. Chang and R.C.T. Lee,Symbolic Logic and Mechanical Theorem Proving.New York: Academic Press, 1973.
[7] A.K. Chandra and M.Y. Vardi, "The Implication Problem for Functional and Inclusion Dependencies is Undecidable," IBM Research Report RC9980, Yorktown, N.Y., 1983.
[8] S. Cosmadakis and P.C. Kanellakis, "Functional and Inclusion Dependencies: A Graph Theoretic Approach," Proc. ACM Symp. Principles of Database Systems, 1984.
[9] P. Dublish, J. Biskup, and Y. Sagiv, "Optimization of a Subclass of Conjunctive Queries," Lecture Notes in Computer Science, vol. 470, pp. 455469, 1990.
[10] N. Dershowitz, “Termination,” RTA '85, pp. 180223, May 1985.
[11] C. Elkan, “Independence of Logic Database Queries and Updates,” Proc. Ninth ACM PODS Conf., pp. 154160, 1990.
[12] M.M. Fonkam and W.A. Gray, "Employing Integrity Constraints for Query Modification and Intensional Answer Generation in MultiDatabase Systems," Lecture Notes in Ccomputer Science, vol. 618, pp. 244260, 1992.
[13] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[14] J. Han, "ConstraintBased Reasoning in Deductive Databases," Proc. Seventh Data Eng., pp. 257265, 1991.
[15] M.M. Hammer and S.B. Zdonik, "Knowledge Based Query Processing," Proc. Sixth Int'l Conf. Very Large Databases, pp. 137147, 1980.
[16] D. Johnson and A. Klug, "Optimizing Conjunctive Queries that Contain Untyped Variables," SIAM J. Computing, vol. 12, no. 4, pp. 616640, Nov. 1983.
[17] D. Johnson and A. Klug, "Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies," J. Computer and System Sciences, vol. 28, no. 1, pp. 167189, 1984.
[18] P. Kanellakis, G. Kuper, and P. Revesz, "Constraint Query Languages, Proc. Ninth ACM Symp. Principles of Database Systems, pp. 299313, 1990.
[19] J.J. King, "QUIST: A System for Semantic Query Optimization in Relational Databases," Proc. Seventh Int'l Conf. Very Large Databases, pp. 510517, 1981.
[20] A. Klug, "On Conjunctive Queries Containing Inequalities," J. ACM vol. 35, no. 1, pp. 146160, Jan. 1988.
[21] S. Lee and J. Han, “Semantic Query Optimization in Recursive Databases,” Proc. IEEE Int'l Conf. Data Eng., pp. 444–451, 1988.
[22] A. Levy and Y. Sagiv, “Constraints and Redundancy in Datalog,” Proc. 11th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, pp. 6780, June 1992.
[23] A.Y. Levy and Y. Sagiv, “Semantic Query Optimization in Datalog Programs,” Proc. ACM Symp. Principles of Database Systems, 1995.
[24] R. van der Meyden, "The Complexity of Querying Infinite Data About Linearly Ordered Domains," Proc. 11th ACM Symp. Principles of Database Systems, pp. 331345, 1992.
[25] J.C. Mitchell, "Inference Rules for Functional and Inclusion Dependencies," Proc. ACM Symp. Principles of Database Systems, 1983.
[26] J.C. Mitchell, "The Implication Problem for Functional and Inclusion Dependencies," Technical Report MIT/LCS/TM235, 1983.
[27] A. Motro, "Using Integrity Constraints to Provide Intensional Answers to Relational Queries," Proc. 15th Int'l Conf. Very Large Databases, pp. 237246, 1989.
[28] N.S. Ishakbeyoglu and Z.M. Ozsoyoglu, "On the Maintenance of Implication Integrity Constraints," Proc. Int'l Conf. Database and Expert Systems Application '93, pp. 221232, 1993.
[29] Z.M. Ozsoyoglu, "Query Optimization in Distributed Databases," PhD thesis, Dept. Computer Science, Univ. of Alberta, Canada, 1980.
[30] H.H. Pang, H.J. Lu, and B.C. Ooi, “An Efficient Semantic Query Optimization Algorithm,” Proc. IEEE Int'l Conf. Data Eng., pp. 326–335, 1991.
[31] A. Pirotte and D. Roelants, "Constraints for Improving the Generation of Intensional Answers in a Deductive Database," Proc. Fifth Data Eng., pp. 652659, 1989.
[32] Y. Sagiv, "Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions," SIAM J. Computing, vol. 12 no. 2, pp. 316329, May 1983.
[33] Y. Sagiv and M. Yannakakis, "Equivalences Among Relational Expressions with Union and Difference Operators," J. ACM, vol. 27, no. 4, pp. 633655, Oct. 1980.
[34] E. Sciore, "Inclusion Dependencies and the Universal Instance," Proc. ACM Symp. Principles of Database Systems, 1983.
[35] S.T. Shenoy and Z.M. Ozsoyoglu, "A System for Semantic Query ptimization," ACM SIGMOD, pp. 181195, 1987.
[36] D. Srivastava, "'Subsumption and Indexing in Constraint Query Languages with Linear Arithmetic Constraints," Annals Math. and Artificial Intelligence, vol. 8, pp. 315343, 1993.
[37] J. Ullman, Principles of Database and KnowledgeBase Systems, vol. 1. Computer Science Press, 1988.
[38] J.D. Ullman, Principles of Database and KnowledgeBase Systems, vol. II: The New Tech nologies. New York: Computer Science Press, 1989.
[39] X. Zhang and Z.M. Ozsoyoglu, "On Efficient Reasoning with Implication Constraints," Proc. Third Int'l Conf. Deductive and ObjectOriented Databases, 1993.
[40] X. Zhang and Z.M. Ozsoyoglu, "Some Results on the Containment and Minimization of (In)equality Queries," Information Processing Letters, vol. 50, no. 5, 1994.