Benny Kimelfeld

research

∙ 09/20/2023

A Unifying Perspective on Succinct Data Representations

Factorized Databases (FDBs) and the recently introduced Path Multiset Re...

0 Benny Kimelfeld, et al. ∙

research

∙ 05/25/2023

Efficient Computation of Quantiles over Joins

We present efficient algorithms for Quantile Join Queries, abbreviated a...

0 Nikolaos Tziavelis, et al. ∙

research

∙ 04/12/2023

Skyline Operators for Document Spanners

When extracting a relation of spans (intervals) from a text document, a ...

0 Antoine Amarilli, et al. ∙

research

∙ 03/09/2023

Direct Access for Answers to Conjunctive Queries with Aggregation

We study the fine-grained complexity of conjunctive queries with groupin...

0 Idan Eldar, et al. ∙

research

∙ 02/17/2023

Finding Possible and Necessary Winners in Spatial Voting with Partial Information

We consider spatial voting where candidates are located in the Euclidean...

0 Aviram Imber, et al. ∙

research

∙ 12/23/2022

The Consistency of Probabilistic Databases with Independent Cells

A probabilistic database with attribute-level uncertainty consists of re...

0 Amir Gilad, et al. ∙

research

∙ 12/15/2022

The Complexity of the Shapley Value for Regular Path Queries

A path query extracts vertex tuples from a labeled graph, based on the w...

0 Majd Khalil, et al. ∙

research

∙ 03/20/2022

PIMDB: Understanding Bulk-Bitwise Processing In-Memory Through Database Analytics

Bulk-bitwise processing-in-memory (PIM), where large bitwise operations ...

0 Ben Perach, et al. ∙

research

∙ 12/16/2021

Computing the Shapley Value of Facts in Query Answering

The Shapley value is a game-theoretic notion for wealth distribution tha...

0 Daniel Deutch, et al. ∙

research

∙ 03/27/2021

Committee Voting with Incomplete Approvals

We investigate approval-based committee voting with incomplete informati...

0 Aviram Imber, et al. ∙

research

∙ 03/11/2021

Dynamic Database Embeddings with FoRWaRD

We study the problem of computing an embedding of the tuples of a relati...

0 Jan Toenshoff, et al. ∙

research

∙ 01/29/2021

Probabilistic Inference of Winners in Elections by Independent Random Voters

We investigate the problem of computing the probability of winning in an...

0 Aviram Imber, et al. ∙

research

∙ 12/22/2020

Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries

We study the question of when we can provide logarithmic-time direct acc...

0 Nofar Carmeli, et al. ∙

research

∙ 09/29/2020

Database Repairing with Soft Functional Dependencies

A common interpretation of soft constraints penalizes the database for e...

0 Nofar Carmeli, et al. ∙

research

∙ 09/29/2020

The Shapley Value of Inconsistency Measures for Functional Dependencies

Quantifying the inconsistency of a database is motivated by various goal...

0 Ester Livshits, et al. ∙

research

∙ 09/04/2020

ViS-Á-ViS : Detecting Similar Patterns in Annotated Literary Text

We present a web-based system called ViS-Á-ViS aiming to assist literary...

0 Moshe Schorr, et al. ∙

research

∙ 05/18/2020

Computing the Extremal Possible Ranks with Incomplete Preferences

In an election via a positional scoring rule, each candidate receives fr...

0 Aviram Imber, et al. ∙

research

∙ 05/18/2020

Approximate Denial Constraints

The problem of mining integrity constraints from data has been extensive...

0 Ester Livshits, et al. ∙

research

∙ 05/14/2020

Algorithmic Techniques for Necessary and Possible Winners

We investigate the practical aspects of computing the necessary and poss...

0 Vishal Chakraborty, et al. ∙

research

∙ 03/16/2020

Supporting Hard Queries over Probabilistic Preferences

Preference analysis is widely applied in various domains such as social ...

