Citations: Merging Databases under Constraints - Lin, Mendelzon (ResearchIndex)

32 citations found. Retrieving documents...

Lin J. and Mendelzon A. 1998. Merging databases under constraints. International Journal of Cooperative information Systems 7(1): 55-76.

Home/Search Document Details and Download Summary Related Articles Check

This paper is cited in the following contexts:

First 50 documents

Specifying and Querying Database Repairs using Logic.. - Arenas, Bertossi.. (2000) (10 citations) (Correct)

....consistent query answers, except in the proposi tional case. It has been widely recognized that in database integration the integrated data may be inconsistent with the integrity constraints. A typical (theoretical) solution is to augment the data model to represent disjunctive information. [2,5,10,24]. There are several important differences between the above approaches and ours. First, they rely on the construction of a single (disjunctive) instance and the deletion of conflicting tuples. Second, they usually handle severely restricted classes of integrity constraints and queries. Gertz [19] ....

J. Lin and A. O. Mendelzon. Merging Databases under Constraints. International Journal of Cooperative Information Systems, 7(1):55-76, 1996.

Scalar Aggregation in FD-Inconsistent Databases - Arenas, Bertossi, Chomicki (2001) (Correct)

....briefly survey the related work here. A more comprehensive discussion can be found in [2] The need to accommodate violations of functional dependencies is one of the main motivations for considering disjunctive databases [12,14] and has led to various proposals in the context of data integration [1, 3,8,13]. A purely proof theoretic notion of consistent query answer comes from Bry [6] None of the above approaches considers aggregation queries. Many further questions suggest themselves. First, is it possible to identify more tractable cases and to reduce the degree of the polynomial in those ....

J. Lin and A. O. Mendelzon. Merging Databases under Constraints. International Journal of Cooperative Information Systems, 7(1):55--76, 1996.

Repairing Inconsistent Databases: A.. - Arieli, Denecker, .. (2 citations) (Correct)

.... of amalgamated data is extensively studied in the literature (see, e.g. 8, 12, 22, 24, 25, 31 34, 38, 41] Common approaches for dealing with this task are based on techniques of belief revision [31] methods of resolving contradictions by quantitative considerations (such as majority vote [32]) or qualitative ones (e.g. de ning priorities on di erent sources of information or preferring certain data over another [4, 9] and approaches that are based on rewriting rules for representing the information in a speci c form [25] As in our case, abduction is used for database updating in ....

J.Lin, A.O.Mendelzon. Merging databases under constraints. J. Cooperative Information Systems 7(1), 55-76, 1998.

Logics for Emerging Applications of Databases - Chomicki, Saake, van der Meyden (2003) (Correct)

.... such a set standing for one of its elements) This approach is limited to primary key functional dependencies and was subsequently generalized to other key functional dependencies by Dung [37] In the same context, Baral et al. 13,53] proposed to use disjunctive Datalog, and Lin and Mendelzon [79] tables with OR objects [62,63] Agarwal et al. 2] introduced flexible relational algebra to query flexible relations, and Dung [37] introduced flexible relational calculus (a proper subset of the calculus can be translated to flexible relational algebra) The remaining papers did not discuss ....

....more flexibility wrt the class of all repairs. For example, considering an answer as consistent if it is true in the majority of the database repairs, or true in some preferred repairs, under some predefined notion of preference. Majority based approaches to consistency have been studied in [79] and [81] in the context of data integration. The whole issue of preferences for certain changes and repairs remains still to be investigated. Some work is this direction is presented in [56] 8.2 Data integration Assume we have a collection of (materialized) data sources S 1 , S n , and ....

J. Lin and A. O. Mendelzon. Merging Databases under Constraints. International Journal of Cooperative Information Systems, 7(1):55--76, 1996.

Specifying and Querying Database Repairs using Logic.. - Arenas, Bertossi.. (2000) (10 citations) (Correct)

....obtain consistent query answers, except in the propositional case. It has been widely recognized that in database integration the integrated data may be inconsistent with the integrity constraints. A typical (theoretical) solution is to augment the data model to represent disjunctive information. [2,5,10,24]. There are several important differences between the above approaches and ours. First, they rely on the construction of a single (disjunctive) instance and the deletion of conflicting tuples. Second, they usually handle severely restricted classes of integrity constraints and queries. Gertz [19] ....

J. Lin and A. O. Mendelzon. Merging Databases under Constraints. International Journal of Cooperative Information Systems, 7(1):55--76, 1996.

Coherent Composition of Distributed.. - Arieli, Van.. (2001) (Correct)

