64 citations · 545 across the 60 of their papers we have counts for
6 papers · 1 filter
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…
SafeBound: A Practical System for Generating Cardinality Bounds
Kyle Deeds, Dan Suciu, Magda Balazinska
Recent work has reemphasized the importance of cardinality estimates for query optimization. While new techniques have continuously improved in accuracy over time, they still gener…
Computing Rule-Based Explanations by Leveraging Counterfactuals
Zixuan Geng, Maximilian Schleich, Dan Suciu
Sophisticated machine models are increasingly used for high-stakes decisions in everyday life. There is an urgent need to develop effective explanation techniques for such automate…
Optimizing Tensor Programs on Flexible Storage
Maximilian Schleich, Amir Shaikhha, Dan Suciu
Tensor programs often need to process large tensors (vectors, matrices, or higher order tensors) that require a specialized storage format for their memory layout. Several such lay…
Optimizing Recursive Queries with Program Synthesis
Yisu Remy Wang, Mahmoud Abo Khamis, Hung Q. Ngo +2
Most work on query optimization has concentrated on loop-free queries. However, data science and machine learning workloads today typically involve recursive or iterative computati…
Degree Sequence Bound For Join Cardinality Estimation
Kyle Deeds, Dan Suciu, Magda Balazinska +1
Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly…