7 citations · 12 across the 14 of their papers we have counts for
5 papers · 1 filter
Enumeration of Minimal Hitting Sets Parameterized by Treewidth
Batya Kenig, Dan Shlomo Mizrahi
Enumerating the minimal hitting sets of a hypergraph is a problem which arises in many data management applications that include constraint mining, discovering unique column combin…
Quantifying the Loss of Acyclic Join Dependencies
Batya Kenig, Nir Weinberger
Acyclic schemes posses known benefits for database design, speeding up queries, and reducing space requirements. An acyclic join dependency (AJD) is lossless with respect to a univ…
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…
Mining Approximate Acyclic Schemes from Relations
Batya Kenig, Pranay Mundra, Guna Prasad +2
Acyclic schemes have numerous applications in databases and in machine learning, such as improved design, more efficient storage, and increased performance for queries and machine…
Integrity Constraints Revisited: From Exact to Approximate Implication
Batya Kenig, Dan Suciu
Integrity constraints such as functional dependencies (FD) and multi-valued dependencies (MVD) are fundamental in database schema design. Likewise, probabilistic conditional indepe…