Benny Kimelfeld

Orcid: 0000-0002-7156-1572

Affiliations:
  • Technion - Israel Institute of Technology, Haifa, Israel


According to our database1, Benny Kimelfeld authored at least 157 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Unifying Framework for Incompleteness, Inconsistency, and Uncertainty in Databases.
Commun. ACM, March, 2024

Understanding Bulk-Bitwise Processing In-Memory Through Database Analytics.
IEEE Trans. Emerg. Top. Comput., 2024

The Importance of Parameters in Database Queries.
Proceedings of the 27th International Conference on Database Theory, 2024

Direct Access for Answers to Conjunctive Queries with Aggregation.
Proceedings of the 27th International Conference on Database Theory, 2024

Skyline Operators for Document Spanners.
Proceedings of the 27th International Conference on Database Theory, 2024

A Dataset for Metaphor Detection in Early Medieval Hebrew Poetry.
Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics, 2024

Accelerating the Global Aggregation of Local Explanations.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Spatial Voting with Incomplete Voter Information.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
The Shapley Value in Database Management.
SIGMOD Rec., June, 2023

Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries.
ACM Trans. Database Syst., March, 2023

The Complexity of Aggregates over Extractions by Regular Expressions.
Log. Methods Comput. Sci., 2023

A Unifying Perspective on Succinct Data Representations.
CoRR, 2023

Finding Possible and Necessary Winners in Spatial Voting with Partial Information.
CoRR, 2023

Efficient Computation of Quantiles over Joins.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

The Complexity of the Shapley Value for Regular Path Queries.
Proceedings of the 26th International Conference on Database Theory, 2023

The Consistency of Probabilistic Databases with Independent Cells.
Proceedings of the 26th International Conference on Database Theory, 2023

Stable Tuple Embeddings for Dynamic Databases.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

FigureOut - Automatic Detection of Metaphors in Hebrew Across the Eras.
Proceedings of the Annual International Conference of the Alliance of Digital Humanities Organizations, 2023

Selecting Walk Schemes for Database Embedding.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Answering Aggregate Queries with Ordered Direct Access (short paper).
Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), 2023

2022
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration.
ACM Trans. Database Syst., 2022

The Shapley Value of Inconsistency Measures for Functional Dependencies.
Log. Methods Comput. Sci., 2022

Weight Annotation in Information Extraction.
Log. Methods Comput. Sci., 2022

Uniform Reliability of Self-Join-Free Conjunctive Queries.
Log. Methods Comput. Sci., 2022

PIMDB: Understanding Bulk-Bitwise Processing In-Memory Through Database Analytics.
CoRR, 2022

Computing the Shapley Value of Facts in Query Answering.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Exploration of Knowledge Graphs via Online Aggregation.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Approval-Based Committee Voting under Incomplete Information.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Algorithmic Techniques for Necessary and Possible Winners.
Trans. Data Sci., 2021

Query Games in Databases.
SIGMOD Rec., 2021

Database Principles and Challenges in Text Analysis.
SIGMOD Rec., 2021

The Shapley Value of Tuples in Query Answering.
Log. Methods Comput. Sci., 2021

Counting subset repairs with functional dependencies.
J. Comput. Syst. Sci., 2021

Regularizing conjunctive features for classification.
J. Comput. Syst. Sci., 2021

Efficiently enumerating minimal triangulations.
Discret. Appl. Math., 2021

Committee Voting with Incomplete Approvals.
CoRR, 2021

Dynamic Database Embeddings with FoRWaRD.
CoRR, 2021

Properties of Inconsistency Measures for Databases.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

The Complexity of Aggregates over Extractions by Regular Expressions.
Proceedings of the 24th International Conference on Database Theory, 2021

Database Repairing with Soft Functional Dependencies.
Proceedings of the 24th International Conference on Database Theory, 2021

Location Classification Based on Tweets.
Proceedings of the GeoAI@SIGSPATIAL 2021: Proceedings of the 4th ACM SIGSPATIAL International Workshop on AI for Geographic Knowledge Discovery, 2021

Probabilistic Inference of Winners in Elections by Independent Random Voters.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Computing the Extremal Possible Ranks with Incomplete Preferences.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Computing Optimal Repairs for Functional Dependencies.
ACM Trans. Database Syst., 2020

Counting and enumerating preferred database repairs.
Theor. Comput. Sci., 2020

