On the foundations of the universal relation model

DOI10.1145/329.318580zbMath0563.68077OpenAlexW1983428002MaRDI QIDQ3677202

Moshe Y. Vardi, David Maier, Jeffrey D. Ullman

Publication date: 1984

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

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

zbMATH Keywords

data dependenciesuniversal relation modelrelational data modellosslessnessaccess path

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (23)

The nested universal relation data model ⋮ A domain theoretic characterisation of the universal relation ⋮ Efficient and optimal query answering on independent schemes ⋮ On the desirability of \(\gamma\)-acyclic BCNF database schemes ⋮ Testing unboundedness of database schemes and functional dependencies ⋮ Can datalog be approximated? ⋮ Boundedness is undecidable for datalog programs with a single recursive rule ⋮ A progression semantics for first-order logic programs ⋮ Using trees to mine multirelational databases ⋮ A new interpretation for null values in the weak instance model ⋮ Unnamed Item ⋮ A universal table model for categorical databases ⋮ Testing arbitrary subhypergraphs for the lossless join property ⋮ Connection-trap-free database schemes ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ On characterizing boundedness of database schemes with bounded dependencies ⋮ Decidable containment of recursive queries ⋮ Data exchange: semantics and query answering ⋮ Data analysis using a geometrical representation of predicate calculus ⋮ Querying Weak Instances Under Extension Chase Semantics: A Complete Solution ⋮ Independent database schemes under functional and inclusion dependencies ⋮ Nonapplicable nulls ⋮ A formal framework for independence with respect to transactions in the universal relation model

This page was built for publication: On the foundations of the universal relation model