• DocumentCode
    1872180
  • Title

    High search performance, small document index: P2P search can have both

  • Author

    Zhu, Yingwu ; Shen, Haiying

  • Author_Institution
    Dept. of Comput. Sci. & Software Eng., Seattle Univ., Seattle, WA, USA
  • fYear
    2009
  • fDate
    16-19 Dec. 2009
  • Firstpage
    312
  • Lastpage
    321
  • Abstract
    One primary goal in P2P networks is to provide high search performance for users to retrieve interested documents distributed over nodes. Document indexing is the key to search performance. However, it is challenging to guarantee high search performance with small document index. In this paper, we present iSearch which aims to build small document index to deliver high search performance on Gnutella-like P2P networks. The number of index terms per document is typically 4, which dramatically reduces associated cost in index storage and dissemination. iSearch explores two options to build index: top term-based indexing (TTI) and query-driven indexing (QDI). TTI bases selection of document index terms on term statistics, while QDI progressively refines document index by past queries. Our simulations show that that TTI and QDI improve search performance over random walk significantly. By dynamically adapting index based on past queries, QDI outperforms TTI greatly, by up to 2× recall improvement.
  • Keywords
    document handling; indexing; peer-to-peer computing; query processing; P2P networks; P2P search; document indexing; document retrieval; high search performance; iSearch; index storage; index terms; peer-to-peer networks; query-driven indexing; small document index; top term-based indexing; Computer science; Costs; Delay; Equations; Floods; Indexing; Information retrieval; Optical computing; Software engineering; Statistics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Computing (HiPC), 2009 International Conference on
  • Conference_Location
    Kochi
  • Print_ISBN
    978-1-4244-4922-4
  • Electronic_ISBN
    978-1-4244-4921-7
  • Type

    conf

  • DOI
    10.1109/HIPC.2009.5433196
  • Filename
    5433196