![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Benny Kimelfeld Sara Cohen , Yaron Kanza , Benny Kimelfeld, Yehoshua Sagiv : Interconnection semantics for keyword search in XML. CIKM 2005 : 389-396 Benny Kimelfeld, Yehoshua Sagiv : Efficiently Enumerating Results of Keyword Search. DBPL 2005 : 58-73 Benny Kimelfeld, Yehoshua Sagiv : Efficient Engines for Keyword Proximity Search. WebDB 2005 : 67-72 1 [ 3 ] 2 [ 3 ] 3 [ 1 ] [ 2 ] [ 3 ] ![]() ©2006 Association for Computing Machinery |