| 2007 |
|---|
| 11 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Combining Incompleteness and Ranking in Tree Queries.
ICDT 2007: 329-343 |
| 10 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Maximally joining probabilistic data.
PODS 2007: 303-312 |
| 9 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Matching Twigs in Probabilistic XML.
VLDB 2007: 27-38 |
| 2006 |
|---|
| 8 | EE | Benny Kimelfeld,
Eitan Kovacs,
Yehoshua Sagiv,
Dan Yahav:
Using Language Models and the HITS Algorithm for XML Retrieval.
INEX 2006: 253-260 |
| 7 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries.
NGITS 2006: 141-152 |
| 6 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Finding and approximating top-k answers in keyword proximity search.
PODS 2006: 173-182 |
| 5 | EE | Sara Cohen,
Itzhak Fadida,
Yaron Kanza,
Benny Kimelfeld,
Yehoshua Sagiv:
Full Disjunctions: Polynomial-Delay Iterators in Action.
VLDB 2006: 739-750 |
| 4 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Twig Patterns: From XML Trees to Graphs.
WebDB 2006 |
| 2005 |
|---|
| 3 | EE | Sara Cohen,
Yaron Kanza,
Benny Kimelfeld,
Yehoshua Sagiv:
Interconnection semantics for keyword search in XML.
CIKM 2005: 389-396 |
| 2 | EE | 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 |
