Dynamic count filters

SIGMOD Record

Volumn 35, Issue 1, 2006, Pages 26-32

  Aguilar Saborit, J ^a   Trancoso, P ^b   Muntes Mulero, V ^a   Larriba Pey, J L ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DYNAMICS;

COUNTING BLOOM FILTERS (CBF); DYNAMIC COUNT FILTERS (DCF); SPECTRAL BLOOM FILTERS (SBF);

DIGITAL FILTERS;

EID: 33644930557     PISSN: 01635808     EISSN: 01635808     Source Type: Journal    
DOI: 10.1145/1121995.1122000     Document Type: Article

References (12)

1. Burton H. Bloom. Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM, 13(7):422-426, 1970.
2. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and zipf-like distributions: Evidence and implications. In Proceedings of the IEEE Infocom Conference, 1999.
3. Andrei Broder and Michael Mitzenmacher. Network Applications of Bloom Filters: A survey. A survey. In Proc. of Allerton Conference, 2002.
4. Saar Cohen and Yossi Matias. Spectral bloom filters. SIGMOD '03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pages 241-252, 2003.
5. Sarang Dharmapurikar, Praveen Krishnamurthy, and David E. Taylor. Longest prefix matching using bloom filters. SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pages 201-212, 2003.
6. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area web cache sharing protocol. IEEE Trans on Networking, 8(3):281-293, 2000.
7. Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, and Jeffrey D. Ullman. Computing Iceberg Queries Efficiently. VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases, pages 299-310, 1998.
8. Jonathan Ledlie, Laura Serban, and Dafina Toncheva. Scaling filename queries in a large-scale distributed file systems. Research Report TR-03-02, Harvard University, January 2002.
9. G. Manku and R. Motwani. Approximate frequency counts over data streams. In Proceedings of the 28th International Conference on Very Large Data Bases, 2002.
10. James K. Mullin. A second look at bloom filters. Commun. ACM, 26(8):570-571, 1983.
11. M. V. Ramakrishna. Practical performance of Bloom filters and parallel free-text searching. Commun. ACM, 32(10):1237-1239, 1989.
12. Wei Wang, Haifeng Jiang, Hongjun Lu, and Jeffrey Xu Yu. Bloom histogram: Path selectivity estimation for xml data with updates. VLDB '04: Proceedings of the Thirtieth International Conference on Very Large Data Bases, pages 240-251, 2004.