Please use this identifier to cite or link to this item:
|Title:||Semi-determinism||Authors:||VAN DEN BUSSCHE, Jan
van Gucht, Dirk
|Issue Date:||1992||Publisher:||s.l. ACM Press 1992||Source:||Proceedings of the 11th ACM Symposium on Principles of Database Systems. p. 191-201||Abstract:||We 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.||Document URI:||http://hdl.handle.net/1942/5470||Link to publication:||http://doi.acm.org/10.1145/137097.137866||Type:||Journal Contribution|
|Appears in Collections:||Research publications|
Show full item record
checked on May 18, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.