Using powerdomains to generalize relational databases

DOI10.1016/0304-3975(91)90266-5zbMath0799.68064OpenAlexW2153320571MaRDI QIDQ1183586

Achim Jung, Peter Buneman, Atsushi Ohori

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/12304732/1_s2.0_0304397591902665_main.pdf

zbMATH Keywords

powerdomainsrelational databases

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55)

Related Items

The nested universal relation data model, Certain answers as objects and knowledge, On representation and querying incomplete information in databases with bags, Data cleaning and query answering with matching dependencies and matching functions, Query languages for bags and aggregate functions, Models of approximation in databases, Decomposition of domains, Semantics of types for database objects, Querying independent databases, A semantics for complex objects and approximate answers, The mixed powerdomain, Model-Checking View-Based Partial Specifications, Computing possible and certain answers over order-incomplete data, Deduction with uncertain conditionals, Negative Knowledge for Certain Query Answers

Cites Work

• Database relations with null values
• An algebraic semantics approach to the effective resolution of type equations
• Towards an abstract theory of dependency constraints in relational databases
• Null values in nested relational databases
• Power domains
• Fast algorithms for the elimination of common subexpressions
• The Format Model
• On the Equivalence of Database Models
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item