Hitherto, most relational database design methods are based on functional dependencies (FDs) and multivalued dependencies (MVDs). Full mappings are proposed as an alternative to FDs and MVDs. A mapping between any two sets, apart from being one-one, many-one, or many-many, is either total or partial on the source and target sets. An 'into' mapping on a set, expresses the fact that an element in the set may not be involved in the mapping. An 'onto' mapping on a set is total on the set. A many-many (into,onto) mapping from set A to set B is written as A[sup=i] m----n B[sup=o]. The mappings incorporate more semantic information into data dependency specification. It is shown, informally, that the full mappings are more expressive tha...
Smith’s method is a formal technique for deriving a set of normalised relations from a functional de...
AbstractModern applications increasingly require the storage of data beyond relational structure. Th...
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental database in...
The current schema design theories assume that a database may be regarded as a single relation. From...
Advances in relational database technology have made available relational database systems that sup...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
International audienceDriven by the dominance of the relational model, we investigate how the requir...
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...
This thesis describes a new approach of relational database design using the SET conceptual model. T...
an enormous growth of the Semantic Web through initiatives like Open Linked Data [5] and Open Govern...
AbstractMultivalued dependencies (MVDs) are an important class of relational constraints that is fun...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
Mapping relational data to RDF is an important task for the development of the Semantic Web. To this...
Relational database schemas must be semantically enriched to reflect knowledge about the data, as ne...
Smith’s method is a formal technique for deriving a set of normalised relations from a functional de...
AbstractModern applications increasingly require the storage of data beyond relational structure. Th...
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental database in...
The current schema design theories assume that a database may be regarded as a single relation. From...
Advances in relational database technology have made available relational database systems that sup...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
International audienceDriven by the dominance of the relational model, we investigate how the requir...
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...
This thesis describes a new approach of relational database design using the SET conceptual model. T...
an enormous growth of the Semantic Web through initiatives like Open Linked Data [5] and Open Govern...
AbstractMultivalued dependencies (MVDs) are an important class of relational constraints that is fun...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
Mapping relational data to RDF is an important task for the development of the Semantic Web. To this...
Relational database schemas must be semantically enriched to reflect knowledge about the data, as ne...
Smith’s method is a formal technique for deriving a set of normalised relations from a functional de...
AbstractModern applications increasingly require the storage of data beyond relational structure. Th...
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental database in...