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
LEINDERS, Dirk 
VAN DEN BUSSCHE, Jan 
Issue Date: 2007
Publisher: Springer Berlin / Heidelberg
Source: Database Programming Languages. p. 153-168
Series/Report: Lecture Notes in Computer Science
Series/Report no.: 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).
Document URI: http://hdl.handle.net/1942/7846
ISBN: 978-3-540-75986-7
DOI: 10.1007/978-3-540-75987-4_11
ISI #: 000250804700011
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
GLV07.pdfPublished version422.08 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

16
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

10
checked on May 13, 2022

Page view(s)

12
checked on May 15, 2022

Download(s)

12
checked on May 15, 2022

Google ScholarTM

Check

Altmetric


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