M.P. Atkinson. Programming Languages and Databases. VLDB Journal, pages 408--419, 1978.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....their co existence. e.g. JOS may be a reasonable choice for easy toimplement storage of small amounts of non critical data, whereas connections to relational databases are often an inevitable choice for legacy RDBs. Orthogonal Persistence, discussed in detail in Section 2.1. 1 was proposed by Atkinson in 1978 [Atk78] to provide seamless integration between the programming language and the storage mechanism, that renders unnecessary the need for a separate database system, along with the complexity such a separation introduces. The latter may include a schema modelling language, rules and restrictions ....

....e.g. JOS may be a reasonable choice for easy toimplement storage of small amounts of non critical data, whereas connections to relational databases are often an inevitable choice for legacy RDBs. Orthogonal Persistence, discussed in detail in Section 2.1. 1 was proposed by Atkinson in 1978 [Atk78] to provide seamless integration between the programming language and the storage mechanism, that renders unnecessary the need for a separate database system, along with the complexity such a separation introduces. The latter may include a schema modelling language, rules and restrictions that ....

[Article contains additional citation context not shown here]

M.P. Atkinson. Programming Languages and Databases. VLDB Journal, pages 408--419, 1978.

....closures or abstract data types. Thus, although there is some overlap, our investigation is into a quite different paradigm of typed internet data. 4. Orthogonal persistence 3.1. Persistence for Data intensive applications The concept of orthogonal persistence was identified by Atkinson [Atk78] whilst working on systems where general purpose programming was required over data stored in databases and file systems. The key observation is that data stored in these domains is available externally only in a flat file format, which causes a serious mismatch when it must be translated into a ....

Atkinson, M.P. "Programming Languages and Databases". In Proc. 4th IEEE International Conference on Very Large Databases (1978) pp 408-419.

....CHAPTER 1. INTRODUCTION 2 mands are preprocessed. As a consequence data has to be passed between these two languages. Since both languages might be semantically as well as structurally different, such transformations may lead to a loss of information. This problem is known as impedance mismatch [Atk78] Its avoidance is an essential motivation for the development of database programming languages (DBPLs) which attempt to integrate features from programming languages and databases. Early work on DBPLs has been surveyed [AB87] Essentially two different approaches have been employed : ffl the ....

M. P. Atkinson. Programming languages and databases. In S. B. Yao, editor, The 4th International Conference on Very Large Data Bases, pages 408--419, Berlin, West Germany, Sept. 1978.

....4LA, Scotland dave, al cs.stir.ac.uk 1.# Problems with Conventional Operating System support for Persistent Application Systems Over the past fifteen years much research effort has been expended in attempting to build systems which provide orthogonal persistence. The idea behind persistence [5] is simple: all data in a system should be able to persist (survive) for as long as that data is required. Orthogonal persistence means that all data may be persistent and that data may be manipulated in a uniform manner regardless of the length of time it persists. In this sense, persistent ....

M.P. Atkinson. "Programming Languages and Databases", in Proceedings of Fourth IEEE International Conference on Very Large Databases, pp. 408 - 419, 1978.

....attempts to provide flexible architectures that permit persistence to be provided efficiently above the operating system. KEY WORDS: persistent systems, operating systems, persistent operating systems, micro kernels, exokernels 1. INTRODUCTION The first systems supporting orthogonal persistence [5] were programming language systems constructed in the early 1980s. These systems realised two ideals: that all data should be able to persist (survive) for as long as that data was required and that all data was manipulated in a uniform manner regardless of the length of time for which it ....

M.P. Atkinson "Programming Languages and Databases", in Proceedings of Fourth IEEE International Conference on Very Large Databases, pp. 408 - 419, 1978.

....[ABC83] Before a value of such a type may be usefully manipulated, a dynamic type check is necessary. 1.2 Persistence 1.2. 1 Motivation The initial motivation for building persistent languages arose from the difficulties of storing and restoring data structures arising in CAD CAM research [Atk78]. Complex mappings had to be constructed between complex program data structures and database systems. These mappings were observed to have a number of costs: they were entirely extraneous to the required computation on the data, thus obscuring code and confusing programmers . they were not ....

