A simplied universal relation assumption and its properties

Authors:
Ronald Fagin;Alberto O. Mendelzon;Jeffrey D. Ullman
Affiliations:
IBM Research Lab, San Jose, CA;IBM Research Lab, San Jose, CA;Stanford Univ., Stanford, CA
Venue:
ACM Transactions on Database Systems (TODS)
Year:
1982

Citing 17
Cited 88

The theory of joins in relational databases

ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies

ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies

ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
Independent components of relations

ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in relational databases

ACM Transactions on Database Systems (TODS)
On the Complexity of Testing Implications of Functional and Join Dependencies

Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
A relational model of data for large shared data banks

Communications of the ACM
A complete axiomatization for functional and multivalued dependencies in database relations

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Principles of Database Systems

Principles of Database Systems
Normal forms and relational database operators

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Real-world MVD's

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Connections in acyclic hypergraphs: extended abstract

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
On the Semantics of the Entity-Relationship Data Model

Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Graphs and Hypergraphs

Graphs and Hypergraphs

SYSTEM/U: a database system based on the universal relation assumption

ACM Transactions on Database Systems (TODS)
Resolving the query inference problem using Steiner trees

ACM Transactions on Database Systems (TODS)
Closures of database hypergraphs

Journal of the ACM (JACM)
On the complexity of join dependencies

ACM Transactions on Database Systems (TODS)
Elimination of intersection anomalies from database schemes

Journal of the ACM (JACM)
The equivalence of solving queries and producing tree projections (extended abstract)

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Sagiv,Y-On finite FD-acyclicity

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Answering queries on embedded-complete database schemes

Journal of the ACM (JACM)
Database theory—past and future

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A theory of intersection anomalies in relational database schemes

Journal of the ACM (JACM)
On visual formalisms

Communications of the ACM
A polynomial time algorithm for testing implications of a join dependency and embodied functional dependencies

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Models for the Combined Logical and Physical Design of Databases

IEEE Transactions on Computers
Horn tables-an efficient tool for handling incomplete information in databases

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An approach for integration of data processing in a distributed enviornment

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
A transient hypergraph-based model for data access

ACM Transactions on Information Systems (TOIS)
Formal syntax and semantics of a reconstructed relational database system

ACM SIGMOD Record
Semantics for null extended nested relations

ACM Transactions on Database Systems (TODS)
Solving queries by tree projections

ACM Transactions on Database Systems (TODS)
Unique complements and decompositions of database schemata

Journal of Computer and System Sciences
Regular Article: The nested universal relation data model

Proceedings of the 30th IEEE symposium on Foundations of computer science
An integrated approach to logical design of relational database schemes

ACM Transactions on Database Systems (TODS)
Perspectives on database theory

ACM SIGACT News
Integrating information by outerjoins and full disjunctions (extended abstract)

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An Extended Relational Data Model For Probabilistic Reasoning

Journal of Intelligent Information Systems
Hypertree decompositions and tractable queries

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Database states and their tableaux

ACM Transactions on Database Systems (TODS)
On the foundations of the universal relation model

ACM Transactions on Database Systems (TODS)
A characterization of globally consistent databases and their correct access paths

ACM Transactions on Database Systems (TODS)
On Kent's “Consequences of assuming a universal relation” (Technical correspondance)

ACM Transactions on Database Systems (TODS)
The universal relation revisited (technical correspondence)

ACM Transactions on Database Systems (TODS)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
Graph Algorithms for Functional Dependency Manipulation

Journal of the ACM (JACM)
Syntactic Characterization of Tree Database Schemas

Journal of the ACM (JACM)
U2RS: an upgradable universal relation system

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
MAYBE algebra operators in database machine architecture

ACM '86 Proceedings of 1986 ACM Fall joint computer conference
A universal relation language interface for INGRES

CSC '91 Proceedings of the 19th annual conference on Computer Science
Data-driven understanding and refinement of schema mappings

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
The Relational Structure of Belief Networks

Journal of Intelligent Information Systems
Windows on the world

SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Functional dependencies on cyclic database schemes

SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
A new characterization of independence

SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Answering queries in relational databases

SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Designing globally consistent network schemas

SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
On the recognition and design of acyclic databases

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Dependency characterizations for acyclic database schemes

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Properties of database schemata with functional dependencies

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
On the decomposition of join dependencies

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Non first normal form relations to represent hierarchically organized data

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Weak multivalued dependencies

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inclusion dependencies and the universal instance

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
GYO reductions, canonical connections, tree and cyclic schemas and tree projections

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The revenge of the JD

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Independent and separable database schemes

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On the recognition of coverings of acyclic database hypergraphs

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Elimination of intersection amomalies from database schemes

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Optimal computation of total projections with unions of simple chase join expressions

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Relational Approach to Querying Data Streams

IEEE Transactions on Knowledge and Data Engineering
A Universal Relation Data Model with Semantic Abstractions

IEEE Transactions on Knowledge and Data Engineering
A Comparative Study of Various Nested Normal Forms

IEEE Transactions on Knowledge and Data Engineering
Comprehensive Approach to the Design of Relational Database Schemes

VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Equivalence and Mapping of Database Schemes

VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
The Theory of Probabilistic Databases

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
LAURA: A Formal Data Model and her Logical Design Methodology

VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Universal Relation Views: A Pragmatic Approach

VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Select-Project Queries over XML Documents

NGITS '02 Proceedings of the 5th International Workshop on Next Generation Information Technologies and Systems
Developing XML Documents with Guaranteed ``Good'' Properties

ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Computing full disjunctions

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Step by Step Method for Conceptual Data Analysis

SEEP '96 Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)
Supporting maybe algebra in the Associative Search Language Machine (ASLM)

ACM SIGMOD Record
Weighted hypertree decompositions and optimal query plans

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query answering exploiting structural properties

ACM SIGMOD Record
Grouping and aggregation in the concept-oriented data model

Proceedings of the 2006 ACM symposium on Applied computing
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Join graphs and acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Logical integration of locally independent relational databases into a distributed database

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Uniform Constraint Satisfaction Problems and Database Theory

Complexity of Constraints
Computing full disjunction using COJO

Information Technology and Management
CUDL language semantics: Updating FDB data

Journal of Systems and Software
Vivid: A framework for heterogeneous problem solving

Artificial Intelligence
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time

Information Systems
Testing implication of probabilistic dependencies

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory

Discrete Applied Mathematics
Using trees to mine multirelational databases

Data Mining and Knowledge Discovery
Generating the fewest redundancy-free scheme trees from acyclic conceptual-model hypergraphs in polynomial time

Information Systems
Interestingness measures for association rules within groups

Intelligent Data Analysis

Quantified Score

Hi-index	0.02

Visualization

Abstract

One problem concerning the universal relation assumption is the inability of known methods to obtain a database scheme design in the general case, where the real-world constraints are given by a set of dependencies that includes embedded multivalued dependencies. We propose a simpler method of describing the real world, where constraints are given by functional dependencies and a single join dependency. The relationship between this method of defining the real world and the classical methods is exposed. We characterize in terms of hypergraphs those multivalued dependencies that are the consequence of a given join dependency. Also characterized in terms of hypergraphs are those join dependencies that are equivalent to a set of multivalued dependencies.