| Design and implementation of the LogicBlox system M Aref, B Ten Cate, TJ Green, B Kimelfeld, D Olteanu, E Pasalic, ... Proceedings of the 2015 ACM SIGMOD International Conference on Management of …, 2015 | 319 | 2015 |
| Keyword proximity search in complex data graphs K Golenberg, B Kimelfeld, Y Sagiv Proceedings of the 2008 ACM SIGMOD international conference on Management of …, 2008 | 240 | 2008 |
| Finding and approximating top-k answers in keyword proximity search B Kimelfeld, Y Sagiv Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on …, 2006 | 224 | 2006 |
| Document spanners: A formal approach to information extraction R Fagin, B Kimelfeld, F Reiss, S Vansummeren Journal of the ACM (JACM) 62 (2), 1-51, 2015 | 122 | 2015 |
| On the expressiveness of probabilistic XML models S Abiteboul, B Kimelfeld, Y Sagiv, P Senellart The VLDB Journal 18 (5), 1041-1064, 2009 | 110 | 2009 |
| Query efficiency in probabilistic XML models B Kimelfeld, Y Kosharovsky, Y Sagiv Proceedings of the 2008 ACM SIGMOD international conference on Management of …, 2008 | 110 | 2008 |
| Interconnection semantics for keyword search in XML S Cohen, Y Kanza, B Kimelfeld, Y Sagiv Proceedings of the 14th ACM international conference on Information and …, 2005 | 106 | 2005 |
| Matching twigs in probabilistic XML B Kimelfeld, Y Sagiv Proceedings of the 33rd international conference on Very large data bases, 27-38, 2007 | 104 | 2007 |
| Efficient enumeration of maximal k-plexes D Berlowitz, S Cohen, B Kimelfeld Proceedings of the 2015 ACM SIGMOD International Conference on Management of …, 2015 | 88 | 2015 |
| Query evaluation over probabilistic XML B Kimelfeld, Y Kosharovsky, Y Sagiv The VLDB Journal 18 (5), 1117-1140, 2009 | 78 | 2009 |
| Computing optimal repairs for functional dependencies E Livshits, B Kimelfeld, S Roy ACM Transactions on Database Systems (TODS) 45 (1), 1-46, 2020 | 74 | 2020 |
| Research directions for principles of data management (dagstuhl perspectives workshop 16151) S Abiteboul, M Arenas, P Barceló, M Bienvenu, D Calvanese, C David, ... Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2018 | 73* | 2018 |
| Probabilistic XML: Models and complexity B Kimelfeld, P Senellart Advances in Probabilistic Databases for Uncertain Information Management, 39-66, 2013 | 71 | 2013 |
| Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties S Cohen, B Kimelfeld, Y Sagiv Journal of Computer and System Sciences 74 (7), 1147-1159, 2008 | 71 | 2008 |
| The Shapley value of tuples in query answering E Livshits, L Bertossi, B Kimelfeld, M Sebag Logical Methods in Computer Science 17, 2021 | 62 | 2021 |
| Adaptive parser-centric text normalization C Zhang, T Baldwin, H Ho, B Kimelfeld, Y Li Proceedings of the 51st Annual Meeting of the Association for Computational …, 2013 | 60 | 2013 |
| Flexible caching in trie joins O Kalinsky, Y Etsion, B Kimelfeld arXiv preprint arXiv:1602.08721, 2016 | 59 | 2016 |
| Incorporating constraints in probabilistic XML S Cohen, B Kimelfeld, Y Sagiv ACM Transactions on Database Systems (TODS) 34 (3), 1-45, 2009 | 59 | 2009 |
| Running tree automata on probabilistic XML S Cohen, B Kimelfeld, Y Sagiv Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on …, 2009 | 56 | 2009 |
| A formal framework for probabilistic unclean databases C De Sa, IF Ilyas, B Kimelfeld, C Ré, T Rekatsinas arXiv preprint arXiv:1801.06750, 2018 | 55 | 2018 |
Ronald FaginIBM Almaden Research CenterVerified email at us.ibm.com
