| L. Serafini, F. Giunchiglia, J. Mylopoulos, P.A. Bernstein. The local relational model: Model and proof theory. Technical Report 0112-23, ITC-IRST, 2001. |
No context found.
L. Serafini, F. Giunchiglia, J. Mylopoulos, P.A. Bernstein. The local relational model: Model and proof theory. Technical Report 0112-23, ITC-IRST, 2001.
....the P2P network topology. For each acquaintance link, domain relations define translation rules between data items, and coordination formulas define semantic dependencies between the two databases. The proposed data model allows for inconsistent databases and supports semantic interoperability [ 13]. The main objectives of this paper are to introduce the LRM through examples and to identify a set of open research questions on its design and implementation. Section 2 presents a motivating scenario. Section 3 1 Microsoft Corporation, One Microsoft Way, Redmond WA, 98052 6399. philbemicrosoft. ....
....if whenever P(d) is true in database i and d, d rq, then Q(d9 is true in databasej. Analogously the formula 3 i: x. q: P (x) is true if there is an element d in dom such that d, d rq and P(d9 is true in databasej. A complete formalization of truth for coordination formulas is described in [13]. Coordination formulas can be used in two different ways. First, they can be used to define consmints that must be satisfied by a relational space. For instance, the formula t 1: x. 1: p(x) v, 2: q(x) states that any object in database 1 either is in tablep or its corresponding object in ....
L. Serafini, F. Giunchiglia, J. Mylopoulos, P.A. Bernstein. The local relational model: Model and proof theory. Technical Report 0112-23, ITC-IRST, 2001.
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