N. S. Ishakbeyoglu and Z. M. Ozsoyoglu. On the maintenance of implication integrity constraints. In Fourth International Conference on Database and Expert Systems Applications, pages 221--232, Prague, Sept. 1993. LNCS 720, Springer. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint-Generating Dependencies - Baudinet, Chomicki, Wolper (1995) (13 citations) (Correct)
....For instance, in [18] one finds a taxonomy of dependencies that are useful for temporal databases. Moreover, many integrity constraints over interpreted data can be represented as generalized dependencies. For instance, the integrity constraints over databases with ordered domains studied in [17, 33] can be represented as generalized dependencies. Also, some versions of the constraint checking problem studied in [16] can be viewed as generalized dependency implication problems. One might think that the study of dependency theory has been close to exhaustive. While this is largely so for ....
....constraint dependencies. We should note that the integrity constraints over temporal databases postulated there involve both typed and untyped constraint generating dependencies, as well as tuple generating ones. Two recent papers on implication constraints by Ishakbeyoglu, Ozsoyoglu and Zhang [17, 33], as well as a paper on efficient integrity checking by Gupta, Sagiv, Ullman, and Widom [16] contain work fairly close to ours. However, there are several important differences. Foremost, all three papers discuss a fixed language of constraint formulas, namely equality ( inequality (6= and ....
[Article contains additional citation context not shown here]
N. S. Ishakbeyoglu and Z. M. Ozsoyoglu. On the maintenance of implication integrity constraints. In Fourth International Conference on Database and Expert Systems Applications, pages 221--232, Prague, Sept. 1993. LNCS 720, Springer.
Constraint-Generating Dependencies - Baudinet, Chomicki, Wolper (1995) (13 citations) (Correct)
....been done on extending other parts of traditional database theory, for instance schema design and dependency theory. It should be clear that dependency theory is of interest in this context. For instance, in [JS92] one finds a taxonomy of dependencies that are useful for temporal databases. In [GH83, GH86, IO93, ZO93], one finds a study of integrity constraints over databases with ordered domains, which can be viewed as constraint generating dependencies. One might think that the study of dependency theory has been close to exhaustive. While this is largely so for dependencies over uninterpreted data (that is, ....
....us to think about constraint dependencies. We should note that the integrity constraints postulated there involve both typed and untyped constraint generating dependencies, as well as tuple generating ones. Also, two recent papers on implication constraints by Ishakbeyoglu, Ozsoyoglu and Zhang [IO93, ZO93] present work fairly close to ours. However, there are several important differences. Foremost, they consider a fixed language of constraint formulas, namely equality ( inequality (6= and order ( constraints, while our results are applicable to any decidable constraint theory thanks to ....
[Article contains additional citation context not shown here]
Naci S. Ishakbeyoglu and Z. Meral Ozsoyo glu. On the maintenance of implication integrity constraints. In Fourth Intl. Conf. on Database and Expert Systems Applications, pp. 221--232, Prague, Sept. 1993. LNCS 720, Springer-Verlag.
Constraint-Generating Dependencies - Baudinet, Chomicki, Wolper (1995) (13 citations) (Correct)
....For instance, in [18] one finds a taxonomy of dependencies that are useful for temporal databases. Moreover, many integrity constraints over interpreted data can be represented as generalized dependencies. For instance, the integrity constraints over databases with ordered domains studied in [17, 33] can be represented as generalized dependencies. Also, some versions of the constraint checking problem studied in [16] can be viewed as generalized dependency implication problems. One might think that the study of dependency theory has been close to exhaustive. While this is largely so for ....
....constraint dependencies. We should note that the integrity constraints over temporal databases postulated there involve both typed and untyped constraint generating dependencies, as well as tuple generating ones. Two recent papers on implication constraints by Ishakbeyoglu, Ozsoyoglu and Zhang [17, 33], as well as a paper on efficient integrity checking by Gupta, Sagiv, Ullman, and Widom [16] contain work fairly close to ours. However, there are several important differences. Foremost, all three papers discuss a fixed language of constraint formulas, namely equality ( inequality (6= and ....
[Article contains additional citation context not shown here]
N. S. Ishakbeyoglu and Z. M. Ozsoyoglu. On the maintenance of implication integrity constraints. In Fourth International Conference on Database and Expert Systems Applications, pages 221--232, Prague, Sept. 1993. LNCS 720, Springer.
Implication and Referential Constraints: A New Formal Reasoning - Zhang, Ozsoyoglu (1994) (10 citations) Self-citation (Ozsoyoglu) (Correct)
.... for example, the update problem ( 11] the redundancy problem in Datalog ( 22] the recursive query optimization problem ( 21] 14] 30] and the problem of providing intensional answers ( 31] 27] 12] The maintenance of non redundant and consistent constraint sets is also studied ([28]) Xubo Zhang is with Intel Corp, 2625 Walsh Avenue, MS SC4 103, Santa Clara, CA 95051. Email: Xubo Zhang ccm.sc.intel.com y Z. Meral Ozsoyoglu is with The Dept. of Computer Eng. and Sci. Case Western Reserve University, Cleveland, OH 44106. Email:ozsoy alpha.ces.cwru.edu In this paper, we ....
....fI ; I 1 ; In g is unsatisfiable. So the subsumption problem can be solved by testing the satisfiabilities of a number of conjunctions of (in)equalities. When there is no function symbol in the (in)equalities, the satisfiability of a conjunction of (in)equalities is polynomially solvable ([28], 20] An O(n 3 ) algorithm is given in [28] to decide the satisfiability, where n is the number of variables and constants appearing in the conjunction. In this subsection we discuss the satisfiability of a conjunction of (in)equalities having function symbols. Let C be a set (conjunction) of ....
[Article contains additional citation context not shown here]
N.S. Ishakbeyoglu and Z.M.Ozsoyoglu, "On The Maintenance of Implication Integrity Constraints", Proc. of DEXA'93, pp 221-232.
Testing Satisfiability Of A Conjunction Of Inequalities - Naci Ishakbeyoglu Self-citation (Ishakbeyoglu) (Correct)
No context found.
Ishakbeyoglu, N. S., and Z. M. Ozsoyoglu, (1993), On the Maintenance of Implication Integrity Constraints, 4th Int. Conf. on Database and Expert Systems Applications (DEXA), Prague, Czech Republic, pp. 221-232, (also in LNCS 720).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC