- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c33 |      | Sara Cohen, Lior Ebel, Benny Kimelfeld: A Social Network Database that Learns How to Answer Queries. CIDR 2013 |
| c32 | | Benny Kimelfeld, Yehoshua Sagiv: Extracting minimum-weight tree patterns from a schema with neighborhood constraints. ICDT 2013: 249-260 |
| 2012 | ||
| j9 | | Benny Kimelfeld, Jan Vondrák, Ryan Williams: Maximizing Conjunctive Views in Deletion Propagation. ACM Trans. Database Syst. 37(4): 24 (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 |
| p1 | | Sara Cohen, Benny Kimelfeld, Georgia Koutrika: A Survey on Proximity Measures for Social Networks. SeCO Book 2012: 191-206 |
| c29 | | Zhuowei Bao, Benny Kimelfeld, Yunyao Li: Automatic suggestion of query-rewrite rules for enterprise search. SIGIR 2012: 591-600 |
| 2011 | ||
| j8 | | Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis: Probabilistic data exchange. J. ACM 58(4): 15 (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 |
| 2009 | ||
| j6 | | Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv: Incorporating constraints in probabilistic XML. ACM Trans. Database Syst. 34(3) (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 |  | |
Data released under the ODC-BY 1.0 license — See also our legal information page