Cardinality computing: a new step towards fully representing multi-sets by bloom filters

Authors:
Jiakui Zhao;Dongqing Yang;Lijun Chen;Jun Gao;Tengjiao Wang
Affiliations:
School of EECS, Peking University, Beijing, China;School of EECS, Peking University, Beijing, China;School of EECS, Peking University, Beijing, China;School of EECS, Peking University, Beijing, China;School of EECS, Peking University, Beijing, China
Venue:
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Year:
2006

Citing 10
Cited 0

Probabilistic counting algorithms for data base applications

Journal of Computer and System Sciences
Summary cache: a scalable wide-area Web cache sharing protocol

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Tables of maximally equidistributed combined LFSR generators

Mathematics of Computation
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Spectral bloom filters

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Tracking set-expression cardinalities over continuous update streams

The VLDB Journal — The International Journal on Very Large Data Bases
Duplicate detection in click streams

WWW '05 Proceedings of the 14th international conference on World Wide Web
Join-distinct aggregate estimation over update streams

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximately detecting duplicates for streaming data using stable bloom filters

Proceedings of the 2006 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bloom Filters are space and time efficient randomized data structures for representing (multi-)sets with certain allowable errors, and are widely used in many applications. Previous works on Bloom Filters considered how to support insertions, deletions, membership queries, and multiplicity queries over (multi-)sets. In this paper, we introduce two novel algorithms for computing cardinalities of multi-sets represented by Bloom Filters, which extend the functionality of the Bloom Filter and thus make it usable in a variety of new applications. The Bloom structure presented in the previous work is used without any modification, and our algorithms have no influence to previous functionality. For Bloom Filters support cardinality computing in addition to insertions, deletions, membership queries, and multiplicity queries simultaneously, our work is a new step towards fully representing multi-sets by Bloom Filters. Performance analysis and experimental results show the difference of the two algorithms and show that our algorithms perform well in most cases.