Querying Weak Instances Under Extension Chase Semantics: A Complete Solution

References

• Atzend , P. and Parker , D. S. Assumptions in relational database theory . Proc. First ACM Symp. on Principles of Database Systems . pp. 1 – 9 .
   Google Scholar
• Beeri , C. and Vardi , M. Y. 1984 . A proof procedure for data dependencies . J. ACM , 31 (4} ) : 718 – 741 .
   Web of Science ®Google Scholar
• Brosda , V and Vossen , G. 1988 . Update and retrieval in a relational database through a universal scheme interface . ACM-TODS , 13 (4} ) : 449 – 485 .
   Google Scholar
• Carlson , C. R. and Kaplan , R. S. A generalized access path model and its application to a relational database system . ACM SIGMOD Int. Conf. on Management of Data . pp. 143 – 156 .
   Google Scholar
• Chan , E. P. F. and Hernandez , H. J. 1991 . Independence-reducible database scheme . J. ACM , 38 (4} )
   Web of Science ®Google Scholar
• Cosmadakis , S. , Kanellakis , P. C. and Spyratos , N. 1985 . Partition semantics for relations . ACM-PODS (Also in J. Comput. Syst. Sci. , 33 (2} ) 1986
   Google Scholar
• Fagin , R. and Vardi , M. Y. 1986 . “ The theory of data dependencies-A survey. ” . In Mathematics of Information Processing , Edited by: Anshel , M. and Gewirtz , W. Vol. 34 , 19 – 72 . Symposia in Applied Mathematics .
   Google Scholar
• Hernandez , H. C. and Chan , E. P. F. 1991 . Constant-time-maintainable BCNF database schemes . ACM TODS , 16 (4} ) : 571 – 599 .
   Google Scholar
• Honeyman , P. 1980 . Extension joins. Proc. VLDB VI , : 239 – 244 .
   Google Scholar
• Honeyman , P. 1982 . Testing satisfaction of functional dependencies . J. ACM , 29 (3} )
   Web of Science ®Google Scholar
• Korth , H. F. , Kuper , G. M. , Feigenbaum , J. , Gelder , A. V and Ullman , J. D. 1984 . System/U: A database system based on the universal relation assumption . ACM TODS , 9 (3} ) : 331 – 347 .
   Google Scholar
• Laurent , D. , Phan Luong , V. and Spyratos , N. Deleted tuples are useful when updating through universal scheme interfaces . The Eighth IEEE Int. Conference on Data Engineering . Feb. 1992 , Phoenix , USA. pp. 420 – 427 .
   Google Scholar
• Laurent , D. , Phan Luong , V and Spyratos , N. 1997 . The use of deleted tuples in database querying and updating . Acta Informatica, 34, fasc. , 12 : 905 – 925 .
   Google Scholar
• Lécluse , C. and Spyratos , N. June 1986 . The semantics of queries and updates in relational databases , Technical Report INRIA No. 561 June , 1986
   Google Scholar
• Lécluse , C. and Spyratos , N. Implementing queries and updates on universal scheme interfaces . Proceedings of the 14th VLDB Conference, Los Angeles . 1988 , California . pp. 62 – 75 .
   Google Scholar
• Lozinskii , E. L. 1980 . Construction of relations in relational database . ACM TODS , 5 : 208 – 224 .
   Google Scholar
• Maier , D. Discarding the universal instance assumption . Proc. XP/1 Workshop . NY : Stony Brook .
   Google Scholar
• Maier , D. 1983 . The Theory of Relational Databases , Computer Science Press .
   Google Scholar
• Maier , D. , Mendelzon , A. O. and Sagiv , Y. 1979 . Testing implications of data dependencies . ACM TODS , 4 (4} ) : 455 – 469 .
   Google Scholar
• Maier , D. , Rozenshtein , E. and Stein , J. Representing roles in universal scheme interfaces . Proc. IEEE Int. Corf, on Data Engineering . pp. 133 – 142 .
   Google Scholar
• Maier , D. , Rozenshtein , E. and Warren , D. S. 1986 . Window functions. Advances in Computing Research , Vol. 3 , 213 – 246 . JAI Press Inc. .
   Google Scholar
• Maier , D. , Ullman , J. D. and Vardi , M. Y. 1984 . On the foundations of the universal relation model . ACM TODS , 9 (2} ) : 283 – 308 .
   Google Scholar
• Mendelzon , A. O. 1984 . Database states and their tableaux . ACM TODS , 9 (2} ) : 264 – 282 .
   Google Scholar
• Osbom , S. L. 1979 . Towards a universal relation interface . Proc. VLDB V , : 52 – 60 .
   Google Scholar
• Phan Luong , V. 1993 . Une Nouvelle Approche des Fonctions Fenètre et des Mises jour pour Interfaces de type Relation Universelle, (french} , Université de Paris-Sud (Orsay} . Thèse de Doctorat
   Google Scholar
• Rissanen , J. 1977 . Independent components of relations . Trans, on Database Systems , 2 (4} ) : 317 – 325 .
   Google Scholar
• Sagiv , Y. Can we use the universal instance assumption without using nulls? . Proc. ACM-SIGMOD Int. Conf. on Management of Data . Mich, April , Ann Arbor . pp. 108 – 120 .
   Google Scholar
• Sagiv , Y. 1983 . A characterization of globally consistent databases and their correct access paths . ACM-TODS , 8 (2} ) : 266 – 286 .
   Google Scholar
• Sagiv , Y. 1991 . Evaluation of queries in independent database schemes . Journal of ACM , 38 (1} ) : 120 – 161 .
   Web of Science ®Google Scholar
• Schenk , K. L. and Pinkert , J. R. An algorithm for servicing multi-relational queries . ACM SIGMOD Conf . pp. 10 – 20 .
   Google Scholar
• Sciore , E. Improving semantic specification in a relational database . Proc. ACM SIGMOD Conf . pp. 170 – 178 .
   Google Scholar
• Sciore , E. 1980 . The universal instance and database design , Vol. October , Princeton University . Doctoral dissertation
   Google Scholar
• Sciore , E. 1991 . An extended universal instance data model . Information Systems , 16 (1} ) : 21 – 34 .
   Web of Science ®Google Scholar
• Spyratos , N. 1987 . The partition model: A deductive database model . ACM TODS , 12 (1} ) : 1 – 37 .
   Google Scholar
• Ullman , J. D. 1989 . Principles of Databases and Knowledge Base Systems , Vol. 1 and 2 , Computer Science Press .
   Google Scholar
• Wang , K. and Graham , M. H. 1992 . Constant-time maintainability: A generalization of independence . ACM TODS , 17 (2} ) : 201 – 246 .
   Google Scholar