Results 1 
2 of
2
Typed Query Languages for Databases Containing Queries
 INFORMATION SYSTEMS
, 1999
"... This paper introduces and studies the relational meta algebra, a statically typed extension of the relational algebra to allow for meta programming in databases. In this meta algebra one can manipulate database relations involving not only stored data values (as in classical relational databases) ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
This paper introduces and studies the relational meta algebra, a statically typed extension of the relational algebra to allow for meta programming in databases. In this meta algebra one can manipulate database relations involving not only stored data values (as in classical relational databases) but also stored relational algebra expressions. Topics discussed include modeling of advanced database applications involving "procedural data"; desirability as well as limitations of a strict typing discipline in this context; equivalence with a firstorder calculus; and global expressive power and nonredundancy of the proposed formalism.
Typed Query Languages for Databases Containing Queries
"... This paper introduces and studies the relational meta algebra, a statically typed extension of the relational algebra to allow for meta programming in databases. In this meta algebra one can manipulate database relations involving not only stored data values (as in classical relational databases) bu ..."
Abstract
 Add to MetaCart
This paper introduces and studies the relational meta algebra, a statically typed extension of the relational algebra to allow for meta programming in databases. In this meta algebra one can manipulate database relations involving not only stored data values (as in classical relational databases) but also stored relational algebra expressions. Topics discussed include modeling of advanced database applications involving \procedural data" � desirability aswell as limitations of a strict typing discipline in this context � equivalence with a rstorder calculus � and global expressive power and nonredundancy of the proposed formalism. 1