Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/7846

Title: A theory of stream queries
Authors: Gurevich, Yuri
Issue Date: 2007
Publisher: Springer Berlin / Heidelberg
Citation: Database Programming Languages. p. 153-168
Series/Report: Lecture Notes in Computer Science, 4797
Abstract: Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predicates. Stream queries are modeled as functions from streams to streams. Both timed and untimed settings are considered. Issues investigated include abstract definitions of computability of stream queries; the connection between abstract computability, continuity, monotonicity, and non-blocking operators; and bounded memory computability of stream queries using abstract state machines (ASMs).
URI: http://hdl.handle.net/1942/7846
DOI: 10.1007/978-3-540-75987-4_11
ISI #: 000250804700011
ISBN: 978-3-540-75986-7
ISSN: 1611-3349
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version422.08 kBAdobe PDF

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