research
∙
07/02/2023
Ranked Enumeration of Minimal Separators
Let G be an undirected graph, and s,t distinguished vertices of G. A min...
share
research
∙
10/26/2022
Quantifying the Loss of Acyclic Join Dependencies
Acyclic schemas possess known benefits for database design, speeding up ...
research
∙
11/15/2021
Enumerating Minimal Separators in Ranked Order
Let G be an n-vertex graph, and s,t vertices of G. We present an efficie...
research
∙
05/30/2021
Approximate Implication with d-Separation
The graphical structure of Probabilistic Graphical Models (PGMs) encodes...
research
∙
08/03/2020
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries
We study the generalized model counting problem, defined as follows: giv...
research
∙
11/29/2019
Mining Approximate Acyclic Schemes from Relations
Acyclic schemes have numerous applications in databases and in machine l...
research
∙
12/24/2018
Integrity Constraints Revisited: From Exact to Approximate Implication
Integrity constraints such as functional dependences (FD), and multi-val...
research
∙
02/25/2018
