Data Types and Persistence by Malcolm P. Atkinson, Peter Buneman, Ronald Morrison

By Malcolm P. Atkinson, Peter Buneman, Ronald Morrison

There is a longtime curiosity in integrating databases and programming languages. This publication on information forms and endurance advanced from the complaints of a workshop held on the Appin in August 1985. the aim of the Appin workshop was once to target those points: patience and information kinds, and to collect humans from a variety of disciplines who've considered those difficulties. specific issues of"interest comprise the layout of variety structures applicable for database paintings, the illustration of chronic gadgets similar to facts kinds and modules, and the supply of orthogonal endurance and likely points of transactions and concurrency. The programme was once damaged into 3 periods: morning, past due afternoon and night to permit the members to use attractive days within the Scottish Highlands. The monetary tips of the technology and Engineering examine Council, the nationwide technology origin and overseas pcs Ltd. is gratefully said. we might additionally wish to thank Isabel Graham, Anne Donnelly and Estelle Taylor for his or her assist in establishing the workshop. ultimately our due to Pete Bailey, Ray Carick and Dave Munro for the big job they undertook in typesetting the publication. The convergence of programming languages and databases to a coherent and constant complete calls for rules from, and adjustment in, either highbrow camps. the 1st team of chapters during this e-book current rules and changes coming from the programming language study neighborhood. This neighborhood usually discusses forms and makes use of them as a framework for different discussions.

Show description

Read Online or Download Data Types and Persistence PDF

Best data modeling & design books

Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization

This publication constitutes a suite of study achievements mature sufficient to supply a company and trustworthy foundation on modular ontologies. It offers the reader an in depth research of the state-of-the-art of the examine zone and discusses the hot recommendations, theories and strategies for wisdom modularization.

Advances in Object-Oriented Data Modeling

Until eventually lately, info platforms were designed round varied enterprise services, reminiscent of bills payable and stock keep an eye on. Object-oriented modeling, by contrast, buildings structures round the data--the objects--that make up a number of the company capabilities. simply because information regarding a selected functionality is proscribed to 1 place--to the object--the procedure is protected from the results of switch.

Introduction To Database Management System

Designed particularly for a unmarried semester, first path on database platforms, there are four points that differentiate our booklet from the remainder. simplicity - more often than not, the expertise of database structures could be very obscure. There are

Extra info for Data Types and Persistence

Sample text

For example, to hide the representation of complex we could write let compTVPE = type() 1$ add, constr fro. 2 ) c = add( a,b) Using the normal algol scope rules, the definition and therefore the selectors on complex are hidden to the outside world. Only the primitive functions add and constr are exported. 1 Type matching One major problem that arises in any type system is the meaning of the equality of types. This problem is made more difficult when the language allows types to be stored and reused as is the case in Napier.

Each structure presents a welldefined interface to the others, and sharing is controlled by substructure bindings. Viewed statically, this appears to capture the idea of modular programming. But from the point of view of the dynamics of program development, we are lacking sufficient tools to create and modify such an arrangement of structures. For example, if we wish to modify the code of a function in the structure R above, then we need to recompile it and rebuild structures sand Q, using the same instance of R in both cases.

Suppose that the functor stored at H has the signature . Then the declaration of G succeeds only if 1) Signature SIGR is no more general than SIGR'; Signature SIG is at least as general as SIG'. 2) Note carefully the inversion between the two conditions. Recall that we say that a signature SIG is more general than SIG' if every structure that matches SIG' also matches SIG. An argument to the functor G must match the signature SIGR. If SIGR is no more general than SIGR', then any argument to G matches SIGR' as well, and hence is acceptable as an argument to the stored functor.

Download PDF sample

Rated 4.58 of 5 – based on 24 votes