|  | 2009 | 
|---|
| 24 |            | Foto N. Afrati,
Rada Chirkova,
Manolis Gergatsoulis,
Benny Kimelfeld,
Vassia Pavlaki,
Yehoshua Sagiv:
On rewriting XPath queries using views.
EDBT 2009: 168-179 | 
| 23 |            | Sara Cohen,
Benny Kimelfeld,
Yehoshua Sagiv:
Running tree automata on probabilistic XML.
PODS 2009: 227-236 | 
| 22 |            | Benny Kimelfeld,
Yehoshua Sagiv,
Gidi Weber:
ExQueX: exploring and querying XML documents.
SIGMOD Conference 2009: 1103-1106 | 
| 21 |            | Sara Cohen,
Benny Kimelfeld,
Yehoshua Sagiv:
Incorporating constraints in probabilistic XML.
ACM Trans. Database Syst. 34(3):  (2009) | 
| 20 |            | Serge Abiteboul,
Benny Kimelfeld,
Yehoshua Sagiv,
Pierre Senellart:
On the expressiveness of probabilistic XML models.
VLDB J. 18(5): 1041-1064 (2009) | 
| 19 |            | Benny Kimelfeld,
Yuri Kosharovsky,
Yehoshua Sagiv:
Query evaluation over probabilistic XML.
VLDB J. 18(5): 1117-1140 (2009) | 
|  | 2008 | 
|---|
| 18 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Revisiting redundancy and minimization in an XPath fragment.
EDBT 2008: 61-72 | 
| 17 |            | Sara Cohen,
Benny Kimelfeld,
Yehoshua Sagiv:
Incorporating constraints in probabilistic XML.
PODS 2008: 109-118 | 
| 16 |            | Benny Kimelfeld,
Yuri Kosharovsky,
Yehoshua Sagiv:
Query efficiency in probabilistic XML models.
SIGMOD Conference 2008: 701-714 | 
| 15 |            | Konstantin Golenberg,
Benny Kimelfeld,
Yehoshua Sagiv:
Keyword proximity search in complex data graphs.
SIGMOD Conference 2008: 927-940 | 
| 14 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Efficiently enumerating results of keyword search over data graphs.
Inf. Syst. 33(4-5): 335-359 (2008) | 
| 13 |            | 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) | 
| 12 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Modeling and querying probabilistic XML data.
SIGMOD Record 37(4): 69-77 (2008) | 
|  | 2007 | 
|---|
| 11 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Combining Incompleteness and Ranking in Tree Queries.
ICDT 2007: 329-343 | 
| 10 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Maximally joining probabilistic data.
PODS 2007: 303-312 | 
| 9 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Matching Twigs in Probabilistic XML.
VLDB 2007: 27-38 | 
|  | 2006 | 
|---|
| 8 |            | Benny Kimelfeld,
Eitan Kovacs,
Yehoshua Sagiv,
Dan Yahav:
Using Language Models and the HITS Algorithm for XML Retrieval.
INEX 2006: 253-260 | 
| 7 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries.
NGITS 2006: 141-152 | 
| 6 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Finding and approximating top-k answers in keyword proximity search.
PODS 2006: 173-182 | 
| 5 |            | Sara Cohen,
Itzhak Fadida,
Yaron Kanza,
Benny Kimelfeld,
Yehoshua Sagiv:
Full Disjunctions: Polynomial-Delay Iterators in Action.
VLDB 2006: 739-750 | 
| 4 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Twig Patterns: From XML Trees to Graphs.
WebDB 2006 | 
|  | 2005 | 
|---|
| 3 |            | Sara Cohen,
Yaron Kanza,
Benny Kimelfeld,
Yehoshua Sagiv:
Interconnection semantics for keyword search in XML.
CIKM 2005: 389-396 | 
| 2 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Efficiently Enumerating Results of Keyword Search.
DBPL 2005: 58-73 | 
| 1 |            | Benny Kimelfeld,
Yehoshua Sagiv:
Efficient Engines for Keyword Proximity Search.
WebDB 2005: 67-72 |