Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/5470
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.contributor.authorvan Gucht, Dirk-
dc.date.accessioned2007-12-20T15:59:03Z-
dc.date.available2007-12-20T15:59:03Z-
dc.date.issued1992-
dc.identifier.citationProceedings of the 11th ACM Symposium on Principles of Database Systems. p. 191-201-
dc.identifier.urihttp://hdl.handle.net/1942/5470-
dc.description.abstractWe investigate under which conditions a non-deterministic query is semi-deterministic, meaning that two different results of the query to a database are isomorphic. We also consider uniform semi-determinism, meaning that all intermediate results of the computation are isomorphic. Semi-determinism is a concept bridging the new trends of non-determinism and object generation in database query languages. Our results concern decidability, both at compile time and at run time; expressibility of the infamous counting queries; and completeness, which is related to the issue of copy elimination raised by Abiteboul and Kannelakis.-
dc.language.isoen-
dc.publishers.l. ACM Press 1992-
dc.titleSemi-determinism-
dc.typeJournal Contribution-
dc.identifier.epage201-
dc.identifier.spage191-
dc.bibliographicCitation.oldjcat-
dc.identifier.urlhttp://doi.acm.org/10.1145/137097.137866-
item.fulltextNo Fulltext-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorvan Gucht, Dirk-
item.fullcitationVAN DEN BUSSCHE, Jan & van Gucht, Dirk (1992) Semi-determinism. In: Proceedings of the 11th ACM Symposium on Principles of Database Systems. p. 191-201.-
item.accessRightsClosed Access-
Appears in Collections:Research publications
Show simple item record

Google ScholarTM

Check


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