23 citations · 149 across the 34 of their papers we have counts for
4 papers · 1 filter
The Consistency of Probabilistic Databases with Independent Cells
Amir Gilad, Aviram Imber, Benny Kimelfeld
A probabilistic database with attribute-level uncertainty consists of relations where cells of some attributes may hold probability distributions rather than deterministic content.…
The Complexity of the Shapley Value for Regular Path Queries
Majd Khalil, Benny Kimelfeld
A path query extracts vertex tuples from a labeled graph, based on the words that are formed by the paths connecting the vertices. We study the computational complexity of measurin…
Understanding Bulk-Bitwise Processing In-Memory Through Database Analytics
Ben Perach, Ronny Ronen, Benny Kimelfeld +1
Bulk-bitwise processing-in-memory (PIM), where large bitwise operations are performed in parallel by the memory array itself, is an emerging form of computation with the potential…
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…