Incorporating cardinality constraints and synonym rules into conditional functional dependencies
نویسندگان
چکیده
We propose an extension of conditional functional dependencies (CFDs), denoted by CFDcs, to express cardinality constraints, domain-specific conventions, and patterns of semantically related constants in a uniform constraint formalism. We show that despite the increased expressive power, the satisfiability and implication problems for CFDcs remain NP-complete and coNP-complete, respectively, the same as their counterparts for CFDs. We also identify tractable special cases.
منابع مشابه
Automatic Discovery of Functional Dependencies and Conditional Functional Dependencies: A Comparative Study
Over the last twenty years, several algorithms have been proposed for automatic rule/constraint discovery from data, for the purpose of data cleaning. These algorithms look for constraints such as functional dependencies (FDs), conditional FDs (CFDs), inclusion dependencies (INDs), conditional INDs (CINDs), association rules, integrity constraints (ICs) and denial constraints (DCs), among other...
متن کاملDiscovering Conditional Functional Dependencies in XML Data
XML data inconsistency has become a serious problem since XML was widely adopted as a standard for data representation on the web. XML-based standards such as OASIS, xCBL and xBRL have been used to report and exchange business and financial information. Such standards focus on technical rather than semantic aspects. XML Functional Dependencies (XFDs) have been introduced to improve XML semantic...
متن کاملFunctional Dependencies for Object Databases
There is an increasing use of object oriented methods (e.g. [Ru91], [UML97]) for the design of database applications and databases themselves. Like the Entity–Relationship model and its variants, structural models of these methods provide rich modelling concepts for specifying object schemas. Some kinds of integrity constraints, e.g. referential integrity constraints or cardinality constraints ...
متن کاملEfficiently Bounding Cardinality Ratios through Database Constraints
Numerical dependencies (NDs) are a type of database constraints in which one limits the number of distinct Y -values that can appear together with any X-value, where both X and Y are sets of attributes. The seminal work by Grant and Minker has shown that NDs are not finitely axiomatizable, which has cut further investigation on this kind of constraints. In this paper we show that, given a set o...
متن کاملAnalysis of Binary/Ternary Cardinality Combinations in Entity-Relationship Modeling
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 simulta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 109 شماره
صفحات -
تاریخ انتشار 2009