Adaptive algorithms for set containment joins

By Sergey Melnik, Hector Garcia-Molina. 2003

78 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Algorithms & Complexity, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Ping Li
2. Anshumali Shrivastava
3. Arvind Arasu
4. Raghav Kaushik
5. Parag Agrawal
6. Venkatesh Ganti
7. Sunita Sarawagi
8. Alok Kirpal

In Computer Networks and Communications

1. Raghav Kaushik
2. Arvind Arasu
3. Ping Li
4. Anshumali Shrivastava
5. Venkatesh Ganti
6. Parag Agrawal
7. Sunita Sarawagi
8. Alok Kirpal

In Algorithms & Complexity

1. Anshumali Shrivastava
2. Ping Li
3. Sunita Sarawagi
4. Alok Kirpal
5. Raghav Kaushik
6. Arvind Arasu
7. Parag Agrawal
8. Behnam Neyshabur

In Signal Processing

1. Anshumali Shrivastava
2. Ping Li
3. Raghav Kaushik
4. Arvind Arasu
5. Venkatesh Ganti
6. Parag Agrawal
7. Sunita Sarawagi
8. Alok Kirpal

Citations in the corpus

• Asymmetric Minwise Hashing (2014, methodology): “Owing to its practical significance, there have been many existing heuristics for solving the MIPS (or MCS) problem [30, 33, 12].”
• Efficient set joins on similarity predicates (2004, methodology): “The optimizations used in our al­gorithm generalize to several weighted and unweighted mea­sures of partial word overlap between sets.”
• Efficient exact set-similarity joins (2006, background): “9 . we can verify that I 1 = [1 , 1] , I 8 = [8 , 8] , I 9 = [9 , 10] , I 13 = [17 , 18] , and I 14 = [19 , 21] .”
• Asymmetric Minwise Hashing for Indexing Binary Inner Products and Set Containment (2015, methodology): “3 Shortcomings of Inverted Index Based Approaches for MIPS (and MCS) Owing to its practical significance, there have been many existing heuristics for solving the MIPS (or MCS) problem [31, 34, 12].”
• On indexing error-tolerant set containment (2010, background): “We note that Jac-card containment is a generalization of exact set containment which has been studied extensively in prior work [11, 24, 25, 28].”