Extended algebra and calculus for nested relational databases

DOI10.1145/49346.49347zbMath0663.68111OpenAlexW1969375478MaRDI QIDQ3814847

Abraham Silberschatz, Henry F. Korth, Mark A. Roth

Publication date: 1988

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

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

zbMATH Keywords

query languagesrelational databasesquery processingpartitioned normal forms

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (21)

The Relationlog system prototype ⋮ Complex object multi-level fixpoint queries. ⋮ A historical query language ⋮ Datalog extension for nested relations ⋮ An alternative way to represent the cogroup of a relation in the context of nested databases ⋮ Null values in nested relational databases ⋮ Compact scheme forests in nested normal form ⋮ Semantics of types for database objects ⋮ On a hierarchy of classes for nested databases ⋮ Efficient processing of probabilistic set-containment queries on uncertain set-valued data ⋮ A semantics for complex objects and approximate answers ⋮ On the expressive power of database queries with intermediate types ⋮ A comparison between algebraic query languages for flat and nested databases ⋮ Equivalence of the relational algebra and calculus for nested relations ⋮ A logic for programming with complex objects ⋮ Algebraic and calculus query languages for recursively typed complex objects ⋮ Optimal block size for set-valued attributes ⋮ Functional and multivalued dependencies in nested databases generated by record and list constructor ⋮ Negation in rule-based database languages: A survey ⋮ Hereditarily-finite sets, data bases and polynomial-time computability ⋮ Extended nested relations

This page was built for publication: Extended algebra and calculus for nested relational databases