The Experts below are selected from a list of 180 Experts worldwide ranked by ideXlab platform
Trevor H. Jones - One of the best experts on this subject based on the ideXlab platform.
-
Binary equivalents of Ternary Relationships in entity-Relationship modeling: a logical decomposition approach
Journal of Database Management, 2000Co-Authors: Trevor H. Jones, Il-yeol SongAbstract:Little work has been completed which addresses the logical composition and use of Ternary Relationships in entity -Relationship modeling. Many modeling notations and most CASE tools do not allow for Ternary Relationships. Alternative methods and substitutes for Ternary Relationship structures do not necessarily reflect the original logic, semantics or constraints of a given situation. Furthermore, it has been shown that Ternary Relationships can be constrained by additional implicit binary constraints which do not occur in the logic of binary Relationships. This paper develops an analytical perspective of Ternary Relationships. We investigate the logical Relationships implicit to the Ternary structure and then identify potential simplification through decomposition into binary equivalents. These alternative binary equivalents allow retention of the implicit logical structure, and consequently also retain the semantics of the original structure. The analysis investigates equivalency of lossless decompositions, preservation of functional dependencies and finally the ability to preserve update constraints (insertions and deletions). We identify which Ternary Relationships have true, fully equivalent, b inary equivalents and those which do not. We provide an exhaustive analysis of cardinality combinations found in Ternary Relationships which practitioners can use to guide the way in which they deal with Ternary Relationships in conceptual modeling.
-
analysis of binary Ternary cardinality combinations in entity Relationship modeling
Data and Knowledge Engineering, 1996Co-Authors: Trevor H. Jones, Il-yeol SongAbstract:In this paper, we discuss the simultaneous existence, and Relationships, between binary and Ternary Relationships in entity-Relationship (ER) modeling. We define the various interpretations that can be applied to the simultaneous existence of Ternary and binary Relationships having the same participating entities. We have identified that only certain cardinalities are permitted to exist simultaneously in such ER structures. We demonstrate which binary Relationship cardinalities are permitted within Ternary Relationships, during ER modeling. We develop an Imp licit Binary Cardinality (IBC) rule, which states that, in any Ternary Relationship, the cardinality of any binary Relationship embedded in the Ternary, is many-to-many when there are no explicit constraints on the data instances. We then present an Explicit Binary Permission (EBP) rule, which explains and enumerates all permitted binary Relationships for various cardinalities of Ternary Relationships. Finally we present an Implicit Binary Override (IBO) rule, which states that the implicit binary cardinalities can be constrained in a Ternary Relationship by an explicitly imposed binary Relationship. We then use these rules to consider the further implicit dynamics of Ternary Relationships when multiple binary Relationships are imposed. In discussing these findings, we consider the rules in the context of supporting functional dependency analysis. The relevance of the findings is presented in the context of ensuring that all functional dependencies associated with Ternary Relationships are correctly applied and identifying the potential for decomposing the Ternary Relationship into multiple binary Relationships based on all explicit functional dependencies.
-
Ternary Relationship decomposition and higher normal form structures derived from entity Relationship conceptual modeling
Conference on Scientific Computing, 1996Co-Authors: Trevor H. Jones, Il-yeol Song, E K ParkAbstract:Our paper looks at the potential decomposition of Ternary Relationships in ER modeling. We suggest that the decomposition of Ternary Relationships is not provided for by traditional normalization theory which does not consider the specific and implicit semantics of these structures. We provide an analysis which identifies the lossless, functional dependency preserving equivalency between Ternary Relationships and subsequent binary decompositions. This demonstration of equivalency is based on notation, constructs and semantic requirements which are available at the entity Relationship modeling level. We provide a template showing all allowable combinations of Ternary/binary cardinalities, and which of those can be losslessly decomposed while preserving functional dependencies. Because of the nature of Ternary Relationships and the implicit involvement of composite keys, comparisons are often made to the higher normal forms. We discuss the obvious similarities between the decomposition of Ternary Relationships presented in this paper and the traditional theory behind 4NF and 5NF decompositions. We show that from an entity Relationship modeling perspective, it is impractical and inappropriate to consider Ternary Relationship decomposition under the umbrella of higher normal form decomposition. We suggest that although the theory of the higher normal forms is sound, it has limited practical application when considering Ternary Relationships. We also discuss the relevancy of this work with regard to their representation in CASE tools, and the inability of binary modeling to logically represent certain Ternary Relationship cardinalities.
-
Analysis of binary/Ternary cardinality combinations in entity-Relationship modeling
Data & Knowledge Engineering, 1996Co-Authors: Trevor H. Jones, Il-yeol SongAbstract:In this paper, we discuss the simultaneous existence, and Relationships, between binary and Ternary Relationships in entity-Relationship (ER) modeling. We define the various interpretations that can be applied to the simultaneous existence of Ternary and binary Relationships having the same participating entities. We have identified that only certain cardinalities are permitted to exist simultaneously in such ER structures. We demonstrate which binary Relationship cardinalities are permitted within Ternary Relationships, during ER modeling. We develop an Imp licit Binary Cardinality (IBC) rule, which states that, in any Ternary Relationship, the cardinality of any binary Relationship embedded in the Ternary, is many-to-many when there are no explicit constraints on the data instances. We then present an Explicit Binary Permission (EBP) rule, which explains and enumerates all permitted binary Relationships for various cardinalities of Ternary Relationships. Finally we present an Implicit Binary Override (IBO) rule, which states that the implicit binary cardinalities can be constrained in a Ternary Relationship by an explicitly imposed binary Relationship. We then use these rules to consider the further implicit dynamics of Ternary Relationships when multiple binary Relationships are imposed. In discussing these findings, we consider the rules in the context of supporting functional dependency analysis. The relevance of the findings is presented in the context of ensuring that all functional dependencies associated with Ternary Relationships are correctly applied and identifying the potential for decomposing the Ternary Relationship into multiple binary Relationships based on all explicit functional dependencies.
-
ACM Conference on Computer Science - Ternary Relationship decomposition and higher normal form structures derived from entity Relationship conceptual modeling
Proceedings of the 1996 ACM 24th annual conference on Computer science - CSC '96, 1996Co-Authors: Trevor H. Jones, Il-yeol Song, E K ParkAbstract:Our paper looks at the potential decomposition of Ternary Relationships in ER modeling. We suggest that the decomposition of Ternary Relationships is not provided for by traditional normalization theory which does not consider the specific and implicit semantics of these structures. We provide an analysis which identifies the lossless, functional dependency preserving equivalency between Ternary Relationships and subsequent binary decompositions. This demonstration of equivalency is based on notation, constructs and semantic requirements which are available at the entity Relationship modeling level. We provide a template showing all allowable combinations of Ternary/binary cardinalities, and which of those can be losslessly decomposed while preserving functional dependencies. Because of the nature of Ternary Relationships and the implicit involvement of composite keys, comparisons are often made to the higher normal forms. We discuss the obvious similarities between the decomposition of Ternary Relationships presented in this paper and the traditional theory behind 4NF and 5NF decompositions. We show that from an entity Relationship modeling perspective, it is impractical and inappropriate to consider Ternary Relationship decomposition under the umbrella of higher normal form decomposition. We suggest that although the theory of the higher normal forms is sound, it has limited practical application when considering Ternary Relationships. We also discuss the relevancy of this work with regard to their representation in CASE tools, and the inability of binary modeling to logically represent certain Ternary Relationship cardinalities.
Il-yeol Song - One of the best experts on this subject based on the ideXlab platform.
-
An analysis of structural validity in entity-Relationship modeling
Data & Knowledge Engineering, 2003Co-Authors: James Dullea, Il-yeol Song, Ioanna LamprouAbstract:We explore the criteria that contribute to the structural validity of modeling structures within the entity-Relationship (ER) diagram. Our approach examines cardinality constraints in conjunction with the degree of the Relationship to address constraint consistency, state compliance, and role uniqueness issues to derive a complete and comprehensive set of decision rules. Unlike typical other analyses that use only maximum cardinality constraints, we have used both maximum and minimum cardinality constraints in defining the properties and their structural validity criteria yielding a complete analysis of the structural validity of recursive, binary, and Ternary Relationship types. Our study evaluates these Relationships as part of the overall diagram and our rules address these Relationships as they coexist in a path structure within the model. The contribution of this paper is to provide a comprehensive set of decision rules to determine the structural validity of any ERD containing recursive, binary, and Ternary Relationships. These decision rules can be readily applied to real world data models regardless of their complexity. The rules can easily be incorporated into the database modeling and designing process, or extended into case tool implementations.
-
Binary equivalents of Ternary Relationships in entity-Relationship modeling: a logical decomposition approach
Journal of Database Management, 2000Co-Authors: Trevor H. Jones, Il-yeol SongAbstract:Little work has been completed which addresses the logical composition and use of Ternary Relationships in entity -Relationship modeling. Many modeling notations and most CASE tools do not allow for Ternary Relationships. Alternative methods and substitutes for Ternary Relationship structures do not necessarily reflect the original logic, semantics or constraints of a given situation. Furthermore, it has been shown that Ternary Relationships can be constrained by additional implicit binary constraints which do not occur in the logic of binary Relationships. This paper develops an analytical perspective of Ternary Relationships. We investigate the logical Relationships implicit to the Ternary structure and then identify potential simplification through decomposition into binary equivalents. These alternative binary equivalents allow retention of the implicit logical structure, and consequently also retain the semantics of the original structure. The analysis investigates equivalency of lossless decompositions, preservation of functional dependencies and finally the ability to preserve update constraints (insertions and deletions). We identify which Ternary Relationships have true, fully equivalent, b inary equivalents and those which do not. We provide an exhaustive analysis of cardinality combinations found in Ternary Relationships which practitioners can use to guide the way in which they deal with Ternary Relationships in conceptual modeling.
-
An analysis of redundant Relationships in data and object modeling
1998Co-Authors: Il-yeol Song, James DulleaAbstract:This research presents a complete analysis of structural validity and redundant Relationships in the entity-Relationship (ER) model. Direct treatment of structural validity and redundant Relationships is rare in the literature. In practice there is no complete set of heuristics to holistically evaluate the structural validity or conclusively identify a redundant Relationship in ER diagrams. Some validity rules are partly discussed in publications, but they do not exhaustively cover all the combinations of maximum and minimum cardinality and address only the most commonly used structures. Current approaches for identifying redundant Relationships depend on the use of functional dependencies and do not consider minimum cardinality constraints. This omission disallows the inference of true transitive connectivity even with the presence of a related connection constraint. Existing approaches can only conclude that the Relationship is "suspiciously redundant." In practice, this leaves the decision of removing a "suspiciously redundant" Relationship to the subjective judgement of the designer. Our approach differs from previous works in that it: (1) Addresses both maximum and minimum cardinality constraints. (2) Considers the impact of Ternary Relationships on redundancy. (3) Presents a holistic analysis of unary, binary, and Ternary Relationships as they coexist in a complex overall diagram. (4) Treats structural validity and redundancy together. The study provides a thorough pattern analysis of redundant Relationships and shows they are sufficiently determined by the cardinality constraints coupled with a semantic connection constraint. The analysis yields a comprehensive set of thirty decision rules to determine the structural validity and the redundancy of any unary, binary, and Ternary Relationship in a complex multi-path environment. These rules can easily be incorporated into the modeling process or extended into case tools implementations. This study extends previous works on Ternary Relationship validity to the areas of minimum cardinality constraints and the structural validity of a complete diagram where a Ternary Relationship coexists. This study lays a foundation in the analysis of structural validity and Relationship redundancy in object modeling. We have shown that the analysis rules identified for data modeling are readily adaptable for the analysis of redundancy in object modeling with association, aggregation, and inheritance constructs.
-
analysis of binary Ternary cardinality combinations in entity Relationship modeling
Data and Knowledge Engineering, 1996Co-Authors: Trevor H. Jones, Il-yeol SongAbstract:In this paper, we discuss the simultaneous existence, and Relationships, between binary and Ternary Relationships in entity-Relationship (ER) modeling. We define the various interpretations that can be applied to the simultaneous existence of Ternary and binary Relationships having the same participating entities. We have identified that only certain cardinalities are permitted to exist simultaneously in such ER structures. We demonstrate which binary Relationship cardinalities are permitted within Ternary Relationships, during ER modeling. We develop an Imp licit Binary Cardinality (IBC) rule, which states that, in any Ternary Relationship, the cardinality of any binary Relationship embedded in the Ternary, is many-to-many when there are no explicit constraints on the data instances. We then present an Explicit Binary Permission (EBP) rule, which explains and enumerates all permitted binary Relationships for various cardinalities of Ternary Relationships. Finally we present an Implicit Binary Override (IBO) rule, which states that the implicit binary cardinalities can be constrained in a Ternary Relationship by an explicitly imposed binary Relationship. We then use these rules to consider the further implicit dynamics of Ternary Relationships when multiple binary Relationships are imposed. In discussing these findings, we consider the rules in the context of supporting functional dependency analysis. The relevance of the findings is presented in the context of ensuring that all functional dependencies associated with Ternary Relationships are correctly applied and identifying the potential for decomposing the Ternary Relationship into multiple binary Relationships based on all explicit functional dependencies.
-
Ternary Relationship decomposition and higher normal form structures derived from entity Relationship conceptual modeling
Conference on Scientific Computing, 1996Co-Authors: Trevor H. Jones, Il-yeol Song, E K ParkAbstract:Our paper looks at the potential decomposition of Ternary Relationships in ER modeling. We suggest that the decomposition of Ternary Relationships is not provided for by traditional normalization theory which does not consider the specific and implicit semantics of these structures. We provide an analysis which identifies the lossless, functional dependency preserving equivalency between Ternary Relationships and subsequent binary decompositions. This demonstration of equivalency is based on notation, constructs and semantic requirements which are available at the entity Relationship modeling level. We provide a template showing all allowable combinations of Ternary/binary cardinalities, and which of those can be losslessly decomposed while preserving functional dependencies. Because of the nature of Ternary Relationships and the implicit involvement of composite keys, comparisons are often made to the higher normal forms. We discuss the obvious similarities between the decomposition of Ternary Relationships presented in this paper and the traditional theory behind 4NF and 5NF decompositions. We show that from an entity Relationship modeling perspective, it is impractical and inappropriate to consider Ternary Relationship decomposition under the umbrella of higher normal form decomposition. We suggest that although the theory of the higher normal forms is sound, it has limited practical application when considering Ternary Relationships. We also discuss the relevancy of this work with regard to their representation in CASE tools, and the inability of binary modeling to logically represent certain Ternary Relationship cardinalities.
Guanglin Huang - One of the best experts on this subject based on the ideXlab platform.
-
SSPR/SPR - Sketch Recognition Based on Topological Spatial Relationship
Lecture Notes in Computer Science, 2004Co-Authors: Binbin Peng, Liu Wenyin, Guanglin HuangAbstract:In recognition of composite graphic objects, topological spatial Relationships of their components play an important role. Although most researchers focus on binary topological Relationships, they cannot carry all information of the internal structure of the compound objects. Therefore, we introduce the Ternary Relationship, which is a complement to the binary Relationship, to describe composite graphic objects. Moreover, we provide a constrained partial permutation algorithm based on both the binary and Ternary topological spatial Relationships to recognize the sketchy objects input by users in an online manner. Experimental results show that this approach is both efficient and effective for online composite graphics recognition in our sketch-based graphics input system–SmartSketchpad.
-
SSPR/SPR - Sketch Recognition Based on Topological Spatial Relationship
Lecture Notes in Computer Science, 2004Co-Authors: Binbin Peng, Liu Wenyin, Guanglin HuangAbstract:In recognition of composite graphic objects, topological spatial Relationships of their components play an important role. Although most researchers focus on binary topological Relationships, they cannot carry all information of the internal structure of the compound objects. Therefore, we introduce the Ternary Relationship, which is a complement to the binary Relationship, to describe composite graphic objects. Moreover, we provide a constrained partial permutation algorithm based on both the binary and Ternary topological spatial Relationships to recognize the sketchy objects input by users in an online manner. Experimental results show that this approach is both efficient and effective for online composite graphics recognition in our sketch-based graphics input system–SmartSketchpad.
Binbin Peng - One of the best experts on this subject based on the ideXlab platform.
-
SSPR/SPR - Sketch Recognition Based on Topological Spatial Relationship
Lecture Notes in Computer Science, 2004Co-Authors: Binbin Peng, Liu Wenyin, Guanglin HuangAbstract:In recognition of composite graphic objects, topological spatial Relationships of their components play an important role. Although most researchers focus on binary topological Relationships, they cannot carry all information of the internal structure of the compound objects. Therefore, we introduce the Ternary Relationship, which is a complement to the binary Relationship, to describe composite graphic objects. Moreover, we provide a constrained partial permutation algorithm based on both the binary and Ternary topological spatial Relationships to recognize the sketchy objects input by users in an online manner. Experimental results show that this approach is both efficient and effective for online composite graphics recognition in our sketch-based graphics input system–SmartSketchpad.
-
SSPR/SPR - Sketch Recognition Based on Topological Spatial Relationship
Lecture Notes in Computer Science, 2004Co-Authors: Binbin Peng, Liu Wenyin, Guanglin HuangAbstract:In recognition of composite graphic objects, topological spatial Relationships of their components play an important role. Although most researchers focus on binary topological Relationships, they cannot carry all information of the internal structure of the compound objects. Therefore, we introduce the Ternary Relationship, which is a complement to the binary Relationship, to describe composite graphic objects. Moreover, we provide a constrained partial permutation algorithm based on both the binary and Ternary topological spatial Relationships to recognize the sketchy objects input by users in an online manner. Experimental results show that this approach is both efficient and effective for online composite graphics recognition in our sketch-based graphics input system–SmartSketchpad.
Liu Wenyin - One of the best experts on this subject based on the ideXlab platform.
-
SSPR/SPR - Sketch Recognition Based on Topological Spatial Relationship
Lecture Notes in Computer Science, 2004Co-Authors: Binbin Peng, Liu Wenyin, Guanglin HuangAbstract:In recognition of composite graphic objects, topological spatial Relationships of their components play an important role. Although most researchers focus on binary topological Relationships, they cannot carry all information of the internal structure of the compound objects. Therefore, we introduce the Ternary Relationship, which is a complement to the binary Relationship, to describe composite graphic objects. Moreover, we provide a constrained partial permutation algorithm based on both the binary and Ternary topological spatial Relationships to recognize the sketchy objects input by users in an online manner. Experimental results show that this approach is both efficient and effective for online composite graphics recognition in our sketch-based graphics input system–SmartSketchpad.
-
SSPR/SPR - Sketch Recognition Based on Topological Spatial Relationship
Lecture Notes in Computer Science, 2004Co-Authors: Binbin Peng, Liu Wenyin, Guanglin HuangAbstract:In recognition of composite graphic objects, topological spatial Relationships of their components play an important role. Although most researchers focus on binary topological Relationships, they cannot carry all information of the internal structure of the compound objects. Therefore, we introduce the Ternary Relationship, which is a complement to the binary Relationship, to describe composite graphic objects. Moreover, we provide a constrained partial permutation algorithm based on both the binary and Ternary topological spatial Relationships to recognize the sketchy objects input by users in an online manner. Experimental results show that this approach is both efficient and effective for online composite graphics recognition in our sketch-based graphics input system–SmartSketchpad.