A Data Layout with Good Data Locality for Single-Machine based Graph Engines
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jo, Yong-Yeon | - |
dc.contributor.author | Jang, Myung-Hwan | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.contributor.author | Park, Sunju | - |
dc.date.accessioned | 2023-05-03T14:27:45Z | - |
dc.date.available | 2023-05-03T14:27:45Z | - |
dc.date.created | 2021-11-22 | - |
dc.date.issued | 2021-08 | - |
dc.identifier.issn | 0018-9340 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/185440 | - |
dc.description.abstract | Graph engines have been used in many applications to handle big graphs efficiently. The majority of the research to improve their performance has focused primarily on the design of efficient graph processing. This paper claims,however,the focus should be given also to graph storage design. This is because good storage design can improve both CPU performance and I/O performance of graph engines. In this paper,we propose an efficient data layout for single-machine based graph engines. We identify the common node access pattern of the graph algorithms running on single-machine based graph engines. Based on this finding,we propose the breadth-first (BF) data layout which places the nodes processed together in the same or adjacent storage space so that they can be accessed together as much as possible. The experimental results show that the BF data layout improves both CPU and I/O performances significantly in all single-machine based graph engines. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | A Data Layout with Good Data Locality for Single-Machine based Graph Engines | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1109/TC.2021.3107725 | - |
dc.identifier.scopusid | 2-s2.0-85113852016 | - |
dc.identifier.wosid | 000822371600001 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON COMPUTERS, v.71, no.8, pp.1784 - 1793 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON COMPUTERS | - |
dc.citation.title | IEEE TRANSACTIONS ON COMPUTERS | - |
dc.citation.volume | 71 | - |
dc.citation.number | 8 | - |
dc.citation.startPage | 1784 | - |
dc.citation.endPage | 1793 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | Digital storage | - |
dc.subject.keywordPlus | Engines | - |
dc.subject.keywordPlus | Access patterns | - |
dc.subject.keywordPlus | Breadth-first | - |
dc.subject.keywordPlus | Data layouts | - |
dc.subject.keywordPlus | Good data | - |
dc.subject.keywordPlus | Graph processing | - |
dc.subject.keywordPlus | Single- machines | - |
dc.subject.keywordPlus | Storage spaces | - |
dc.subject.keywordPlus | Graph algorithms | - |
dc.subject.keywordAuthor | Data layout | - |
dc.subject.keywordAuthor | data locality | - |
dc.subject.keywordAuthor | graph engine | - |
dc.subject.keywordAuthor | single machine | - |
dc.subject.keywordAuthor | breadth first search | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9522039 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.