The snack powerdomain for database semantics

  • Hermann Puhlmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 711)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Bancilhon and S. Khoshafian. A calculus for complex objects. In Proceedings of the 5th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, pages 53–59, Cambridge, Massachusetts, March 1986.Google Scholar
  2. 2.
    P. Buneman, S. Davidson, and A. Watters. A semantics for complex objects and approximate queries. Technical Report MS-CIS-87-99, University of Pennsylvania, November 1988.Google Scholar
  3. 3.
    P. Buneman, A. Jung, and A. Ohori. Using powerdomains to generalize relational databases. Theoretical Computer Science, 91:23–55, 1991.Google Scholar
  4. 4.
    Carl A. Gunter. The mixed powerdomain. Theoretical Computer Science, 103(2):311–334, September 1992.Google Scholar
  5. 5.
    Carl A. Gunter. Semantics of Programming Languages. Structures and Techniques. MIT Press, 1992.Google Scholar
  6. 6.
    A. Jung. Cartesian Closed Categories of Domains, volume 66 of CWI Tracts. Centrum voor Wiskunde en Informatica, Amsterdam, 1989.Google Scholar
  7. 7.
    Teow-Hin Ngair. Convex Spaces as an Order-theoretic Basis for Problem Solving. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, July 1992.Google Scholar
  8. 8.
    J. Płonka. On distributive quasi-lattices. Fundamenta Mathematicae, 60:191–200, 1967.Google Scholar
  9. 9.
    G. D. Plotkin. Post-graduate lecture notes in advanced domain theory (incorporating the“ Pisa Notes”). Dept. of Computer Science, Univ. of Edinburgh, 1981.Google Scholar
  10. 10.
    A. Romanowska. On bisemilattices with one distributive law. Algebra Universalis, 10:36–47, 1980.Google Scholar
  11. 11.
    Yannis Vassiliou. Null values in data base management: A denotational semantics approach. In Proceedings of the ACM SIGMOD Int. Conf. Management of Data, Boston, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Hermann Puhlmann
    • 1
  1. 1.Fachbereich MathematikTechnische Hochschule DarmstadtDarmstadtGermany

Personalised recommendations