DocumentCode :
3324338
Title :
Efficient Aggregate Computation over Data Streams
Author :
Nagaraj, Kanthi ; Naidu, K.V.M. ; Rastogi, Rajeev ; Satkin, Scott
Author_Institution :
Bell Labs. Res. India, Bangalore
fYear :
2008
fDate :
7-12 April 2008
Firstpage :
1382
Lastpage :
1384
Abstract :
Cisco´s NetFlow collector (NFC) is a powerful example of a real-world product that supports multiple aggregate queries over a continuous stream of IP flow records. NFC enables a plethora of network management tasks like traffic demands estimation, application traffic profiling, etc. In this paper, we investigate two computation sharing techniques for enabling streaming applications such as NFC to scale to hundreds of queries. Our first technique instantiates certain intermediate aggregates which are then used to generate the final answers for input queries. Our second technique coalesces the filter conditions of similar queries and uses the coalesced filter to pre-filter stream data input to these queries. Using these techniques, we propose a heuristic to compute a good query plan and perform extensive simulations to show that our heuristic delivers a factor of over 3 performance improvement compared to a naive approach.
Keywords :
IP networks; computation theory; computer network management; query processing; IP flow records; NetFlow collector; computation sharing techniques; data streams; multiple aggregate queries; network management tasks; Aggregates; Computational modeling; Computer network management; Costs; Filters; IP networks; Scalability; Statistics; Telecommunication traffic; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on
Conference_Location :
Cancun
Print_ISBN :
978-1-4244-1836-7
Electronic_ISBN :
978-1-4244-1837-4
Type :
conf
DOI :
10.1109/ICDE.2008.4497563
Filename :
4497563
Link To Document :
بازگشت