Caching for improved retrieval in peer-to-peer networks
作者： Wolf Siberski , Uwe Thaden , Wolfgang Nejdl , Wolf-Tilo Balke
DOI:
关键词:
摘要: In modern information systems the dominant retrieval paradigms have shifted from exact matching towards retrieving a list of most relevant objects. This is because users usually are not satisfied by arbitrarily large and unordered answer sets, but rather interested in small sets ”best” answers. All popular ranking approaches need collection-wide information. poses challenge P2P context where each peer has only local knowledge. We discuss how to deal with networks optimize query distribution based on result analysis, present evaluation results.
参考文章(5)
Wolf Siberski, Uwe Thaden, A simulation framework for schema-based query routing in p2p-networks extending database technology. pp. 436- 445 ,(2004) , 10.1007/978-3-540-30192-9_43
B. Beverly Yang, H. Garcia-Molina, Designing a super-peer network international conference on data engineering. pp. 49- 60 ,(2003) , 10.1109/ICDE.2003.1260781
W.-T. Balke, W. Nejdl, W. Siberski, U. Thaden, Progressive distributed top-k retrieval in peer-to-peer networks international conference on data engineering. pp. 174- 185 ,(2005) , 10.1109/ICDE.2005.115
W. Hypercup-hypercubes Nejdl, Mario T. Schlosser, Stefan Decker, Michael Sintek, Ontologies and efficient search on p2p networks Agents and Peer-to-Peer Computing. ,(2002)
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Tilo Balke, Top-k query evaluation for schema-based peer-to-peer networks international semantic web conference. pp. 137- 151 ,(2004) , 10.1007/978-3-540-30475-3_11