Join Constraints
نویسنده
چکیده
Many application domains involve constraints that, at a conceptual modeling level, apply to one or more schema paths, each of which involves one or more conceptual joins (where the same conceptual object plays roles in two relationships). Popular information modeling approaches typically provide only weak support for such join constraints. This paper contrasts how join constraints are catered for in Object-Role Modeling (ORM), the Unified Modeling Language (UML), the Objectoriented Systems Model (OSM), and some popular versions of Entity-Relationship modeling (ER). Three main problems for rich support for join constraints are identified: disambiguation of schema paths; disambiguation of join types; and mapping of join constraints. To address these problems, some notational, metamodel, and mapping extensions are proposed.
منابع مشابه
Efficient Rank Join with Aggregation Constraints
We show aggregation constraints that naturally arise in several applications can enrich the semantics of rank join queries, by allowing users to impose their application-specific preferences in a declarative way. By analyzing the properties of aggregation constraints, we develop efficient deterministic and probabilistic algorithms which can push the aggregation constraints inside the rank join ...
متن کاملConstraints on Conceptual Join Paths
To ensure that a software system accurately reflects the business domain that it models, the system needs to enforce the business rules (constraints and derivation rules) that apply to that domain. From a conceptual modeling perspective, many application domains involve constraints over one or more conceptual schema paths that include one or more conceptual joins (where the same conceptual obje...
متن کاملLarge-Scale Similarity Join with Edit-Distance Constraints
In the age of big data, the data quality problem is more severe than ever. As an essential step in data cleaning, similarity join has attracted lots of attentions from the database community. In this work, to address the similarity join problem with edit-distance constraints, we first improve the partition-based join algorithm for small scale data. Then we extend the algorithm based on MapReduc...
متن کاملA LESS COSTLY CONSTBAIhTS CHECKING FUR JOIN DEPChDEKY
A set of n tuples in a relation of a relational database design is tested tlpon the constraints of the join dependency. Some constraint equalities are found to be redundant. To remove thfs superEluity, the universe of atttbutes is partitioned into n dfsjolnt sets and a new notat.ion of join dependency is introduced. The checking time In each run of n tuples is significantly reduced by a factor ...
متن کاملJoin Evaluation Schemata for Constraint Handling Rules (chr)
CHR is a committed-choice language consisting of guarded rules that rewrite constraints into simpler ones until they are solved. CHR can de-ne both simpliication of and propagation over user-deened constraints. Simpliication replaces constraints by simpler constraints while preserving logical equivalence. Propagation adds new constraints which are logically redundant but may cause further simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002