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)
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
Null values in data base management a denotational semantics approach
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
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
Equivalence of relational database schemes
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
An extension of conflict-free multivalued dependency sets
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
On the complexity of join dependencies
ACM Transactions on Database Systems (TODS)
Alpha-acyclic decompositions of relational database schemes
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
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
A message passing framework for logical query evaluation
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
NC Algorithms for Recognizing Chordal Graphs and k Trees
IEEE Transactions on Computers
On the equivalence of an Egd to a set of Fd's
Journal of the ACM (JACM)
Solving queries by tree projections
ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries
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)
Syntactic Characterization of Tree Database Schemas
Journal of the ACM (JACM)
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
On the design of a query processing strategy in a distributed database environment
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Query processing utilizing dependencies and horizontal decomposition
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
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
Answering queries in relational databases
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Query processing for distributed databases using generalized semi-joins
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
On the cyclic to acyclic scheme transformation and solving cyclic queries
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
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
Assumptions in relational database theory
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
On equivalences of database schemes
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The tree property is fundamental for query processing
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Transforming cyclic schemas into trees
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Efficient processing of relational calculus expressions using range query theory
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A parallel Data Base Machine for query translation in a distributed database system
SAC '86 Proceedings of the 1986 workshop on Applied computing
A note on decompositions of relational databases
ACM SIGMOD Record
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
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Artificial Intelligence
On the complexity of deriving schema mappings from database instances
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Functions of the database workbench
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
Schema mapping discovery from data instances
Journal of the ACM (JACM)
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
The complexity of acyclic subhypergraph problems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory
Discrete Applied Mathematics
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
There is a class of database descriptions, involving one “acyclic” join dependency and a collection of functional dependencies, and nothing else, that appears powerful enough to describe most any real-world body of data in relational database terms. Further, this class has many desirable properties. Some properties make operations like updates and the selection of joins to implement a query over a universal relation especially easy. Other properties of interest were studied by other researchers who described the same class in radically different terms, and found desirable properties in their own contexts. It is the purpose of this paper to define the class formally, to give its important properties and the equivalences with the other classes mentioned, and to explain the importance of each property. This paper is intended to summarize the results that will appear in more detail in [FMU] and [BFMY].