Grand challenge: In-Memory indexation of event streams

Evaluating continuous queries in real-time while receiving events notifications requires a balanced exploitation of available resources. In this paper, we present our solution for aggregating events from social streams in memory. With the help of a compact representation of the data and relying on an efficient tree data structure, we were able to minimize the costs of the updates required when an event enters or leaves the current window which led to low and stable latencies and high throughput.