Paper Info
Title
The Snack Powerdomain for Database Semantics
Abstract
Recently the use of domain theory for a semantics of databases has been proposed. To model set-valued structures in this framework, a powerdomain construction will be needed. As an appropriate construction a modification of the recently introduced snack powerdomain is investigated and shown to be a free algebra. Moreover, the construction preserves bounded completeness. A slight modification of the snack powerdomain yields the scone powerdomain which, additionally, is distributive. Both constructions promise to bear fruit in the domain theoretic approach to database semantics.
Year
DOI
Venue
1993
10.1007/3-540-57182-5_56
MFCS
Keywords
Field
DocType
snack powerdomain,database semantics,domain theory,free algebra
Discrete mathematics,Distributive property,Computer science,Domain theory,Completeness (statistics),Semantics,Free algebra,Database,Bounded function
Conference
ISBN
Citations 
PageRank 
3-540-57182-5
7
1.60
References 
Authors
7
1
Name
Order
Citations
PageRank
Hermann Puhlmann15514.33