0 Haoyue Ping, et al. ∙

research

∙ 02/21/2020

The Complexity of Determining the Necessary and Possible Top-k Winners in Partial Voting Profiles

When voter preferences are known in an incomplete (partial) manner, winn...

0 Aviram Imber, et al. ∙

research

∙ 02/20/2020

The Complexity of Aggregates over Extractions by Regular Expressions

Regular expressions with capture variables, also known as "regex formula...

0 Johannes Doleschal, et al. ∙

research

∙ 02/05/2020

Automatic Location Type Classification From Social-Media Posts

We introduce the problem of Automatic Location Type Classification from ...

0 Elad Kravi, et al. ∙

research

∙ 12/29/2019

The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries

The Shapley value is a conventional and well-studied function for determ...

0 Alon Reshef, et al. ∙

research

∙ 12/23/2019

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration

As data analytics becomes more crucial to digital systems, so grows the ...

0 Nofar Carmeli, et al. ∙

research

∙ 08/30/2019

Weight Annotation in Information Extraction

The framework of document spanners abstracts the task of information ext...

0 Johannes Doleschal, et al. ∙

research

∙ 08/30/2019

Annotated Document Spanners

We introduce annotated document spanners, which are document spanners th...

0 Johannes Doleschal, et al. ∙

research

∙ 08/19/2019

Model Counting for Conjunctive Queries Without Self-Joins

We study the problem of model counting for Boolean Conjunctive Queries (...

0 Antoine Amarilli, et al. ∙

research

∙ 05/17/2019

The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins

Graph pattern matching (e.g., finding all cycles and cliques) has become...

0 Oren Kalinsky, et al. ∙

research

∙ 04/18/2019

The Shapley Value of Tuples in Query Answering

We investigate the application of the Shapley value to quantifying the c...

0 Ester Livshits, et al. ∙

research

∙ 04/13/2019

Principles of Progress Indicators for Database Repairing

How should a cleaning system measure the amount of inconsistency in the ...

0 Ester Livshits, et al. ∙

research

∙ 01/14/2019

Complexity Bounds for Relational Algebra over Document Spanners

We investigate the complexity of evaluating queries in Relational Algebr...

0 Liat Peterfreund, et al. ∙

research

∙ 11/27/2018

Efficiently Charting RDF

We propose a visual query language for interactively exploring large-sca...

0 Oren Kalinsky, et al. ∙

research

∙ 10/08/2018

Split-Correctness in Information Extraction

Programs for extracting structured information from text, namely informa...

0 Johannes Doleschal, et al. ∙

research

∙ 05/10/2018

Computational Social Choice Meets Databases

We develop a novel framework that aims to create bridges between the com...

0 Benny Kimelfeld, et al. ∙

research

∙ 01/21/2018

A Formal Framework For Probabilistic Unclean Databases

Traditional modeling of inconsistency in database theory casts all possi...

0 Christopher De Sa, et al. ∙

research

∙ 12/21/2017

Recursive Programs for Document Spanners

A document spanner models a program for Information Extraction (IE) as a...

0 Liat Peterfreund, et al. ∙

research

∙ 12/20/2017

Computing Optimal Repairs for Functional Dependencies

We investigate the complexity of computing an optimal repair of an incon...

0 Ester Livshits, et al. ∙

research

∙ 08/30/2017

The Complexity of Computing a Cardinality Repair for Functional Dependencies

For a relation that violates a set of functional dependencies, we consid...

0 Ester Livshits, et al. ∙

research

∙ 07/24/2017

eLinda: Explorer for Linked Data

To realize the premise of the Semantic Web towards knowledgeable machine...

0 Oren Mishali, et al. ∙

research

∙ 12/06/2014

Declarative Statistical Modeling with Datalog

Formalisms for specifying statistical models, such as probabilistic-prog...

0 Vince Bárány, et al. ∙

Benny Kimelfeld

Featured Co-authors