{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:33Z","timestamp":1761610113493,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6784,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(04)00020-9","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T05:14:39Z","timestamp":1075353279000},"page":"334-354","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Types, Logic, and Semantics for Nested Databases"],"prefix":"10.1016","volume":"1","author":[{"given":"Achim","family":"Jung","sequence":"first","affiliation":[]},{"given":"Hermann","family":"Puhlmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB2","article-title":"Domain theory","volume":"volume 3","author":"Abramsky","year":"1995"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB3","doi-asserted-by":"crossref","unstructured":"V. Breazu-Tannen, P. Buneman, and L. Wong. Naturally embedded query languages. In J. Biskup and R. Hull, editors, Database Theory - ICDT'92, volume 646 of Lecture Notes in Computer Science, pages 140\u2013154. Springer Verlag, 1992","DOI":"10.1007\/3-540-56039-4_38"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(91)90266-5","article-title":"Using powerdomains to generalize relational databases","volume":"91","author":"Buneman","year":"1991","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB5","series-title":"Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics","first-page":"841","article-title":"15: Methods and Logics for Proving Program","author":"Cousot","year":"1990"},{"year":"1980","series-title":"A Compendium of Continuous Lattices","author":"Gierz","key":"10.1016\/S1571-0661(04)00020-9_NEWBIB6"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(92)90017-A","article-title":"The mixed power domain","volume":"103","author":"Gunter","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB8","doi-asserted-by":"crossref","unstructured":"K. H. Hofmann and M. Mislove. Local compactness and continuous lattices. In B. Banaschewski and R.-E. Hoffmann, editors, Continuous Lattices, Proceedings Bremen 1979, volume 871 of Lecture Notes in Mathematics, pages 209\u2013248. Springer Verlag, 1981.","DOI":"10.1007\/BFb0089908"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB9","unstructured":"P. T. Johnstone. Stone Spaces, volume 3 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1982."},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB10","doi-asserted-by":"crossref","unstructured":"A. Jung, L. Libkin, and H. Puhlmann. Decomposition of domains. Technical Report 1416, Technische Hochschule Darmstadt, 1991.","DOI":"10.1007\/3-540-55511-0_12"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB11","doi-asserted-by":"crossref","unstructured":"P. Kanellakis. Elements of relational database theory. In J. van Leeuwen editor, Handbook of Theoretical Computer Science, volume B, chapter 17, pages 1073\u20131156. Elsevier Science Publishers B.V., 1990","DOI":"10.1016\/B978-0-444-88074-1.50022-6"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB12","doi-asserted-by":"crossref","unstructured":"K. Keimel and J. Paseka. A direct proof of the Hofmann-Mislove theorem. Proceedings of the AMS, 120:301\u2013303, 1994.","DOI":"10.1090\/S0002-9939-1994-1195723-0"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB13","unstructured":"L. Libkin. A relational algebra for complex objects based on partial information. In J. Demetrovics and B. Thalheim, editors, Mathematical Fundamentals of Database Systems\u201391, volume 495 of Lecture Notes in Computer Science, pages 36\u201341. Springer-Verlag, 1991."},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB14","unstructured":"L. Libkin. Aspects of Partial Information in Databases. PhD thesis, University of Pennsylvania, 1994."},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB15","doi-asserted-by":"crossref","unstructured":"L. Libkin. Approximation in databases. In G. Gottlob and M. Vardi, editors, International Conference on Database Theory, volume 893 of Lecture Notes in Computer Science, pages 411\u2013424. Springer Verlag, 1995.","DOI":"10.1007\/3-540-58907-4_31"},{"year":"1983","series-title":"The Theory of Relational Databases","author":"Maier","key":"10.1016\/S1571-0661(04)00020-9_NEWBIB16"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB17","unstructured":"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."},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB18","unstructured":"H. Puhlmann. A Semantics for Generalized Database Relations. Master's thesis, Imperial College of Science, Technology and Medicine, London, 1991."},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB19","doi-asserted-by":"crossref","unstructured":"H. Puhlmann. The snack powerdomain for database semantics. In A. M. Borzyszkowski and S. Sokolowski, editors, Mathematical Foundations of Computer Science, volume 711 of Lecture Notes in Computer Science, pages 650\u2013659, 1993.","DOI":"10.1007\/3-540-57182-5_56"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB20","unstructured":"H. Puhlmann. How to nest and unnest relations without loosing information. Notes., 1994."},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0306-4379(86)90003-7","article-title":"The relational model with relation-valued attributes","volume":"11","author":"Schek","year":"1986","journal-title":"Information Systems"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB22","series-title":"Cambridge Tracts in Theoretical Computer Science","article-title":"Topology Via Logic","author":"Vickers","year":"1989"},{"key":"10.1016\/S1571-0661(04)00020-9_NEWBIB23","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0022-0000(84)90080-1","article-title":"Database relation with null values","volume":"28","author":"Zaniolo","year":"1984","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000209?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000209?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:03:34Z","timestamp":1761609814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104000209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":23,"alternative-id":["S1571066104000209"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00020-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Types, Logic, and Semantics for Nested Databases","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)00020-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}