TCAM-conscious Algorithms for Data Streams
Bandi, N.
Metwally, A.
Agrawal, D.
El Abbadi, A.
Dept. of Comput. Sci., California Univ., Santa Barbara, CA;
This paper appears in: Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on
Publication Date: 15-20 April 2007
On page(s): 1342-1344
Location: Istanbul,
ISBN: 1-4244-0803-2
INSPEC Accession Number: 9551795
Digital Object Identifier: 10.1109/ICDE.2007.369007
Current Version Published: 2007-06-04
Abstract
There has been significant interest in developing space and time efficient solutions for answering continuous summarization queries over data streams. While these techniques are evaluated in a standard CPU setting, many of their applications such as click-fraud detection, and network-traffic summarization typically execute on special networking architectures called network processing units (NPUs). These NPUs interface with special kind of associative memories known as the ternary content addressable memories (TCAMs). In this paper, we describe how the integrated architecture of NPU and TCAMs can be exploited towards achieving the goal of developing high-speed stream summarization solutions. We analyze popular solutions for the frequent elements problem in data stream, discuss the bottleneck issues and motivate how TCAMs can help alleviate these bottlenecks. A preliminary evaluation on an NPU platform reveals the performance gains of the TCAM-conscious techniques over software implementations.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
