GreedyDual-Join: Locality-Aware Buffer Management for Approximate Join Processing Over Data StreamsReportar como inadecuado


GreedyDual-Join: Locality-Aware Buffer Management for Approximate Join Processing Over Data Streams


GreedyDual-Join: Locality-Aware Buffer Management for Approximate Join Processing Over Data Streams - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract

We investigate adaptive buffer management techniques for approximate evaluation of sliding window joins over multiple data streams. In many applications, data stream processing systems have limited memory or have to deal with very high speed data streams. In both cases, computing the exact results of joins between these streams may not be feasible, mainly because the buffers used to compute the joins contain much smaller number of tuples than the tuples contained in the sliding windows. Therefore, a stream buffer management policy is needed in that case. We show that the buffer replacement policy is an important determinant of the quality of the produced results. To that end, we propose GreedyDual-Join GDJ an adaptive and locality-aware buffering technique for managing these buffers. GDJ exploits the temporal correlations at both long and short time scales, which we found to be prevalent in many real data streams. We note that our algorithm is readily applicable to multiple data streams and multiple joins and requires almost no additional system resources. We report results of an experimental study using both synthetic and real-world data sets. Our results demonstrate the superiority and flexibility of our approach when contrasted to other recently proposed techniques.

CAS: Computer Science: Technical Reports -



Autor: Chang, Ching - Li, Feifei - Bestavros, Azer - Kollios - -

Fuente: https://open.bu.edu/







Documentos relacionados