AbstractDatabase schemas may be partitioned into two subclasses: three schemas and cyclic schemas. The analysis of tree vs . cyclic schemas introduced the concepts of GYO reductions, canonical connections, and tree projections. This paper investigates the intricate relationships among these concepts in the context of universal relation databases
Much of relational algebra and the underlying principles of relational data-base design have a simpl...
This paper deals with the problem of how to interrelate theory-specific treebanks and how to transfo...
During the past 15 years, schema mappings have been extensively used in formalizing and studying suc...
AbstractDatabase schemas may be partitioned into two subclasses: three schemas and cyclic schemas. T...
AbstractThe class of relational database schemas can be partitioned into two subclasses: tree schema...
Hypergraph has been proven to be a very useful structure in relational database theory. The family o...
AbstractThe method of the canonical connection introduced by Maier and Ullman provides an optimal pr...
The current schema design theories assume that a database may be regarded as a single relation. From...
The N-ary relationships, have been traditionally a source of confusion and still are. One important ...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
We introduce a theoretical framework for discovering relationships between two database instances ov...
A generalized approach to the decomposition of relational schemata is developed in which the compone...
A schema mapping is a high-level specification of the relationship between two database schemas. For...
One problem concerning the universal relation assumption is the inability of known methods to obtain...
A general technique for merging database schemas is developed that has a number of advantages over e...
Much of relational algebra and the underlying principles of relational data-base design have a simpl...
This paper deals with the problem of how to interrelate theory-specific treebanks and how to transfo...
During the past 15 years, schema mappings have been extensively used in formalizing and studying suc...
AbstractDatabase schemas may be partitioned into two subclasses: three schemas and cyclic schemas. T...
AbstractThe class of relational database schemas can be partitioned into two subclasses: tree schema...
Hypergraph has been proven to be a very useful structure in relational database theory. The family o...
AbstractThe method of the canonical connection introduced by Maier and Ullman provides an optimal pr...
The current schema design theories assume that a database may be regarded as a single relation. From...
The N-ary relationships, have been traditionally a source of confusion and still are. One important ...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
We introduce a theoretical framework for discovering relationships between two database instances ov...
A generalized approach to the decomposition of relational schemata is developed in which the compone...
A schema mapping is a high-level specification of the relationship between two database schemas. For...
One problem concerning the universal relation assumption is the inability of known methods to obtain...
A general technique for merging database schemas is developed that has a number of advantages over e...
Much of relational algebra and the underlying principles of relational data-base design have a simpl...
This paper deals with the problem of how to interrelate theory-specific treebanks and how to transfo...
During the past 15 years, schema mappings have been extensively used in formalizing and studying suc...
DOI
Add to ORKG