Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/27729
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings
Author(s): Connor, Richard
Dearie, Alan
Morrison, Ronald
Brown, Fred
Contact Email: richard.connor@stir.ac.uk
Title: Existentially quantified types as a database viewing mechanism
Editor(s): Bancilhon, François
Thanos, Constantino
Tsichritzis, Dennis
Citation: Connor R, Dearie A, Morrison R & Brown F (1990) Existentially quantified types as a database viewing mechanism. In: Bancilhon F, Thanos C & Tsichritzis D (eds.) Advances in Database Technology: EDBT '90 International Conference on Extending Database Technology Venice, Italy, March 26–30, 1990 Proceedingsvolume 416 LNCS. Lecture Notes in Computer Science, 416. Advances in Database Technology: EDBT '90 International Conference on Extending Database Technology, Venice, 26.03.1990-30.03.1990. Berlin Heidelberg: Springer Verlag, pp. 301-315. https://doi.org/10.1007/BFb0022178
Issue Date: 31-Dec-1990
Series/Report no.: Lecture Notes in Computer Science, 416
Conference Name: Advances in Database Technology: EDBT '90 International Conference on Extending Database Technology
Conference Dates: 1990-03-26 - 1990-03-30
Conference Location: Venice
Abstract: In database management systems, viewing mechanisms have been used to provide conceptual support for the user and security for the overall system. By controlling the style of database use, views aid the user by concentrating on the area of interest, and the system by ensuring the integrity of the data. In recent years, there have been a number of proposals for database or persistent programming languages. Such languages must be able to provide the facilities traditionally found in both database management systems and programming languages. In this paper we demonstrate how a persistent programming language, Napier88, can provide a viewing mechanism over persistent data by using existentially quantified types. The views, which may be generated dynamically, are statically type checked. The technique shown is applicable to any language which supports existentially quantified data types and a persistent store.
Status: VoR - Version of Record
Rights: The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.

Files in This Item:
File Description SizeFormat 
Connor et al 1990.pdfFulltext - Published Version1.11 MBAdobe PDFUnder Permanent Embargo    Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.



This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.