Benny Kimelfeld

According to our database1, Benny Kimelfeld authored at least 100 papers between 2005 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

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

Computational Social Choice Meets Databases.
CoRR, 2018

A Formal Framework For Probabilistic Unclean Databases.
CoRR, 2018

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

Computing Optimal Repairs for Functional Dependencies.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 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 21th International Conference on Extending Database Technology, 2018

Towards Linked Data of Bible Quotations in Jewish Texts.
Proceedings of the Digital Humanities 2018, 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 Record, 2017

Recursive Programs for Document Spanners.
CoRR, 2017

Computing Optimal Repairs for Functional Dependencies.
CoRR, 2017

Ranked Enumeration of Minimal Triangulations.
CoRR, 2017

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

eLinda: Explorer for Linked Data.
CoRR, 2017

Joining Extractions of Regular Expressions.
CoRR, 2017

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
CoRR, 2017

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

A Relational Framework for Classifier Engineering.
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 Record, 2016

Unambiguous Prioritized Repairing of Databases.
CoRR, 2016

Flexible Caching in Trie Joins.
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

Declarative Probabilistic Programming with Datalog.
Proceedings of the 19th International Conference on Database Theory, 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 Record, 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.
PVLDB, 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.
PVLDB, 2013

Next Generation Data Analytics at IBM Research.
PVLDB, 2013

The complexity of mining maximal frequent subgraphs.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 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 CIDR 2013, 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.
PVLDB, 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

Maximizing conjunctive views in deletion propagation.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 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

Transducing Markov sequences.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

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

Probabilistic data exchange.
Proceedings of the Database Theory, 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
Modeling and querying probabilistic XML data.
SIGMOD Record, 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

Incorporating constraints in probabilistic XML.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 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...