{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220013","sets":["1164:3500:10803:10983"]},"path":["10983"],"owner":"44499","recid":"220013","title":["Towards Constructing Destination Node Index for Repetition Paths"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-09-02"},"_buckets":{"deposit":"1cb7f919-8173-487e-8484-8d690434fa3e"},"_deposit":{"id":"220013","pid":{"type":"depid","value":"220013","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Towards Constructing Destination Node Index for Repetition Paths","author_link":["574725","574726","574724","574722","574723","574721"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Towards Constructing Destination Node Index for Repetition Paths"},{"subitem_title":"Towards Constructing Destination Node Index for Repetition Paths","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-09-02","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Doshisha University, Graduate School of Culture and Information Science"},{"subitem_text_value":"Nagoya University, Mathematical and Data Science Center"},{"subitem_text_value":"Doshisha University, Faculty of Culture and Information Science"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Doshisha University, Graduate School of Culture and Information Science","subitem_text_language":"en"},{"subitem_text_value":"Nagoya University, Mathematical and Data Science Center","subitem_text_language":"en"},{"subitem_text_value":"Doshisha University, Faculty of Culture and Information Science","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/220013/files/IPSJ-IFAT22148015.pdf","label":"IPSJ-IFAT22148015.pdf"},"date":[{"dateType":"Available","dateValue":"2024-09-02"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IFAT22148015.pdf","filesize":[{"value":"878.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"9b2ac63c-f8ca-45ef-b8d5-88b13096af4c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuma, Kusu"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takahiro, Komamizu"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kenji, Hatano"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuma, Kusu","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takahiro, Komamizu","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kenji, Hatano","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10114171","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8884","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Graph database management systems (GDBMSs) enable users to traverse one edge at a fixed computing cost for vast and complex graph data. However, GDBMSs cannot avoid reaching already-scanned nodes from different starting nodes by repeatedly traversing edges, which we name a repetition path, with a specific relationship type. Therefore, when a GDBMS reaches a high degree node (HDN), the number of graph traversals increases in proportion to the number of its adjacent nodes. Consequently, the cost of traversing repetition paths extremely increases affected by HDNs in conventional GDBMSs. In this paper, we propose a graph index structure to repeatedly traverse edges belonging to a specific relationship type by distinguishing between HDNs and other nodes. Moreover, we also propose a method for compressing our index to take advantage of the characteristics of real-world networks so that a graph index tends to be the easily huge size of index files.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Graph database management systems (GDBMSs) enable users to traverse one edge at a fixed computing cost for vast and complex graph data. However, GDBMSs cannot avoid reaching already-scanned nodes from different starting nodes by repeatedly traversing edges, which we name a repetition path, with a specific relationship type. Therefore, when a GDBMS reaches a high degree node (HDN), the number of graph traversals increases in proportion to the number of its adjacent nodes. Consequently, the cost of traversing repetition paths extremely increases affected by HDNs in conventional GDBMSs. In this paper, we propose a graph index structure to repeatedly traverse edges belonging to a specific relationship type by distinguishing between HDNs and other nodes. Moreover, we also propose a method for compressing our index to take advantage of the characteristics of real-world networks so that a graph index tends to be the easily huge size of index files.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告情報基礎とアクセス技術（IFAT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-09-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"15","bibliographicVolumeNumber":"2022-IFAT-148"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":220013,"updated":"2025-01-19T14:41:56.585246+00:00","links":{},"created":"2025-01-19T01:20:03.921364+00:00"}