The Experts below are selected from a list of 300 Experts worldwide ranked by ideXlab platform
Peretz Shoval - One of the best experts on this subject based on the ideXlab platform.
-
Conceptual design of object-oriented database schemas using the Binary-Relationship model
Data & Knowledge Engineering, 1995Co-Authors: Yoram Kornatzky, Peretz ShovalAbstract:Abstract We describe an algorithmic method for transforming a Binary-Relationship (BR) conceptual schema to an object-oriented (OO) database schema. The BR schema is a semantically rich diagram that represents the reality being modeled in terms of objects, Relationships and constraints. It is easy to understand and serves as a communication tool between users and designers. Therefore it can be created in the early stages of system development, and later on be transformed into a specific OO database schema. The transformation method employs a multi-stage algorithm, which first identifies the essential objects in the BR schema, together with their Relationships and constraints. These are then mapped to object classes, attributes, and constraints, maintaining the semantics and all types of constraints present in the conceptual schema.
-
database reverse engineering from the relational to the Binary Relationship model
Data and Knowledge Engineering, 1993Co-Authors: Peretz Shoval, Nili ShreiberAbstract:Abstract This paper describes an algorithmic method for transforming a relational database schema to a Binary-Relationship one. The source schema may consist of relations that are at any level of normalization, and the designer may add semantic information on the source schema, such as the definition of candidate keys, foreign keys, functional dependencies of various types, multi-valued dependencies, many-to-many constraints, inclusion dependencies, and others. Based on this information, the multi-stage transformation algorithm applies mapping rules to generate object-types, Binary-Relationships and constraints in the target conceptual schema. The method is implemented as a PC-based tool, utilizing Ingres, SQL and C, and is part of a comprehensive database design tool for both forward and reverse engineering.
-
on non constrained constrained and mandatory many to many Relationship types
Journal of Database Management, 1993Co-Authors: Peretz ShovalAbstract:The purpose of a data model is to express the semantics of the real world that it models. One common situation that should be modeled is that of many-to-many Relationships between objects (entities). In this paper we distinguish between three different types of m:n Relationships: non-constrained, constrained and mandatory. Their meaning and consequences are discussed along with examples from entityRelationship (ER), Binary-Relationship (BR) and relational models. These refined m:n Relationship types bring to light additional semantics, thereby facilitate analysis and representation of the data structure.
-
Binary-Relationship integration methodology
Data & Knowledge Engineering, 1991Co-Authors: Peretz Shoval, Sara ZohnAbstract:Abstract BRIM is a view integration methodology which utilizes the Binary-Relationship data model and encompasses all stages of conceptual schema integration. In the pre-integration stage it assists the designer to prepare a Binary-strategy integration plan. Then, in the stage of conflict resolution, it identifies and resolves all possible types of conflict between schemas, including naming conflicts (i.e. homonyms and synonyms) and structural conflicts (i.e. conflicts regarding differences between types, dependencies, keys, constraints, and hierarchies of objects). Once conflicts are resolved and the source schemas are in conformity, they are merged by superimposition, and inter-schema Relationships are added to the integrated schema. The process is repeated for every two source schemas or intermediate results, until the target global schema is obtained. BRIM is supported by an interactive software tool which is part of a PC-based system for automated database design. The tool leads the designer through all stages of the integration process, applying conflict resolution rules and schema merging algorithms, providing an integrated conceptual schema which can then be automatically tranformed into a normalized database schema.
-
A methodology for integration of Binary-Relationship conceptual schemas
Proceedings. PARBASE-90: International Conference on Databases Parallel Architectures and Their Applications, 1Co-Authors: Peretz ShovalAbstract:A description is given of BRIM, a view integration methodology which utilizes the Binary-Relationship data model to create a global conceptual schema. In the preintegration stage it assists the designer in preparing an integration plan. Then, in the conflict resolution stage it identifies and resolves all possible types of conflicts between schemas, including naming conflicts (i.e. homonyms and synonyms) and structural conflicts (i.e. type, dependency, key, constraint, and hierarchy conflicts). Once conflicts are resolved and the source schemas are confirmed, the conflict-free schemas are merged, and interschema Relationships are added to the integrated schema. BRIM is being implemented as part of ADDS, a system for automated database design. The tool leads the designer through all the stages of the integration process, providing an integrated conceptual schema which can then be automatically transformed into a normalized database schema. >
Jian Tang - One of the best experts on this subject based on the ideXlab platform.
-
Spectrum Auctions Under Physical Interference Model
IEEE Transactions on Cognitive Communications and Networking, 2017Co-Authors: Yuhui Zhang, Dejun Yang, Jian Lin, Guoliang Xue, Jian Tang, Lei XieAbstract:Spectrum auctions provide a platform for licensed spectrum users to share their underutilized spectrum with unlicensed users. Existing spectrum auctions either adopt the protocol interference model to characterize interference Relationship as Binary Relationship or only lease channels that are not used by the primary user (PU) to secondary users (SUs). In this paper, we design spectrum auctions under the physical interference model, which allow PU and SUs to transmit simultaneously. Specifically, we consider both single-minded and multi-minded cases, and design auctions SPA-S and SPA-M, respectively. We prove that both auctions are truthful, individually rational, and computationally efficient. Extensive simulation results demonstrate that, these designed auctions achieve higher spectrum utilization, buyer satisfaction ratio, and revenue than a representative existing spectrum auction adapted for the physical interference model.
-
GLOBECOM - A Spectrum Auction under Physical Interference Model
2016 IEEE Global Communications Conference (GLOBECOM), 2016Co-Authors: Yuhui Zhang, Dejun Yang, Guoliang Xue, Jian TangAbstract:Spectrum auctions provide a platform for licensed spectrum users to share their underutilized spectrum with unlicensed users. Existing spectrum auctions either use the protocol interference model to characterize interference Relationship as Binary Relationship, or do not allow the primary and secondary users to share channels simultaneously. To fill this void, we design SPA, a spectrum single-sided auction under the physical interference model, which considers the interference to be accumulative. We prove that SPA is truthful, individually rational, and computationally efficient. Results from extensive simulation studies demonstrate that, SPA achieves higher spectrum utilization and buyer satisfaction ratio, compared with an existing auction adapted for the physical interference model.
Il-yeol Song - One of the best experts on this subject based on the ideXlab platform.
-
An Analysis of the Structural Validity of Unary and Binary Relationships in Entity Relationship Modeling
1999Co-Authors: James Dullea, Il-yeol SongAbstract:We explore the criteria that contribute to the 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 and role uniqueness issues. Here we use both maximum and minimum cardinality constraints yielding a complete analysis of the structural validity of unary and Binary 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. Our analysis yields a comprehensive set of decision rules based on path connectivity to determine the structural validity of any ER diagram containing unary and Binary Relationships. These rules can be readily applied to real world models regardless of the complexity. They can easily be incorporated into the database modeling and design process or extended into case tool implementations.
-
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.
-
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.
-
ER - Analysis of Binary Relationships within Ternary Relationships in ER Modeling
Entity-Relationship Approach — ER '93, 1Co-Authors: Il-yeol Song, Trevor H. JonesAbstract:In this paper, we discuss which Binary Relationship cardinalities are permitted within ternary Relationships, during ER modeling. We develop an implicit 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 explicit constraints imposed by a Binary Relationship. We also detail how the cardinalities within the ternary are altered as a single Binary, and then multiple Binary Relationships are imposed.
Yuhui Zhang - One of the best experts on this subject based on the ideXlab platform.
-
Spectrum Auctions Under Physical Interference Model
IEEE Transactions on Cognitive Communications and Networking, 2017Co-Authors: Yuhui Zhang, Dejun Yang, Jian Lin, Guoliang Xue, Jian Tang, Lei XieAbstract:Spectrum auctions provide a platform for licensed spectrum users to share their underutilized spectrum with unlicensed users. Existing spectrum auctions either adopt the protocol interference model to characterize interference Relationship as Binary Relationship or only lease channels that are not used by the primary user (PU) to secondary users (SUs). In this paper, we design spectrum auctions under the physical interference model, which allow PU and SUs to transmit simultaneously. Specifically, we consider both single-minded and multi-minded cases, and design auctions SPA-S and SPA-M, respectively. We prove that both auctions are truthful, individually rational, and computationally efficient. Extensive simulation results demonstrate that, these designed auctions achieve higher spectrum utilization, buyer satisfaction ratio, and revenue than a representative existing spectrum auction adapted for the physical interference model.
-
GLOBECOM - A Spectrum Auction under Physical Interference Model
2016 IEEE Global Communications Conference (GLOBECOM), 2016Co-Authors: Yuhui Zhang, Dejun Yang, Guoliang Xue, Jian TangAbstract:Spectrum auctions provide a platform for licensed spectrum users to share their underutilized spectrum with unlicensed users. Existing spectrum auctions either use the protocol interference model to characterize interference Relationship as Binary Relationship, or do not allow the primary and secondary users to share channels simultaneously. To fill this void, we design SPA, a spectrum single-sided auction under the physical interference model, which considers the interference to be accumulative. We prove that SPA is truthful, individually rational, and computationally efficient. Results from extensive simulation studies demonstrate that, SPA achieves higher spectrum utilization and buyer satisfaction ratio, compared with an existing auction adapted for the physical interference model.
O.m.f. De Troyer - One of the best experts on this subject based on the ideXlab platform.
-
ICDE - ON modularity for conceptual data models and the consequences for subtyping, inheritance and overriding
Proceedings of IEEE 9th International Conference on Data Engineering, 1993Co-Authors: O.m.f. De Troyer, R. JanssenAbstract:The Binary Relationship model is used to explain the principles of schema object types (SOTs). A SOT is a modularization concept for conventional conceptual data models, based on decomposition and abstraction from context. A SOT is at one level a single object type, but at a lower level it is described by a conceptual schema itself. The issue of subtyping, inheritance, and overriding for SOTs are discussed. The relevance of SOTs for object-oriented models is indicated. >
-
CAiSE - The OO-Binary Relationship model: a truly object oriented conceptual model
Advanced Information Systems Engineering, 1991Co-Authors: O.m.f. De TroyerAbstract:Conventional conceptual models like the Binary Relationship Model (also known as NIAM) or the Entity-Relationship Model do not fit well with the promising object oriented database systems. In this paper we show that is possible to turn such a conventional conceptual model (in particular the Binary Relationship Model) into a truly object oriented conceptual model which combines the assets of the conventional model with the advantages of the object oriented approach.
-
the oo Binary Relationship model a truly object oriented conceptual model
Conference on Advanced Information Systems Engineering, 1991Co-Authors: O.m.f. De TroyerAbstract:Conventional conceptual models like the Binary Relationship Model (also known as NIAM) or the Entity-Relationship Model do not fit well with the promising object oriented database systems. In this paper we show that is possible to turn such a conventional conceptual model (in particular the Binary Relationship Model) into a truly object oriented conceptual model which combines the assets of the conventional model with the advantages of the object oriented approach.