....persistent systems. First, a short synopsis of the research upon which the thesis is based, and some more which may derive from the topics in it, will be given. 6.1 Related work 6.1. 1 Past The persistence of data was first identified as being orthogonal to its other attributes by Atkinson in [Atk78]. After some attempts to provide persistence in other languages, S algol [Mor82] was identified as a suitable candidate and the first implementation of PS algol, the first persistent language, was completed in 1980 [ACC81] Napier, a language based on PS algol but with a much richer type system, ....

M.P. Atkinson "Programming Languages and Databases" Proc. 4th International Conference on Very Large Data Bases, Berlin In S.P. Yao (editor), IEEE ( September 1978 ) pp 408 - 419

....objects, a capability system also protects the capabilities. This is necessary to prevent erroneous programs modifying capabilities or manufacturing their own. 1. 3 PS algol and the CPOMS The concept of persistence arose from work on integrating programming languages with database systems[atk78]. As part of this research, persistence was added to the programming language S algol[mor82] requiring solutions to be found for each of the five problems described above. The resulting programming language, PS algol[atk83c] was developed to test the hypothesis that persistence could be added to ....

Atkinson M.P. Programming Languages and Databases. Proc. Fourth IEEE International Conference on Very Large Databases, 1978, pp408-419.

....Therefore, the programmer is faced with the task of mapping data onto long term storage which is usually provided by the file system or DBMS. The mapping of data between long and short term 2 storage is expensive, both in terms of programmer design time and program run time. In 1978, Atkinson [2] recognised this problem and isolated a property of data known as persistence. Persistent programming is a relatively new paradigm that makes data intensive application programming significantly easier. The idea behind persistence is a simple one: data in a system should be able to persist ....

Atkinson, M. P. "Programming Languages and Databases", Fourth IEEE International Conference on Very Large Databases, IEEE, pp. 408 - 419, 1978.

....) that reads the string in a file and converts it into a number. When getbal is first called it will return the number currently stored in a file. Even if the contents of the file are changed it will continue to return the same value. CHAPTER 3. RELATED WORK 16 3.1. 3 Persistence Persistence [7] seems to offer a solution to the problem of long term data storage in functional languages. Atkinson observed that in most existing languages only certain data structures may be permanently stored. Much of the effort in writing programs that manipulate permanent data is expended in unpacking the ....

....completeness, of list comprehensions is proved. Database and programming language theories are further integrated by describing the relational calculus in a programming language semantics. 8. 1 Introduction There is a great deal of interest in unifying databases with programming languages [1, 2, 7, 12]. Any database programming language must incorporate a query notation. Any well integrated database programming language must have a consistent theoretical basis. The work described in this Chapter contributes towards unifying database and programming language theory. The database theory used is ....

Atkinson M.P. Programming Languages and Databases. Proceedings of the 4th International Conference on Very Large Databases (1978), 408419. BIBLIOGRAPHY 191

.... database) environment (Sj berg 1993a) Another thesaurus tool was thereafter built in the research context of the strongly typed, persistent programming language Napier88 (Morrison et al. 1989) The concept of persistence tackles the mismatch between database systems and programming languages (Atkinson 1978); a uniform model for representations and operations on persistent and transient data is provided. Some of the features of the thesaurus tools are: structure and dependency visualisation, impact analysis, and . automatic build management, including smart recompilation. In large application ....

Atkinson, M.P. (1978). "Programming Languages and Databases". In: Fourth International Conference on Very Large Data Bases, Berlin, West Germany, 13th--15th September 1978, IEEE and ACM, pp. 408--419.

....between the stable virtual memory and non volatile store. The combination of the stable virtual memory and the non volatile storage layers is often referred to as the stable store. 1.6 Related Work 1.6. 1 Persistence The concept of persistence can be traced back to investigations by Atkinson [Atk78] into the integration of databases and programming languages. This led on to the production of the persistent language PS algol [ACC81] which essentially added persistence to the S algol [Mor79] programming language. The PS algol persistent store has been implemented by several systems, including: ....

Atkinson, M.P. "Programming Languages and Databases". Proc. 4th IEEE International Conference on Very Large Databases, 1978 pp 408-419.

