Publications

• Matching Twigs in Probabilistic XML [ppt] Benny Kimelfeld and Yehoshua Sagiv. In Proceedings of the 33rd Internation Conference on Very Large Data Bases (VLDB), September 2007.
• Maximally Joining Probabilistic Data. Benny Kimelfeld and Yehoshua Sagiv. In Proceedings of the 26th ACM Symposium on Principles of Database Systems (PODS), June 2007.
• Combining Incompleteness and Ranking in Tree Queries Benny Kimelfeld and Yehoshua Sagiv. In 11th International Conference on Database Theory Conference (ICDT), January 2007.
• Using Language Models and the HITS Algorithm for XML Retrieval Benny Kimelfeld, Eitan Kovacs, Yehoshua Sagiv and Dan Yahav. In 4th International Workshop of the Initiative for the Evaluation of XML Retrieval (INEX), 2007.
• Full Disjunctions: Polynomial-Delay Iterators in Action. Sara Cohen, Itzhak Fadida, Yaron Kanza, Benny Kimelfeld and Yehoshua Sagiv. In Proceedings of the 32nd Internation Conference on Very Large Data Bases (VLDB), September 2006.
• Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. Benny Kimelfeld and Yehoshua Sagiv. In Proceedings of the 6th Workshop on Next Generation Information Systems (NGITS), July 2006.
• Twig Patterns: From XML Trees to Graphs. Benny Kimelfeld and Yehoshua Sagiv. In Proceedings of the 9th International Workshop on the Web & Databases (WebDB), June 2006.
• Finding and Approximating Top-k Answers in Keyword Proximity Search. Benny Kimelfeld and Yehoshua Sagiv. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), June 2006.
• Interconnection Semantics for Keyword Search in XML. Sara Cohen, Yaron Kanza, Benny Kimelfeld and Yehoshua Sagiv. In Proceedings of the 2005 ACM International Conference on Information and Knowledge Management (CIKM), October - November 2005.
• Efficiently Enumerating Results of Keyword Search. Benny Kimelfeld and Yehoshua Sagiv. In 10th International Symposium on Database Programming Languages (DBPL), August 2005.
• Efficient Engines for Keyword Proximity Search. Benny Kimelfeld and Yehoshua Sagiv. In Proceedings of the 8th International Workshop on the Web & Databases (WebDB), June 2005.

Unpublished Manuscripts

• New Algorithms for Computing Steiner Trees for a Fixed Number of Terminals. Benny Kimelfeld and Yehoshua Sagiv.

Master's Thesis

• Interconnection Semantics for XML. The Hebrew University, 2004.