{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T21:37:59Z","timestamp":1758231479618,"version":"3.44.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T00:00:00Z","timestamp":1754352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T00:00:00Z","timestamp":1754352000000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s00778-025-00938-4","type":"journal-article","created":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T20:36:22Z","timestamp":1754426182000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Truss Decomposition over Large Directed Graphs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3335-8351","authenticated-orcid":false,"given":"Anxin","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xun","family":"Jian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,5]]},"reference":[{"key":"938_CR1","doi-asserted-by":"crossref","unstructured":"Abou-Rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In IPDPS, pages 10\u2013pp. IEEE, (2006)","DOI":"10.1109\/IPDPS.2006.1639360"},{"key":"938_CR2","doi-asserted-by":"crossref","unstructured":"Acquisti, A., Gross, R.: Imagined communities: Awareness, information sharing, and privacy on the facebook. PETS, pages 36\u201358, (2006)","DOI":"10.1007\/11957454_3"},{"key":"938_CR3","unstructured":"Ananthanarayanan, G., Kandula, S., Greenberg, A., Stoica, I., Lu, Y., Saha, B., Harris, E.: Reining in the outliers in $$\\{$$Map-Reduce$$\\}$$ clusters using mantri. In OSDI), 2010"},{"key":"938_CR4","doi-asserted-by":"crossref","unstructured":"Aridhi, S., Brugnara, M., Montresor, A., Velegrakis, Y.: Distributed k-core decomposition and maintenance in large dynamic graphs. In DEBS, pages 161\u2013168, (2016)","DOI":"10.1145\/2933267.2933299"},{"key":"938_CR5","doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs: theory, algorithms and applications. SSBM, (2008)","DOI":"10.1007\/978-1-84800-998-1"},{"issue":"5","key":"938_CR6","doi-asserted-by":"publisher","first-page":"224","DOI":"10.25046\/aj040528","volume":"4","author":"O Basalkevych","year":"2019","unstructured":"Basalkevych, O., Basalkevych, O.: Fuzzy simulation of historical associative thesaurus. Adv. Sci. Technol. Eng. Syst 4(5), 224\u2013233 (2019)","journal-title":"Adv. Sci. Technol. Eng. Syst"},{"key":"938_CR7","unstructured":"Batagelj, V., Zaversnik, M.: An $$o(m)$$ algorithm for cores decomposition of networks. arXiv: cs\/0310049, (2003)"},{"key":"938_CR8","doi-asserted-by":"crossref","unstructured":"Bichot, C.-E., Siarry, P.: Graph partitioning. John Wiley & Sons, (2013)","DOI":"10.1002\/9781118601181"},{"key":"938_CR9","doi-asserted-by":"crossref","unstructured":"Bourse, F., Lelarge, M., Vojnovic, M.: Balanced graph edge partition. In SIGKDD, pages 1456\u20131465, (2014)","DOI":"10.1145\/2623330.2623660"},{"key":"938_CR10","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. Springer, (2016)","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"938_CR11","doi-asserted-by":"crossref","unstructured":"Chen, P.-L., Chou, C.-K., Chen, M.-S.: Distributed algorithms for k-truss decomposition. In ICBD, pages 471\u2013480. IEEE, (2014)","DOI":"10.1109\/BigData.2014.7004264"},{"issue":"3","key":"938_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3298989","volume":"5","author":"R Chen","year":"2019","unstructured":"Chen, R., Shi, J., Chen, Y., Zang, B., Guan, H., Chen, H.: Powerlyra: Differentiated graph computation and partitioning on skewed graphs. TOPC 5(3), 1\u201339 (2019)","journal-title":"TOPC"},{"key":"938_CR13","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In ICDE, pages 51\u201362. IEEE, (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"938_CR14","unstructured":"Chhabra, A., Fonseca Faraj, M., Schulz, C., Seemaier, D.: Buffered streaming edge partitioning. In 22nd International Symposium on Experimental Algorithms (SEA 2024), pages 5\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, (2024)"},{"issue":"3.1","key":"938_CR15","first-page":"1","volume":"16","author":"J Cohen","year":"2008","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. National Secur. Agency Tech. Rep. 16(3.1), 1\u201329 (2008)","journal-title":"National Secur. Agency Tech. Rep."},{"key":"938_CR16","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Kann, V.: A compendium of NP optimization problems. Citeseer, (1998)","DOI":"10.1007\/3-540-63248-4_10"},{"key":"938_CR17","doi-asserted-by":"crossref","unstructured":"Dai, D., Zhang, W., Chen, Y.: Iogp: An incremental online graph partitioning algorithm for distributed graph databases. In HPDC, pages 219\u2013230, (2017)","DOI":"10.1145\/3078597.3078606"},{"key":"938_CR18","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. CIKM, pages 2047\u20132050, (2017)","DOI":"10.1145\/3132847.3133130"},{"key":"938_CR19","doi-asserted-by":"crossref","unstructured":"Ding, Z., Kong, D., Zhang, Z., Xie, X., Xu, J.: Cluspar: A game-theoretic approach for efficient and scalable streaming edge partitioning. IEEE Transactions on Computers, (2024)","DOI":"10.1109\/TC.2024.3475568"},{"issue":"3","key":"938_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3654965","volume":"2","author":"Z Ding","year":"2024","unstructured":"Ding, Z., Xiang, Y., Wang, S., Xie, X., Zhou, S.K.: Play like a vertex: A stackelberg game approach for streaming graph partitioning. Proceedings of the ACM on Management of Data 2(3), 1\u201327 (2024)","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"938_CR21","doi-asserted-by":"crossref","unstructured":"Fan, W., Jin, R., Liu, M., Lu, P., Luo, X., Xu, R., Yin, Q., Yu, W., Zhou, J.: Application driven graph partitioning. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pages 1765\u20131779, 2020","DOI":"10.1145\/3318464.3389745"},{"issue":"4","key":"938_CR22","first-page":"1","volume":"43","author":"W Fan","year":"2018","unstructured":"Fan, W., Yu, W., Xu, J., Zhou, J., Luo, X., Yin, Q., Lu, P., Cao, Y., Xu, R.: Parallelizing sequential graph computations. TODS 43(4), 1\u201339 (2018)","journal-title":"Parallelizing sequential graph computations. TODS"},{"issue":"11","key":"938_CR23","first-page":"2093","volume":"31","author":"Y Fang","year":"2018","unstructured":"Fang, Y., Wang, Z., Cheng, R., Wang, H., Hu, J.: Effective and efficient community search over large directed graphs. TKDE 31(11), 2093\u20132107 (2018)","journal-title":"TKDE"},{"key":"938_CR24","doi-asserted-by":"crossref","unstructured":"Gabert, K., Pinar, A., \u00c7ataly\u00fcrek, \u00dc.V.: Shared-memory scalable k-core maintenance on dynamic graphs and hypergraphs. In IPDPSW, pages 998\u20131007. IEEE, (2021)","DOI":"10.1109\/IPDPSW52791.2021.00158"},{"issue":"2","key":"938_CR25","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10115-012-0539-0","volume":"35","author":"C Giatsidis","year":"2013","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst. 35(2), 311\u2013343 (2013)","journal-title":"Knowl. Inf. Syst."},{"issue":"7028","key":"938_CR26","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1038\/nature03288","volume":"433","author":"R Guimera","year":"2005","unstructured":"Guimera, R., Nunes Amaral, L.A.: Functional cartography of complex metabolic networks. Nature 433(7028), 895\u2013900 (2005)","journal-title":"Nature"},{"issue":"1","key":"938_CR27","doi-asserted-by":"publisher","first-page":"14","DOI":"10.14778\/3696435.3696437","volume":"18","author":"MR Hajidehi","year":"2024","unstructured":"Hajidehi, M.R., Sridhar, S., Seltzer, M.: Cuttana: Scalable graph partitioning for faster distributed graph databases and analytics. Proceedings of the VLDB Endowment 18(1), 14\u201327 (2024)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"938_CR28","doi-asserted-by":"crossref","unstructured":"Huang, Y., Wang, C., Shi, J., Shun, J.: Efficient algorithms for parallel bi-core decomposition. In J.\u00a0Gao, editor, APOCS, pages 17\u201332. SIAM, (2023)","DOI":"10.1137\/1.9781611977578.ch2"},{"key":"938_CR29","doi-asserted-by":"crossref","unstructured":"Kabir, H., Madduri, K.: Parallel k-core decomposition on multicore platforms. In IPDPSW, pages 1482\u20131491. IEEE, (2017)","DOI":"10.1109\/IPDPSW.2017.151"},{"key":"938_CR30","doi-asserted-by":"crossref","unstructured":"Karypis, G.: Kumar, V.: Parallel multilevel k-way partitioning scheme for irregular graphs. In ICS, pages 35\u2013es, (1996)","DOI":"10.1145\/369028.369103"},{"issue":"1","key":"938_CR31","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"938_CR32","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.datak.2011.11.004","volume":"72","author":"M Kim","year":"2012","unstructured":"Kim, M., Candan, K.S.: Sbv-cut: Vertex-cut based graph partitioning using structural balance vertices. Data Knowl. Eng. 72, 285\u2013303 (2012)","journal-title":"Data Knowl. Eng."},{"key":"938_CR33","doi-asserted-by":"crossref","unstructured":"LeBeane, M., Song, S., Panda, R., Ryoo, J.H., John, L.K.: Data partitioning strategies for graph workloads on heterogeneous clusters. In Int. Conf. High Perform. Comput. Netw. Storage Anal., pages 1\u201312, (2015)","DOI":"10.1145\/2807591.2807632"},{"issue":"8","key":"938_CR34","first-page":"891","volume":"12","author":"D Li","year":"2019","unstructured":"Li, D., Zhang, Y., Wang, J., Tan, K.-L.: Topox: Topology refactorization for efficient graph partitioning and processing. PVLDB 12(8), 891\u2013905 (2019)","journal-title":"PVLDB"},{"key":"938_CR35","doi-asserted-by":"crossref","unstructured":"Liao, X., Liu, Q., Jiang, J., Huang, X., Xu, J., Choi, B.: Distributed d-core decomposition over large directed graphs. PVLDB, (2022)","DOI":"10.14778\/3529337.3529340"},{"issue":"1","key":"938_CR36","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"938_CR37","doi-asserted-by":"crossref","unstructured":"Liu, Q., Liao, X., Huang, X., Xu, J., Gao, Y.: Distributed ($$\\alpha $$, $$\\beta $$)-core decomposition over bipartite graphs. In ICDE, pages 909\u2013921. IEEE, (2023)","DOI":"10.1109\/ICDE55515.2023.00075"},{"key":"938_CR38","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhao, M., Huang, X., Xu, J., Gao, Y.: Truss-based community search over large directed graphs. In SIGMOD, pages 2183\u20132197, (2020)","DOI":"10.1145\/3318464.3380587"},{"issue":"1","key":"938_CR39","doi-asserted-by":"publisher","first-page":"10168","DOI":"10.1038\/ncomms10168","volume":"7","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc, L., Zhou, T., Zhang, Q.-M., Stanley, H.E.: The h-index of a network node and its relation to degree and coreness. Nat. Commun. 7(1), 10168 (2016)","journal-title":"Nat. Commun."},{"key":"938_CR40","doi-asserted-by":"crossref","unstructured":"Luo, Q., Yu, D., Sheng, H., Yu, J., Cheng, X.: Distributed algorithm for truss maintenance in dynamic graphs. In PDCAT, pages 104\u2013115. Springer, (2021)","DOI":"10.1007\/978-3-030-69244-5_9"},{"key":"938_CR41","doi-asserted-by":"crossref","unstructured":"Montresor, A., De Pellegrini, F., Miorandi, D.: Distributed k-core decomposition. In TPDS, page 288\u2013300, (2013)","DOI":"10.1109\/TPDS.2012.124"},{"issue":"7043","key":"938_CR42","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"key":"938_CR43","doi-asserted-by":"crossref","unstructured":"Pearce, R., Sanders, G.: K-truss decomposition for scale-free graphs at scale in distributed memory. In HPEC, pages 1\u20136. IEEE, (2018)","DOI":"10.1109\/HPEC.2018.8547572"},{"key":"938_CR44","doi-asserted-by":"crossref","unstructured":"Petroni, F., Querzoni, L., Daudjee, K., Kamali, S., Iacoboni, G.: Hdrf: Stream-based partitioning for power-law graphs. In CIKM, pages 243\u2013252, (2015)","DOI":"10.1145\/2806416.2806424"},{"key":"938_CR45","doi-asserted-by":"crossref","unstructured":"Qu, W., Zhang, W., Cheng, J., Zhang, C., Han, W., Bai, B., Zhang, C.J., He, L., Wang, X.: Optimizing graph partition by optimal vertex-cut: A holistic approach. In 2023 IEEE 39th International Conference on Data Engineering (ICDE), pages 1019\u20131031. IEEE, (2023)","DOI":"10.1109\/ICDE55515.2023.00083"},{"issue":"5586","key":"938_CR46","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1126\/science.1073374","volume":"297","author":"E Ravasz","year":"2002","unstructured":"Ravasz, E., Somera, A.L., Mongru, D.A., Oltvai, Z.N., Barab\u00e1si, A.-L.: Hierarchical organization of modularity in metabolic networks. Science 297(5586), 1551\u20131555 (2002)","journal-title":"Science"},{"issue":"1","key":"938_CR47","first-page":"43","volume":"12","author":"AE Sariy\u00fcce","year":"2018","unstructured":"Sariy\u00fcce, A.E., Seshadhri, C., Pinar, A.: Local algorithms for hierarchical dense subgraph discovery. PVLDB 12(1), 43\u201356 (2018)","journal-title":"PVLDB"},{"key":"938_CR48","doi-asserted-by":"crossref","unstructured":"Sariy\u00fcce, A.E., Seshadhri, C., Pinar, A., \u00c7ataly\u00fcrek, \u00dc.V.: Finding the hierarchy of dense subgraphs using nucleus decompositions. In A.\u00a0Gangemi, S.\u00a0Leonardi, and A.\u00a0Panconesi, editors, WWW, pages 927\u2013937. ACM, (2015)","DOI":"10.1145\/2736277.2741640"},{"key":"938_CR49","doi-asserted-by":"crossref","unstructured":"Shi, J., Dhulipala, L., Shun, J.: Parallel clique counting and peeling algorithms. In M.\u00a0Bender, J.\u00a0Gilbert, B.\u00a0Hendrickson, and B.\u00a0D. Sullivan, editors, ACDA, pages 135\u2013146. SIAM, (2021)","DOI":"10.1137\/1.9781611976830.13"},{"issue":"S2","key":"938_CR50","first-page":"1185","volume":"18","author":"V Sinyachkin","year":"2022","unstructured":"Sinyachkin, V., Shchennikova, N., Varlamova, I.: Adolescents and adults\u2019 structure and content of associative fields of keywords of an advertisement text: an experiment of associations. J. lang. linguist. 18(S2), 1185\u20131193 (2022)","journal-title":"J. lang. linguist."},{"key":"938_CR51","doi-asserted-by":"crossref","unstructured":"Smith, S., Liu, X., Ahmed, N.K., Tom, A.S., Petrini, F., Karypis, G.: Truss decomposition on shared-memory parallel systems. In HPEC, pages 1\u20136. IEEE, (2017)","DOI":"10.1109\/HPEC.2017.8091049"},{"key":"938_CR52","doi-asserted-by":"crossref","unstructured":"Stanzione, D., Barth, B., Gaffney, N., Gaither, K., Hempel, C., Minyard, T., Mehringer, S., Wernert, E., Tufo, H., Panda, D., et al.: Stampede 2: The evolution of an xsede supercomputer. In PEARC, pages 1\u20138, (2017)","DOI":"10.1145\/3093338.3093385"},{"issue":"11","key":"938_CR53","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.160270","volume":"3","author":"T Takaguchi","year":"2016","unstructured":"Takaguchi, T., Yoshida, Y.: Cycle and flow trusses in directed networks. R. Soc. Open Sci. 3(11), 160270 (2016)","journal-title":"R. Soc. Open Sci."},{"issue":"9","key":"938_CR54","first-page":"2199","volume":"16","author":"A Tian","year":"2023","unstructured":"Tian, A., Zhou, A., Wang, Y., Chen, L.: Maximal d-truss search in dynamic directed graphs. PVLDB 16(9), 2199\u20132211 (2023)","journal-title":"PVLDB"},{"key":"938_CR55","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Gkantsidis, C., Radunovic, B., Vojnovic, M.: Fennel: Streaming graph partitioning for massive scale graphs. In WSDM, pages 333\u2013342, (2014)","DOI":"10.1145\/2556195.2556213"},{"key":"938_CR56","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: The k-clique densest subgraph problem. In A.\u00a0Gangemi, S.\u00a0Leonardi, and A.\u00a0Panconesi, editors, WWW, pages 1122\u20131132. ACM, (2015)","DOI":"10.1145\/2736277.2741098"},{"issue":"5","key":"938_CR57","first-page":"493","volume":"10","author":"S Verma","year":"2016","unstructured":"Verma, S., Leslie, L.M., Shin, Y., Gupta, I.: An experimental comparison of partitioning strategies in distributed graph processing. PVLDB 10(5), 493\u2013504 (2016)","journal-title":"PVLDB"},{"key":"938_CR58","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB, 5(9), (2012)","DOI":"10.14778\/2311906.2311909"},{"key":"938_CR59","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In ICDE, pages 661\u2013672. IEEE, (2020)","DOI":"10.1109\/ICDE48307.2020.00063"},{"issue":"2","key":"938_CR60","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00778-021-00658-5","volume":"31","author":"K Wang","year":"2022","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. VLDBJ 31(2), 203\u2013226 (2022)","journal-title":"VLDBJ"},{"key":"938_CR61","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Zhang, Y., Qin, L., Zhang, Y.: Discovering significant communities on bipartite graphs: An index-based approach. TKDE, (2021)","DOI":"10.1109\/TKDE.2021.3111349"},{"issue":"9","key":"938_CR62","first-page":"1889","volume":"15","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Xu, R., Jian, X., Zhou, A., Chen, L.: Towards distributed bitruss decomposition on bipartite graphs. PVLDB 15(9), 1889\u20131901 (2022)","journal-title":"PVLDB"},{"key":"938_CR63","doi-asserted-by":"crossref","unstructured":"Xing, Y., Xiao, N., Lu, Y., Li, R., Yu, S., Gao, S.: Fast truss decomposition in memory. In SpaCCS, pages 719\u2013729. Springer, (2017)","DOI":"10.1007\/978-3-319-72395-2_64"},{"key":"938_CR64","unstructured":"Zhu, X., Chen, W., Zheng, W., Ma, X.: Gemini: A computation-centric distributed graph processing system. In OSDI, pages 301\u2013316, (2016)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00938-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00938-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00938-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T12:03:40Z","timestamp":1758197020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00938-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,5]]},"references-count":64,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["938"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00938-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2025,8,5]]},"assertion":[{"value":"25 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"59"}}