.... of amalgamated data is extensively studied in the literature (see, e.g. 1, 3, 7, 13, 14, 20 23, 26, 29] Common approaches for dealing with this task are based on techniques of belief revision [20] methods of resolving contradictions by quantitative considerations (such as majority vote [21]) or qualitative ones (e.g. de ning priorities on di erent sources of information or preferring certain data over another [2, 4, 5] Other approaches are based on rewriting rules for representing the information in a speci c form [14] or use multiple valued semantics (e.g. annotated logic ....

J.Lin, A.O.Mendelzon. Merging databases under constraints. Int. Journal of Cooperative Information Systems 7(1), 55-76, 1998.

Query Answering in Inconsistent Databases - Bertossi, Chomicki (Correct)

.... such a set standing for one of its elements) This approach is limited to primary key functional dependencies and was subsequently generalized to other key functional dependencies by Dung [29] In the same context, Baral et al. 12, 38] proposed to use disjunctive Datalog, and Lin and Mendelzon [61] tables with OR objects [47] Agarwal et al. 2] introduced flexible relational algebra to query flexible relations, and Dung [29] flexible relational calculus (whose subset can be translated to flexible relational algebra) The remaining papers did not discuss query language issues, relying on ....

....flexibility wrt the class of all repairs. For example, considering an answer as consistent if it is true in the majority of the database repairs, or true in some preferred repairs, under some predefined notion of preference. Majority based approaches to consistency have been studied in [63] and [61] in the context of data integration. The whole issue of preferences for certain changes and repairs remains still to be investigated. Some work is this direction is presented in [44] 8.2 Data integration Assume we have a collection of (materialized) data sources S 1 , S n , and a global, ....

Lin, J. and Mendelzon, A.O. Merging Databases Under Constraints. Int. J. Cooperative Information Systems, 1998, 7(1):55--76.

Scalar Aggregation in Inconsistent Databases - Arenas, Bertossi, Chomicki (Correct)

....brie y survey the related work here. A more comprehensive discussion can be found in [3] The need to accommodate violations of functional dependencies is one of the main motivations for considering disjunctive databases [22, 30] and has led to various proposals in the context of data integration [2, 6, 13, 25]. A purely proof theoretic notion of consistent query answer comes from Bry [7] This notion, described only in the propositional case, corresponds to our notion of core answer. None of the above approaches considers aggregation queries. There seems to be an intriguing connection between relation ....

J. Lin and A. O. Mendelzon. Merging Databases under Constraints. International Journal of Cooperative Information Systems, 7(1):55-76, 1996.

Scalar Aggregation in FD-Inconsistent Databases - Arenas, Bertossi, Chomicki (2001) (Correct)

....briefly survey the related work here. A more comprehensive discussion can be found in [2] The need to accommodate violations of functional dependencies is one of the main motivations for considering disjunctive databases [12, 14] and has led to various proposals in the context of data integration [1, 3, 8, 13]. A purely proof theoretic notion of consistent query answer comes from Bry [6] None of the above approaches considers aggregation queries. Many further questions suggest themselves. First, is it possible to identify more tractable cases and to reduce the degree of the polynomial in those ....

J. Lin and A. O. Mendelzon. Merging Databases under Constraints. International Journal of Cooperative Information Systems, 7(1):55--76, 1996.

On the Logic of Merging - Konieczny, Pino-Pérez (1998) (33 citations) (Correct)

....operators is missing. In this work the result of a merging is a subset of the set of all interpretations but a lot of systems have to conform to a set of integrity constraints, for that reason it is interesting to be able to merge some knowledge sets in the presence of these constraints [LMb]. And so one has to restrain the result of the merging to be a subset of the set of allowed interpretations. Suppose that these integrity constraints are denoted by the knowledge base IC. If we consider a weighted rational merging, a way to incorporate integrity constraints is to add IC to E with ....

J. Lin and A. O. Mendelzon. Merging databases under constraints. To appear in International Journal of Cooperative Information System.

Merging with Integrity Constraints - Konieczny, Pérez (1999) (14 citations) (Correct)

....to n knowledge bases, we could then de ne the merging of a knowledge set f 1 t : t n g as: 4 1 : n ( 1 t : t n ) 6. 3 Lin and Mendelzon majority merging operators Lin and Mendelzon have de ned a kind of merging operators that they call majority merging operators [LM, LM98, Lin95] The postulates given by Lin and Mendelzon for these operators are: LM1) N( is consistent (LM2) If V is consistent then N( V (LM3) If 0 , then N( N( 0 ) LM4) For a literal sentence l, if jf i 2 : i j= lgj jf i 2 : i j= lgj jf i 2 : i ....

J. Lin and A. O. Mendelzon. Merging databases under constraints. International Journal of Cooperative Information System, 7(1):55-76, 1998.

Combining Individually Inconsistent Prioritized Knowledge Bases - Guilin Qi Weiru (2004) (Correct)

No context found.

Lin J. and Mendelzon A. 1998. Merging databases under constraints. International Journal of Cooperative information Systems 7(1): 55-76.

Multiple Semi-Revision in Possibilistic Logic - Guilin Qi Weiru (Correct)

No context found.

Lin, J., Mendelzon, A.: Merging databases under constraints. International Journal of Cooperative information Systems vol. 7(1), pp. 55-76, 1998.

Combining Multiple Knowledge Bases by Negotiation: A.. - Qi, Liu, Bell (2005) (Correct)

No context found.

Lin, J. and Mendelzon, A.: Merging databases under constraints. International Journal of Cooperative information Systems, vol. 7(1), 55-76, 1998.

Complexity and Approximation of Fixing - Numerical Attributes In (Correct)