D. Beneventano, S. Bergamaschi, S. Lodi, and C. Sartori. Consistency checking in complex object database schemata with integrity constraints. IEEE Transactions on Knowledge and Data Engineering, 10:576--598, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... to maintain data consistency [39] Boolean expression, A boolean expression over a global database schema [36] Integrity constraints are well typed boolean expressions built using the names and classes of the schema and general operators [6] Rule, which guarantees the integrity of a database [4] [9] 12] 80] When integrity constraint is represented in a data model, it is called as integrity model. Integrity models are interrelated with data models and transaction models, by offering concepts for representing constraints to mini world states and constraints to mini world processes [68] ....

D. Beneventano, S. Bergamaschi, S. Lodi, and C. Sartori, Consistency Checking in Complex Object Database Schemata with Integrity Constraints. IEEE Transactions on Knowledge and Data Engineering 10(4): 576-598, 1998

....multiple viewpoints using strategies based on unification. Other work[10, 6, 13] has focused on the problem of consistency checking for more general constraints, such as 1 th order constraints. Manandhar[12] discussed deterministic consistency checking for LP constraints. Beneventano and et al. [2] focused on the problem of providing a theoretical framework for consistency checking of integrity constraints in a complicated object database environment. We briefly describe Allen s Algorithm since it is basic to many algorithms used in consistency checking. 1.2.1 Allen s Propagation ....

Domenico Beneventano and etc. Consistency Checking in Complex Object Database Schemata with Integrity. IEEE Trans. on Knowledge and Data Eng., 10(4), July/August 1998.

....multiple viewpoints using strategies based on unification. Other work[10, 6, 13] has focused on the problem of consistency checking for more general constraints, such as 1 th order constraints. Manandhar[12] discussed deterministic consistency checking for LP constraints. Beneventano and et al. [2] focused on the problem of providing a theoretical framework for consistency checking of integrity constraints in a complicated object database environment. We briefly describe Allen s Algorithm since it is basic to many algorithms used in consistency checking. 1.2.1 Allen s Propagation ....

Domenico Beneventano and etc. Consistency Checking in Complex Object Database Schemata with Integrity. IEEE Trans. on Knowledge and Data Eng., 10(4), July/August 1998.

....multiple viewpoints using strategies based on unification. Some other work[15, 10, 17] focused on the problem of consistency checking for more general constraints, such as, 1 th order constraints. Manandhar[16] discussed deterministic consistency checking for LP constraints. Beneventano and etc. [4] focused on the problem of providing a theoretical framework for consistency checking of integrity constraints in a complex object database environment. The consistency checking algorithm is dependent on the set of spatial predicates. This paper, we deal with basic direction predicates for ....

Domenico Beneventano and etc. Consistency Checking in Complex Object Database Schemata with Integrity. IEEE Trans. on Knowledge and Data Eng., 10(4), July/August 1998.

No context found.

D. Beneventano, S. Bergamaschi, S. Lodi, and C. Sartori. Consistency checking in complex object database schemata with integrity constraints. IEEE Transactions on Knowledge and Data Engineering, 10:576--598, July/August 1998. 15

....schema. QM automatically generates the translation of the query into a corresponding set of sub queries for the sources. 3. SI Designer, is the framework with a graphical interface which supports the designer in the overall integration process. 4. ODB Tools Engine, is the OLCD Description Logics [1, 7] based tool performing schema validation and query optimization [3, 2, 19] 5. ARTEMIS Tool Environment, is an affinity based clustering tool performing ODL I 3 class analysis and clustering [9] 2.1 SI Designer architecture Sources integration is based on the individuation of an ontology ....

D. Beneventano, S. Bergamaschi, S. Lodi, and C. Sartori. Consistency checking in complex object database schemata with integrity constraints. IEEE Transactions on Knowledge and Data Engineering, 10:576--598, July/August 1998.

....computing a set of affinity coefficients, that take into account both ontological and structural knowledge about ODL I 3 classes. Furthermore, ARTEMIS classifies ODL I 3 classes by affinity levels using hierarchical clustering techniques; ODB Tools, a tool based on the OLCD Description Logics [9] inference techniques, such as incoherence detection and subsumption computation, which performs ODL I 3 schema validation and evaluates implicit inter schema isa relationships. The integration process is subdivided in two phases (1) Common Thesaurus generation, 2) Global Virtual Schema ....

