2004
DOI: 10.1016/j.ins.2003.06.015
|View full text |Cite
|
Sign up to set email alerts
|

Consistency problems in ER-schemas for database systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
10
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 22 publications
0
10
0
Order By: Relevance
“…Unifying class-based representation formalisms are available [11] but to address this situation UML needs a formal semantics which allows for reasoning tasks: Berardi et al [12] study the complexity of formal reasoning on general UML class diagrams, Artale et al [13] extend these results over fragments of extended entity relationship models, obtaining EXPTIME hardness results. Consistency problems are also studied in [14]. However, by restricting the allowed artefacts in UML class diagrams polynomial procedures for certain reasoning tasks, like consistency checking, become possible [4], [5], [15].…”
Section: Related Workmentioning
confidence: 99%
“…Unifying class-based representation formalisms are available [11] but to address this situation UML needs a formal semantics which allows for reasoning tasks: Berardi et al [12] study the complexity of formal reasoning on general UML class diagrams, Artale et al [13] extend these results over fragments of extended entity relationship models, obtaining EXPTIME hardness results. Consistency problems are also studied in [14]. However, by restricting the allowed artefacts in UML class diagrams polynomial procedures for certain reasoning tasks, like consistency checking, become possible [4], [5], [15].…”
Section: Related Workmentioning
confidence: 99%
“…All the features will be considered when constructing a schema database for a system. Boufares and Bennaceur (Boufares and Bennaceur, 2003) have written on their paper about consistency problems in cardinality constraints. They have discuss on the problems occurred and wrote a suggestion method to solve it.…”
Section: Related Workmentioning
confidence: 99%
“…In the previous works, we found that many researchers work on data integrity or quality in UML diagram especially in designing system (Hadj Ali, Boufares, and Abdellatif, 2006;Alsaadi, 2006;Ha and Kang, 2008;Zhu, Shanker, and Cai, 2007;Boufares and Bennaceur, 2003). A few of them discussed the idea of extracting manually schema table from class diagram using OCL (Hadj Ali, Boufares, and Abdellatif, 2006;He, Ying, and Zhang, 2002).…”
Section: Related Workmentioning
confidence: 99%
“…We summarize below these concepts using UML notation: Let I be an instance (a database) of a given conceptual schema SC. We say I satisfies the multiplicity constraint K -denoted u..vof an association R over the class E with the role L, if for every object e of E , the number r of R objects connected to e verifies : u ≤ r ≤ v [2,3,7,8].…”
Section: Multiplicity Constraints Satisfactionmentioning
confidence: 99%
“…Theorem: a conceptual schema SC is valid, with respect to its constraints iff the associated linear constraint system ∑ has a solution [3,8].…”
Section: Multiplicity Constraints Satisfactionmentioning
confidence: 99%