Technical Perspective: Constant-Delay Enumeration for Nondeterministic Document Spanners.
SIGMOD Rec., 2020

Supporting Hard Queries over Probabilistic Preferences.
Proc. VLDB Endow., 2020

Approximate Denial Constraints.
Proc. VLDB Endow., 2020

Special Issue on the 2018 International Conference on Database Theory.
Theory Comput. Syst., 2020

ViS-Á-ViS : Detecting Similar Patterns in Annotated Literary Text.
CoRR, 2020

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

Automatic Location Type Classification From Social-Media Posts.
CoRR, 2020

The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

Facets of Probabilistic Databases (Invited Talk).
Proceedings of the 23rd International Conference on Database Theory, 2020

Geosocial Location Classification: Associating Type to Places Based on Geotagged Social-Media Posts.
Proceedings of the SIGSPATIAL '20: 28th International Conference on Advances in Geographic Information Systems, 2020

The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins.
Proceedings of the ASPLOS '20: Architectural Support for Programming Languages and Operating Systems, 2020

2019
Technical Perspective: Entity Matching with Quality and Error Guarantees.
SIGMOD Rec., 2019

Enumeration in Data Management (Dagstuhl Seminar 19211).
Dagstuhl Reports, 2019

Annotated Document Spanners.
CoRR, 2019

Model Counting for Conjunctive Queries Without Self-Joins.
CoRR, 2019

Principles of Progress Indicators for Database Repairing.
CoRR, 2019

Ranked Enumeration of Minimal Triangulations.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Complexity Bounds for Relational Algebra over Document Spanners.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Query Evaluation in Election Databases.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Split-Correctness in Information Extraction.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

A Formal Framework for Probabilistic Unclean Databases.
Proceedings of the 22nd International Conference on Database Theory, 2019

Recursive Programs for Document Spanners.
Proceedings of the 22nd International Conference on Database Theory, 2019

Learning to Generate Personalized Product Descriptions.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

Building Causal Graphs from Medical Literature and Electronic Medical Records.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Approximate Inference of Outcomes in Probabilistic Elections.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
A Relational Framework for Classifier Engineering.
SIGMOD Rec., 2018

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
Dagstuhl Manifestos, 2018

Efficiently Charting RDF.
CoRR, 2018

A Query Engine for Probabilistic Preferences.
Proceedings of the 2018 International Conference on Management of Data, 2018

Joining Extractions of Regular Expressions.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Computational Social Choice Meets Databases.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

eLinda: Explorer for Linked Data.
Proceedings of the 21st International Conference on Extending Database Technology, 2018

Towards Linked Data of Bible Quotations in Jewish Texts.
Proceedings of the 13th Annual International Conference of the Alliance of Digital Humanities Organizations, 2018

Probabilistic Inference Over Repeated Insertion Models.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Declarative Probabilistic Programming with Datalog.
ACM Trans. Database Syst., 2017

Technical Perspective: Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data.
SIGMOD Rec., 2017

The Complexity of Computing a Cardinality Repair for Functional Dependencies.
CoRR, 2017

Counting and Enumerating (Preferred) Database Repairs.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Querying Probabilistic Preferences in Databases.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Efficiently Enumerating Minimal Triangulations.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Detecting Ambiguity in Prioritized Database Repairing.
Proceedings of the 20th International Conference on Database Theory, 2017

Flexible Caching in Trie Joins.
Proceedings of the 20th International Conference on Extending Database Technology, 2017

A Database Framework for Probabilistic Preferences.
Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, 2017

2016
Declarative Cleaning of Inconsistencies in Information Extraction.
ACM Trans. Database Syst., 2016

Research Directions for Principles of Data Management (Abridged).
SIGMOD Rec., 2016

Unambiguous Prioritized Repairing of Databases.
CoRR, 2016

On the Enumeration of all Minimal Triangulations.
CoRR, 2016

Lossless Separation of Web Pages into Layout Code and Data.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

Recognizing Determinism in Prioritized Repairing of Inconsistent Databases.
Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, 2016

On the Enumeration of Tree Decompositions.
Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, 2016

2015
A Relational Framework for Information Extraction.
SIGMOD Rec., 2015

Document Spanners: A Formal Approach to Information Extraction.
J. ACM, 2015

Efficient Enumeration of Maximal k-Plexes.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Design and Implementation of the LogicBlox System.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Extending Datalog Intelligence.
Proceedings of the Web Reasoning and Rule Systems - 9th International Conference, 2015