D. Beneventano, S. Bergamaschi, S. Lodi, and C. Sartori. Consistency checking in complex object database schemata with integrity constraints. IEEE Transactions on Knowledge and Data Engineering, 10:576--598, July/August 1998. 4

....[5] A Common Thesaurus is constructed, which has the role of a shared ontology for the information sources. The Common Thesaurus is built by analyzing ODL I 3 descriptions of the sources, by exploiting the Description Logics OLCD (Object Language with Complements allowing Descriptive cycles) [2, 6], derived from KL ONE family [17] The knowledge in the Common Thesaurus is then exploited for the identification of semantically related information in ODL I 3 descriptions of different sources and for their integration at the global level. Mapping rules and integrity constraints are defined at ....

....represent explicit relationships (i.e. extracted supplied) dashed lines represent inferred relationships, and superscripts indicate their kind. 2 ODB Tools performs validation and inference steps by exploiting subsumption (i.e. generalization) and equivalence computation. As we showed in [2, 6], the computation of subsumption and equivalence in OLCD is decidable. Furthermore, even if from a purely theoretical point of view this computation is PSPACE hard (as proved in [6] these problems can be efficiently solved by transforming a schema in a canonical form. These results imply that ....

D. Beneventano, S. Bergamaschi, S. Lodi and C. Sartori, "Consistency Checking in Complex Object Database Schemata with Integrity Constraints ", IEEE TKDE, Vol. 10, 1998.

No context found.

D. Beneventano, S. Bergamaschi, S. Lodi, and C. Sartori. Consistency checking in complex object database schemata with integrity constraints. Technical Report 103, CIOC--CNR, Viale Risorgimento, 2 Bologna, Italia, September 1994.

....information extraction and integration which take into account both structured and semistructured data sources. An object oriented language, called ODL I 3 , derived from the standard ODMG, with the underlying Description Logic OLCD (Object Language with Complements allowing Descriptive cycles) Beneventano et al. 1998; Bergamaschi Nebel, 1994 ] derived from the KL ONE family [ Woods et Schmolze, 1989 ] is introduced. Information extraction has the goal of representing source schemas in ODL I 3 . In case of semistructured information sources, information extraction produces also object patterns, to be used ....

....descriptions in order to perform inference tasks typical of description logics that will be useful for semantic integration, as will be illustrated in the remaining part of the paper. In this section, we give an informal description of OLCD. Readers interested in a formal account can refer to [ Beneventano et al. 1998 ] OLCD is an extension of the object description language ODL (not to be confused with ODL ODMG) introduced in [ Bergamaschi Nebel, 1994 ] and holds usual type constructors of complex object data models. OLCD, as its ancestor ODL, provides a system of base types: string, boolean, integer, ....

[Article contains additional citation context not shown here]

D. Beneventano, S. Bergamaschi, S. Lodi and C. Sartori, "Consistency Checking in Complex Object Database Schemata with Integrity Constraints", in IEEE Transactions on Knowledge and Data Engineering, Vol. 10, pag. 576-598, 1998.

.... reasoning techniques on the data schema and their implications, leaving out the project s applications (Prelet and Object Wrapper software modules) 3 OLCD: A Formalism for Complex Objects including Integrity Constraints OLCD is an extension of the object description language ODL, introduced in [3, 9] and is in the tradition of complex object data models [10] OLCD, as its ancestor ODL, provides a system of base types: string, boolean, integer, real; the type constructors tuple, set and class allow the construction of complex value types and class types. Class types (also briefly called ....

D. Beneventano, S. Bergamaschi, S. Lodi, and C. Sartori. Consistency checking in complex object database schemata with integrity constraints. IEEE Transactions on Knowledge and Data Engineering, 10:576--598, July/August 1998.

No context found.

D. Beneventano, S. Bergamaschi, S. Lodi, and C. Sartori. Consistency checking in complex object database schemata with integrity constraints. IEEE Transactions on Knowledge and Data Engineering, 10:576--598, 1998.

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