1 Hit in 1.6 sec

Covering the Relational Join [article]

Shi Li and Sai Vikneshwar Mani Jayaraman and Atri Rudra
2020 arXiv   pre-print
We prove lower bounds for |T_Q, Δ| using well-known classes of error-correcting codes e.g, Reed-Solomon codes.  ...  Somewhat surprisingly, this approach is not tight even for the case when the input relations have arity at most two.  ...  SVMJ thanks MSR for hospitality, where a part of this work was done.  ... 
arXiv:2003.09537v1 fatcat:47gthdfjrjf5blxln3bwscvzsu