A simplied universal relation assumption and its properties

DOI10.1145/319732.319735zbMath0488.68069OpenAlexW2039610696MaRDI QIDQ3950001

Alberto O. Mendelzon, Jeffrey D. Ullman, Ronald Fagin

Publication date: 1982

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/319732.319735

zbMATH Keywords

hypergraphrelational databasetreesgraph algorithmsfunctional dependenciesmultivalued dependencyjoin dependencydatabase scheme designquery formulation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (34)

Independent database schemas ⋮ On improving dependency implication algorithms ⋮ The nested universal relation data model ⋮ Characterization of desirable properties of general database decompositions. ⋮ Interaction-free multivalued dependency sets ⋮ Completeness issues for join dependencies derived from the universal relation join dependency ⋮ Relational decomposition and structural analysis of systems ⋮ Null values in nested relational databases ⋮ Using trees to mine multirelational databases ⋮ Testing arbitrary subhypergraphs for the lossless join property ⋮ Inferring multivalued dependencies from functional and join dependencies ⋮ Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms ⋮ Generating hinges from arbitrary subhypergraphs ⋮ Hypertree decompositions and tractable queries ⋮ Another view of functional and multivalued dependencies in the relational database model ⋮ Non first normal form relations: An algebra allowing data restructuring ⋮ Lossless outer joins with incomplete information ⋮ A characterization of finite fd-acyclicity ⋮ Connections in acyclic hypergraphs ⋮ Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers ⋮ Arboricity: an acyclic hypergraph decomposition problem motivated by database theory ⋮ Vivid: a framework for heterogeneous problem solving ⋮ Uniform Constraint Satisfaction Problems and Database Theory ⋮ NP-complete problems simplified on tree schemas ⋮ A characterization of multivalued dependencies equivalent to a join dependency ⋮ On the existence of acyclic views in a database scheme ⋮ Acyclic join dependency and data base projections ⋮ The tree projection theorem and relational query processing ⋮ GYO reductions, canonical connections, tree and cyclic schemas, and tree projections ⋮ Synthesis of unnormalized relations incorporating more meaning ⋮ Unifying functional and multivalued dependencies for relational database design ⋮ Database relations with null values ⋮ Unique complements and decompositions of database schemata ⋮ Decomposing constraint satisfaction problems using database techniques

This page was built for publication: A simplied universal relation assumption and its properties