Bounded fixpoints for complex objects

DOI10.1016/S0304-3975(96)00293-9zbMath0903.68058MaRDI QIDQ1392283

Dan Suciu

Publication date: 23 July 1998

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

zbMATH Keywords

query languagecomplex-object databases

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (6)

Comprehending Ringads ⋮ Query languages for bags and aggregate functions ⋮ A query language for NC ⋮ Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions ⋮ Structural recursion as a query language on lists and ordered trees ⋮ Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Non first normal form relations: An algebra allowing data restructuring
• Principles of programming with complex objects and collection types
• The relational model with relation-valued attributes
• Fixed-point extensions of first-order logic
• Multilevel nested relational structures
• On the expressive power of database queries with intermediate types
• A comparison between algebraic query languages for flat and nested databases
• The powerset algebra as a natural tool to handle nested database relations
• A query language for NC
• Domain-independent queries on databases with external functions
• Structure and complexity of relational queries
• Tractable query languages for complex object databases
• Relational queries computable in polynomial time

This page was built for publication: Bounded fixpoints for complex objects