Database Paper Browser

Back to papers

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
3855
Venue
SIGMOD
Year
2007
Pagerank
6.6902516e-05
Overall Rank
3,860 | 73.15%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
835 Finding Frequent Items in Data Streams 2008 VLDB 0.00016109621
2,272 Streams on Wires — A Query Compiler for FPGAs 2009 VLDB 9.1334837e-05
3,319 Sketching Linear Classifiers over Data Streams 2018 SIGMOD 7.226439e-05
6,041 FPGA: What's in it for a Database? 2009 SIGMOD 5.2407055e-05
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers