The complexity of the evaluation of complex algebra expressions
From MaRDI portal
Publication:1376410
DOI10.1006/jcss.1997.1526zbMath0887.68025OpenAlexW2125327296MaRDI QIDQ1376410
Publication date: 1 June 1998
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://repository.uantwerpen.be/docman/irua/3482a0/5143.pdf
Related Items (2)
Iterating on multiple collections in synchrony ⋮ Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of queries in the logical data model
- The relational model with relation-valued attributes
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- On the expressive power of database queries with intermediate types
- A query language for NC
- On uniformity within \(NC^ 1\)
- Languages that Capture Complexity Classes
This page was built for publication: The complexity of the evaluation of complex algebra expressions
