Two kinds of basic operations can be performed on a database: update it, i.e. modify the data values stored in it, and query it, i.e. ask questions about its data value. In this work we deal with update and query languages for the relational database model, introduced by Codd in , Some query languages were developed since the origin of this model, e.g. the first-order relational calculus and the relational algebra. A precise concept of completeness, based on computability, for relational query languages was defined by Chandra and Harel in . Updates in the relational database model were considered systematically as a research topic in . Restructuring of relational databases was considered in [4, 5]. In [6, 7] a family of relational update languages was defined. The languages introduced in [6, 7] are complete update languages (deterministic and non-deterministic). By completeness it follows that these languages are also capable of expressing all computable queries, as defined in . However, the constructs chosen in  do not necessarily reflect this, but capture the essence of update operations. The completeness proof in  is very detailed and built from scratch.
KeywordsRelational Database Query Language Relational Algebra Database Schema Database Instance
Unable to display preview. Download preview PDF.
- S. Abiteboul. Updates a new frontier. In Proceedings of the 2nd. International Conference on Database Theory LNCS 326 pages 1–18 1988Google Scholar
- V.E. Markowitz and J.A. Makowsky. Incremental reorganization of relational databases. In VLDB’ 87, pages 127–135, September 1987.Google Scholar
- V.E. Markowitz and J.A. Makowsky. Incremental restructuring of relational schemas. In Proceedings of the 4th International Conference on Data Engineering, pages 276–284, February 1988.Google Scholar
- S. Abiteboul and V. Vianu. A transaction language complete for database update and specification. In Proceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 260–268, 1987.Google Scholar
- S. Abiteboul and C. Beeri. On the power of languages for the manipulation of complex objects. Research Report 846, INRIA, April 1988.Google Scholar
- R.A. Hasson and J.A. Makowsky. Updates in the complex object data model, 1991. (Unpublished manuscript).Google Scholar
- G.M. Kuper and M.Y. Vardi. A new approach to database logic. In Proceedings of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 86–96, 1984.Google Scholar
- E. Dalhaus and J.A. Makowsky. Computable directory queries. In P. Franchi Zannettacci, editor, Proceedings of CAAP’86 (11th Colloquium on Trees and Algebra in Programming), LNCS 214, pages 254–265, March 1986.Google Scholar
- E. Dalhaus and J.A. Makowsky. Query languages for hierarchic databases. Technical Report 652, Department of Computer Science-The Technion, Haifa, Israel, 1990. To appear in Information and Computation. Google Scholar
- S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 159–173, 1989.Google Scholar