A database schema is independent with respect to a given set of constraints if the constraints can be enforced separately in the relations. A polynomial time algorithm is presented that recognizes independent schemas, when the given constraints consist of functional dependencies and the join dependency of the database schema. 1
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental database in...
In earlier work, Bancilhon and Spyratos introduced the concept of a complement to a database schema,...
We investigate a class of set constraints that is used for the type analysis of concurrent constrain...
A database schema is independent with respect to a given set of constraints if the constraints can b...
AbstractA database schema is independent with respect to a given set of constraints if the constrain...
Abstract. Independent database schemes are best known to have constraints enforced globally by enfor...
We investigate the implication problem for independence atoms X⊥Y of disjoint attribute sets X and Y...
The problem of satisfiability of a specific class of integrity constraints in data bases, namely the...
A desirable feature of a database management system is the ability to support many views of the data...
We study the representation, derivation and utilization of a special kind of constraints in multidat...
We define extended conflict free dependencies in the context of functional and multivalued dependenc...
We introduce a theoretical framework for discovering relationships between two database instances ov...
Database design almost invariably includes a specification of a set of rules (the integrity constrai...
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fun-damental integrity ...
Abstract. This paper introduces procedures to test strict satisfiability and de-cide logical implica...
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental database in...
In earlier work, Bancilhon and Spyratos introduced the concept of a complement to a database schema,...
We investigate a class of set constraints that is used for the type analysis of concurrent constrain...
A database schema is independent with respect to a given set of constraints if the constraints can b...
AbstractA database schema is independent with respect to a given set of constraints if the constrain...
Abstract. Independent database schemes are best known to have constraints enforced globally by enfor...
We investigate the implication problem for independence atoms X⊥Y of disjoint attribute sets X and Y...
The problem of satisfiability of a specific class of integrity constraints in data bases, namely the...
A desirable feature of a database management system is the ability to support many views of the data...
We study the representation, derivation and utilization of a special kind of constraints in multidat...
We define extended conflict free dependencies in the context of functional and multivalued dependenc...
We introduce a theoretical framework for discovering relationships between two database instances ov...
Database design almost invariably includes a specification of a set of rules (the integrity constrai...
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fun-damental integrity ...
Abstract. This paper introduces procedures to test strict satisfiability and de-cide logical implica...
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental database in...
In earlier work, Bancilhon and Spyratos introduced the concept of a complement to a database schema,...
We investigate a class of set constraints that is used for the type analysis of concurrent constrain...
DOI
Add to ORKG