Upsortable: Programming Top-K Queries Over Data Streams. Subercaze, J., Gravier, C., Gillani, S., & Kammoun, A. Proceedings of the VLDB Endowment, 2017.
Upsortable: Programming Top-K Queries Over Data Streams [pdf]Paper  abstract   bibtex   
Top-k queries over data streams is a well studied problem. There exists numerous systems allowing to process contin- uous queries over sliding windows. At the opposite, non- append only streams call for ad-hoc solutions, e.g. tailor- made solutions implemented in a mainstream programming language. In the meantime, the Stream API and lambda expressions have been added in Java 8, thus gaining pow- erful operations for data stream processing. However, the Java Collections Framework does not provide data struc- tures to safely and conveniently support sorted collections of evolving data. In this paper, we demonstrate Upsortable, an annotation-based approach that allows to use existing sorted collections from the standard Java API for dynamic data management. Our approach relies on a combination of pre-compilation abstract syntax tree modifications and runtime analysis of bytecode. Upsortable offers the devel- oper a safe and time-efficient solution for developing top-k queries on data streams while keeping a full compatibility with standard Java.

Downloads: 0