Efficiently Summarizing Data Streams over Sliding Windows

Estimating the frequency of any piece of information in large-scale distributed data streams became of utmost importance in the last decade (e.g., in the context of network monitoring, big data, etc.). If some elegant solutions have been proposed recently, their approximation is computed from the in...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2015 IEEE 14th International Symposium on Network Computing and Applications S. 151 - 158
Hauptverfasser:	Rivetti, Nicolo, Busnel, Yann, Mostefaoui, Achour
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.09.2015
Schlagworte:	Approximation methods Complexity theory Computational modeling Data models data stream Estimation Frequency estimation Monitoring randomized approximation algorithm windowing model
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!