Types, Logic, and Semantics for Nested Databases

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

This work presents first steps towards a denotational semantics for relational databases. It is argued that such a semantics will increase the chances of successfully incorporating relational databases into typed programming languages. Database relations are seen as sets of data of a common structure. The main problem therefore is to model a type of sets. We propose the snack powerdomain for this purpose. Technically, the paper attempts to clarify two aspects of the domain theoretic background of this approach. We give a localic description of the snack powerdomain construction which reveals its logical simplicity. Second, we study a subdomain relation between Scott-domains on the denotational and the logical level. Again, the logical version is simple and intuitive. Such a relation is indispensable for introducing database operations such as 'natural join'. © 2000.

Cite

CITATION STYLE

APA

Jung, A., & Puhlmann, H. (1995). Types, Logic, and Semantics for Nested Databases. Electronic Notes in Theoretical Computer Science, 1(C), 334–354. https://doi.org/10.1016/S1571-0661(04)00020-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free