23 citations · 149 across the 34 of their papers we have counts for
7 papers · 1 filter
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…
Recursive Programs for Document Spanners
Liat Peterfreund, Balder ten Cate, Ronald Fagin +1
A document spanner models a program for Information Extraction (IE) as a function that takes as input a text document (string over a finite alphabet) and produces a relation of spa…
Ranked Enumeration of Minimal Triangulations
Noam Ravid, Dori Medini, Benny Kimelfeld
A tree decomposition of a graph facilitates computations by grouping vertices into bags that are interconnected in an acyclic structure, hence their importance in a plethora of pro…
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…