{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214790","sets":["6504:10735:10806"]},"path":["10806"],"owner":"44499","recid":"214790","title":["グラフk近傍検索のための高速な索引構築手法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-04"},"_buckets":{"deposit":"a908a850-099c-465e-8a8d-820cf95d1ece"},"_deposit":{"id":"214790","pid":{"type":"depid","value":"214790","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"グラフk近傍検索のための高速な索引構築手法の提案","author_link":["552219","552218","552217"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"グラフk近傍検索のための高速な索引構築手法の提案"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"データとウェブ","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2021-03-04","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"筑波大"},{"subitem_text_value":"筑波大"},{"subitem_text_value":"筑波大"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/214790/files/IPSJ-Z83-5L-05.pdf","label":"IPSJ-Z83-5L-05.pdf"},"date":[{"dateType":"Available","dateValue":"2021-12-28"}],"format":"application/pdf","filename":"IPSJ-Z83-5L-05.pdf","filesize":[{"value":"234.6 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"ac4a5e77-ec94-486e-a282-ba7786d07ba5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小林, 瑞季"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"真次, 彰平"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"塩川, 浩昭"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"k近傍検索はグラフ構造において特定の頂点からk個の近傍を特定する検索であり，検索の高速化が重要となっている．代表的な高速化手法としてグラフを用いたインデックスを作成する方法があり，様々なインデックスが考案されている．しかし，それらのインデックスは主に交通ネットワークなどの単純なグラフに特化しており，ソーシャルネットワークなどの複雑なグラフに適用するのが難しい．そこで本稿では，複雑なグラフでも検索を高速に処理できる最小全域木を基にしたグラフ型インデックスを提案する．実データを用いた実験を行い，既存の手法に比べてインデックス作成時間を最大181倍高速に計算できることを確認した．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"370","bibliographic_titles":[{"bibliographic_title":"第83回全国大会講演論文集"}],"bibliographicPageStart":"369","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2021"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214790,"updated":"2025-01-19T16:28:00.858276+00:00","links":{},"created":"2025-01-19T01:15:35.266045+00:00"}