Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Termset-Based Indexing and Query Processing in P2P Search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wang Zhenhua ; Coll. of Inf. Sci. & Eng., Northeastern Univ. (NEU), Shenyang, China ; Shen Derong ; Yu Ge

Multi-term query is a common issue in information retrieval system. In large-scale P2P information retrieval, the method of indexing and query processing based on single-term results in large bandwidth cost. We take into account the correlation among terms and propose a termset-based indexing and query processing method suited for information retrieval in structured P2P overlay. Employing statistics, metadata and query log, we construct a dynamic termset corpus, and the index is built based on termset. When processing query, the peer extracts the termsets from the query terms, and each termset is treated as a key. Several methods are applied to reduce bandwidth consumption. We also present a method of query expansion to be a complement when there are no sufficient results. The experiments show that our method has good performance, and it is suitable for large-scale distributed information retrieval.

Published in:

Computer Science-Technology and Applications, 2009. IFCSTA '09. International Forum on  (Volume:3 )

Date of Conference:

25-27 Dec. 2009