{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1050845762829468928.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"URI","@value":"https://ipsj.ixsq.nii.ac.jp/records/70360"}},{"identifier":{"@type":"NAID","@value":"110007970789"}}],"resourceType":"学術雑誌論文(journal article)","dc:title":[{"@value":"P2PネットワークにおけるBloom Filterを用いた移動履歴に基づくユーザ探索手法の提案"},{"@language":"en","@value":"Proposal of a User Search Method Based on Movement Records Utilizing Bloom Filter for P2P Network"}],"dc:language":"ja","description":[{"type":"Other","notation":[{"@value":"本稿では，ユーザの移動履歴がP2Pネットワークにおいて分散管理されている状況のもと，指定した移動履歴を持つユーザを効率的に探索するための手法を提案する．提案手法では，移動履歴を，訪問場所を示すspot IDと訪問時刻を示すtimeの組を1つの要素とした系列とし，各要素にBloom Filterを適用したビット論理和をユーザ（ピア）ごとに算出する．この算出されたBloom FilterをBloom FilterのP2Pネットワークでの探索手法であるBloom Finger Table（BFT）に適用し，移動履歴のAND/OR検索を実現する．提案手法により，時間指定を含め指定した経路の一部またはすべてをたどったユーザの探索が効率的に実現できる．また，ユーザ探索におけるメッセージ数を削減し，検索適合率を上昇させるため，行動範囲が類似したユーザのピアIDが近傍となるピアIDの割当て法（地理的ピアID）を提案する．提案手法の有効性をシミュレーションにより評価し，従来手法であるMulti-key Skip Graph（MKSG）との比較により1,000ピアがそれぞれ100の移動履歴を持つ状況での経路検索でAND検索において，メッセージ数は80%，OR検索においては，88% 削減できることを確認した．"}]},{"type":"Other","notation":[{"@value":"In this paper, we propose a P2P user search method based on movement records. In our proposal, a Bloom Filter is applied to each spotID and time to combine all movement records for one user (peer) as a fixed length bit array. To search a user who followed specified course, we propose a AND/OR search method based on Bloom Finger Table (BFT), which extends finger table, a routing table of Chord DHT to achieve multiple attribute retrieval. By using proposed method, we can efficiently retrieve a user who followed a part of or all of the specified course including time. Additionally, in order to reduce the number of messages and to raise precision of search for a user search, we propose a peer-ID assignment method based on user's geographical foothold. We evaluated our proposal by simulations comparing with Multi-key Skip Graph that is an existing search method on P2P networks. In AND search, we confirmed the number of messages can be reduced by 80% and in OR search, 88% when there are 1,000 peers and each peer has 100 movement records."}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1420564276163730048","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"50263215"},{"@type":"NRID","@value":"1000050263215"},{"@type":"NRID","@value":"9000415210094"},{"@type":"NRID","@value":"9000242080792"},{"@type":"NRID","@value":"9000004806010"},{"@type":"NRID","@value":"9000403601551"},{"@type":"NRID","@value":"9000415170958"},{"@type":"NRID","@value":"9000287157523"},{"@type":"NRID","@value":"9000287157357"},{"@type":"NRID","@value":"9000404294984"},{"@type":"NRID","@value":"9000238865291"},{"@type":"NRID","@value":"9000238865287"},{"@type":"NRID","@value":"9000347538643"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/harumoto"}],"foaf:name":[{"@value":"白木, 徹"},{"@value":"寺西, 裕一"},{"@value":"竹内, 亨"},{"@value":"春本, 要"},{"@value":"西尾, 章治郎"}]},{"@id":"https://cir.nii.ac.jp/crid/1070865265055386625","@type":"Researcher","foaf:name":[{"@value":"Toru, Shiraki"},{"@value":"Yuuichi, Teranishi"},{"@value":"Susumu, Takeuchi"},{"@value":"Kaname, Harumoto"},{"@value":"Shojiro, Nishio"}]}],"publication":{"publicationIdentifier":[{"@type":"ISSN","@value":"18827764"},{"@type":"NCID","@value":"AN00116647"}],"prism:publicationName":[{"@value":"情報処理学会論文誌"}],"prism:publicationDate":"2010-09-15","prism:volume":"51","prism:number":"9","prism:startingPage":"1905","prism:endingPage":"1915"},"url":[{"@id":"https://ipsj.ixsq.nii.ac.jp/records/70360"},{"@id":"http://id.nii.ac.jp/1001/00070360/"}],"foaf:topic":[{"@id":"https://cir.nii.ac.jp/all?q=%E4%B8%80%E8%88%AC%E8%AB%96%E6%96%87","dc:title":"一般論文"}],"dcterms:subject":[{"subjectScheme":"Other","notation":[{"@value":"一般論文"}]}],"dataSourceIdentifier":[{"@type":"IRDB","@value":"oai:irdb.nii.ac.jp:02902:0003161596"},{"@type":"CIA","@value":"110007970789"}]}