Sai Vikneshwar Mani Jayaraman

activity

20182021

most citedTopology Dependent Bounds For FAQs

2 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing cs.DBShow all

2 papers · 1 filter

cs.DB2021

Worst-case Optimal Binary Join Algorithms under General $ℓ_{p}$ Constraints

Sai Vikneshwar Mani Jayaraman, Corey Ropell, Atri Rudra

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…

cs.DB2020

Covering the Relational Join

Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra

In this paper, we initiate a theoretical study of what we call the join covering problem. We are given a natural join query instance $Q$ on $n$ attributes and $m$ relations $(R_i)_…

Worst-case Optimal Binary Join Algorithms under General ℓp​ Constraints

Covering the Relational Join

Worst-case Optimal Binary Join Algorithms under General $ℓ_{p}$ Constraints