{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T07:51:26Z","timestamp":1725609086471},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1109\/bigcomp51126.2021.00043","type":"proceedings-article","created":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T21:58:10Z","timestamp":1615413490000},"page":"188-191","source":"Crossref","is-referenced-by-count":1,"title":["A Hub-based Graph Management for Efficient Repetition Path Traversing"],"prefix":"10.1109","author":[{"given":"Kazuma","family":"Kusu","sequence":"first","affiliation":[]},{"given":"Kenji","family":"Hatano","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/3297753.3297759"},{"journal-title":"LDBC’s HP","year":"2020","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"journal-title":"ldbc\/ldbc snb datagen git","year":"2020","key":"ref13"},{"journal-title":"ldbc snb implementations git","year":"2020","key":"ref14"},{"journal-title":"Graph Databases","year":"2015","author":"robinson","key":"ref4"},{"journal-title":"Graph Data Management Techniques and Applications","year":"2011","author":"sakr","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-61350-053-8.ch004"},{"key":"ref5","first-page":"29","article-title":"The Graph Traversal Pattern","author":"sakr","year":"2012","journal-title":"Graph Data Management Techniques and Applications"},{"journal-title":"Breadth First Search algorithm","year":"2020","author":"eppstein","key":"ref8"},{"key":"ref7","first-page":"49","article-title":"Leveraging Bitmap Indexing for Subgraph Searching","author":"luaces","year":"2019","journal-title":"22nd International Conference on Extending Database Technology (EDBT) OpenProceedings org"},{"journal-title":"Ranking of Graph DBMS","year":"2020","key":"ref2"},{"journal-title":"Network Science","year":"2016","author":"barab\u00e1si","key":"ref1"},{"journal-title":"Neo4j’s HP","year":"2020","key":"ref9"}],"event":{"name":"2021 IEEE International Conference on Big Data and Smart Computing (BigComp)","start":{"date-parts":[[2021,1,17]]},"location":"Jeju Island, Korea (South)","end":{"date-parts":[[2021,1,20]]}},"container-title":["2021 IEEE International Conference on Big Data and Smart Computing (BigComp)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9373068\/9373070\/09373134.pdf?arnumber=9373134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:42:56Z","timestamp":1652197376000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9373134\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/bigcomp51126.2021.00043","relation":{},"subject":[],"published":{"date-parts":[[2021,1]]}}}