Worst-case Optimal Binary Join Algorithms under General ℓ_p Constraints

Worst-case optimal join algorithms have so far been studied in two broad contexts – (1) when we are given input relation sizes [Atserias et al., FOCS 2008, Ngo et al., PODS 2012, Velduizhen et. al, ICDT 2014] (2) when in addition to size, we are given a degree bound on the relation [Abo Khamis et al., PODS 2017]. To the best of our knowledge, this problem has not been studied beyond these two statistics even for the case when input relations have arity (at most) two. In this paper, we present a worst-case optimal join algorithm when are given ℓ_p-norm size bounds on input relations of arity at most two for p ∈ (1, 2]. (p=1 corresponds to relation size bounds and p=∞ corresponds to the degree bounds.) The worst-case optimality holds any fixed p ∈ (2, ∞) as well (as long as the join query graph has large enough girth). Our algorithm is simple, does not depend on p (or) the ℓ_p-norm bounds and avoids the (large) poly-log factor associated with the best known algorithm PANDA [Abo Khamis et al., PODS 2017] for the size and degree bounds setting of the problem. In this process, we (partially) resolve two open question from [Ngo, 2018 Gems of PODS]. We believe our algorithm has the potential to pave the way for practical worst-case optimal join algorithms beyond the case of size bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/29/2019

Worst-Case Optimal Radix Triejoin

Relatively recently, the field of join processing has been swayed by the...
research
06/21/2018

Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?

Motivated by crowdsourced computation, peer-grading, and recommendation ...
research
08/28/2018

Implementation Notes for the Soft Cosine Measure

The standard bag-of-words vector space model (VSM) is efficient, and ubi...
research
09/26/2019

Box Covers and Domain Orderings for Beyond Worst-Case Join Processing

Recent beyond worst-case optimal join algorithms Minesweeper and its gen...
research
04/16/2018

Adaptive MapReduce Similarity Joins

Similarity joins are a fundamental database operation. Given data sets S...
research
05/10/2020

Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting

We consider the problem of finding a solution to a multivariate polynomi...
research
04/09/2020

Composable Sketches for Functions of Frequencies: Beyond the Worst Case

Recently there has been increased interest in using machine learning tec...

Please sign up or login with your details

Forgot password? Click here to reset