64 citations · 545 across the 60 of their papers we have counts for
67 papers
From Shapley Value to Model Counting and Back
Ahmet Kara, Dan Olteanu, Dan Suciu
In this paper we investigate the problem of quantifying the contribution of each variable to the satisfying assignments of a Boolean function based on the Shapley value. Our main r…
Join Size Bounds using Lp-Norms on Degree Sequences
Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu +1
Estimating the output size of a query is a fundamental yet longstanding problem in database query processing. Traditional cardinality estimators used by database systems can routin…
CHORUS: Foundation Models for Unified Data Discovery and Exploration
Moe Kayali, Anton Lykov, Ilias Fountalis +3
We apply foundation models to data discovery and exploration tasks. Foundation models include large language models (LLMs) that show promising performance on a range of diverse tas…
Applications of Information Inequalities to Database Theory Problems
Dan Suciu
The paper describes several applications of information inequalities to problems in database theory. The problems discussed include: upper bounds of a query's output, worst-case op…
Free Join: Unifying Worst-Case Optimal and Traditional Joins
Yisu Remy Wang, Max Willsey, Dan Suciu
Over the last decade, worst-case optimal join (WCOJ) algorithms have emerged as a new paradigm for one of the most fundamental challenges in query processing: computing joins effic…
Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality
Moe Kayali, Dan Suciu
We propose quasi-stable coloring, an approximate version of stable coloring. Stable coloring, also called color refinement, is a well-studied technique in graph theory for classify…