A cache architecture for counting bloom filters: theory and application

DOI10.1155/2011/475865zbMATH Open1237.68033DBLPjournals/jece/AhmadiW11OpenAlexW2109584844WikidataQ58690666 ScholiaQ58690666MaRDI QIDQ415792FDOQ415792

Authors: Mahmood Ahmadi, Stephan Wong 

Publication date: 9 May 2012

Published in: Journal of Electrical and Computer Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2011/475865

Recommendations

• Cache-, hash-, and space-efficient bloom filters
• Compressed Bloom filters
• An Improved Construction for Counting Bloom Filters
• Improving counting Bloom filter performance with fingerprints
• Network Applications of Bloom Filters: A Survey

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Network Applications of Bloom Filters: A Survey

Cited In (6)

• Title not available (Why is that?)
• An index-split Bloom filter for deep packet inspection
• Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
• CLAMP: efficient class-based sampling for flexible flow monitoring
• Improving counting Bloom filter performance with fingerprints
• Filter Data Cache: An Energy-Efficient Small L0 Data Cache Architecture Driven byMiss Cost Reduction

This page was built for publication: A cache architecture for counting bloom filters: theory and application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415792)