{"created":"2023-05-15T12:20:26.841405+00:00","id":11023,"links":{},"metadata":{"_buckets":{"deposit":"74bf2d92-65aa-4839-b917-fc0bffa6bc94"},"_deposit":{"created_by":1,"id":"11023","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"11023"},"status":"published"},"_oai":{"id":"oai:kansai-u.repo.nii.ac.jp:00011023","sets":["528:1538:1585"]},"author_link":["23548","23546","23549","23547"],"item_7_alternative_title_22":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Applying Graph-Partitioning Tree to Distance Range Queries in Road Networks"}]},"item_7_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2008-04-07","bibliographicIssueDateType":"Issued"},"bibliographic_titles":[{}]}]},"item_7_description_4":{"attribute_name":"概要","attribute_value_mlt":[{"subitem_description":"近年，道路網をグラフとして捉えた空間データベースの研究が盛んである．我々は，ネットワークボロノイ図と確率的手法を利用しながら，グラフを分割して階層化して構成した領域分割木を提案している．提案木は，最下位の領域分割からボトムアップに上位の階層を生成することにより，上位の階層がより広い範囲の領域となる．また、上位階層の領域と下位の領域が包含関係を満たす構造となっており，道路網応用に適した構成を持っている．本稿では，中心から一定範囲内のすべてのオブジェクトを抽出するDistance Range　Query(DRQ) 問題に対して提案木構造を適用し，その有効性について議論する．提案手法では，領域間の境界点に着目することにより，領域分割木の生成ならびに問合せ処理がリスト処理に帰着され、効率的な計算が可能となっている。また多くの従来手法と異なり，提案木が，道路網と領域関係をもとに構成されているため，問合せ範囲が与えられた時，多種類のオブジェクトに対して同時に問い合わせを実行することができる特徴を持つ．","subitem_description_type":"Other"}]},"item_7_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"DEIMフォーラム2009　第1回データ工学と情報マネジメントに関するフォーラム　2009年3月8日～10日","subitem_description_type":"Other"}]},"item_7_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"23548","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Kambara, Tomoya"}]},{"nameIdentifiers":[{"nameIdentifier":"23549","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Ueshima, Shinichi"}]}]},"item_7_publisher_36":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会"}]},"item_7_version_type_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"蒲原, 智也"}],"nameIdentifiers":[{"nameIdentifier":"23546","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"上島, 紳一"}],"nameIdentifiers":[{"nameIdentifier":"23547","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"10184920","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://nrid.nii.ac.jp/ja/nrid/1000010184920"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-05-22"}],"displaytype":"detail","filename":"KU-1100-20080407-3.pdf","filesize":[{"value":"505.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KU-1100-20080407-3.pdf","url":"https://kansai-u.repo.nii.ac.jp/record/11023/files/KU-1100-20080407-3.pdf"},"version_id":"085fdf4a-4c83-49d6-9c76-14c79aa4d2c7"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ネットワークボロノイ図","subitem_subject_scheme":"Other"},{"subitem_subject":"範囲問合せ","subitem_subject_scheme":"Other"},{"subitem_subject":"領域分割木","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"道路網に対する領域分割木を用いた範囲問い合わせ手法の提案","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"道路網に対する領域分割木を用いた範囲問い合わせ手法の提案"}]},"item_type_id":"7","owner":"1","path":["1585"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-07-05"},"publish_date":"2011-07-05","publish_status":"0","recid":"11023","relation_version_is_last":true,"title":["道路網に対する領域分割木を用いた範囲問い合わせ手法の提案"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-05-15T14:40:02.094809+00:00"}