Reasoning on constraint sets is a difficult task. Classical database design is based on a step-wise extension of the constraint set and on a consideration of constraint sets through generation by tools. Since the database developer must master semantics acquisition, tools and approaches are still sought that support reasoning on sets of constraints. We propose novel approaches for presentation ...

Databases ometimes have keys besides those pre-planned by the database designers. These are easy to discover given functional dependencies in the data. These superfluous keys are convenient ira user wishes to add data to a projection of the database. A key can be chosen that minimizes the attributes the user must edit. In a list format view, enough attribute columns are added to those specified...

Databases sometimes have keys besides those pre-planned by the database designers. These are easy to discover given functional dependencies in the data. These superfluous keys are convenient if a user wishes to add data to a projection of the database. A key can be chosen that minimizes the attributes the user must edit. In a list format view, enough attribute columns are added to those specifi...

We study inference systems for the combined class of functional and full hierarchical dependencies in relational databases. Two notions of implication are considered: the original version in which the underlying set of attributes is fixed, and the alternative notion in which this set is left undetermined. The first main result establishes a finite axiomatisation in fixed universes which clarifi...

This paper extends the work of Gottlob, Lee, and Valiant (PODS 2009) [9], and considers worst-case bounds for the size of the result Q(D) of a conjunctive query Q to a database D given an arbitrary set of functional dependencies. The bounds in [9] are based on a “coloring” of the query variables. In order to extend the previous bounds to the setting of arbitrary functional dependencies, we leve...

Query rewriting is an essential issue in data integration systems over the Web and has received considerable attention. Many rewriting algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the MiniCon algorithm, have been proposed to address this issue in the absence of functional dependencies. These algorithms can be divided into two categories: bucket-base...

The design of an information system for a business process can be implemented either in the object-oriented paradigm or in relational database management system as per the client’s choice. In object oriented paradigm, the design starts with abstraction of objects, classes, attributes, functional dependencies, interrelationships and use cases but in relational database management system (RDBMS) ...

A sound and complete Automated Prover for the Fuzzy Simplification Logic (FSL logic) is introduced and based on it a method for efficiently reasoning about fuzzy functional dependencies over domains with similarity relations. The complexity of the algorithm is the same as that of equivalent algorithms for crisp functional dependencies that appear in the literature.