PROCEDURAL LANGUAGES FOR DATABASE QUERIES AND UPDATES

被引：43
作者：
ABITEBOUL, S [1 ]
VIANU, V [1 ]
机构：
[1] UNIV CALIF SAN DIEGO,CSE DEPT,LA JOLLA,CA 92093
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1990年 / 41卷 / 02期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1016/0022-0000(90)90036-K
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Relational database transformations, encompassing database queries and updates, are studied. A completeness criterion for database languages is introduced, based on their capability to express database transformations. Specific deterministic and non-deterministic transformation languages are defined and shown to be complete. Restrictions of these languages are also considered and their expressive power characterized. The classes of transformations captured by these languages include the transformations computable in polynomial time and space (in the non-deterministic case), and the fixpoint queries and the while queries (in the deterministic case). Connections with existing notions of query completeness, and corresponding query languages, are exhibited. © 1990.
引用
收藏
页码：181 / 229
页数：49
相关论文
共 22 条
  • [1] ABITEBOUL S, 1989, FOURTH ANNUAL SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, P71
  • [2] Abiteboul S., 1988, Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, P240, DOI 10.1145/308386.308448
  • [3] ABITEBOUL S, 1985, 4TH P ACM PODS, P193
  • [4] ABITEBOUL S, 1988, 3RD P INT C DAT KNOW, P324
  • [5] ABITEBOUL S, IN PRESS J COMPUT SY
  • [6] ABITEBOUL S, 1988, INRIA900 TECHN REP
  • [7] Aho Alfred V., 1979, 6TH P ACM S PRINC PR, P110
  • [8] BANCILHON F, 1978, 7TH P S MATH F COMP, P112
  • [9] Chandra A. K., 1981, P ACM S PRINC PROGR, P50
  • [10] COMPUTABLE QUERIES FOR RELATIONAL DATA-BASES
    CHANDRA, AK
    HAREL, D
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 21 (02) : 156 - 178
123