Bounded fixpoints for complex objects

DOI10.1016/S0304-3975(96)00293-9MaRDI QIDQ1392283zbMATH OpenFDO

Authors Dan Suciu

Publication date 23 July 1998

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

Full work available at URL https://doi.org/10.1016/S0304-3975(96)00293-9

zbMATH Keywords

complex-object databasesquery language

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Tractable query languages for complex object databases
• Complex object multi-level fixpoint queries.
• Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
• scientific article; zbMATH DE number 1086662

Cites work

• A comparison between algebraic query languages for flat and nested databases
• A query language for NC
• Domain-independent queries on databases with external functions
• Fixed-point extensions of first-order logic
• scientific article; zbMATH DE number 176244 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Multilevel nested relational structures
• Non first normal form relations: An algebra allowing data restructuring
• On the expressive power of database queries with intermediate types
• Principles of programming with complex objects and collection types
• Relational queries computable in polynomial time
• Structure and complexity of relational queries
• The powerset algebra as a natural tool to handle nested database relations
• The relational model with relation-valued attributes
• Tractable query languages for complex object databases

Cited in

(14)

• Complex object multi-level fixpoint queries.
• Query languages for bags and aggregate functions
• A query language for NC
• The complexity of the evaluation of complex algebra expressions
• Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
• Tractable query languages for complex object databases
• Structural recursion as a query language on lists and ordered trees
• A class of bounded functions, a database language and an extended lambda calculus
• Comprehending Ringads
• Boolean lattices of nested relations as a foundation for rule-based database languages
• Deductive query languages for recursively typed complex objects
• scientific article; zbMATH DE number 1086662 (Why is no real title available?)
• scientific article; zbMATH DE number 1531039 (Why is no real title available?)
• Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392283)