Search

• < Previous
• 1
• Next >

---

Uniform Reliability of Self-Join-Free Conjunctive Queries

Antoine Amarilli ; Benny Kimelfeld.

The reliability of a Boolean Conjunctive Query (CQ) over a tuple-independent probabilistic database is the probability that the CQ is satisfied when the tuples of the database are sampled one by one, independently, with their associated probability. For queries without self-joins (repeated relation&nbsp;[&hellip;]

---

The Shapley Value of Tuples in Query Answering

Ester Livshits ; Leopoldo Bertossi ; Benny Kimelfeld ; Moshe Sebag.

We investigate the application of the Shapley value to quantifying the contribution of a tuple to a query answer. The Shapley value is a widely known numerical measure in cooperative game theory and in many applications of game theory for assessing the contribution of a player to a coalition game.&nbsp;[&hellip;]

---

Weight Annotation in Information Extraction

Johannes Doleschal ; Benny Kimelfeld ; Wim Martens ; Liat Peterfreund.

The framework of document spanners abstracts the task of information extraction from text as a function that maps every document (a string) into a relation over the document's spans (intervals identified by their start and end indices). For instance, the regular spanners are the closure under the&nbsp;[&hellip;]

---

The Shapley Value of Inconsistency Measures for Functional Dependencies

Ester Livshits ; Benny Kimelfeld.

Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data cleaning. Another goal is to attribute to individual tuples a level of responsibility to the overall inconsistency, and thereby prioritize&nbsp;[&hellip;]

---

The Complexity of Aggregates over Extractions by Regular Expressions

Johannes Doleschal ; Benny Kimelfeld ; Wim Martens.

Regular expressions with capture variables, also known as regex-formulas, extract relations of spans (intervals identified by their start and end indices) from text. In turn, the class of regular document spanners is the closure of the regex formulas under the Relational Algebra. We investigate the&nbsp;[&hellip;]

---