2 citations · 2 across the 6 of their papers we have counts for
6 papers
Worst-case Optimal Binary Join Algorithms under General Constraints
Sai Vikneshwar Mani Jayaraman, Corey Ropell, Atri Rudra
Worst-case optimal join algorithms have so far been studied in two broad contexts -- when we are given input relation sizes [Atserias et al., FOCS 2008, Ngo et al., PODS 2012…
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 on attributes and relations $(R_i)_…
Topology Dependent Bounds For FAQs
Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman +1
In this paper, we prove topology dependent bounds on the number of rounds needed to compute Functional Aggregate Queries (FAQs) studied by Abo Khamis et al. [PODS 2016] in a synchr…
-MSR Codes: Contacting Fewer Code Blocks for Exact Repair
Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman
-Minimum Storage Regenerating (-MSR) codes form a special class of Maximum Distance Separable (MDS) codes, providing mechanisms for exact regeneration of a single code block…
Hypertree Decompositions Revisited for PGMs
Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré +1
We revisit the classical problem of exact inference on probabilistic graphical models (PGMs). Our algorithm is based on recent \emph{worst-case optimal database join} algorithms, w…
Hypertree Decompositions Revisited for PGMs
Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré +1
We revisit the classical problem of exact inference on probabilistic graphical models (PGMs). Our algorithm is based on recent worst-case optimal database join algorithms, which ca…