14 citations · 21 across the 4 of their papers we have counts for
7 papers
Computing Optimal Repairs for Functional Dependencies
Ester Livshits, Benny Kimelfeld, Sudeepa Roy
We investigate the complexity of computing an optimal repair of an inconsistent database, in the case where integrity constraints are Functional Dependencies (FDs). We focus on two…
The Complexity of Computing a Cardinality Repair for Functional Dependencies
Ester Livshits, Benny Kimelfeld
For a relation that violates a set of functional dependencies, we consider the task of finding a maximum number of pairwise-consistent tuples, or what is known as a "cardinality re…
eLinda: Explorer for Linked Data
Oren Mishali, Tal Yahav, Oren Kalinsky +1
To realize the premise of the Semantic Web towards knowledgeable machines, one might often integrate an application with emerging RDF graphs. Nevertheless, capturing the content of…
Joining Extractions of Regular Expressions
Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund
Regular expressions with capture variables, also known as "regex formulas," extract relations of spans (interval positions) from text. These relations can be further manipulated vi…
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)
Serge Abiteboul, Marcelo Arenas, Pablo Barceló +18
In April 2016, a community of researchers working in the area of Principles of Data Management (PDM) joined in a workshop at the Dagstuhl Castle in Germany. The workshop was organi…
Unambiguous Prioritized Repairing of Databases
Benny Kimelfeld, Ester Livshits, Liat Peterfreund
In its traditional definition, a repair of an inconsistent database is a consistent database that differs from the inconsistent one in a "minimal way". Often, repairs are not equal…