| 2011 |
|---|
| 35 | A Graph Approach to Spelling Correction in Domain-Centric Search. Zhuowei Bao, Benny Kimelfeld, Yunyao Li. ACL 2011, 905-914. Web SearchBibTeXDownload |
| 34 | Probabilistic data exchange. Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis. J. ACM (58): 15 (2011). Web SearchBibTeXDownload |
| 33 | Maximizing conjunctive views in deletion propagation. Benny Kimelfeld, Jan Vondrák, Ryan Williams. PODS 2011, 187-198. Web SearchBibTeXDownload |
| 32 | Rewrite rules for search database systems. Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan. PODS 2011, 271-282. Web SearchBibTeXDownload |
| 31 | Finding a minimal tree pattern under neighborhood constraints. Benny Kimelfeld, Yehoshua Sagiv. PODS 2011, 235-246. Web SearchBibTeXDownload |
| 30 | Optimizing and Parallelizing Ranked Enumeration. Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv. PVLDB (4): 1028-1039 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 29 | Probabilistic data exchange. Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis. ICDT 2010, 76-88. Web SearchBibTeXDownload |
| 28 | Querying parse trees of stochastic context-free grammars. Sara Cohen, Benny Kimelfeld. ICDT 2010, 62-75. Web SearchBibTeXDownload |
| 27 | Transducing Markov sequences. Benny Kimelfeld, Christopher Ré. PODS 2010, 15-26. Web SearchBibTeXDownload |
| 26 | Understanding queries in a search database system. Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan. PODS 2010, 273-284. Web SearchBibTeXDownload |
| 25 | Exploratory keyword search on data graphs. Hilit Achiezra, Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv. SIGMOD Conference 2010, 1163-1166. Web SearchBibTeXDownload |
| 2009 |
|---|
| 24 | Incorporating constraints in probabilistic XML. Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv. ACM Trans. Database Syst. (34) (2009). Cited by 15Web SearchBibTeXDownload |
| 23 | On rewriting XPath queries using views. Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Benny Kimelfeld, Vassia Pavlaki, Yehoshua Sagiv. EDBT 2009, 168-179. Web SearchBibTeXDownload |
| 22 | Running tree automata on probabilistic XML. Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv. PODS 2009, 227-236. Cited by 5Web SearchBibTeXDownload |
| 21 | ExQueX: exploring and querying XML documents. Benny Kimelfeld, Yehoshua Sagiv, Gidi Weber. SIGMOD Conference 2009, 1103-1106. Web SearchBibTeXDownload |
| 20 | Query evaluation over probabilistic XML. Benny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv. VLDB J. (18): 1117-1140 (2009). Web SearchBibTeXDownload |
| 19 | On the expressiveness of probabilistic XML models. Serge Abiteboul, Benny Kimelfeld, Yehoshua Sagiv, Pierre Senellart. VLDB J. (18): 1041-1064 (2009). Cited by 7Web SearchBibTeXDownload |
| 2008 |
|---|
| 18 | Revisiting redundancy and minimization in an XPath fragment. Benny Kimelfeld, Yehoshua Sagiv. EDBT 2008, 61-72. Web SearchBibTeXDownload |
| 17 | Efficiently enumerating results of keyword search over data graphs. Benny Kimelfeld, Yehoshua Sagiv. Inf. Syst. (33): 335-359 (2008). Web SearchBibTeXDownload |
| 16 | Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties. Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv. J. Comput. Syst. Sci. (74): 1147-1159 (2008). Web SearchBibTeXDownload |
| 15 | Incorporating constraints in probabilistic XML. Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv. PODS 2008, 109-118. Cited by 15Web SearchBibTeXDownload |
| 14 | Keyword proximity search in complex data graphs. Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv. SIGMOD Conference 2008, 927-940. Web SearchBibTeXDownload |
| 13 | Query efficiency in probabilistic XML models. Benny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv. SIGMOD Conference 2008, 701-714. Web SearchBibTeXDownload |
| 12 | Modeling and querying probabilistic XML data. Benny Kimelfeld, Yehoshua Sagiv. SIGMOD Record (37): 69-77 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 11 | Combining Incompleteness and Ranking in Tree Queries. Benny Kimelfeld, Yehoshua Sagiv. ICDT 2007, 329-343. Web SearchBibTeXDownload |
| 10 | Maximally joining probabilistic data. Benny Kimelfeld, Yehoshua Sagiv. PODS 2007, 303-312. Web SearchBibTeXDownload |
| 9 | Matching Twigs in Probabilistic XML. Benny Kimelfeld, Yehoshua Sagiv. VLDB 2007, 27-38. Web SearchBibTeXDownload |
| 2006 |
|---|
| 8 | Using Language Models and the HITS Algorithm for XML Retrieval. Benny Kimelfeld, Eitan Kovacs, Yehoshua Sagiv, Dan Yahav. INEX 2006, 253-260. Web SearchBibTeXDownload |
| 7 | Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. Benny Kimelfeld, Yehoshua Sagiv. NGITS 2006, 141-152. Web SearchBibTeXDownload |
| 6 | Finding and approximating top-k answers in keyword proximity search. Benny Kimelfeld, Yehoshua Sagiv. PODS 2006, 173-182. Web SearchBibTeXDownload |
| 5 | Full Disjunctions: Polynomial-Delay Iterators in Action. Sara Cohen, Itzhak Fadida, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv. VLDB 2006, 739-750. Cited by 12Web SearchBibTeXDownload |
| 4 | Twig Patterns: From XML Trees to Graphs. Benny Kimelfeld, Yehoshua Sagiv. WebDB 2006. Web SearchBibTeXDownload |
| 2005 |
|---|
| 3 | Interconnection semantics for keyword search in XML. Sara Cohen, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv. CIKM 2005, 389-396. Cited by 50Web SearchBibTeXDownload |
| 2 | Efficiently Enumerating Results of Keyword Search. Benny Kimelfeld, Yehoshua Sagiv. DBPL 2005, 58-73. Web SearchBibTeXDownload |
| 1 | Efficient Engines for Keyword Proximity Search. Benny Kimelfeld, Yehoshua Sagiv. WebDB 2005, 67-72. Web SearchBibTeX |
