乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T22:43:23Z","timestamp":1743806603015},"reference-count":64,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2021,7]]},"abstract":"\n GraphScope is a system and a set of language extensions that enable a new programming interface for large-scale distributed graph computing. It generalizes previous graph processing frameworks\n (e.g.<\/jats:italic>\n , Pregel, GraphX) and distributed graph databases (\n e.g<\/jats:italic>\n ., Janus-Graph, Neptune) in two important ways: by exposing a unified programming interface to a wide variety of graph computations such as graph traversal, pattern matching, iterative algorithms and graph neural networks within a high-level programming language; and by supporting the seamless integration of a highly optimized graph engine in a general purpose data-parallel computing system.\n <\/jats:p>\n A GraphScope program is a sequential program composed of declarative data-parallel operators, and can be written using standard Python development tools. The system automatically handles the parallelization and distributed execution of programs on a cluster of machines. It outperforms current state-of-the-art systems by enabling a separate optimization (or family of optimizations) for each graph operation in one carefully designed coherent framework. We describe the design and implementation of GraphScope and evaluate system performance using several real-world applications.<\/jats:p>","DOI":"10.14778\/3476311.3476369","type":"journal-article","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T22:48:56Z","timestamp":1635461336000},"page":"2879-2892","source":"Crossref","is-referenced-by-count":40,"title":["GraphScope"],"prefix":"10.14778","volume":"14","author":[{"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[{"name":"University of Edinburgh and Shenzhen Institute of Computing Sciences"}]},{"given":"Tao","family":"He","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Longbin","family":"Lai","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Xue","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Zhao","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Zhengping","family":"Qian","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Chao","family":"Tian","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Jingbo","family":"Xu","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Youyang","family":"Yao","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Qiang","family":"Yin","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Jingren","family":"Zhou","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Diwen","family":"Zhu","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Rong","family":"Zhu","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]}],"member":"320","published-online":{"date-parts":[[2021,10,28]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2012. SNAP Datasets. http:\/\/snap.stanford.edu\/data 2012. SNAP Datasets. http:\/\/snap.stanford.edu\/data"},{"key":"e_1_2_1_2_1","unstructured":"2019. etcd. https:\/\/github.com\/etcd-io\/etcd 2019. etcd. https:\/\/github.com\/etcd-io\/etcd"},{"key":"e_1_2_1_3_1","unstructured":"2020. Plato. https:\/\/github.com\/Tencent\/plato 2020. Plato. https:\/\/github.com\/Tencent\/plato"},{"key":"e_1_2_1_4_1","volume-title":"18th USENIX Symposium on Networked Systems Design and Implementation (NSDI21)","unstructured":"2021. GAIA : A System for Interactive Analysis on Distributed Graphs Using a High-Level Language . In 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI21) . USENIX Association. https:\/\/www.usenix.org\/conference\/nsdi21\/presentation\/qian-0 2021. GAIA: A System for Interactive Analysis on Distributed Graphs Using a High-Level Language. In 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI21). USENIX Association. https:\/\/www.usenix.org\/conference\/nsdi21\/presentation\/qian-0"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3026877.3026899"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915213"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3199517.3199520"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1322432.1322433"},{"key":"e_1_2_1_10_1","volume-title":"Amazon Neptune: Graph Data Management in the Cloud. In International Semantic Web Conference (P&D\/Industry\/BlueSky).","author":"Bebee Bradley R","year":"2018","unstructured":"Bradley R Bebee , Daniel Choi , Ankit Gupta , Andi Gutmans , Ankesh Khandelwal , Yigit Kiran , Sainath Mallidi , Bruce McGaughy , Mike Personick , Karthik Rajan , 2018 . Amazon Neptune: Graph Data Management in the Cloud. In International Semantic Web Conference (P&D\/Industry\/BlueSky). Bradley R Bebee, Daniel Choi, Ankit Gupta, Andi Gutmans, Ankesh Khandelwal, Yigit Kiran, Sainath Mallidi, Bruce McGaughy, Mike Personick, Karthik Rajan, et al. 2018. Amazon Neptune: Graph Data Management in the Cloud. In International Semantic Web Conference (P&D\/Industry\/BlueSky)."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/209937.209958"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3386135"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3384685"},{"key":"e_1_2_1_15_1","volume-title":"Dask: Library for dynamic task scheduling. https:\/\/dask.org","author":"Team Dask Development","year":"2016","unstructured":"Dask Development Team . 2016 . Dask: Library for dynamic task scheduling. https:\/\/dask.org Dask Development Team. 2016. Dask: Library for dynamic task scheduling. https:\/\/dask.org"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389745"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452796"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035942"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3282488"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804339"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190657"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_2_1_23_1","volume-title":"A set of measures of centrality based on betweenness. Sociometry","author":"Freeman Linton C","year":"1977","unstructured":"Linton C Freeman . 1977. A set of measures of centrality based on betweenness. Sociometry ( 1977 ), 35--41. Linton C Freeman. 1977. A set of measures of centrality based on betweenness. Sociometry (1977), 35--41."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3398682.3399162"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2387880.2387883"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685096"},{"key":"e_1_2_1_27_1","unstructured":"Hadoop-Gremlin. 2020. https:\/\/tinkerpop.apache.org\/docs\/3.4.6\/reference\/#hadoop-gremlin Hadoop-Gremlin. 2020. https:\/\/tinkerpop.apache.org\/docs\/3.4.6\/reference\/#hadoop-gremlin"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359141"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272998.1273005"},{"key":"e_1_2_1_32_1","unstructured":"JanusGraph. 2021. https:\/\/github.com\/JanusGraph\/janusgraph JanusGraph. 2021. https:\/\/github.com\/JanusGraph\/janusgraph"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_2_1_34_1","volume-title":"Vertex-Centric Graph Processing: The Good, the Bad, and the Ugly. CoRR abs\/1612.07404","author":"Khan Arijit","year":"2016","unstructured":"Arijit Khan . 2016. Vertex-Centric Graph Processing: The Good, the Bad, and the Ugly. CoRR abs\/1612.07404 ( 2016 ). arXiv:1612.07404 http:\/\/arxiv.org\/abs\/1612.07404 Arijit Khan. 2016. Vertex-Centric Graph Processing: The Good, the Bad, and the Ugly. CoRR abs\/1612.07404 (2016). arXiv:1612.07404 http:\/\/arxiv.org\/abs\/1612.07404"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339494"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1965594"},{"key":"e_1_2_1_38_1","unstructured":"OrientDB library. 2020. https:\/\/github.com\/orientechnologies\/orientdb OrientDB library. 2020. https:\/\/github.com\/orientechnologies\/orientdb"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_40_1","volume-title":"A Survey of Link Prediction in Complex Networks. ACM Comput. Surv. 49, 4","author":"Mart\u00ednez V\u00edctor","year":"2017","unstructured":"V\u00edctor Mart\u00ednez , Fernando Berzal , and Juan Carlos Cubero Talavera . 2017. A Survey of Link Prediction in Complex Networks. ACM Comput. Surv. 49, 4 ( 2017 ), 69:1--69:33. V\u00edctor Mart\u00ednez, Fernando Berzal, and Juan Carlos Cubero Talavera. 2017. A Survey of Link Prediction in Complex Networks. ACM Comput. Surv. 49, 4 (2017), 69:1--69:33."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the Southern Association for Information Systems Conference","volume":"2324","author":"Miller Justin J","year":"2013","unstructured":"Justin J Miller . 2013 . Graph database applications and concepts with Neo4j . In Proceedings of the Southern Association for Information Systems Conference , Atlanta, GA, USA , Vol. 2324 . Justin J Miller. 2013. Graph database applications and concepts with Neo4j. In Proceedings of the Southern Association for Information Systems Conference, Atlanta, GA, USA, Vol. 2324."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_2_1_45_1","unstructured":"Koalas Project. 2020. https:\/\/github.com\/databricks\/koalas Koalas Project. 2020. https:\/\/github.com\/databricks\/koalas"},{"key":"e_1_2_1_46_1","unstructured":"Mars Project. 2020. https:\/\/github.com\/mars-project\/mars Mars Project. 2020. https:\/\/github.com\/mars-project\/mars"},{"key":"e_1_2_1_47_1","volume-title":"Taming the Expressiveness and Programmability of Graph Analytical Queries. arXiv preprint arXiv:2004.09045","author":"Qin Lu","year":"2020","unstructured":"Lu Qin , Longbin Lai , Kongzhang Hao , Zhongxin Zhou , Yiwei Zhao , Yuxing Han , Xuemin Lin , Zhengping Qian , and Jingren Zhou . 2020. Taming the Expressiveness and Programmability of Graph Analytical Queries. arXiv preprint arXiv:2004.09045 ( 2020 ). Lu Qin, Longbin Lai, Kongzhang Hao, Zhongxin Zhou, Yiwei Zhao, Yuxing Han, Xuemin Lin, Zhengping Qian, and Jingren Zhou. 2020. Taming the Expressiveness and Programmability of Graph Analytical Queries. arXiv preprint arXiv:2004.09045 (2020)."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_2_1_49_1","volume-title":"Near linear time algorithm to detect community structures in large-scale networks. Physical review E 76, 3","author":"Raghavan Usha Nandini","year":"2007","unstructured":"Usha Nandini Raghavan , R\u00e9ka Albert , and Soundar Kumara . 2007. Near linear time algorithm to detect community structures in large-scale networks. Physical review E 76, 3 ( 2007 ), 036106. Usha Nandini Raghavan, R\u00e9ka Albert, and Soundar Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Physical review E 76, 3 (2007), 036106."},{"key":"e_1_2_1_50_1","volume-title":"Web Applications on Azure","author":"Reagan Rob","unstructured":"Rob Reagan . 2018. Cosmos DB . In Web Applications on Azure . Springer , 187--255. Rob Reagan. 2018. Cosmos DB. In Web Applications on Azure. Springer, 187--255."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815072.2815073"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522715"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.95"},{"key":"e_1_2_1_55_1","volume-title":"http:\/\/hadoop.apache.org\/hive\/. [Online","author":"The HIVE","year":"2020","unstructured":"The HIVE project. 2020. http:\/\/hadoop.apache.org\/hive\/. [Online ; accessed 17- September - 2020 ]. The HIVE project. 2020. http:\/\/hadoop.apache.org\/hive\/. [Online; accessed 17-September-2020]."},{"key":"e_1_2_1_56_1","unstructured":"Apache TinkerPop. 2019. http:\/\/tinkerpop.apache.org\/ Apache TinkerPop. 2019. http:\/\/tinkerpop.apache.org\/"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_2_1_58_1","unstructured":"Random Walks. 2010. http:\/\/en.wikipedia.org\/wiki\/Random_walk Random Walks. 2010. http:\/\/en.wikipedia.org\/wiki\/Random_walk"},{"key":"e_1_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Haobo Wang Zhao Li Jiaming Huang Pengrui Hui Weiwei Liu Tianlei Hu and Gang Chen. 2020. Collaboration based multi-label propagation for fraud detection. In IJCAI. Haobo Wang Zhao Li Jiaming Huang Pengrui Hui Weiwei Liu Tianlei Hu and Gang Chen. 2020. Collaboration based multi-label propagation for fraud detection. In IJCAI .","DOI":"10.24963\/ijcai.2020\/343"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219869"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359634"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855741.1855742"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/2228298.2228301"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132777"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352127"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.5555\/3026877.3026901"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3476311.3476369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:33:51Z","timestamp":1672227231000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3476311.3476369"}},"subtitle":["a unified engine for big graph processing"],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":64,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["10.14778\/3476311.3476369"],"URL":"https:\/\/doi.org\/10.14778\/3476311.3476369","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}