Clik here to view.
Efficient Engines for Keyword Proximity Search.
Benny Kimelfeld, Yehoshua Sagiv: Efficient Engines for Keyword Proximity Search. WebDB 2005: 67-72
View ArticleClik here to view.
Efficiently Enumerating Results of Keyword Search.
Benny Kimelfeld, Yehoshua Sagiv: Efficiently Enumerating Results of Keyword Search. DBPL 2005: 58-73
View ArticleClik here to view.
Interconnection semantics for keyword search in XML.
Sara Cohen, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv: Interconnection semantics for keyword search in XML. CIKM 2005: 389-396
View ArticleClik here to view.
Twig Patterns: From XML Trees to Graphs.
Benny Kimelfeld, Yehoshua Sagiv: Twig Patterns: From XML Trees to Graphs. WebDB 2006
View ArticleClik here to view.
Full Disjunctions: Polynomial-Delay Iterators in Action.
Sara Cohen, Itzhak Fadida, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv: Full Disjunctions: Polynomial-Delay Iterators in Action. VLDB 2006: 739-750
View ArticleClik here to view.
Finding and approximating top-k answers in keyword proximity search.
Benny Kimelfeld, Yehoshua Sagiv: Finding and approximating top-k answers in keyword proximity search. PODS 2006: 173-182
View ArticleClik here to view.
Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries.
Benny Kimelfeld, Yehoshua Sagiv: Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. NGITS 2006: 141-152
View ArticleClik here to view.
Using Language Models and the HITS Algorithm for XML Retrieval.
Benny Kimelfeld, Eitan Kovacs, Yehoshua Sagiv, Dan Yahav: Using Language Models and the HITS Algorithm for XML Retrieval. INEX 2006: 253-260
View ArticleClik here to view.
Matching Twigs in Probabilistic XML.
Benny Kimelfeld, Yehoshua Sagiv: Matching Twigs in Probabilistic XML. VLDB 2007: 27-38
View ArticleClik here to view.
Maximally joining probabilistic data.
Benny Kimelfeld, Yehoshua Sagiv: Maximally joining probabilistic data. PODS 2007: 303-312
View ArticleClik here to view.
Combining Incompleteness and Ranking in Tree Queries.
Benny Kimelfeld, Yehoshua Sagiv: Combining Incompleteness and Ranking in Tree Queries. ICDT 2007: 329-343
View ArticleClik here to view.
Keyword proximity search in complex data graphs.
Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv: Keyword proximity search in complex data graphs. SIGMOD Conference 2008: 927-940
View ArticleClik here to view.
Query efficiency in probabilistic XML models.
Benny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv: Query efficiency in probabilistic XML models. SIGMOD Conference 2008: 701-714
View ArticleClik here to view.
Incorporating constraints in probabilistic XML.
Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv: Incorporating constraints in probabilistic XML. PODS 2008: 109-118
View ArticleClik here to view.
Revisiting redundancy and minimization in an XPath fragment.
Benny Kimelfeld, Yehoshua Sagiv: Revisiting redundancy and minimization in an XPath fragment. EDBT 2008: 61-72
View ArticleClik here to view.
Modeling and querying probabilistic XML data.
Benny Kimelfeld, Yehoshua Sagiv: Modeling and querying probabilistic XML data. SIGMOD Rec. 37(4): 69-77 (2008)
View ArticleClik here to view.
Generating all maximal induced subgraphs for hereditary and...
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)
View ArticleClik here to view.
Efficiently enumerating results of keyword search over data graphs.
Benny Kimelfeld, Yehoshua Sagiv: Efficiently enumerating results of keyword search over data graphs. Inf. Syst. 33(4-5): 335-359 (2008)
View ArticleClik here to view.
Querying paradigms for the web (פרדיגמותלשאילתותמעלמידעבאינטרנט.).
Benny Kimelfeld: Querying paradigms for the web (פרדיגמות לשאילתות מעל מידע באינטרנט.). Hebrew University of Jerusalem, Israel, 2008
View ArticleClik here to view.
ExQueX: exploring and querying XML documents.
Benny Kimelfeld, Yehoshua Sagiv, Gidi Weber: ExQueX: exploring and querying XML documents. SIGMOD Conference 2009: 1103-1106
View Article
