Upsortable: Programming Top-K Queries Over Data Streams - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Upsortable: Programming Top-K Queries Over Data Streams

Résumé

Top-k queries over data streams is a well studied problem. There exists numerous systems allowing to process continuous 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 powerful operations for data stream processing. However, the Java Collections Framework does not provide data structures to safely and convienently 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 precompilation abstract syntax tree modifications and runtime analysis of bytecode. Upsortable offer the developer a safe and time-efficient solution for developing top-k queries on data streams while keeping a full compatibility with standard Java.
Fichier principal
Vignette du fichier
vldb2017.pdf (411.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01518606 , version 1 (05-05-2017)

Identifiants

  • HAL Id : hal-01518606 , version 1

Citer

Julien Subercaze, Christophe Gravier, Syed Gillani, Abderrahmen Kammoun, Frédérique Laforest. Upsortable: Programming Top-K Queries Over Data Streams. 43rd International Conference on Very Large Data Bases, Aug 2017, Munich, Germany. ⟨hal-01518606⟩
71 Consultations
121 Téléchargements

Partager

Gmail Facebook X LinkedIn More