Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarBenny Kimelfeld
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j21]Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). Dagstuhl Manifestos 7(1): 1-29 (2018)- [c63]Batya Kenig, Lovro Ilijasic, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich:
Probabilistic Inference Over Repeated Insertion Models. AAAI 2018 - [c62]Oren Mishali, Benny Kimelfeld:
Towards Linked Data of Bible Quotations in Jewish Texts. DH 2018: 455-456 - [c61]Tal Yahav, Oren Kalinsky, Oren Mishali, Benny Kimelfeld:
eLinda: Explorer for Linked Data. EDBT 2018: 658-661 - [c60]Benny Kimelfeld, Phokion G. Kolaitis, Julia Stoyanovich:
Computational Social Choice Meets Databases. IJCAI 2018: 317-323 - [c59]Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund:
Joining Extractions of Regular Expressions. PODS 2018: 137-149 - [c58]Ester Livshits, Benny Kimelfeld, Sudeepa Roy:
Computing Optimal Repairs for Functional Dependencies. PODS 2018: 225-237 - [c57]Uzi Cohen, Batya Kenig, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich:
A Query Engine for Probabilistic Preferences. SIGMOD Conference 2018: 1509-1524 - [e1]Benny Kimelfeld, Yael Amsterdamer:
21st International Conference on Database Theory, ICDT 2018, March 26-29, 2018, Vienna, Austria. LIPIcs 98, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2018, ISBN 978-3-95977-063-7 [contents] - [i13]Christopher De Sa, Ihab F. Ilyas, Benny Kimelfeld, Christopher Ré, Theodoros Rekatsinas:
A Formal Framework For Probabilistic Unclean Databases. CoRR abs/1801.06750 (2018) - [i12]Benny Kimelfeld, Phokion G. Kolaitis, Julia Stoyanovich:
Computational Social Choice Meets Databases. CoRR abs/1805.04156 (2018) - 2017
- [j20]Benny Kimelfeld:
Technical Perspective: Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. SIGMOD Record 46(1): 14 (2017) - [j19]Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Probabilistic Programming with Datalog. ACM Trans. Database Syst. 42(4): 22:1-22:35 (2017) - [c56]Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich:
A Database Framework for Probabilistic Preferences. AMW 2017 - [c55]
- [c54]Benny Kimelfeld, Ester Livshits, Liat Peterfreund:
Detecting Ambiguity in Prioritized Database Repairing. ICDT 2017: 17:1-17:20 - [c53]
- [c52]Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich:
Querying Probabilistic Preferences in Databases. PODS 2017: 21-36 - [c51]Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
Efficiently Enumerating Minimal Triangulations. PODS 2017: 273-287 - [c50]Ester Livshits, Benny Kimelfeld:
Counting and Enumerating (Preferred) Database Repairs. PODS 2017: 289-301 - [i11]Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). CoRR abs/1701.09007 (2017) - [i10]Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund:
Joining Extractions of Regular Expressions. CoRR abs/1703.10350 (2017) - [i9]Oren Mishali, Tal Yahav, Oren Kalinsky, Benny Kimelfeld:
eLinda: Explorer for Linked Data. CoRR abs/1707.07623 (2017) - [i8]Ester Livshits, Benny Kimelfeld:
The Complexity of Computing a Cardinality Repair for Functional Dependencies. CoRR abs/1708.09140 (2017) - [i7]Noam Ravid, Dori Medini, Benny Kimelfeld:
Ranked Enumeration of Minimal Triangulations. CoRR abs/1709.10254 (2017) - [i6]Ester Livshits, Benny Kimelfeld, Sudeepa Roy:
Computing Optimal Repairs for Functional Dependencies. CoRR abs/1712.07705 (2017) - [i5]Liat Peterfreund, Balder ten Cate, Ronald Fagin, Benny Kimelfeld:
Recursive Programs for Document Spanners. CoRR abs/1712.08198 (2017) - 2016
- [j18]Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Abridged). SIGMOD Record 45(4): 5-17 (2016) - [j17]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Declarative Cleaning of Inconsistencies in Information Extraction. ACM Trans. Database Syst. 41(1): 6:1-6:44 (2016) - [c49]
- [c48]Benny Kimelfeld, Ester Livshits, Liat Peterfreund:
Recognizing Determinism in Prioritized Repairing of Inconsistent Databases. AMW 2016 - [c47]Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Probabilistic Programming with Datalog. ICDT 2016: 7:1-7:19 - [c46]Adi Omari, Benny Kimelfeld, Eran Yahav, Sharon Shoham:
Lossless Separation of Web Pages into Layout Code and Data. KDD 2016: 1805-1814 - [i4]Oren Kalinsky, Yoav Etsion, Benny Kimelfeld:
Flexible Caching in Trie Joins. CoRR abs/1602.08721 (2016) - [i3]Benny Kimelfeld, Ester Livshits, Liat Peterfreund:
Unambiguous Prioritized Repairing of Databases. CoRR abs/1603.01820 (2016) - [i2]Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
On the Enumeration of all Minimal Triangulations. CoRR abs/1604.02833 (2016) - 2015
- [j16]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Document Spanners: A Formal Approach to Information Extraction. J. ACM 62(2): 12:1-12:51 (2015) - [j15]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
A Relational Framework for Information Extraction. SIGMOD Record 44(4): 5-16 (2015) - [c45]Molham Aref, Benny Kimelfeld, Emir Pasalic, Nikolaos Vasiloglou:
Extending Datalog with Analytics in LogicBlox. AMW 2015 - [c44]Balder ten Cate, Benny Kimelfeld, Dan Olteanu:
PPDL: Probabilistic Programming with Datalog. AMW 2015 - [c43]
- [c42]Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Dichotomies in the Complexity of Preferred Repairs. PODS 2015: 3-15 - [c41]
- [c40]Devora Berlowitz, Sara Cohen, Benny Kimelfeld:
Efficient Enumeration of Maximal k-Plexes. SIGMOD Conference 2015: 431-444 - [c39]Molham Aref, Balder ten Cate, Todd J. Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L. Veldhuizen, Geoffrey Washburn:
Design and Implementation of the LogicBlox System. SIGMOD Conference 2015: 1371-1382 - 2014
- [j14]
- [j13]Marie Jacob, Benny Kimelfeld, Julia Stoyanovich:
A System for Management and Analysis of Preference Data. PVLDB 7(12): 1255-1258 (2014) - [j12]Benny Kimelfeld, Phokion G. Kolaitis:
The Complexity of Mining Maximal Frequent Subgraphs. ACM Trans. Database Syst. 39(4): 32:1-32:33 (2014) - [c38]
- [c37]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Cleaning inconsistencies in information extraction via prioritized repairs. PODS 2014: 164-175 - [i1]Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Statistical Modeling with Datalog. CoRR abs/1412.2221 (2014) - 2013
- [j11]Oktie Hassanzadeh, Anastasios Kementsietsidis, Benny Kimelfeld, Rajasekar Krishnamurthy, Fatma Ozcan, Ippokratis Pandis:
Next Generation Data Analytics at IBM Research. PVLDB 6(11): 1174-1175 (2013) - [j10]Benny Kimelfeld, Jan Vondrák, David P. Woodruff:
Multi-Tuple Deletion Propagation: Approximations and Complexity. PVLDB 6(13): 1558-1569 (2013) - [c36]Congle Zhang, Tyler Baldwin, Howard Ho, Benny Kimelfeld, Yunyao Li:
Adaptive Parser-Centric Text Normalization. ACL (1) 2013: 1159-1168 - [c35]Sara Cohen, Lior Ebel, Benny Kimelfeld:
A Social Network Database that Learns How to Answer Queries. CIDR 2013 - [c34]Benny Kimelfeld, Yehoshua Sagiv:
Extracting minimum-weight tree patterns from a schema with neighborhood constraints. ICDT 2013: 249-260 - [c33]Benny Kimelfeld, Phokion G. Kolaitis:
The complexity of mining maximal frequent subgraphs. PODS 2013: 13-24 - [c32]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Spanners: a formal framework for information extraction. PODS 2013: 37-48 - [p2]Benny Kimelfeld, Pierre Senellart:
Probabilistic XML: Models and Complexity. Advances in Probabilistic Databases for Uncertain Information Management 2013: 39-66 - 2012
- [j9]Benny Kimelfeld, Jan Vondrák, Ryan Williams:
Maximizing Conjunctive Views in Deletion Propagation. ACM Trans. Database Syst. 37(4): 24:1-24:37 (2012) - [c31]Zhuowei Bao, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Huahai Yang:
Gumshoe quality toolkit: administering programmable search. CIKM 2012: 2716-2718 - [c30]Benny Kimelfeld:
A dichotomy in the complexity of deletion propagation with functional dependencies. PODS 2012: 191-202 - [c29]Zhuowei Bao, Benny Kimelfeld, Yunyao Li:
Automatic suggestion of query-rewrite rules for enterprise search. SIGIR 2012: 591-600 - [p1]Sara Cohen, Benny Kimelfeld, Georgia Koutrika:
A Survey on Proximity Measures for Social Networks. SeCO Book 2012: 191-206 - 2011
- [j8]Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Probabilistic data exchange. J. ACM 58(4): 15:1-15:55 (2011) - [j7]Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv:
Optimizing and Parallelizing Ranked Enumeration. PVLDB 4(11): 1028-1039 (2011) - [c28]Zhuowei Bao, Benny Kimelfeld, Yunyao Li:
A Graph Approach to Spelling Correction in Domain-Centric Search. ACL 2011: 905-914 - [c27]Benny Kimelfeld, Jan Vondrák, Ryan Williams:
Maximizing conjunctive views in deletion propagation. PODS 2011: 187-198 - [c26]Benny Kimelfeld, Yehoshua Sagiv:
Finding a minimal tree pattern under neighborhood constraints. PODS 2011: 235-246 - [c25]Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan:
Rewrite rules for search database systems. PODS 2011: 271-282 - [c24]Sara Cohen, Benny Kimelfeld, Georgia Koutrika, Jan Vondrák:
On Principles of Egocentric Person Search in Social Networks. VLDS 2011: 3-6 - 2010
- [c23]Sara Cohen, Benny Kimelfeld:
Querying parse trees of stochastic context-free grammars. ICDT 2010: 62-75 - [c22]
- [c21]
- [c20]Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan:
Understanding queries in a search database system. PODS 2010: 273-284 - [c19]Hilit Achiezra, Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv:
Exploratory keyword search on data graphs. SIGMOD Conference 2010: 1163-1166
2000 – 2009
- 2009
- [j6]Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv:
Incorporating constraints in probabilistic XML. ACM Trans. Database Syst. 34(3): 18:1-18:45 (2009) - [j5]Serge Abiteboul, Benny Kimelfeld, Yehoshua Sagiv, Pierre Senellart:
On the expressiveness of probabilistic XML models. VLDB J. 18(5): 1041-1064 (2009) - [j4]Benny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv:
Query evaluation over probabilistic XML. VLDB J. 18(5): 1117-1140 (2009) - [c18]Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Benny Kimelfeld, Vassia Pavlaki, Yehoshua Sagiv:
On rewriting XPath queries using views. EDBT 2009: 168-179 - [c17]Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv:
Running tree automata on probabilistic XML. PODS 2009: 227-236 - [c16]Benny Kimelfeld, Yehoshua Sagiv, Gidi Weber:
ExQueX: exploring and querying XML documents. SIGMOD Conference 2009: 1103-1106 - 2008
- [j3]Benny Kimelfeld, Yehoshua Sagiv:
Efficiently enumerating results of keyword search over data graphs. Inf. Syst. 33(4-5): 335-359 (2008) - [j2]Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv:
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties. J. Comput. Syst. Sci. 74(7): 1147-1159 (2008) - [j1]Benny Kimelfeld, Yehoshua Sagiv:
Modeling and querying probabilistic XML data. SIGMOD Record 37(4): 69-77 (2008) - [c15]Benny Kimelfeld, Yehoshua Sagiv:
Revisiting redundancy and minimization in an XPath fragment. EDBT 2008: 61-72 - [c14]Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv:
Incorporating constraints in probabilistic XML. PODS 2008: 109-118 - [c13]Benny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv:
Query efficiency in probabilistic XML models. SIGMOD Conference 2008: 701-714 - [c12]Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv:
Keyword proximity search in complex data graphs. SIGMOD Conference 2008: 927-940 - 2007
- [c11]Benny Kimelfeld, Yehoshua Sagiv:
Combining Incompleteness and Ranking in Tree Queries. ICDT 2007: 329-343 - [c10]
- [c9]
- 2006
- [c8]Benny Kimelfeld, Eitan Kovacs, Yehoshua Sagiv, Dan Yahav:
Using Language Models and the HITS Algorithm for XML Retrieval. INEX 2006: 253-260 - [c7]Benny Kimelfeld, Yehoshua Sagiv:
Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. NGITS 2006: 141-152 - [c6]Benny Kimelfeld, Yehoshua Sagiv:
Finding and approximating top-k answers in keyword proximity search. PODS 2006: 173-182 - [c5]Sara Cohen, Itzhak Fadida, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv:
Full Disjunctions: Polynomial-Delay Iterators in Action. VLDB 2006: 739-750 - [c4]
- 2005
- [c3]Sara Cohen, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv:
Interconnection semantics for keyword search in XML. CIKM 2005: 389-396 - [c2]Benny Kimelfeld, Yehoshua Sagiv:
Efficiently Enumerating Results of Keyword Search. DBPL 2005: 58-73 - [c1]
Coauthor Index
maintained by 
at 
at 
last updated on 2018-08-17 21:00 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint