| 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 | 281 | 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 | 232 | 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 | 217 | 2006 |
| Query efficiency in probabilistic XML models B Kimelfeld, Y Kosharovsky, Y Sagiv Proceedings of the 2008 ACM SIGMOD international conference on Management of …, 2008 | 113 | 2008 |
| On the expressiveness of probabilistic XML models S Abiteboul, B Kimelfeld, Y Sagiv, P Senellart The VLDB Journal 18 (5), 1041, 2009 | 112 | 2009 |
| 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 | 108 | 2005 |
| 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 | 105 | 2015 |
| Matching twigs in probabilistic XML B Kimelfeld, Y Sagiv Proceedings of the 33rd international conference on Very large data bases, 27-38, 2007 | 105 | 2007 |
| Query evaluation over probabilistic XML B Kimelfeld, Y Kosharovsky, Y Sagiv The VLDB Journal 18 (5), 1117, 2009 | 80 | 2009 |
| Efficient enumeration of maximal k-plexes D Berlowitz, S Cohen, B Kimelfeld Proceedings of the 2015 ACM SIGMOD International Conference on Management of …, 2015 | 77 | 2015 |
| Probabilistic XML: Models and complexity B Kimelfeld, P Senellart Advances in Probabilistic Databases for Uncertain Information Management, 39-66, 2013 | 72 | 2013 |
| Incorporating constraints in probabilistic XML S Cohen, B Kimelfeld, Y Sagiv ACM Transactions on Database Systems (TODS) 34 (3), 1-45, 2009 | 61 | 2009 |
| 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 | 61 | 2008 |
| Running tree automata on probabilistic XML S Cohen, B Kimelfeld, Y Sagiv Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on …, 2009 | 58 | 2009 |
| 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 | 55 | 2013 |
| A dichotomy in the complexity of deletion propagation with functional dependencies B Kimelfeld Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2012 | 55 | 2012 |
| Computing optimal repairs for functional dependencies E Livshits, B Kimelfeld, S Roy ACM Transactions on Database Systems (TODS) 45 (1), 1-46, 2020 | 48 | 2020 |
| Probabilistic data exchange R Fagin, B Kimelfeld, PG Kolaitis Journal of the ACM (JACM) 58 (4), 1-55, 2011 | 48 | 2011 |
| Flexible caching in trie joins O Kalinsky, Y Etsion, B Kimelfeld arXiv preprint arXiv:1602.08721, 2016 | 45 | 2016 |
| Maximizing conjunctive views in deletion propagation B Kimelfeld, J Vondrák, R Williams ACM Transactions on Database Systems (TODS) 37 (4), 1-37, 2012 | 45 | 2012 |
Ronald FaginIBM Almaden Research CenterVerified email at us.ibm.com
