Distance-sensitive bloom filters

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 41-50

  Kirsch, Adam ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DATABASE SYSTEMS; METRIC SYSTEM; PROBLEM SOLVING; SENSITIVITY ANALYSIS;

BLOOM FILTERS; DESIGNING GENERALIZATIONS; HAMMING METRIC; LOCALITY-SENSITIVE HASH FUNCTIONS;

DATA STRUCTURES;

EID: 33646839129     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972863.4     Document Type: Conference Paper

References (16)

1. A. Andoni, M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-sensitive hashing using stable distributions. To appear in Nearest Neighbor Methods in Learning and Vision: Theory and Practice, MIT Press.
2. A. Broder and M. Mitzenmacher. Network Applications of Bloom Filters: A Survey. Internet Mathematics, 1(4):485-509, 2004.
3. N. Jain, M. Dahlin, and R. Tewari. Using Bloom filters to refine web search results. In Proc. of the Eighth International Workshop on the Web and Databases (WebDB2005), 2005.
4. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Proc. of the 20th ACM Symposium on Computational Geometry, pp. 253-262, 2004.
5. A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing. In Proc. of the 25th International Conference on Very Large Data Bases, pp. 518-529, 1999.
6. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653-750, 1998.
7. P. Indyk. Approximate nearest neighbor under edit distance via product metrics. In Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 646-650, 2004.
8. U. Manber and S. Wu. An algorithm for approximate membership checking with applications to password security. Information Processing Letters, 50(4):191-197, 1994.
9. M. Mitzenmacher. Compressed Bloom Filters. IEEE/ACM Transactions on Networking, 10(5):613-620, 2002.
10. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
11. R. Ostrovsky and Y. Rabani. Low distortion embeddings for edit distance. In Proc. of the 37th Annual ACM Symposium on Theory of Computing, 218-224, 2005.
12. A. Pagh, R. Pagh, and S. Srinivas Rao. An Optimal Bloom Filter Replacement. In Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 823-829, 2005.
13. M. Parnas, D. Ron, and R. Rubinfeld. Tolerant property testing and distance approximation. ECCC Report No. 10, 2004.
14. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
15. K. Shanmugasundaram, H. Brunnimann, and N. Memon. Payload attribution via hierarchical Bloom filters. In Proc. of the 11th ACM Conference on Computer and Communications Security, pp. 31-41, 2004.
16. A. Snoeren, C. Partridge, L. Sanchez, C. Jones, F. Tchakountio, B. Schwartz, S. Kent, and W. Strayer. Single-Packet IP Traceback. IEEE/ACM Transactions on Networking, 10(6):721-734, 2002.