
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yu Hua, Bin Xiao, Bharadwaj Veeravalli, Dan Feng, "LocalitySensitive Bloom Filter for Approximate Membership Query," IEEE Transactions on Computers, vol. 61, no. 6, pp. 817830, June, 2012.  
BibTex  x  
@article{ 10.1109/TC.2011.108, author = {Yu Hua and Bin Xiao and Bharadwaj Veeravalli and Dan Feng}, title = {LocalitySensitive Bloom Filter for Approximate Membership Query}, journal ={IEEE Transactions on Computers}, volume = {61}, number = {6}, issn = {00189340}, year = {2012}, pages = {817830}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2011.108}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  LocalitySensitive Bloom Filter for Approximate Membership Query IS  6 SN  00189340 SP817 EP830 EPD  817830 A1  Yu Hua, A1  Bin Xiao, A1  Bharadwaj Veeravalli, A1  Dan Feng, PY  2012 KW  Approximate membership query KW  bloom filters KW  locality sensitive hashing. VL  61 JA  IEEE Transactions on Computers ER   
[1] L. Carter, R. Floyd, J. Gill, G. Markowsky, and M. Wegman, “Exact and Approximate Membership Testers,” Proc. 10th Ann. ACM Symp. Theory of Computing (STOC '78), pp. 5965, 1978.
[2] Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, “MultiProbe LSH: Efficient Indexing for HighDimensional Similarity Search,” Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 950961, 2007.
[3] F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese, “Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines,” Proc. ACM SIGCOMM, 2006.
[4] Y. Zhu and H. Jiang, “False Rate Analysis of Bloom Filter Replicas in Distributed Systems,” Proc. Int'l Conf. Parallel Processing (ICPP '06), pp. 255262, 2006.
[5] W. Chang Feng, D.D. Kandlur, D. Saha, and K.G. Shin, “Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness,” Proc. IEEE INFOCOM, 2001.
[6] F.M. CuencaAcuna, C. Peery, R.P. Martin, and T.D. Nguyen, “PlantP: Using Gossiping to Build Content Addressable PeertoPeer Information Sharing Communities,” Proc. IEEE 12th Int'l Symp. High Performance Distributed Computing, 2003.
[7] A. Pagh, R. Pagh, and S. Rao, “An Optimal Bloom Filter Replacement,” Proc. 16th Ann. ACMSIAM Symp. Discrete Algorithms (SODA '05), pp. 823829, 2005.
[8] S. Dharmapurikar, P. Krishnamurthy, and D.E. Taylor, “Longest Prefix Matching Using Bloom Filters,” Proc. ACM SIGCOMM, pp. 201212, 2003.
[9] A. Broder and M. Mitzenmacher, “Using Multiple Hash Functions to Improve IP Lookups,” Proc. IEEE INFOCOM, pp. 14541463, 2001.
[10] F. Baboescu and G. Varghese, “Scalable Packet Classification,” IEEE/ACM Trans. Networking, vol. 13, no. 1, pp. 214, Feb. 2005.
[11] P. Indyk and R. Motwani, “Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality,” Proc. 13th Ann. ACM Symp. Theory of Computing (STOC '98), pp. 604613, 1998.
[12] A. Kirsch and M. Mitzenmacher, “DistanceSensitive Bloom Filters,” Proc. Eighth Workshop Algorithm Eng. and Experiments (ALENEX), 2006.
[13] A. Andoni and P. Indyk, “NearOptimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions,” Comm. ACM, vol. 51, no. 1, pp. 117122, 2008.
[14] L. Fan, P. Cao, J. Almeida, and A. Broder, “Summary Cache: A Scalable WideArea Web Cache Sharing Protocol,” IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 281293, June 2000.
[15] M. Mitzenmacher, “Compressed Bloom Filters,” IEEE/ACM Trans. Networking, vol. 10, no. 5, pp. 604612, Oct. 2002.
[16] Y. Hua, Y. Zhu, H. Jiang, D. Feng, and L. Tian, “Scalable and Adaptive Metadata Management in Ultra Largescale File Systems,” Proc. 28th Int'l Conf. Distributed Computing Systems (ICDCS '08), pp. 403410, 2008.
[17] A. Kumar, J.J. Xu, J. Wang, O. Spatschek, and L.E. Li, “SpaceCode Bloom Filter for Efficient PerFlow Traffic Measurement,” Proc. IEEE INFOCOM, pp. 17621773, 2004.
[18] C. Saar and M. Yossi, “Spectral Bloom Filters,” Proc. ACM SIGMOD Int'l Conf. Management data , pp. 241252, 2003.
[19] D. Guo, J. Wu, H. Chen, and X. Luo, “Theory and Network Application of Dynamic Bloom Filters,” Proc. IEEE INFOCOM, 2006.
[20] B. Xiao and Y. Hua, “Using Parallel Bloom Filters for MultiAttribute Representation on Network Services,” IEEE Trans. Parallel and Distributed Systems, vol. 21, no. 1, pp. 2032, Jan. 2010.
[21] H. Song, F. Hao, M. Kodialam, and T.V. Lakshman, “IPv6 Lookups Using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards,” Proc. IEEE INFOCOM, 2009.
[22] F. Hao, M. Kodialam, T.V. Lakshman, and H. Song, “Fast Multiset Membership Testing Using Combinatorial Bloom Filters,” Proc. IEEE INFOCOM, 2009.
[23] F. Hao, M. Kodialam, and T.V. Lakshman, “Incremental Bloom Filters,” Proc. IEEE INFOCOM, pp. 17411749, 2008.
[24] A. Broder and M. Mitzenmacher, “Network Applications of Bloom Filters: A Survey,” Internet Math., vol. 1, pp. 485509, 2005.
[25] A. Joly and O. Buisson, “A Posteriori MultiProbe Locality Sensitive Hashing,” Proc. ACM Multimedia, 2008.
[26] Y. Hua, B. Xiao, D. Feng, and B. Yu, “Bounded LSH for Similarity Search in PeertoPeer File Systems,” Proc. Int'l Conf. Parallel Processing, pp. 644651, 2008.
[27] M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni, “LocalitySensitive Hashing Scheme Based on pStable Distributions,” Proc. Ann. Symp. Computational Geometry, pp. 253262, 2004.
[28] A. Andoni, M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni, “LocalitySensitive Hashing Using Stable Distributions,” Nearest Neighbor Methods in Learning and Vision: Theory and Practice, T. Darrell and P. Indyk and G. Shakhnarovich, eds., MIT Press, 2006.
[29] M. Charikar, “Similarity Estimation Techniques from Rounding Algorithms,” Proc. 34th Ann. ACM Symp. Theory of Computing (STOC '02), pp. 380388, 2002.
[30] N. Agrawal, W. Bolosky, J. Douceur, and J. Lorch, “A FiveYear Study of FileSystem Metadata,” Proc. Fifth USENIX Conf. File and Storage Technologies (FAST), 2007.
[31] The Forest CoverType data set, “UCI Machine Learning Repository,” http://archive.ics.uci.edu/ml/data setsCovertype , 2011.
[32] S. Kavalanekar, B. Worthington, Q. Zhang, and V. Sharda, “Characterization of Storage Workload Traces from Production Windows Servers,” Proc. IEEE Int'l Symp. Workload Characterization (IISWC), 2008.
[33] Y. Hua, H. Jiang, Y. Zhu, D. Feng, and L. Tian, “SmartStore: A New Metadata Organization Paradigm with SemanticAwareness for NextGeneration File Systems,” Proc. ACM/IEEE Supercomputing Conf. (SC), 2009.
[34] Y. Tao, K. Yi, C. Sheng, and P. Kalnis, “Quality and Efficiency in HighDimensional Nearest Neighbor Search,” Proc. 35th SIGMOD Int'l Conf. Management of Data (SIGMOD '09), 2009.
[35] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '84), pp. 4757, 1984.
[36] A. Gionis, P. Indyk, and R. Motwani, “Similarity Search in High Dimensions via Hashing,” Proc. 25th Int'l Conf. Very Large Data Bases (VLDB '99), pp. 518529, 1999.
[37] A. Leung, I. Adams, and E.L. Miller, “Magellan: A Searchable Metadata Architecture for LargeScale File Systems,” Technical Report UCSCSSRC0907, Univ. of California, Nov. 2009.
[38] V. Athitsos, M. Potamias, P. Papapetrou, and G. Kollios, “Nearest Neighbor Retrieval Using DistanceBased Hashing,” Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE), 2008.
[39] Y. Hua, Y. Zhu, H. Jiang, D. Feng, and L. Tian, “Supporting Scalable and Adaptive Metadata Management in Ultra LargeScale File Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 4, pp. 580593, Apr. 2011.
[40] J. Bruck, J. Gao, and A. Jiang, “Weighted Bloom Filter,” Proc. IEEE Int'l Symp. Information Theory, pp. 23042308, 2006.
[41] M. Zhong, P. Lu, K. Shen, and J. Seiferas, “Optimizing Data Popularity Conscious Bloom Filters,” Proc. 27th ACM Symp. Principles of Distributed Computing (PODC '08), 2008.
[42] F. Hao, M. Kodialam, and T. Lakshman, “Building High Accuracy Bloom Filters Using Partitioned Hashing,” Proc. ACM SIGMETRICS Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '07), pp. 277288, 2007.
[43] B. Donnet, B. Baynat, and T. Friedman, “Retouched Bloom Filters: Allowing Networked Applications to Trade off Selected False Positives Against False Negatives,” Proc. ACM CoNEXT Conf., 2006.