{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:24:03Z","timestamp":1774121043437,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,26]],"date-time":"2016-06-26T00:00:00Z","timestamp":1466899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP150102728,DP140103578"],"award-info":[{"award-number":["DP150102728,DP140103578"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["14209314"],"award-info":[{"award-number":["14209314"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61232006"],"award-info":[{"award-number":["61232006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,26]]},"DOI":"10.1145\/2882903.2915220","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T19:01:52Z","timestamp":1466103712000},"page":"1813-1828","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":128,"title":["Speedup Graph Processing by Graph Ordering"],"prefix":"10.1145","author":[{"given":"Hao","family":"Wei","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Can","family":"Lu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, Australia"}]}],"member":"320","published-online":{"date-parts":[[2016,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"User Guide and Reference Manual","author":"Graph Library The Boost","year":"2002","unstructured":"The Boost Graph Library : User Guide and Reference Manual . Addison-Wesley Longman Publishing Co., Inc. , 2002 . The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Longman Publishing Co., Inc., 2002."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of VLDB'99","author":"Ailamaki A.","year":"1999","unstructured":"A. Ailamaki , D. J. DeWitt , M. D. Hill , and D. A. Wood . Dbmss on a modern processor: Where does time go ? In Proc. of VLDB'99 , 1999 . A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. Dbmss on a modern processor: Where does time go? In Proc. of VLDB'99, 1999."},{"key":"e_1_3_2_1_3_1","volume-title":"International Symposium on Web AlGorithms","author":"Auroux L.","year":"2015","unstructured":"L. Auroux , M. Burelle , and R. Erra . Reordering very large graphs for fun & profit . In International Symposium on Web AlGorithms , 2015 . L. Auroux, M. Burelle, and R. Erra. Reordering very large graphs for fun & profit. In International Symposium on Web AlGorithms, 2015."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.9055"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69346-7_15"},{"key":"e_1_3_2_1_6_1","volume-title":"An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049","author":"Batagelj V.","year":"2003","unstructured":"V. Batagelj and M. Zaversnik . An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049 , 2003 . V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049, 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_10"},{"key":"e_1_3_2_1_9_1","volume-title":"Technology","author":"Borkar S.","year":"2005","unstructured":"S. Borkar , P. Dubey , K. Kahn , D. Kuck , H. Mulder , S. Pawlowski , and J. Rattner . Platform 2015: Intel processor and platform evolution for the next decade . Technology , 2005 . S. Borkar, P. Dubey, K. Kahn, D. Kuck, H. Mulder, S. Pawlowski, and J. Rattner. Platform 2015: Intel processor and platform evolution for the next decade. Technology, 2005."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465323"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109670"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978128"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375688"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301633"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060302"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2008.917744"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0070371"},{"key":"e_1_3_2_1_20_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to algorithms . MIT press Cambridge , 2 edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT press Cambridge, 2 edition, 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.4.799"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/578296"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of VLDB'05","author":"Ghoting A.","year":"2005","unstructured":"A. Ghoting , G. Buehrer , S. Parthasarathy , D. Kim , A. Nguyen , Y.-K. Chen , and P. Dubey . Cache-conscious frequent pattern mining on a modern processor . In Proc. of VLDB'05 , 2005 . A. Ghoting, G. Buehrer, S. Parthasarathy, D. Kim, A. Nguyen, Y.-K. Chen, and P. Dubey. Cache-conscious frequent pattern mining on a modern processor. In Proc. of VLDB'05, 2005."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398792"},{"key":"e_1_3_2_1_25_1","volume-title":"USA","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI Hollywood, CA , USA , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI Hollywood, CA, USA, 2012."},{"key":"e_1_3_2_1_26_1","volume-title":"American Mathematical Soc.","author":"Grinstead C. M.","year":"2012","unstructured":"C. M. Grinstead and J. L. Snell . Introduction to probability . American Mathematical Soc. , 2012 . C. M. Grinstead and J. L. Snell. Introduction to probability. American Mathematical Soc., 2012."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0112012"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00102-1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.26"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_31_1","volume-title":"Biometrika","author":"Kendall M. G.","year":"1938","unstructured":"M. G. Kendall . A new measure of rank correlation . Biometrika , 1938 . M. G. Kendall. A new measure of rank correlation. Biometrika, 1938."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/647683.760642"},{"key":"e_1_3_2_1_33_1","volume-title":"USA","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. E. Blelloch , and C. Guestrin . Graphchi: Large-scale graph computation on just a PC. In OSDI Hollywood, CA , USA , 2012 . A. Kyrola, G. E. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a PC. In OSDI Hollywood, CA, USA, 2012."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816686"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/237090.237190"},{"key":"e_1_3_2_1_37_1","unstructured":"The Apache Software Foundation. Giraph website. http:\/\/giraph.apache.org.  The Apache Software Foundation. Giraph website. http:\/\/giraph.apache.org."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/191987.191996"},{"key":"e_1_3_2_1_39_1","volume-title":"The pagerank citation ranking: Bringing order to the web","author":"Page L.","year":"1999","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The pagerank citation ranking: Bringing order to the web . 1999 . L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. 1999."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.44"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/996546.996554"},{"key":"e_1_3_2_1_42_1","volume-title":"Proc. of VLDB'99","author":"Rao J.","year":"1999","unstructured":"J. Rao and K. A. Ross . Cache conscious indexing for decision-support in main memory . In Proc. of VLDB'99 , 1999 . J. Rao and K. A. Ross. Cache conscious indexing for decision-support in main memory. In Proc. of VLDB'99, 1999."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412232"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2010.09.007"},{"key":"e_1_3_2_1_46_1","first-page":"80","volume":"25","author":"Serdyukov A. I.","year":"1984","unstructured":"A. I. Serdyukov . An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy , 25 : 80 -- 86 , 1984 . A. I. Serdyukov. An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy, 25:80--86, 1984.","journal-title":"Upravlyaemye Sistemy"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2327037"},{"key":"e_1_3_2_1_48_1","volume-title":"Computers & Mathematics with Applications, 7(1)","author":"Sharir M.","year":"1981","unstructured":"M. Sharir . A strong-connectivity algorithm and its applications in data flow analysis. Computers & Mathematics with Applications, 7(1) , 1981 . M. Sharir. A strong-connectivity algorithm and its applications in data flow analysis. Computers & Mathematics with Applications, 7(1), 1981."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735496.2735507"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556581"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"}],"event":{"name":"SIGMOD\/PODS'16: International Conference on Management of Data","location":"San Francisco California USA","acronym":"SIGMOD\/PODS'16","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2016 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2915220","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2882903.2915220","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:42Z","timestamp":1750222542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2915220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,26]]},"references-count":53,"alternative-id":["10.1145\/2882903.2915220","10.1145\/2882903"],"URL":"https:\/\/doi.org\/10.1145\/2882903.2915220","relation":{},"subject":[],"published":{"date-parts":[[2016,6,26]]},"assertion":[{"value":"2016-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}