Streamable Regular Transductions

TL;DR

This paper develops a formal framework for real-time data stream processing using unambiguous Cost Register Automata, characterizing their expressive power, logical properties, and relation to weighted automata, with applications in monitoring and data analysis.

Contribution

It introduces streamable regular transductions via CRAs, provides logical characterizations, and connects CRAs to weighted automata, advancing the theoretical understanding of streaming data queries.

Findings

CRAs characterize streamable regular transductions.

Logical characterization of SR and SLR classes.

CRAs encompass weighted automata as a special case.

Abstract

Motivated by real-time monitoring and data processing applications, we develop a formal theory of quantitative queries for streaming data that can be evaluated efficiently. We consider the model of unambiguous Cost Register Automata (CRAs), which are machines that combine finite-state control (for identifying regular patterns) with a finite set of data registers (for computing numerical aggregates). The definition of CRAs is parameterized by the collection of numerical operations that can be applied to the registers. These machines give rise to the class of streamable regular transductions (SR), and to the class of streamable linear regular transductions (SLR) when the register updates are copyless, i.e. every register appears at most once the right-hand-side expressions of the updates. We give a logical characterization of the class SR (resp., SLR) using MSO-definable transformations from strings to DAGs (resp., trees) without backward edges. Additionally, we establish that the two classes SR and SLR are closed under operations that are relevant for designing query languages. Finally, we study the relationship with weighted automata (WA), and show that CRAs over a suitably chosen set of operations correspond to WA, thus establishing that WA are a special case of CRAs.