TT-Join: Efficient Set Containment Join
暂无分享,去创建一个
[1] Nikolaus Augsten,et al. An Empirical Evaluation of Set Similarity Join Techniques , 2016, Proc. VLDB Endow..
[2] Xuemin Lin,et al. Top-k Set Similarity Joins , 2009, 2009 IEEE 25th International Conference on Data Engineering.
[3] Roberto J. Bayardo,et al. Scaling up all pairs similarity search , 2007, WWW '07.
[4] Timos K. Sellis,et al. Efficient answering of set containment queries for skewed item distributions , 2011, EDBT/ICDT '11.
[5] Hector Garcia-Molina,et al. Adaptive algorithms for set containment joins , 2003, TODS.
[6] Sven Helmer,et al. PIEJoin: Towards Parallel Set Containment Joins , 2016, SSDBM.
[7] Sven Helmer,et al. Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates , 1996, VLDB.
[8] Renée J. Miller,et al. LSH Ensemble: Internet-Scale Domain Search , 2016, Proc. VLDB Endow..
[9] Hector Garcia-Molina,et al. Divide-and-Conquer Algorithm for Computing Set Containment Joins , 2002, EDBT.
[10] Guoliang Li,et al. An Efficient Partition Based Method for Exact Set Similarity Joins , 2015, Proc. VLDB Endow..
[11] Nikos Mamoulis,et al. Set containment join revisited , 2015, Knowledge and Information Systems.
[12] Jeffrey F. Naughton,et al. Set Containment Joins: The Good, The Bad and The Ugly , 2000, VLDB.
[13] Guoliang Li,et al. Can we beat the prefix filtering?: an adaptive framework for similarity join and search , 2012, SIGMOD Conference.
[14] Nikos Mamoulis,et al. Efficient processing of joins on set-valued attributes , 2003, SIGMOD '03.
[15] Vikram Pudi,et al. Using Prefix-Trees for Efficiently Computing Set Joins , 2005, DASFAA.
[16] Raghav Kaushik,et al. Efficient exact set-similarity joins , 2006, VLDB.
[17] Jiaheng Lu,et al. Efficient Merging and Filtering Algorithms for Approximate String Searches , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[18] Jan Hidders,et al. Efficient and scalable trie-based algorithms for computing set containment relations , 2015, 2015 IEEE 31st International Conference on Data Engineering.
[19] Cédric du Mouza,et al. Subscription indexes for web syndication systems , 2012, EDBT '12.
[20] Hector Garcia-Molina,et al. Index structures for selective dissemination of information under the Boolean model , 1994, TODS.
[21] Timos K. Sellis,et al. A combination of trie-trees and inverted files for the indexing of set-valued attributes , 2006, CIKM '06.
[22] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[23] Surajit Chaudhuri,et al. A Primitive Operator for Similarity Joins in Data Cleaning , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[24] Jeffrey Xu Yu,et al. Efficient similarity joins for near-duplicate detection , 2011, TODS.
[25] Parag Agrawal,et al. On indexing error-tolerant set containment , 2010, SIGMOD Conference.