<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-10T12:23:44Z</responseDate>
  <request metadataPrefix="oai_dc" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00081782">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00081782</identifier>
        <datestamp>2025-01-20T06:51:48Z</datestamp>
        <setSpec>581:6644:6761</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Tag-Based Scheme to Realize Real-Time File Search in Hierarchical Peer-to-Peer Systems</dc:title>
          <dc:title>A Tag-Based Scheme to Realize Real-Time File Search in Hierarchical Peer-to-Peer Systems</dc:title>
          <dc:creator>TingTingQin</dc:creator>
          <dc:creator>Qi, Cao</dc:creator>
          <dc:creator>QiYingWei</dc:creator>
          <dc:creator>Satoshi, Fujita</dc:creator>
          <dc:creator>Ting, Qin</dc:creator>
          <dc:creator>Qi, Cao</dc:creator>
          <dc:creator>Qi, YingWei</dc:creator>
          <dc:creator>Satoshi, Fujita</dc:creator>
          <dc:subject>一般論文</dc:subject>
          <dc:description>In this paper, we propose a new method to realize quick update of information concerned with shared contents in Peer-to-Peer (P2P) networks. The proposed method is a combination of a hierarchical P2P architecture and a tag-based file management scheme. The hierarchical architecture consists of three layers: the top layer consisting of a collection of central servers, the middle layer consisting of a set of sub-servers, and the bottom layer consisting of a number of user peers. Indexes of files held by each user peer are stored at the sub-servers in the middle layer, and the correlation between file indexes and sub-servers is maintained by central servers using tags. We implemented a prototype of the proposed method using Java, and evaluated the performance through simulations using PeerSim 1.0.4. The results of our experiments indicate that the proposed method is a good candidate for “real-time search engines” in P2P systems; e.g., it completes an upload of 10,000 file indexes to the relevant sub-servers in a few minutes and achieves query forwarding to relevant peers within 100ms.

------------------------------ 
This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online) 
DOI　http://dx.doi.org/10.2197/ipsjjip.20.463
------------------------------</dc:description>
          <dc:description>In this paper, we propose a new method to realize quick update of information concerned with shared contents in Peer-to-Peer (P2P) networks. The proposed method is a combination of a hierarchical P2P architecture and a tag-based file management scheme. The hierarchical architecture consists of three layers: the top layer consisting of a collection of central servers, the middle layer consisting of a set of sub-servers, and the bottom layer consisting of a number of user peers. Indexes of files held by each user peer are stored at the sub-servers in the middle layer, and the correlation between file indexes and sub-servers is maintained by central servers using tags. We implemented a prototype of the proposed method using Java, and evaluated the performance through simulations using PeerSim 1.0.4. The results of our experiments indicate that the proposed method is a good candidate for “real-time search engines” in P2P systems; e.g., it completes an upload of 10,000 file indexes to the relevant sub-servers in a few minutes and achieves query forwarding to relevant peers within 100ms.

------------------------------ 
This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online) 
DOI　http://dx.doi.org/10.2197/ipsjjip.20.463
------------------------------</dc:description>
          <dc:description>journal article</dc:description>
          <dc:date>2012-04-15</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>情報処理学会論文誌</dc:identifier>
          <dc:identifier>4</dc:identifier>
          <dc:identifier>53</dc:identifier>
          <dc:identifier>1882-7764</dc:identifier>
          <dc:identifier>AN00116647</dc:identifier>
          <dc:identifier>https://ipsj.ixsq.nii.ac.jp/record/81782/files/IPSJ-JNL5304024.pdf</dc:identifier>
          <dc:language>eng</dc:language>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
