Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube

Paul Beame, Cyrus Rashtchian

Type: Preprint

Publication Date: 2017-01-01

Citations: 3

DOI: https://doi.org/10.1137/1.9781611974782.19

Locations

arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Massively-parallel similarity join, edge-isoperimetry, and distance correlations on the hypercube	2017	Paul Beame Cyrus Rashtchian
+	Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube	2016	Paul Beame Cyrus Rashtchian
+ PDF Chat	On the Complexity of Inner Product Similarity Join	2016	Thomas D. Ahle Rasmus Pagh Ilya Razenshteyn Francesco Silvestri
+	Dimension independent similarity computation	2013	Reza Bosagh Zadeh Ashish Goel
+	Dimension Independent Similarity Computation	2012	Reza Bosagh Zadeh Ashish Goel
+	Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search	2019	Thomas D. Ahle Jakob Bæk Tejs Knudsen
+	Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search	2019	Thomas D. Ahle Jakob Bæk Tejs Knudsen
+ PDF Chat	Distance-Sensitive Hashing	2018	Martin Aumüller Tobias Christiani Rasmus Pagh Francesco Silvestri
+	A Faster Algorithm for Finding Closest Pairs in Hamming Metric	2021	Andre Esser Robert Kübler Floyd Zweydinger
+	A Faster Algorithm for Finding Closest Pairs in Hamming Metric	2021	André Esser Robert Kübler Floyd Zweydinger
+ PDF Chat	Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search	2020	Thomas D. Ahle Jakob Bæk Tejs Knudsen
+	A Faster Algorithm for Finding Closest Pairs in Hamming Metric.	2021	Andre Esser Robert Kübler Floyd Zweydinger
+ PDF Chat	Set Similarity Search for Skewed Data	2018	Samuel McCauley Jesper W. Mikkelsen Rasmus Pagh
+ PDF Chat	I/O-Efficient Similarity Join	2017	Rasmus Pagh Ninh Pham Francesco Silvestri Morten Stöckel
+ PDF Chat	I/O-Efficient Similarity Join	2015	Rasmus Pagh Ninh Pham Francesco Silvestri Morten Stöckel
+	Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search	2019	Thomas D. Ahle
+	Set Similarity Search for Skewed Data	2018	Samuel McCauley Jesper W. Mikkelsen Rasmus Pagh
+	Communication Cost in Parallel Query Processing	2016	Paul Beame Paraschos Koutris Dan Suciu
+ PDF Chat	LSF-Join: Locality Sensitive Filtering for Distributed All-Pairs Set Similarity Under Skew	2020	Cyrus Rashtchian Aneesh Sharma David P. Woodruff
+	LSF-Join: Locality Sensitive Filtering for Distributed All-Pairs Set Similarity Under Skew	2020	Cyrus Rashtchian Aneesh Sharma David P. Woodruff

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Edge Isoperimetric Inequalities for Powers of the Hypercube	2022	Cyrus Rashtchian William Raynaud

Works Cited by This (13)

Action	Title	Year	Authors
+ PDF Chat	Probabilistic Polynomials and Hamming Nearest Neighbors	2015	Josh Alman Ryan Williams
+	High Speed Hashing for Integers and Strings	2015	Mikkel Thorup
+	A new bound on partial sum-sets and difference-sets, and applications to the Kakeya conjecture	1999	Nets Hawk Katz Terence Tao
+ PDF Chat	Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)	2014	Ryan O’Donnell Yi Wu Yuan Zhou
+ PDF Chat	Concentration Inequalities and Martingale Inequalities: A Survey	2006	Fan Chung Linyuan Lü
+	Lower bounds by probabilistic arguments	1983	Andrew Chi-Chih Yao
+	A correlation inequality for bipartite graphs	1993	Alexander Sidorenko
+	Non-averaging Subsets and Non-vanishing Transversals	1999	Noga Alon Imre Z. Ruzsa
+	Covering and packing for pairs	2013	Yeow Meng Chee Charles J. Colbourn Alan C. H. Ling Richard M. Wilson
+ PDF Chat	Upper and lower bounds on the cost of a map-reduce computation	2013	Anish Das Sarma Foto Afrati Semih Salihoğlu Jeffrey D. Ullman