Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/6790
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.contributor.authorvan Gucht, Dirk-
dc.contributor.authorAndries, Marc-
dc.contributor.authorGYSSENS, Marc-
dc.date.accessioned2007-12-20T16:10:35Z-
dc.date.available2007-12-20T16:10:35Z-
dc.date.issued1992-
dc.identifier.citationProceedings of the 33rd Annual Symposium on Foundations of Computer Science. p. 372-379-
dc.identifier.urihttp://hdl.handle.net/1942/6790-
dc.description.abstractRecently, various database query languages have been considered that have the ability to create new domain elements. These languages, however, are not complete in the sense of Abiteboul and Kanellakis (1989). They provide a precise characterization for the class of queries that can be expressed in these languages. They call this class the constructive queries and motivate this term by establishing a close correspondence between object creation and the construction of hereditarily finite sets.-
dc.language.isoen-
dc.publishers.l. IEEE Computer Society Press 1992-
dc.titleOn the completeness of object-creating query languages-
dc.typeJournal Contribution-
dc.identifier.epage379-
dc.identifier.spage372-
dc.bibliographicCitation.oldjcat-
dc.identifier.doi10.1109/SFCS.1992.267753-
item.fulltextNo Fulltext-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorvan Gucht, Dirk-
item.contributorAndries, Marc-
item.contributorGYSSENS, Marc-
item.fullcitationVAN DEN BUSSCHE, Jan; van Gucht, Dirk; Andries, Marc & GYSSENS, Marc (1992) On the completeness of object-creating query languages. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. p. 372-379.-
item.accessRightsClosed Access-
Appears in Collections:Research publications
Show simple item record

Google ScholarTM

Check

Altmetric


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