Fast Data Stream Algorithms using Associative Memories

Summary: Leverages the integrated NPU-TCAM architecture to accelerate data stream summarization at gigabit rates. Proposes two TCAM-conscious algorithms for the frequent elements problem and evaluates them on a state-of-the-art networking platform. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 3917
Venue: SIGMOD
Year: 2007
Pagerank: 6.9643802e-05
Overall Rank: 4,005 | 72.53%
DOI: 10.1145/1247480.1247510

Incoming Non-self Citations Over Time

Authors

1. Nagender Bandi (University of California Santa Barbara)
2. Ahmed Metwally (University of California Santa Barbara)
3. Divyakant Agrawal (University of California Santa Barbara)
4. Amr El Abbadi (University of California Santa Barbara)

BibTeX Citation

@inproceedings{bandi_sigmod07,
        title = {{Fast Data Stream Algorithms using Associative Memories}},
        author = {Bandi, Nagender and Metwally, Ahmed and Agrawal, Divyakant and Abbadi, Amr El},
        series = {{SIGMOD} '07},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1247480.1247510},
        url = {https://dl.acm.org/doi/10.1145/1247480.1247510},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
885	Finding Frequent Items in Data Streams	2008	VLDB	0.00013419017
2,181	Streams on Wires — A Query Compiler for FPGAs	2009	VLDB	9.0101847e-05
3,445	Sketching Linear Classifiers over Data Streams	2018	SIGMOD	7.4089141e-05
6,040	FPGA: What's in it for a Database?	2009	SIGMOD	5.9977597e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
82	Space-Efficient Online Computation of Quantile Summaries	2001	SIGMOD	0.00036378991
111	TelegraphCQ: Continuous Dataflow Processing for an Uncertain World	2003	CIDR	0.00032990214
122	Approximate Frequency Counts over Data Streams	2002	VLDB	0.00031260115
150	Query Processing, Resource Management, and Approximation in a Data Stream Management System	2003	CIDR	0.00029208207
230	Gigascope: A Stream Database for Network Applications	2003	SIGMOD	0.00023891474
261	Approximate Medians and other Quantiles in One Pass and with Limited Memory	1998	SIGMOD	0.00023097188
838	What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically	2003	PODS	0.0001370404

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,815	Sketching Unaggregated Data Streams for Subpopulation-Size Queries	2007	PODS
2	11,123	Streaming Algorithms with Few State Changes	2024	PODS
3	12,755	Using Association Rules for Fraud Detection in Web Advertising Networks	2005	VLDB
4	6,597	Similarity Search and Locality Sensitive Hashing using Ternary Content Addressable Memories	2010	SIGMOD
5	4,683	False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams	2004	VLDB
6	122	Approximate Frequency Counts over Data Streams	2002	VLDB
7	3,197	Processing Set Expressions over Continuous Update Streams	2003	SIGMOD
8	11,638	Frequent Elements with Witnesses in Data Streams	2021	PODS
9	8,603	Stream Frequency over Interval Queries	2019	VLDB
10	885	Finding Frequent Items in Data Streams	2008	VLDB