Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/7299
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGYSSENS, Marc-
dc.contributor.authorSuciu, D.-
dc.contributor.authorvan Gucht, D.-
dc.date.accessioned2007-12-20T16:14:53Z-
dc.date.available2007-12-20T16:14:53Z-
dc.date.issued1996-
dc.identifier.citationDatabase programming languages (DBPL-95): proceedings of the 5th international workshop on database programming languages, Gubbio, Umbria, Italy, 6-8 september 1995.-
dc.identifier.urihttp://hdl.handle.net/1942/7299-
dc.publisherBerlin Springer 1996-
dc.titleThe restricted and the bounded fixpoint closures of the nested relational algebra are equivalent-
dc.typeProceedings Paper-
local.type.specifiedProceedings Paper-
dc.bibliographicCitation.oldjcat-
local.bibliographicCitation.btitleDatabase programming languages (DBPL-95): proceedings of the 5th international workshop on database programming languages, Gubbio, Umbria, Italy, 6-8 september 1995-
item.fullcitationGYSSENS, Marc; Suciu, D. & van Gucht, D. (1996) The restricted and the bounded fixpoint closures of the nested relational algebra are equivalent. In: Database programming languages (DBPL-95): proceedings of the 5th international workshop on database programming languages, Gubbio, Umbria, Italy, 6-8 september 1995..-
item.contributorGYSSENS, Marc-
item.contributorSuciu, D.-
item.contributorvan Gucht, D.-
item.fulltextNo Fulltext-
item.accessRightsClosed Access-
Appears in Collections:Research publications
Show simple item record

Page view(s)

76
checked on Nov 1, 2023

Google ScholarTM

Check


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