A comparison between algebraic query languages for flat and nested databases

DOI10.1016/0304-3975(91)90327-XzbMath0743.68053MaRDI QIDQ1177142

Marc Gyssens, Dirk Van Gucht

Publication date: 26 June 1992

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

zbMATH Keywords

nested relational database modelsquery algebras

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45)

Related Items

Domain-independent queries on databases with external functions, Bounded fixpoints for complex objects, Principles of programming with complex objects and collection types, The powerset algebra as a natural tool to handle nested database relations, Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable queries for relational data bases
• On the expressive power of the relational algebra
• Structure and complexity of relational queries
• A uniform approach toward handling atomic and structured information in the nested relational database model
• Horn clause queries and generalizations
• Relational queries computable in polynomial time
• Extended algebra and calculus for nested relational databases
• On Database Logic
• A relational model of data for large shared data banks