{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:12:24Z","timestamp":1785543144366,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSFC","award":["61836013"],"award-info":[{"award-number":["61836013"]}]},{"name":"NSFC for Distinguished Young Scholar","award":["61825602"],"award-info":[{"award-number":["61825602"]}]},{"name":"US National Science Foundation","award":["18462"],"award-info":[{"award-number":["18462"]}]},{"name":"National Key R&D Program of China","award":["2018YFB1402600"],"award-info":[{"award-number":["2018YFB1402600"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457329","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:30Z","timestamp":1624036950000},"page":"2281-2289","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["LightNE: A Lightweight Graph Processing System for Network Embedding"],"prefix":"10.1145","author":[{"given":"Jiezhong","family":"Qiu","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laxman","family":"Dhulipala","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Tang","sequence":"additional","affiliation":[{"name":"Tsinghua University & Microsoft Research, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Peng","sequence":"additional","affiliation":[{"name":"Georgia Insitute of Technology & Microsoft Research, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chi","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"et almbox","author":"Battaglia Peter W","year":"2018","unstructured":"Peter W Battaglia , Jessica B Hamrick , Victor Bapst , Alvaro Sanchez-Gonzalez , Vinicius Zambaldi , Mateusz Malinowski , Andrea Tacchetti , David Raposo , Adam Santoro , Ryan Faulkner , et almbox . 2018 . Relational inductive biases, deep learning, and graph networks. arXiv preprint arXiv:1806.01261 (2018). Peter W Battaglia, Jessica B Hamrick, Victor Bapst, Alvaro Sanchez-Gonzalez, Vinicius Zambaldi, Mateusz Malinowski, Andrea Tacchetti, David Raposo, Adam Santoro, Ryan Faulkner, et almbox. 2018. Relational inductive biases, deep learning, and graph networks. arXiv preprint arXiv:1806.01261 (2018)."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"e_1_3_2_2_3_1","volume-title":"Proceedings of The 28th Conference on Learning Theory","author":"Cheng Dehua","year":"2015","unstructured":"Dehua Cheng , Yu Cheng , Yan Liu , Richard Peng , and Shang-Hua Teng . 2015 . Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification . Proceedings of The 28th Conference on Learning Theory (2015), 364--390. Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, and Shang-Hua Teng. 2015. Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification. Proceedings of The 28th Conference on Learning Theory (2015), 364--390."},{"key":"e_1_3_2_2_4_1","volume-title":"Global convergence of stochastic gradient descent for some non-convex matrix problems. arXiv preprint arXiv:1411.1134","author":"Sa Christopher De","year":"2014","unstructured":"Christopher De Sa , Kunle Olukotun , and Christopher R\u00e9. 2014. Global convergence of stochastic gradient descent for some non-convex matrix problems. arXiv preprint arXiv:1411.1134 ( 2014 ). Christopher De Sa, Kunle Olukotun, and Christopher R\u00e9. 2014. Global convergence of stochastic gradient descent for some non-convex matrix problems. arXiv preprint arXiv:1411.1134 (2014)."},{"key":"e_1_3_2_2_5_1","volume-title":"Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) . 393--404","author":"Dhulipala Laxman","year":"2018","unstructured":"Laxman Dhulipala , Guy E. Blelloch , and Julian Shun . 2018 . Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) . 393--404 . Laxman Dhulipala, Guy E. Blelloch, and Julian Shun. 2018. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) . 393--404."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_8_1","volume-title":"SPAA '15","author":"Gu Yan","unstructured":"Yan Gu , Julian Shun , Yihan Sun , and Guy E. Blelloch . 2015. A Top-Down Parallel Semisort . In SPAA '15 . 24--34. Yan Gu, Julian Shun, Yihan Sun, and Guy E. Blelloch. 2015. A Top-Down Parallel Semisort. In SPAA '15. 24--34."},{"key":"e_1_3_2_2_9_1","series-title":"SIAM review","volume-title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions","author":"Halko Nathan","year":"2011","unstructured":"Nathan Halko , Per-Gunnar Martinsson , and Joel A Tropp . 2011. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions . SIAM review , Vol. 53 , 2 ( 2011 ), 217--288. Nathan Halko, Per-Gunnar Martinsson, and Joel A Tropp. 2011. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM review , Vol. 53, 2 (2011), 217--288."},{"key":"e_1_3_2_2_10_1","volume-title":"Representation Learning on Graphs: Methods and Applications","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton , Rex Ying , and Jure Leskovec . 2017. Representation Learning on Graphs: Methods and Applications . IEEE Data(base) Engineering Bulletin , Vol. 40 ( 2017 ), 52--74. William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Representation Learning on Graphs: Methods and Applications. IEEE Data(base) Engineering Bulletin , Vol. 40 (2017), 52--74."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Jeremy Kepner and John Gilbert. 2011. Graph algorithms in the language of linear algebra .SIAM.  Jeremy Kepner and John Gilbert. 2011. Graph algorithms in the language of linear algebra .SIAM.","DOI":"10.1137\/1.9780898719918"},{"key":"e_1_3_2_2_12_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling . 2017 . Semi-Supervised Classification with Graph Convolutional Networks . (2017). Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. (2017)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967938.2967948"},{"key":"e_1_3_2_2_14_1","volume-title":"Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. In 29th International Symposium on Theoretical Aspects of Computer Science. Citeseer, 266","author":"Koutis Ioannis","year":"2012","unstructured":"Ioannis Koutis , Alex Levin , and Richard Peng . 2012 . Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. In 29th International Symposium on Theoretical Aspects of Computer Science. Citeseer, 266 . Ioannis Koutis, Alex Levin, and Richard Peng. 2012. Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. In 29th International Symposium on Theoretical Aspects of Computer Science. Citeseer, 266."},{"key":"e_1_3_2_2_15_1","volume-title":"Pytorch-biggraph: A large-scale graph embedding system. arXiv preprint arXiv:1903.12287","author":"Lerer Adam","year":"2019","unstructured":"Adam Lerer , Ledell Wu , Jiajun Shen , Timothee Lacroix , Luca Wehrstedt , Abhijit Bose , and Alex Peysakhovich . 2019 . Pytorch-biggraph: A large-scale graph embedding system. arXiv preprint arXiv:1903.12287 (2019). Adam Lerer, Ledell Wu, Jiajun Shen, Timothee Lacroix, Luca Wehrstedt, Abhijit Bose, and Alex Peysakhovich. 2019. Pytorch-biggraph: A large-scale graph embedding system. arXiv preprint arXiv:1903.12287 (2019)."},{"key":"e_1_3_2_2_16_1","volume-title":"mbox","author":"L\u00e1szl\u00f3 Lov\u00e1sz","year":"1993","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz et al mbox . 1993 . Random walks on graphs: A survey. Combinatorics, Paul erdos is eighty , Vol. 2 , 1 (1993), 1--46. L\u00e1szl\u00f3 Lov\u00e1sz et almbox. 1993. Random walks on graphs: A survey. Combinatorics, Paul erdos is eighty , Vol. 2, 1 (1993), 1--46."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3016078.2851188"},{"key":"e_1_3_2_2_18_1","unstructured":"Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In Advances in neural information processing systems. 3111--3119.  Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In Advances in neural information processing systems. 3111--3119."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879191"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313446"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_2_24_1","volume-title":"NeurIPS '20","author":"Qiu Jiezhong","year":"2020","unstructured":"Jiezhong Qiu , Chi Wang , Ben Liao , Richard Peng , and Jie Tang . 2020 . A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices . NeurIPS '20 (2020). Jiezhong Qiu, Chi Wang, Ben Liao, Richard Peng, and Jie Tang. 2020. A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices. NeurIPS '20 (2020)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272030"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_2_27_1","volume-title":"Gibbons","author":"Shun Julian","year":"2013","unstructured":"Julian Shun , Guy E. Blelloch , Jeremy T. Fineman , and Phillip B . Gibbons . 2013 . Reducing Contention Through Priority Updates. In SPAA . Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, and Phillip B. Gibbons. 2013. Reducing Contention Through Priority Updates. In SPAA ."},{"key":"e_1_3_2_2_28_1","volume-title":"Blelloch","author":"Shun Julian","year":"2015","unstructured":"Julian Shun , Laxman Dhulipala , and Guy E . Blelloch . 2015 . Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra Julian Shun, Laxman Dhulipala, and Guy E. Blelloch. 2015. Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra"},{"key":"e_1_3_2_2_29_1","unstructured":". In DCC .  . In DCC ."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742839"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557109"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831313"},{"key":"e_1_3_2_2_36_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Petar Velivc","year":"2017","unstructured":"Petar Velivc kovi\u0107 , Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Lio , and Yoshua Bengio . 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 ( 2017 ). Petar Velivc kovi\u0107 , Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219869"},{"key":"e_1_3_2_2_38_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu , Weihua Hu , Jure Leskovec , and Stefanie Jegelka . 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 ( 2018 ). Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377376"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/594"},{"key":"e_1_3_2_2_42_1","volume-title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding. In The World Wide Web Conference. ACM, 2494--2504","author":"Zhu Zhaocheng","year":"2019","unstructured":"Zhaocheng Zhu , Shizhen Xu , Jian Tang , and Meng Qu . 2019 . GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding. In The World Wide Web Conference. ACM, 2494--2504 . Zhaocheng Zhu, Shizhen Xu, Jian Tang, and Meng Qu. 2019. GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding. In The World Wide Web Conference. ACM, 2494--2504."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457329","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457329","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:04Z","timestamp":1750195504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":42,"alternative-id":["10.1145\/3448016.3457329","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457329","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}