On the foundations of the universal relation model
From MaRDI portal
Recommendations
Cited in
(45)- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Testing unboundedness of database schemes and functional dependencies
- Boundedness is undecidable for datalog programs with a single recursive rule
- Connection-trap-free database schemes
- On characterizing boundedness of database schemes with bounded dependencies
- A fast algorithm for query optimization in universal-relation databases
- The nested universal relation data model
- Can datalog be approximated?
- The nested universal relation database model
- A progression semantics for first-order logic programs
- Independent database schemes under functional and inclusion dependencies
- Nonapplicable nulls
- Algorithms and applications for universal quantification in relational databases.
- Efficient and optimal query answering on independent schemes
- Internal model of relational data on the basis of -lists
- scientific article; zbMATH DE number 3881905 (Why is no real title available?)
- Maximal objects and the semantics of universal relation databases
- scientific article; zbMATH DE number 3898274 (Why is no real title available?)
- scientific article; zbMATH DE number 3917749 (Why is no real title available?)
- On the spectra of universal relational sentences
- Some Results on the Representative Instance in Relational Databases
- scientific article; zbMATH DE number 4035217 (Why is no real title available?)
- scientific article; zbMATH DE number 4058919 (Why is no real title available?)
- scientific article; zbMATH DE number 4058921 (Why is no real title available?)
- scientific article; zbMATH DE number 4070983 (Why is no real title available?)
- scientific article; zbMATH DE number 4091579 (Why is no real title available?)
- Update and retrieval in a relational database through a universal schema interface
- A domain theoretic characterisation of the universal relation
- Uniquest: Determining the Semantics of Complex Uniqueness Constraints
- Using trees to mine multirelational databases
- scientific article; zbMATH DE number 527369 (Why is no real title available?)
- Querying Weak Instances Under Extension Chase Semantics: A Complete Solution
- Social choice methods for database aggregation
- Model integration based on universal relation model representation
- Universal query language for unified state model
- Decidable containment of recursive queries
- Data exchange: semantics and query answering
- Data analysis using a geometrical representation of predicate calculus
- The theory of SML schema-directed query
- On the equivalence of recursive and nonrecursive Datalog programs
- Refinement of enquiries in retrieval systems based on the universal relation model
- A formal framework for independence with respect to transactions in the universal relation model
- A new interpretation for null values in the weak instance model
- A universal table model for categorical databases
- Testing arbitrary subhypergraphs for the lossless join property
This page was built for publication: On the foundations of the universal relation model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677202)