....type. Therefore, the programmer is faced with the task of mapping data onto long term storage; this is usually provided by the file system or DBMS. The mapping of data between long and short term storage is expensive, both in terms of programmer design time and program run time. In 1978, Atkinson [atk78] recognised this problem and isolated a property of data known as persistence. Persistence is defined to be the length of time for which data exists and is usable [atk83] It is therefore an abstraction over a physical property of data; the length of time it is kept. Traditionally, programming ....

Atkinson M.P. Programming Languages and Databases. Proc VLDB pp 408419 (1978).

....the implementation language, not the constructed application s language. For the same reasons the application language need not be able to link components to locations The ability to share strongly typed locations across compilation units is not shared by many languages. In a persistent system [Atk78] such locations may be held in a persistent store. A single persistent language and type system may be used both for the implementation of applications and the implementation of the architecture that supports their construction. This section describes an implementation of the architecture using ....

M.P. Atkinson "Programming Languages and Databases" In Proc. Very Large Databases, (1978) pp 408 - 419.

....Fachbereich Mathematik, Technische Hochschule Darmstadt, D 6100 Darmstadt, FRG as generalizations of the relational data model. The second is to try to draw out the connection between data models and data types, something that is crucial if we are to achieve a proper integration of databases [4, 5, 39] and programming languages. The main focus of this paper is the first of these. There are a number of attempts to generalize the relational data model beyond first normal form relations [17, 36, 32] there are also numerous formulations of other data models [1, 18, 7, 19] that at first sight ....

M. P. Atkinson. Programming languages and databases. In S. B. Yao, editor, The fourth international conference on Very Large Data Bases, Berlin, West Germany, pages 408--419, IEEE & ACM, September 1978.

....of Glasgow, Glasgow, Scotland. Email: fdaw,trinderg csd.glasgow.ac.uk Note: This is an extended version of a paper submitted for publication. 1 Introduction Several database programming languages (DBPLs) are emerging that enable dataintensive applications to be created with greater ease [1, 3, 6, 10, 11, 12, 13]. In order to represent and manipulate large amounts of data, a DBPL must support one or more bulk types. Values of a bulk type are large and typically variable sized. Examples of bulk types are lists, sets, relations, and finite mappings. Most conventional database management systems and some ....

....no obvious order amongst people. In contrast, the places visited on a tour are most naturally modelled by a list: a place may be visited twice, and the order of visits is important. In order to model application domains more naturally, therefore, some DBPLs permit the use of different bulk types [3, 10, 11]. Unfortunately, supporting several bulk types may complicate the language because there must be a means of declaring, constructing, inspecting, and updating instances of each type. The problem is exacerbated in languages, such as those with orthogonal persistence, that permit the programmer to ....

[Article contains additional citation context not shown here]

Atkinson, M.P. Programming Languages and Databases. Proceedings of the 4th International Conference on Very Large Databases (1978), 408--419.

....ffl data structure flattening or pickling , ffl use of relational and object databases, and ffl use of database programming languages and persistent programming languages. The original notion (and meaning) of the term persistence, was conceived by Atkinson in the late 1970 s. In (Atkinson 1978), Atkinson argued that the task of mapping data between short and long term representations in a conventional system is expensive in both computer resources and programmer effort. He postulated an alternative approach to programming in which data values can transparently persist between ....

Atkinson, M. P. (1978). Programming languages and database. In Proceedings 4th Internatinal Conference on Very Large Databases, pp. 408-- 419. IEEE.

....Model in a Persistent Programming Environment The Structured Persistent Application System Model (SPASM) is an example of a tailored constraint model defined in a persistent programming environment. The concept of persistence tackles the mismatch between database systems and programming languages [2, 12]; a uniform model for representations and operations on persistent and transient data is provided. Tools, programs and data may reside in the same store. Many of the benefits of persistent language technology have been described in the literature [3, 5, 6] SPASM is couched in terms of the ....

Atkinson, M.P. "Programming Languages and Databases". In: Fourth International Conference on Very Large Data Bases (Berlin, West Germany, 13th--15th September, 1978), Yao, S.B. (editor), pp. 408--419, IEEE and ACM, 1978.

