.png){kind=icon}
返回
Typed query languages for databases containing queries
.png){kind=icon}
OA
AI
DOI：10.1016/S0306-4379(99)00033-2.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 first-order calculus; and global expressive power and non-redundancy of the proposed formalism. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keyword:
databases
query languages
stored procedures
meta programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Does No Child Left Behind Really Capture School Quality? Evidence From an Urban School District《不让一个孩子掉队》真的能衡量学校质量吗？——来自一个城市学区的证据
PREAI
分享收藏
查看更多内容