Abstract
This chapter outlines a formal and foundational treatment of stream processing from the word perspective where stream processing and stream queries are modelled as functions mapping (finite or infinite( words to words. The main relevant aspects of streams—potential infinity, ubiquity, and ordering/recency—are taken into account in order to give an axiomatic characterisation of various natural classes of stream functions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Özçep, Ö.L. (2019). Representation Theorems for Stream Processing. In: Representation Theorems in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-25785-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-25785-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25784-2
Online ISBN: 978-3-030-25785-9
eBook Packages: Computer ScienceComputer Science (R0)