Dichotomies in the Complexity of Preferred Repairs.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

A Database Framework for Classifier Engineering.
Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

PPDL: Probabilistic Programming with Datalog.
Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

Extending Datalog with Analytics in LogicBlox.
Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

2014
The Complexity of Mining Maximal Frequent Subgraphs.
ACM Trans. Database Syst., 2014

A System for Management and Analysis of Preference Data.
Proc. VLDB Endow., 2014

Transducing Markov sequences.
J. ACM, 2014

Declarative Statistical Modeling with Datalog.
CoRR, 2014

Database principles in information extraction.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Cleaning inconsistencies in information extraction via prioritized repairs.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

2013
Probabilistic XML: Models and Complexity.
Proceedings of the Advances in Probabilistic Databases for Uncertain Information Management, 2013

Multi-Tuple Deletion Propagation: Approximations and Complexity.
Proc. VLDB Endow., 2013

Next Generation Data Analytics at IBM Research.
Proc. VLDB Endow., 2013

Spanners: a formal framework for information extraction.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Extracting minimum-weight tree patterns from a schema with neighborhood constraints.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

A Social Network Database that Learns How to Answer Queries.
Proceedings of the Sixth Biennial Conference on Innovative Data Systems Research, 2013

Adaptive Parser-Centric Text Normalization.
Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, 2013

2012
Maximizing Conjunctive Views in Deletion Propagation.
ACM Trans. Database Syst., 2012

Automatic suggestion of query-rewrite rules for enterprise search.
Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

A Survey on Proximity Measures for Social Networks.
Proceedings of the Search Computing - Broadening Web Search, 2012

A dichotomy in the complexity of deletion propagation with functional dependencies.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Gumshoe quality toolkit: administering programmable search.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Optimizing and Parallelizing Ranked Enumeration.
Proc. VLDB Endow., 2011

Probabilistic data exchange.
J. ACM, 2011

On Principles of Egocentric Person Search in Social Networks.
Proceedings of the First International Workshop on Searching and Integrating New Web Data Sources, 2011

Finding a minimal tree pattern under neighborhood constraints.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Rewrite rules for search database systems.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

A Graph Approach to Spelling Correction in Domain-Centric Search.
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

2010
Exploratory keyword search on data graphs.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Understanding queries in a search database system.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Querying parse trees of stochastic context-free grammars.
Proceedings of the Database Theory, 2010

2009
Query evaluation over probabilistic XML.
VLDB J., 2009

On the expressiveness of probabilistic XML models.
VLDB J., 2009

Incorporating constraints in probabilistic XML.
ACM Trans. Database Syst., 2009

ExQueX: exploring and querying XML documents.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Running tree automata on probabilistic XML.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

On rewriting XPath queries using views.
Proceedings of the EDBT 2009, 2009

2008
Querying paradigms for the web (פרדיגמות לשאילתות מעל מידע באינטרנט.).
PhD thesis, 2008

Modeling and querying probabilistic XML data.
SIGMOD Rec., 2008

Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties.
J. Comput. Syst. Sci., 2008

Efficiently enumerating results of keyword search over data graphs.
Inf. Syst., 2008

Query efficiency in probabilistic XML models.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Keyword proximity search in complex data graphs.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Revisiting redundancy and minimization in an XPath fragment.
Proceedings of the EDBT 2008, 2008

2007
Matching Twigs in Probabilistic XML.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Maximally joining probabilistic data.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Combining Incompleteness and Ranking in Tree Queries.
Proceedings of the Database Theory, 2007

2006
Twig Patterns: From XML Trees to Graphs.
Proceedings of the Ninth International Workshop on the Web and Databases, 2006

Full Disjunctions: Polynomial-Delay Iterators in Action.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

Finding and approximating top-k answers in keyword proximity search.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries.
Proceedings of the Next Generation Information Technologies and Systems, 2006

Using Language Models and the HITS Algorithm for XML Retrieval.
Proceedings of the Comparative Evaluation of XML Information Retrieval Systems, 2006

2005
Efficient Engines for Keyword Proximity Search.
Proceedings of the Eight International Workshop on the Web & Databases (WebDB 2005), 2005

Efficiently Enumerating Results of Keyword Search.
Proceedings of the Database Programming Languages, 10th International Symposium, 2005

Interconnection semantics for keyword search in XML.
Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31, 2005


  Loading...