A Generic Method for Accelerating LSH-Based Similarity Join Processing
暂无分享,去创建一个
Cong Wang | Xingliang Yuan | Sarana Nutanong | Chenyun Yu | Hangyu Li | Xingliang Yuan | Sarana Nutanong | Chenyun Yu | Cong Wang | Hangyu Li
[1] Jeremy Buhler,et al. Provably sensitive Indexing strategies for biosequence similarity search , 2002, RECOMB '02.
[2] Andrei Z. Broder. Min-wise Independent Permutations: Theory and Practice , 2000, ICALP.
[3] Ning Zhang,et al. On approximation algorithms of k-connected m-dominating sets in disk graphs , 2007, Theor. Comput. Sci..
[4] Xuemin Lin,et al. SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index , 2014, Proc. VLDB Endow..
[5] N. Perry,et al. Book Reviews : Introduction to Mathematical Statistics (2nd Ed.), by Paul G. Hoel. New York: John Wiley and Sons, Inc., I954. Pp. xi + 33I. $5.00 , 1955 .
[6] Hanan Samet,et al. Metric space similarity joins , 2008, TODS.
[7] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[8] Bernhard Seeger,et al. GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces , 2001, KDD '01.
[9] Christian Böhm,et al. Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data , 2001, SIGMOD '01.
[10] Luis Gravano,et al. Approximate String Joins in a Database (Almost) for Free , 2001, VLDB.
[11] Qiang Huang,et al. Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search , 2015, Proc. VLDB Endow..
[12] Nicole Immorlica,et al. Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.
[13] R. A. Fox,et al. Introduction to Mathematical Statistics , 1947 .
[14] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[15] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.
[16] Din J. Wasem,et al. Mining of Massive Datasets , 2014 .
[17] Jianliang Xu,et al. Geo-Social K-Cover Group queries for collaborative spatial computing , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).
[18] Lijun Chang,et al. Diversified top-k clique search , 2015, The VLDB Journal.
[19] Pavel Zezula,et al. Similarity Join in Metric Spaces Using eD-Index , 2003, DEXA.
[20] Hans-Peter Kriegel,et al. Efficient processing of spatial joins using R-trees , 1993, SIGMOD Conference.
[21] Rina Panigrahy,et al. Entropy based nearest neighbor search in high dimensions , 2005, SODA '06.
[22] Wilfred Ng,et al. Locality-sensitive hashing scheme based on dynamic collision counting , 2012, SIGMOD Conference.
[23] Jianliang Xu,et al. Geo-Social K-Cover Group Queries for Collaborative Spatial Computing , 2015, IEEE Transactions on Knowledge and Data Engineering.
[24] Mikhail Kapralov. Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search , 2015, PODS.
[25] Jeffrey Xu Yu,et al. Diversifying Top-K Results , 2012, Proc. VLDB Endow..
[26] Zhe Wang,et al. Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search , 2007, VLDB.
[27] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[28] Evaggelia Pitoura,et al. DisC diversity: result diversification based on dissimilarity and coverage , 2012, Proc. VLDB Endow..
[29] Tatiana A. Tatusova,et al. NCBI Reference Sequences (RefSeq): current status, new features and genome annotation policy , 2011, Nucleic Acids Res..
[30] Panos Kalnis,et al. Efficient and accurate nearest neighbor and closest pair search in high-dimensional space , 2010, TODS.
[31] Kai Li,et al. Efficient k-nearest neighbor graph construction for generic similarity measures , 2011, WWW.
[32] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[33] Magnús M. Halldórsson,et al. Approximating the Minimum Maximal Independence Number , 1993, Inf. Process. Lett..