64 citations · 545 across the 60 of their papers we have counts for
6 papers · 2 filters
A Near-Optimal Parallel Algorithm for Joining Binary Relations
Bas Ketsman, Dan Suciu, Yufei Tao
We present a constant-round algorithm in the massively parallel computation (MPC) model for evaluating a natural join where every input relation has two attributes. Our algorithm a…
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries
Batya Kenig, Dan Suciu
We study the , defined as follows: given a database, and a set of deterministic tuples, count the number of subsets of the database that include…
Causal Relational Learning
Babak Salimi, Harsh Parikh, Moe Kayali +3
Causal inference is at the heart of empirical research in natural and social sciences and is critical for scientific discovery and informed decision making. The gold standard in ca…
Sample Debiasing in the Themis Open World Database System (Extended Version)
Laurel Orr, Magda Balazinska, Dan Suciu
Open world database management systems assume tuples not in the database still exist and are becoming an increasingly important area of research. We present Themis, the first open…
SPORES: Sum-Product Optimization via Relational Equality Saturation for Large Scale Linear Algebra
Yisu Remy Wang, Shana Hutchison, Jonathan Leang +2
Machine learning algorithms are commonly specified in linear algebra (LA). LA expressions can be rewritten into more efficient forms, by taking advantage of input properties such a…
Mosaic: A Sample-Based Database System for Open World Query Processing
Laurel Orr, Samuel Ainsworth, Walter Cai +3
Data scientists have relied on samples to analyze populations of interest for decades. Recently, with the increase in the number of public data repositories, sample data has become…