Bounded fixpoints for complex objects
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 176244 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- 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
- 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
(10)- Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
- Boolean lattices of nested relations as a foundation for rule-based database languages
- Tractable query languages for complex object databases
- Query languages for bags and aggregate functions
- Structural recursion as a query language on lists and ordered trees
- scientific article; zbMATH DE number 1531039 (Why is no real title available?)
- Comprehending Ringads
- A class of bounded functions, a database language and an extended lambda calculus
- Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
- A query language for NC
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)
