The complexity of the evaluation of complex algebra expressions
From MaRDI portal
(Redirected from Publication:1376410)
Recommendations
- Tractable query languages for complex object databases
- Algebraic and calculus query languages for recursively typed complex objects
- Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
- Bounded fixpoints for complex objects
Cites work
- scientific article; zbMATH DE number 4035108 (Why is no real title available?)
- scientific article; zbMATH DE number 3485719 (Why is no real title available?)
- scientific article; zbMATH DE number 3637904 (Why is no real title available?)
- A query language for NC
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- Languages that Capture Complexity Classes
- On the complexity of queries in the logical data model
- On the expressive power of database queries with intermediate types
- On uniformity within \(NC^ 1\)
- The relational model with relation-valued attributes
Cited in
(4)- Iterating on multiple collections in synchrony
- scientific article; zbMATH DE number 66626 (Why is no real title available?)
- An intensional expressiveness gap of comprehension syntax
- 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: The complexity of the evaluation of complex algebra expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376410)
