On the expressive power of the relational algebra

DOI10.1016/0020-0190(78)90055-8zbMath0375.68046OpenAlexW2087515863MaRDI QIDQ1245699

K. Appert

Publication date: 1978

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90055-8

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)

Related Items

An alternative way to represent the cogroup of a relation in the context of nested databases, Linear constraint query languages expressive power and complexity, Structural characterizations of the navigational expressiveness of relation algebras on a tree, Computable queries for relational data bases, A comparison between algebraic query languages for flat and nested databases, The complexity of higher-order queries, The powerset algebra as a natural tool to handle nested database relations, On database query languages for K-relations, First-order definable counting-only queries, On the expressive power of the relational algebra with partially ordered domains, Procedural languages for database queries and updates, The expressive power of stratified logic programs with value invention

Cites Work

• Unnamed Item
• A relational model of data for large shared data banks