Abstract
Relations are in the process of being accepted as a data structure adequate for a wide variety of applications. On the one hand this is due to the powerful and high level operators on relations, on the other it results from additional services such as recovery management, concurrency control and expression optimization provided by relational systems.
This paper presents a database person’s view of data definition and data processing, and outlines principles of database programming from a language person’s point of view. In addition, design aspects of Database Programming Languages and execution models for query evaluation and transaction management are discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Sagiv, Y., Ullman, J.D.: Efficient Optimization of a Class of Relational Expressions. A CM TODS, Vol. 4, No. 4, December 1979.
Atkinson, M.P., Chrisholm, K, Cockshott, P.: The New Edinburgh Persistent Algorithmic Language. University of Edinburgh, Department of Computer Science, CSR-90-81, August 1981.
Bernstein, P. A., Chin, D.H.: Using Semi-Joins to Solve Relational Queries. J. ACM Vol. 28, No. 1, January 1981.
Brodie, M.L., Mylopoulos, J., Schmidt,J.W. (Eds.): Proc. Symp. on Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages. Intervale, New Hampshire, June 1 982, Springer-Verlag, 1984.
Brägger, R.P., Reimer, M.: Predicative Scheduling: Integration of Locking and Optimistic Methods. ETH Zürich, Institut für Informatik, Report Nr. 53, July 1983.
Brodie, N.L., Zilles, S. (Eds.): Proc. Workshop on Data Abstraction, Databases and Conceptual Modelling. Pingree Park, Colorado, June 1980, ACM SIGART/SIGMOD/SIGPLAN, 1981.
Ceri, S., Crespi-Reghizzi, S.: Relational Data Bases in the Design of Program Construction Systems. ACM SIGPLAN Notices, Vol. 18, No. 11, November 1983.
Codd, E.F.: A Relational Model of Data for Large Shared Data Banks. CACM Vol.13, No.6, June 1 970.
Codd, E.F.: Relational Completeness of Data Base Sublanguages. Courant Computer Science.Symposia 6, Prentice-Ha 11, May 1971.
Codd, E.F.: Relational Database: A Practical Foundation for Productivity. CACM Vol. 25, No. 2, February 1982.
Codd, E.F. “Foreword” of [ScBr831].
Eswaran, K.P., Gray,J.N., Lorie.R.A., Traiger, I. L.: The Notions of Consistency and Predicate Locks in a Database System. CACM, Vol. 19, No. 11, November 1976.
Gray, J. N.: The Transaction Concept: Virtues and Limitations. Proc. 7th VLDB Conf., Cannes, September 1981.
Gries, O.: The Science of Programming. Springer-Verlag, 1981.
Hall, P.A.V.: Optimization of Single Expressions in a Relational Data Base System. IBM J. Res. Development Vol.20, No.3, March 197G.
Hehner, E.C.R.: The Logic of Programming. Prentice-Hall, to be published, 1983.
Haskin, R., Lorie, R.: On Extending the Function of a Relational Database System. Proc. ACM SI.GMOD Conf., Orlando, June 1982.
Hoare, C.A.R.: Record Handling. In F. Genuys ( Ed. ): Programming Languages. Academic Press, 1968.
Hoare, C.A.R.: An Axiomatic Approach to Computer Programming. CACM Vol.12, No.10, October 1 969.
Jarke, M., Koch, J.: A Survey of Query Optimization in Centralized Database Systems. Tech. Rep. CRIS 44 G B A 82–73, New York University, November 1982.
Jarke, M., Koch, J.: Range Nesting: A Fast Method to Evaluate Quantified Queries. Proc. ACM SIGMOD Conf. on Management of Data, San Jose, June 1983.
Jarke, M., Schmidt, J. W.: Query Processing Strategies in the Pascal/R Relational Database Management System. Proc. ACM SIGMOD Conf., Orlando, June 1982.
King,J.J.: QUIST: A System for Semantic Query Optimization in Relational Data Bases. Proc. 7th VLDB Conf., Cannes, September 1981.
Koch, J., Mall, M., Putfarken, P., Reimer, M., Schmidt, J.W., Zehnder, C.A.: Modula/R Report. Lilith Version, ETH Zürich, Institut für Informatik, Februar 1983.
Koch, J., Schmidt, J.W.: Robust Query Compilation. Universität Hamburg, Institut für Informatik, November 1983.
Kung, H.T., Robinson, J.T.: On Optimistic Methods for Concurrency Control. ACH TODS. Vol. 6, No. 2, June 1981.
Lamersdorf, W, Schmidt, J.W.: Rekursive Datenmodelle. Proc. GI-Fachgespräch ‘Sprachen für Datenbanken’. Hamburg. Informatik-Fachberichte Nr.83, Springer-Verlag, Oktober 1 983.
Lorie, R.: Issues in Database for Design Applications. IBM Research Report RJ3178, San Jose, July 1981.
Harburger, H., Nebel, B.: Natürlichsprachlicher Datenbankzugang mit HAM-ANS: Syntaktische Korrespondenz, natürlichsprachliche Quantifizierung und semantisches Hodell des Diskursbereiches. Proc. GI-Fachgespräch ‘Sprachen für Datenbanken’, Hamburg, Informatik-Fachberichte Nr. 83, Springer-Verlag, Oktober 1983.
Mylopoulos, J., Bernstein, P., Wong, H.K.T.: A Language Facility for Designing Interactive Database-Intensive Applications. ACM TODS, Vol.5, No.2, June 1 980.
Reimer, M.: Solving the Phantom Problem by Predicative Optimistic Concurrency Control. Proc. 9th VLDB Conf., Florence, October 1983.
Reynolds, J.C.: The Craft of Programming. Prentice-Hall, 1981.
Rebsamen, J., Reimer, M., Ursprung, P., Zehnder, C. A.,Diener, A.: LIDAS - The Database System for the Personal Computer Lilith. Proc. INRIA Workshop on Relational DBMS Design, Implementation, and Use on Micro-Computers, Toulouse, February 1983.
Schmidt, J.W., Brodie, M.L.: Relational Database Systems: Analysis and Comparison. Springer-Verlag, 1983.
Schmidt, J.W.: Some High Level Language Constructs for Data of Type Relation. ACM TODS, Vol. 2, No. 3, September 1977.
Schmidt, J. W., Mall, M.: Pascal/R Report. Universität Hamburg, Fachbereich Informatik, Report No.66, Januar 1980.
Schmidt, J.W., Mall, M.: Abstraction Mechanisms for Database Programming. Proc. ACM SIGPLAN Symp. on Programming Language Issues in Software Systems, ACM SIGPLAN Notices, Vol. 18, No. 6, June 1983.
Schek, H.J., Pister, P.: Data Structure for an Integrated Data Base Management and Information Retrieval System. Proc. VLDB Conf., Mexico City, September 1982.
Smith, J.M., Fox, S., Landers, T.: Reference Manual for ADAPLEX. Computer Corporation of America, Cambridge, January 1981.
Schmidt, J.W., Reimer, M., Mall, M., Koch, J.: Report on the Database Programming Language DBPL (draft version). Universität Hamburg, Fachbereich Informatik, 1983.
Schmidt, J.W., Reimer, M., Putfarken, P., Mall, M. Koch, J., Jarke, M.: Research in Database Programming: Language Constructs and Execution Models. IEEE Database Engineering 6, June 1983.
Stonebraker, H.: Implementation of Integrity Constraints and Views by Query Modification. Proc. ACM SIGMOD Conf., San Jose, May 1975.
Wasserman, A.I.: The Data Management Facilities of PLAIN. Proc. ACM SIGMOD Conf., Boston. May 1979.
Wirth, N.: Programming in Modula/2. Springer-Verlag, 1982.
Zloof, M.: Query by Example: A Data Base Query Language. IBM Systems Journal, 4, 1977.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmidt, J.W. (1984). Database Programming: Language Constructs and Execution Models. In: Ammann, U. (eds) Programmiersprachen und Programmentwicklung. Informatik-Fachberichte, vol 77. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69393-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-69393-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12905-9
Online ISBN: 978-3-642-69393-9
eBook Packages: Springer Book Archive