{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:44:46Z","timestamp":1772725486877,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key R&D Program of China","award":["2018Y FB1004403"],"award-info":[{"award-number":["2018Y FB1004403"]}]},{"name":"National Natural Science Foundation of China","award":["61702015 U1936104 61832001 61702016 61729201"],"award-info":[{"award-number":["61702015 U1936104 61832001 61702016 61729201"]}]},{"name":"Hong Kong RGC GRF Project","award":["16214716"],"award-info":[{"award-number":["16214716"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3380562","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"1797-1812","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs"],"prefix":"10.1145","author":[{"given":"Yingxia","family":"Shao","sequence":"first","affiliation":[{"name":"Beijing Univeristy of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyue","family":"Huang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xupeng","family":"Miao","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-018-0065-5"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/LA-WEB.2012.19"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-0097-5"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275492"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(87)90165-2"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(87)90165-2"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00089"},{"key":"e_1_3_2_2_8_1","volume-title":"Probability and random processes","author":"Grimmett Geoffrey","unstructured":"Geoffrey Grimmett and David Stirzaker . 2001. Probability and random processes . Vol. 80 . Oxford university press . Geoffrey Grimmett and David Stirzaker. 2001. Probability and random processes. Vol. 80. Oxford university press."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294869"},{"key":"e_1_3_2_2_11_1","volume-title":"Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD '08)","author":"He Huahai","unstructured":"Huahai He and Ambuj K. Singh . 2008. Graphs-at-a-time: Query Language and Access Methods for Graph Databases . In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD '08) . 405--418. Huahai He and Ambuj K. Singh. 2008. Graphs-at-a-time: Query Language and Access Methods for Graph Databases. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD '08). 405--418."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402746"},{"key":"e_1_3_2_2_13_1","volume-title":"2014 IEEE 30th International Conference on Data Engineering (ICDE '14)","author":"Huang Jiewen","unstructured":"Jiewen Huang , Kartik Venkatraman , and Daniel J. Abadi . 2014. Query optimization of distributed pattern matching . In 2014 IEEE 30th International Conference on Data Engineering (ICDE '14) . 64--75. Jiewen Huang, Kartik Venkatraman, and Daniel J. Abadi. 2014. Query optimization of distributed pattern matching. In 2014 IEEE 30th International Conference on Data Engineering (ICDE '14). 64--75."},{"key":"e_1_3_2_2_14_1","volume-title":"Meyer","author":"Langville Amy N.","year":"2011","unstructured":"Amy N. Langville and Carl D . Meyer . 2011 . Google's PageRank and Beyond: The Science of Search Engine Rankings, chapter The mathematics guide. Princeton University Press . Amy N. Langville and Carl D. Meyer. 2011. Google's PageRank and Beyond: The Science of Search Engine Rankings, chapter The mathematics guide. Princeton University Press."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9511-1"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816659"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994519"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/366193.366228"},{"key":"e_1_3_2_2_23_1","volume-title":"Nature Communications","volume":"5","author":"Martin Rosvall","year":"2014","unstructured":"Rosvall Martin , Esquivel Alcides V., Andrea Lancichinetti , West Jevin D., and Lambiotte Renaud . 2014 . Memory in network flows and its effects on spreading dynamics and community detection . Nature Communications , Vol. 5 , 4630 (2014). Rosvall Martin, Esquivel Alcides V., Andrea Lancichinetti, West Jevin D., and Lambiotte Renaud. 2014. Memory in network flows and its effects on spreading dynamics and community detection. Nature Communications, Vol. 5, 4630 (2014)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735707"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00015-I"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1985.tb01383.x"},{"key":"e_1_3_2_2_28_1","volume-title":"Robert and George Casella","author":"Christian","year":"2010","unstructured":"Christian P. Robert and George Casella . 2010 . Monte Carlo Statistical Methods .Springer Publishing Company , Incorporated. Christian P. Robert and George Casella. 2010. Monte Carlo Statistical Methods .Springer Publishing Company, Incorporated."},{"key":"e_1_3_2_2_29_1","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad Yousef","unstructured":"Yousef Saad . 2003. Iterative Methods for Sparse Linear Systems 2 nd ed.). Society for Industrial and Applied Mathematics , Philadelphia, PA, USA . Yousef Saad. 2003. Iterative Methods for Sparse Linear Systems 2nd ed.). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.","edition":"2"},{"key":"e_1_3_2_2_30_1","volume-title":"Using higher-order Markov models to reveal flow-based communities in networks. Scientific reports","author":"Salnikov Vsevolod","year":"2016","unstructured":"Vsevolod Salnikov , Michael T. Schaub , and Renaud Lambiotte . 2016. Using higher-order Markov models to reveal flow-based communities in networks. Scientific reports , Vol. 5 , 23194 ( 2016 ), 1--13. Vsevolod Salnikov, Michael T. Schaub, and Renaud Lambiotte. 2016. Using higher-order Markov models to reveal flow-based communities in networks. Scientific reports, Vol. 5, 23194 (2016), 1--13."},{"key":"e_1_3_2_2_31_1","volume-title":"ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs. In 2019 IEEE 35th International Conference on Data Engineering (ICDE '19)","author":"Sengupta Neha","year":"2019","unstructured":"Neha Sengupta , Amitabha Bagchi , Maya Ramanath , and Srikanta Bedathur . 2019 . ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs. In 2019 IEEE 35th International Conference on Data Engineering (ICDE '19) . 470--481. Neha Sengupta, Amitabha Bagchi, Maya Ramanath, and Srikanta Bedathur. 2019. ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs. In 2019 IEEE 35th International Conference on Data Engineering (ICDE '19). 470--481."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2757807.2757809"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.3.503"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2007070101"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355749"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3015270.3015272"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-017-9334-3"},{"key":"e_1_3_2_2_40_1","volume-title":"Chawla","author":"Xu Jian","year":"2016","unstructured":"Jian Xu , Thanuka Wickramarathne , and Nitesh V . Chawla . 2016 . Representing higher-order dependencies in networks. In Science Advances . Jian Xu, Thanuka Wickramarathne, and Nitesh V. Chawla. 2016. Representing higher-order dependencies in networks. In Science Advances."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.6.1412"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055552"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"e_1_3_2_2_44_1","volume-title":"Efficient Graph Computation for Node2Vec. CoRR","author":"Zhou Dongyan","year":"2018","unstructured":"Dongyan Zhou , Songjie Niu , and Shimin Chen . 2018. Efficient Graph Computation for Node2Vec. CoRR , Vol. abs\/ 1805 .00280 ( 2018 ). arxiv: 1805.00280 Dongyan Zhou, Songjie Niu, and Shimin Chen. 2018. Efficient Graph Computation for Node2Vec. CoRR, Vol. abs\/1805.00280 (2018). arxiv: 1805.00280"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3380562","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3380562","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:01:51Z","timestamp":1750208511000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3380562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":44,"alternative-id":["10.1145\/3318464.3380562","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3380562","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}