Fast data stream algorithms using associative memories

Nagender Bandi, Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Citations (Scopus)

Abstract

The primary goal of data stream research is to develop space and time efficient solutions for answering continuous on-line summarization queries. Research efforts over the last decade have resulted in a number of efficient algorithms with varying degrees of space and time complexities. While these techniques are developed 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 associative memories known as Ternary Content Addressable Memories (TCAMs) to provide gigabit rate forwarding at network routers. 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 propose two TCAM-conscious solutions for the frequent elements problem in data streams and present a comprehensive evaluation of these techniques on a state-of-the-art networking platform.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGMOD International Conference on Management of Data
Pages247-256
Number of pages10
DOIs
Publication statusPublished - 30 Oct 2007
Externally publishedYes
EventSIGMOD 2007: ACM SIGMOD International Conference on Management of Data - Beijing, China
Duration: 12 Jun 200714 Jun 2007

Other

OtherSIGMOD 2007: ACM SIGMOD International Conference on Management of Data
CountryChina
CityBeijing
Period12/6/0714/6/07

Fingerprint

Associative storage
Data storage equipment
Processing
Computer networks
Network architecture
Routers
Interfaces (computer)
Program processors

Keywords

  • Data streams
  • Hardware
  • TCAMS

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Bandi, N., Metwally, A., Agrawal, D., & El Abbadi, A. (2007). Fast data stream algorithms using associative memories. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 247-256) https://doi.org/10.1145/1247480.1247510

Fast data stream algorithms using associative memories. / Bandi, Nagender; Metwally, Ahmed; Agrawal, Divyakant; El Abbadi, Amr.

Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007. p. 247-256.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bandi, N, Metwally, A, Agrawal, D & El Abbadi, A 2007, Fast data stream algorithms using associative memories. in Proceedings of the ACM SIGMOD International Conference on Management of Data. pp. 247-256, SIGMOD 2007: ACM SIGMOD International Conference on Management of Data, Beijing, China, 12/6/07. https://doi.org/10.1145/1247480.1247510
Bandi N, Metwally A, Agrawal D, El Abbadi A. Fast data stream algorithms using associative memories. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007. p. 247-256 https://doi.org/10.1145/1247480.1247510
Bandi, Nagender ; Metwally, Ahmed ; Agrawal, Divyakant ; El Abbadi, Amr. / Fast data stream algorithms using associative memories. Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007. pp. 247-256
@inproceedings{bb67212345694c4880a39125740f379a,
title = "Fast data stream algorithms using associative memories",
abstract = "The primary goal of data stream research is to develop space and time efficient solutions for answering continuous on-line summarization queries. Research efforts over the last decade have resulted in a number of efficient algorithms with varying degrees of space and time complexities. While these techniques are developed 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 associative memories known as Ternary Content Addressable Memories (TCAMs) to provide gigabit rate forwarding at network routers. 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 propose two TCAM-conscious solutions for the frequent elements problem in data streams and present a comprehensive evaluation of these techniques on a state-of-the-art networking platform.",
keywords = "Data streams, Hardware, TCAMS",
author = "Nagender Bandi and Ahmed Metwally and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2007",
month = "10",
day = "30",
doi = "10.1145/1247480.1247510",
language = "English",
isbn = "1595936866",
pages = "247--256",
booktitle = "Proceedings of the ACM SIGMOD International Conference on Management of Data",

}

TY - GEN

T1 - Fast data stream algorithms using associative memories

AU - Bandi, Nagender

AU - Metwally, Ahmed

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2007/10/30

Y1 - 2007/10/30

N2 - The primary goal of data stream research is to develop space and time efficient solutions for answering continuous on-line summarization queries. Research efforts over the last decade have resulted in a number of efficient algorithms with varying degrees of space and time complexities. While these techniques are developed 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 associative memories known as Ternary Content Addressable Memories (TCAMs) to provide gigabit rate forwarding at network routers. 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 propose two TCAM-conscious solutions for the frequent elements problem in data streams and present a comprehensive evaluation of these techniques on a state-of-the-art networking platform.

AB - The primary goal of data stream research is to develop space and time efficient solutions for answering continuous on-line summarization queries. Research efforts over the last decade have resulted in a number of efficient algorithms with varying degrees of space and time complexities. While these techniques are developed 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 associative memories known as Ternary Content Addressable Memories (TCAMs) to provide gigabit rate forwarding at network routers. 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 propose two TCAM-conscious solutions for the frequent elements problem in data streams and present a comprehensive evaluation of these techniques on a state-of-the-art networking platform.

KW - Data streams

KW - Hardware

KW - TCAMS

UR - http://www.scopus.com/inward/record.url?scp=35449003310&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35449003310&partnerID=8YFLogxK

U2 - 10.1145/1247480.1247510

DO - 10.1145/1247480.1247510

M3 - Conference contribution

SN - 1595936866

SN - 9781595936868

SP - 247

EP - 256

BT - Proceedings of the ACM SIGMOD International Conference on Management of Data

ER -