....and Computational Sciences, University of St Andrews, North Haugh, St Andrews KY16 9SS, Scotland ron dcs.st andrews.ac. uk Keywords: orthogonal persistence, persistent programming languages, database programming languages, persistent application systems This paper should be referenced as: Atkinson, M.P. Morrison, R. Orthogonally Persistent Object Systems . VLDB Journal 4, 3 (1995) pp 319 401. 2 ABSTRACT Persistent Application Systems (PASs) are of increasing social and economic importance. They have the potential to be long lived, concurrently accessed and consist of large bodies of data ....

....the designers of orthogonally persistent object systems to propose and support computational models that allow large scale and long lived computation without these unnecessary sources of complexity. It transpires that, in many cases, the inconsistent treatments are not fundamental but accidental [Atkinson, 1978]. The various subsystems were built at different times 5 when the engineering trade offs were different. In consequence, they provide virtually the same services, but inconsistently as they were designed and developed independently. By choosing to provide the total composition of services ....

[Article contains additional citation context not shown here]

Atkinson, M.P., 1978. Programming Languages and Databases. In Proc. 4th IEEE International Conference on Very Large Databases pp 408-419.

....tool in an industrial context were valuable, but the provision for integration and longevity makes persistent programming technology a more suitable platform for research into software environments. The concept of persistence tackles the mismatch between database systems and programming languages [2]; a uniform model for representations and operations on persistent and transient data is provided. Tools, programs and data may reside in the same store. Many of the benefits of persistent language technology have been described in the literature [4, 5, 3] In particular, it has been argued that a ....

M.P. Atkinson. "Programming Languages and Databases". In Proceedings of the Fourth International Conference on Very Large Data Bases (Berlin, West Germany, 13th--15th September 1978), S.B. Yao (editors), pp. 408--419, IEEE and ACM, 1978.

....variants; and ffl they facilitate communication among a system s designers, builders and users via related textual and diagrammatic representations. The programming languages have supported a model of reference and identity and seen it as an important modelling tool for many years [ Hoare, 1975; Atkinson, 1978 ] They have had a concern for specifying the relationship between code and data, for example, in Fortran subprograms and in modules in many languages. Higher order languages 1 , languages with modules and languages with abstract data types all provide a means of describing a static ....

M.P. Atkinson. Programming languages and databases. In S.B. Yao, editor, The Fourth International Conference on Very Large Data Bases (Berlin, West Germany, September 1978), pages 408--419, September 1978.

....cannot cope with all the data and or all the processing needed, and because ownership of data must respect autonomy and users are geographically distributed. An inter process communication mechanism is needed to connect these components across a wide area network. Persistent programming languages [Atk78, ABC 83, AM95] integrate those features traditionally delegated to a database management system into the programming language itself. This significantly simplifies the construction of long lived applications with complex data and algorithms. In order to allow application programmers to write ....

....and so throughout the rest of the paper we use passing parameters to denote both activities. 2. 1 Persistent Programming Languages We aspire to support the construction of distributed persistent applications written in a certain class of orthogonally persistent programming languages [Atk78, ABC 83, AM95] We choose these languages based on their long term potential and because virtually all other languages can then be supported by the same mechanism. The properties of persistent languages that are most relevant to this paper are summarised below. Orthogonal Persistence Objects ....

M.P. Atkinson. Programming languages and databases. In S.B. Yao, editor, The Fourth International Conference on Very Large Data Bases (Berlin, West Germany, September 1978), pages 408--419, September 1978.

No context found.

M. Atkinson: "Programming Languages and Databases", in: Proc. 4th Intern. Conf. on Very Large Data Bases (VLDB), Berlin, 1978, 408-419

No context found.

M. P. Atkinson, Programming Languages and Databases. VLDB Journal, pages 408-419, 1978.

No context found.

M. P. Atkinson, Programming Languages and Databases. In Proceedings of the 4th IEEE

No context found.

Atkinson, M.P. "Programming Languages and Databases". In Proc. 4th IEEE International Conference on Very Large Databases (1978) pp 408-419.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC