Highest-performance Stream Processing

11/24/2022
by   Oleg Kiselyov, et al.
0

We present the stream processing library that achieves the highest performance of existing OCaml streaming libraries, attaining the speed and memory efficiency of hand-written state machines. It supports finite and infinite streams with the familiar declarative interface, of any combination of map, filter, take(while), drop(while), zip, flatmap combinators and tupling. Experienced users may use the lower-level interface of stateful streams and implement accumulating maps, compression and windowing. The library is based on assured code generation (at present, of OCaml and C) and guarantees in all cases complete fusion.

READ FULL TEXT

page 1

page 2

page 3

research
07/15/2021

The Art of the Meta Stream Protocol: Torrents of Streams

The rise of streaming libraries such as Akka Stream, Reactive Extensions...
research
12/20/2018

Property-based testing for Spark Streaming

Stream processing has reached the mainstream in the last years, as a new...
research
07/26/2019

Lazy Stream Programming in Prolog

In recent years, stream processing has become a prominent approach for i...
research
02/18/2020

Managing multiple data streams in R

It is often useful to tap secondary information from a running R script....
research
09/01/2023

Laminar: A New Serverless Stream-based Framework with Semantic Code Search and Code Completion

This paper introduces Laminar, a novel serverless framework based on dis...
research
02/20/2023

Profiling and Optimizing Java Streams

The Stream API was added in Java 8 to allow the declarative expression o...
research
07/31/2021

Enhanced Regular Corecursion for Data Streams

We propose a simple calculus for processing data streams (infinite flows...

Please sign up or login with your details

Forgot password? Click here to reset