14 citations · 24 across the 11 of their papers we have counts for
20 papers · 1 filter
Repairing Databases over Metric Spaces with Coincidence Constraints
Youri Kaminsky, Benny Kimelfeld, Ester Livshits +2
Datasets often contain values that naturally reside in a metric space: numbers, strings, geographical locations, machine-learned embeddings in a Euclidean space, and so on. We stud…
SpannerLib: Embedding Declarative Information Extraction in an Imperative Workflow
Dean Light, Ahmad Aiashy, Mahmoud Diab +3
Document spanners have been proposed as a formal framework for declarative Information Extraction (IE) from text, following IE products from the industry and academia. Over the pas…
Computing the Shapley Value of Facts in Query Answering
Daniel Deutch, Nave Frost, Benny Kimelfeld +1
The Shapley value is a game-theoretic notion for wealth distribution that is nowadays extensively used to explain complex data-intensive computation, for instance, in network analy…
Database Repairing with Soft Functional Dependencies
Nofar Carmeli, Martin Grohe, Benny Kimelfeld +2
A common interpretation of soft constraints penalizes the database for every violation of every constraint, where the penalty is the cost (weight) of the constraint. A computationa…
Approximate Denial Constraints
Ester Livshits, Alireza Heidari, Ihab F. Ilyas +1
The problem of mining integrity constraints from data has been extensively studied over the past two decades for commonly used types of constraints including the classic Functional…
Supporting Hard Queries over Probabilistic Preferences
Haoyue Ping, Julia Stoyanovich, Benny Kimelfeld
Preference analysis is widely applied in various domains such as social choice and e-commerce. A recently proposed framework augments the relational database with a preference rela…