1 citations · 1 across the 1 of their papers we have counts for
3 papers
Complexity Bounds for Relational Algebra over Document Spanners
Liat Peterfreund, Dominik D. Freydenberger, Benny Kimelfeld +1
We investigate the complexity of evaluating queries in Relational Algebra (RA) over the relations extracted by regex formulas (i.e., regular expressions with capture variables) ove…
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…
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…