{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:01:49Z","timestamp":1775815309906,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T00:00:00Z","timestamp":1633651200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T00:00:00Z","timestamp":1633651200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s11704-020-0255-y","type":"journal-article","created":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T16:02:29Z","timestamp":1633795349000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An efficient memory data organization strategy for application-characteristic graph processing"],"prefix":"10.1007","volume":"16","author":[{"given":"Peng","family":"Fang","sequence":"first","affiliation":[]},{"given":"Fang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhan","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Qianxu","family":"Yi","sequence":"additional","affiliation":[]},{"given":"Xianghao","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yongxuan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,8]]},"reference":[{"key":"255_CR1","doi-asserted-by":"crossref","unstructured":"Balaji V, Lucia B. When is graph reordering an optimization? studying the effect of lightweight graph reordering across applications and input graphs. In: Proceedings of IEEE International Symposium on Workload Characterization. 2018, 203\u2013214","DOI":"10.1109\/IISWC.2018.8573478"},{"key":"255_CR2","doi-asserted-by":"crossref","unstructured":"Wei H, Yu J X, Lu C, Lin X M. Speedup graph processing by graph ordering. In: Proceedings of ACM International Conference on Management of Data. 2016, 1813\u20131828","DOI":"10.1145\/2882903.2915220"},{"key":"255_CR3","doi-asserted-by":"crossref","unstructured":"Shan Y X, Shi Z, Feng D, Mengyun O, Wang F. Cache-friendly data layout for massive graph. In: Proceedings of IEEE International Conference on Networking Architecture and Storages. 2018, 1\u20134","DOI":"10.1109\/NAS.2018.8515737"},{"key":"255_CR4","doi-asserted-by":"crossref","unstructured":"Pearce R, Gokhale M, Amato N M. Multithreaded asynchronous graph traversal for in-memory and semi-external memory. In: Proceedings of ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis. 2010, 1\u201311","DOI":"10.1109\/SC.2010.34"},{"key":"255_CR5","doi-asserted-by":"crossref","unstructured":"Karantasis K I, Lenharth A, Nguyen D, Garzar\u00e1n M J, Pingalik. Paral-lelization of reordering algorithms for bandwidth and wavefront reduction. In: Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis. 2014, 921\u2013932","DOI":"10.1109\/SC.2014.80"},{"issue":"7","key":"255_CR6","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1016\/j.physa.2009.12.019","volume":"389","author":"X Liu","year":"2010","unstructured":"Liu X, Murata T. Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Physica A: Statistical Mechanics and its Applications, 2010, 389(7): 1493\u20131500","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"255_CR7","doi-asserted-by":"crossref","unstructured":"Arai J, Shiokawa H, Yamamuro T, Onizuka M, Lwamura S. Rabbit order: just-in-time parallel reordering for fast graph analysis. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium. 2016, 22\u201331","DOI":"10.1109\/IPDPS.2016.110"},{"key":"255_CR8","unstructured":"Kyrola A, Blelloch G, Guestrin C. GraphChi: large-scale graph computation on Just a PC. In: Proceedings of USENIX Conference on Operating Systems Design and Implementation. 2012, 31\u201346"},{"key":"255_CR9","unstructured":"Zhu X W, Han W T, Chen W G. Gridgraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: Proceedings of Usenix Conference on Usenix Technical Conference. 2015, 375\u2013386"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-0255-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-020-0255-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-0255-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T22:12:57Z","timestamp":1679523177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-020-0255-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,8]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["255"],"URL":"https:\/\/doi.org\/10.1007\/s11704-020-0255-y","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,8]]},"assertion":[{"value":"7 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"161607"}}