{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T08:45:48Z","timestamp":1765529148887,"version":"3.48.0"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T00:00:00Z","timestamp":1750464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T00:00:00Z","timestamp":1750464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702073"],"award-info":[{"award-number":["61702073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176036"],"award-info":[{"award-number":["62176036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>To monitor clients potentially bypassing position limits, business units employ the disjoint sets principle to identify potential client correlations based on account profiles. The key challenge lies in computing disjoint sets for large-scale topological graphs (with millions of nodes and billions of edges) in a short response time. In this article, we propose a multi-DAG indexing algorithm, namely the Hierarchical Isomerism Distributed Equivalent (HIDE) union find. First, in large-scale topological graphs, we utilize two new topological structures: the equivalent sub-Directed Acyclic Graph (sub-DAG) and the hierarchical isomerism topological graph, to reduce the number of edges and nodes in the multi-DAG indexing merging process. Then, our HIDE union find is proposed to achieve computable splitting across temporal and spatial spans. HIDE union find is\u00a0theoretically proven\u00a0to ensure correctness and universality. Experimental validation demonstrates that HIDE union find outperforms previous methods in large-scale topological graphs. The results indicate that HIDE union find achieves response times 100 to 200 times faster than those of\u00a0the current leading methods.<\/jats:p>","DOI":"10.1007\/s41019-025-00287-w","type":"journal-article","created":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T02:16:32Z","timestamp":1750472192000},"page":"665-680","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Isomerism Distributed Equivalent Union Find for Billion-Scale Disjoint Sets: A Case Study"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0699-933X","authenticated-orcid":false,"given":"Liang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7209-3563","authenticated-orcid":false,"given":"Pingchuan","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5951-2164","authenticated-orcid":false,"given":"Kai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4217-3781","authenticated-orcid":false,"given":"Liping","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3016-6197","authenticated-orcid":false,"given":"Se\u00e1n","family":"McLoone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4338-9338","authenticated-orcid":false,"given":"Yuanjun","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9296-9975","authenticated-orcid":false,"given":"Hongbo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,21]]},"reference":[{"issue":"1","key":"287_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-024-00460-w","volume":"37","author":"Y Afek","year":"2024","unstructured":"Afek Y, Giladi G, Patt-Shamir B (2024) Distributed computing with the cloud. Distrib Comput 37(1):1\u201318","journal-title":"Distrib Comput"},{"key":"287_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s41019-019-0088-6","volume":"4","author":"M Alam","year":"2019","unstructured":"Alam M, Perumalla KS, Sanders P (2019) Novel parallel algorithms for fast multi-GPU-based generation of massive scale-free networks. Data Sci Eng 4:61\u201375","journal-title":"Data Sci Eng"},{"key":"287_CR3","doi-asserted-by":"publisher","unstructured":"Alistarh D, Fedorov A, Koval N (2019) In search of the fastest concurrent union-find algorithm. arXiv:1911.06347. https:\/\/doi.org\/10.48550\/arXiv.1911.06347","DOI":"10.48550\/arXiv.1911.06347"},{"issue":"1","key":"287_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2636922","volume":"11","author":"S Alstrup","year":"2014","unstructured":"Alstrup S, Thorup M, G\u00f8rtz IL, Rauhe T, Zwick U (2014) Union-find with constant time deletions. ACM Trans Algorithms 11(1):1\u201328","journal-title":"ACM Trans Algorithms"},{"key":"287_CR5","doi-asserted-by":"crossref","unstructured":"Anderson RJ, Woll H (1991) Wait-free parallel algorithms for the union-find problem. In: Proceedings of the twenty-third annual ACM symposium on Theory of computing, pp 370\u2013380","DOI":"10.1145\/103418.103458"},{"key":"287_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00446-022-00435-9","volume":"36","author":"A Balliu","year":"2023","unstructured":"Balliu A, Brandt S, Chang YJ, Olivetti D, Studen\u1ef3 J, Suomela J, Tereshchenko A (2023) Locally checkable problems in rooted trees. Distrib Comput 36:277\u2013311","journal-title":"Distrib Comput"},{"issue":"4","key":"287_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1093\/rfs\/5.4.637","volume":"5","author":"H Bessembinder","year":"1992","unstructured":"Bessembinder H (1992) Systematic risk, hedging pressure, and risk premiums in futures markets. Rev Financ Stud 5(4):637\u2013667","journal-title":"Rev Financ Stud"},{"issue":"1","key":"287_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11554-016-0574-2","volume":"15","author":"L Cabaret","year":"2018","unstructured":"Cabaret L, Lacassagne L, Etiemble D (2018) Parallel light speed labeling: an efficient connected component algorithm for labeling and analysis on multi-core processors. J Real-Time Image Proc 15(1):173\u2013196. https:\/\/doi.org\/10.1007\/s11554-016-0574-2","journal-title":"J Real-Time Image Proc"},{"issue":"3","key":"287_CR9","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.transproceed.2008.02.064","volume":"40","author":"G Carvajal","year":"2008","unstructured":"Carvajal G, Droguett A, Burgos M, Aros C, Ardiles L, Flores C, Carpio D, Ruiz-Ortega M, Egido J, Mezzano S (2008) Gremlin: a novel mediator of epithelial mesenchymal transition and fibrosis in chronic allograft nephropathy. Transpl Proc 40(3):734\u2013739","journal-title":"Transpl Proc"},{"key":"287_CR10","doi-asserted-by":"publisher","unstructured":"Chargueraud A, Pottier F (2015) Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation. In: International conference on interactive theorem proving. Springer, pp 137\u2013153. https:\/\/doi.org\/10.1007\/978-3-319-22102-1_9","DOI":"10.1007\/978-3-319-22102-1_9"},{"issue":"3","key":"287_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.frl.2005.05.002","volume":"2","author":"PH Chou","year":"2005","unstructured":"Chou PH, Lin MC, Yu MT (2005) Risk aversion and price limits in futures markets. Financ Res Lett 2(3):173\u2013184","journal-title":"Financ Res Lett"},{"issue":"5","key":"287_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF01383882","volume":"17","author":"G Cybenko","year":"1988","unstructured":"Cybenko G, Allen TG, Polito J (1988) Practical parallel union-find algorithms for transitive closure and clustering. Int J Parallel Prog 17(5):403\u2013423","journal-title":"Int J Parallel Prog"},{"key":"287_CR13","doi-asserted-by":"crossref","unstructured":"Czumaj A, Davies P, Parter M (2021) Component stability in low-space massively parallel computation. In: Proceedings of the 2021 ACM symposium on principles of distributed computing, pp 481\u2013491","DOI":"10.1145\/3465084.3467903"},{"issue":"1","key":"287_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"287_CR15","doi-asserted-by":"crossref","unstructured":"Fasuga R, Stoklasa P, Nemec M (2014) The method of automated monitoring of product prices and market position determination in relation to competition quotes: Monitoring of product prices and marketability development with continuous assessment of market position in on-line sales. In: 2014 11th international conference on e-business. IEEE, pp 5\u201313","DOI":"10.5220\/0005014400050013"},{"key":"287_CR16","doi-asserted-by":"publisher","unstructured":"Fedorov A, Hashemi D, Nadiradze G, Alistarh D (2023) Provably-efficient and internally-deterministic parallel union-find. In: SPAA \u201923: proceedings of the 35th ACM symposium on parallelism in algorithms and architectures, pp 261\u2013271. https:\/\/doi.org\/10.1145\/3558481.3591082","DOI":"10.1145\/3558481.3591082"},{"issue":"1\u20132","key":"287_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1504\/IJHPCN.2019.103537","volume":"15","author":"Z Fu","year":"2019","unstructured":"Fu Z, Wu Z, Li H, Li Y, Wu M, Chen X, Ye X, Yu B, Hu X (2019) Geabase: a high-performance distributed graph database for industry-scale applications. Int J High Perform Comput Netw 15(1\u20132):12\u201321","journal-title":"Int J High Perform Comput Netw"},{"issue":"2","key":"287_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"HN Gabow","year":"1983","unstructured":"Gabow HN, Tarjan RE (1983) A linear-time algorithm for a special case of disjoint set union. J Comput Syst Sci 30(2):209\u2013221","journal-title":"J Comput Syst Sci"},{"key":"287_CR19","doi-asserted-by":"publisher","unstructured":"Gabrielyan Y, Yeghiazaryan V, Voiculescu I (2022) Parallel partitioning: Path reducing and union-find based watershed for the GPU. In: 2022 IEEE international conference on image processing (ICIP), pp 1501\u20131505. https:\/\/doi.org\/10.1109\/ICIP46576.2022.9897372","DOI":"10.1109\/ICIP46576.2022.9897372"},{"key":"287_CR20","unstructured":"Gonzalez JE, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) Graphx: graph processing in a distributed dataflow framework. In: Proceedings of 11th USENIX symposium on operating systems design and implementation, pp 599\u2013613"},{"issue":"6","key":"287_CR21","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1109\/TIP.2010.2044963","volume":"19","author":"C Grana","year":"2010","unstructured":"Grana C, Borghesani D, Cucchiara R (2010) Optimized block-based connected components labeling with decision trees. IEEE Trans Image Process 19(6):1596\u20131609. https:\/\/doi.org\/10.1109\/TIP.2010.2044963","journal-title":"IEEE Trans Image Process"},{"issue":"2","key":"287_CR22","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TBDATA.2016.2637378","volume":"6","author":"K Hildebrandt","year":"2020","unstructured":"Hildebrandt K, Panse F, Wilcke N, Ritter N (2020) Large-scale data pollution with Apache Spark. IEEE Trans Big Data 6(2):396\u2013411. https:\/\/doi.org\/10.1109\/TBDATA.2016.2637378","journal-title":"IEEE Trans Big Data"},{"key":"287_CR23","doi-asserted-by":"crossref","unstructured":"Holzschuher F, Peinl R (2013) Performance of graph query languages: Comparison of cypher, gremlin and native access in Neo4j. In: Proceedings of the joint EDBT\/ICDT 2013 workshops, pp 195\u2013204","DOI":"10.1145\/2457317.2457351"},{"key":"287_CR24","doi-asserted-by":"crossref","unstructured":"Kaplan H, Shafrir N, Tarjan RE (2002) Meldable heaps and Boolean union-find. In: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, pp 573\u2013582","DOI":"10.1145\/509907.509990"},{"key":"287_CR25","doi-asserted-by":"publisher","unstructured":"Khatua A, Mailthody VS, Taleka B, Ma T, Song X, Hwu Wm (2023) IGB: addressing the gaps in labeling, features, heterogeneity, and size of public graph datasets for deep learning research. In: Proceedings of the 29th ACM SIGKDD conference on knowledge discovery and data mining, pp 4284\u20134295. https:\/\/doi.org\/10.48550\/arXiv.2302.13522","DOI":"10.48550\/arXiv.2302.13522"},{"key":"287_CR26","unstructured":"Kim Y (2018) The necessity of introducing the principle-based regulation system to the capital market and financial services act and some suggestions for future reform. Korean J Secur Law"},{"issue":"49","key":"287_CR27","first-page":"35","volume":"180","author":"A Ko\u00e7i","year":"2018","unstructured":"Ko\u00e7i A, \u00c7i\u00e7o B (2018) Performance evaluation of the asymmetric distributed lock management in cloud computing. Int J Comput Appl 180(49):35\u201342","journal-title":"Int J Comput Appl"},{"issue":"4","key":"287_CR28","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1109\/TBDATA.2017.2782809","volume":"7","author":"C Luo","year":"2021","unstructured":"Luo C, Zhang K, Salinas S, Li P (2021) Secfact: secure large-scale QR and LU factorizations. IEEE Trans Big Data 7(4):796\u2013807. https:\/\/doi.org\/10.1109\/TBDATA.2017.2782809","journal-title":"IEEE Trans Big Data"},{"key":"287_CR29","doi-asserted-by":"crossref","unstructured":"Manne F, Patwary MMA (2010) A scalable parallel union-find algorithm for distributed memory computers. In: Parallel processing and applied mathematics, pp 186\u2013195","DOI":"10.1007\/978-3-642-14390-8_20"},{"issue":"1","key":"287_CR30","first-page":"1235","volume":"17","author":"X Meng","year":"2016","unstructured":"Meng X, Bradley J, Yavuz B, Sparks E, Venkataraman S, Liu D, Freeman J, Tsai D, Amde M, Owen S et al (2016) Mllib: machine learning in Apache Spark. J. Mach. Learn. Res. 17(1):1235\u20131241","journal-title":"J. Mach. Learn. Res."},{"key":"287_CR31","unstructured":"Monath N, Zaheer M, Dubey KA, Ahmed A, McCallum A (2021) Dag-structured clustering by nearest neighbors. In: International conference on artificial intelligence and statistics. PMLR, pp 2854\u20132862"},{"issue":"1","key":"287_CR32","doi-asserted-by":"publisher","first-page":"57","DOI":"10.4310\/21-SII697","volume":"16","author":"R Nargunam","year":"2023","unstructured":"Nargunam R, Wei WW, Anuradha N (2023) Analyses of the impact of country specific macro risk variables on gold futures contract and its position as an asset class: evidence from India. Stat Interface 16(1):57\u201367","journal-title":"Stat Interface"},{"key":"287_CR33","doi-asserted-by":"crossref","unstructured":"Patwary M, Ali M, Blair J, Manne F (2010) Experiments on union-find algorithms for the disjoint-set data structure. In: International symposium on experimental algorithms. Springer, pp 411\u2013423","DOI":"10.1007\/978-3-642-13193-6_35"},{"key":"287_CR34","doi-asserted-by":"crossref","unstructured":"Patwary MMA, Refsnes P, Manne F (2012) Multi-core spanning forest algorithms using the disjoint-set data structure. In: 2012 IEEE 26th international parallel and distributed processing symposium. IEEE, pp 827\u2013835","DOI":"10.1109\/IPDPS.2012.79"},{"issue":"1","key":"287_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep01665","volume":"3","author":"F Pozzi","year":"2013","unstructured":"Pozzi F, Di Matteo T, Aste T (2013) Spread of risk across financial markets: better to invest in the peripheries. Sci Rep 3(1):1\u20137","journal-title":"Sci Rep"},{"issue":"3","key":"287_CR36","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s41019-021-00161-5","volume":"6","author":"Z Ren","year":"2021","unstructured":"Ren Z, Gu Y, Li C, Li F, Yu G (2021) GPU-based dynamic hyperspace hash with full concurrency. Data Sci Eng 6(3):265\u2013279","journal-title":"Data Sci Eng"},{"key":"287_CR37","doi-asserted-by":"publisher","unstructured":"Salahat E, Saleh H, Sluzek A, Al-Qutayri M, Mohammad B, Ismail M (2015) Novel fast and scalable parallel union-find ASIC implementation for real-time digital image segmentation. In: IECON 2015-41st annual conference of the IEEE industrial electronics society. IEEE, pp 003,122\u2013003,125. https:\/\/doi.org\/10.1109\/IECON.2015.7392579","DOI":"10.1109\/IECON.2015.7392579"},{"issue":"1","key":"287_CR38","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TBDATA.2019.2907624","volume":"7","author":"JAd Santos","year":"2021","unstructured":"Santos JAd, Syed TI, Naldi MC, Campello RJGB, Sander J (2021) Hierarchical density-based clustering using mapreduce. IEEE Trans Big Data 7(1):102\u2013114. https:\/\/doi.org\/10.1109\/TBDATA.2019.2907624","journal-title":"IEEE Trans Big Data"},{"issue":"1\u20132","key":"287_CR39","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1017\/S1471068405002541","volume":"6","author":"T Schrijvers","year":"2006","unstructured":"Schrijvers T, Fr\u00fchwirth T (2006) Optimal union-find in constraint handling rules. Theory Pract Logic Program 6(1\u20132):213\u2013224","journal-title":"Theory Pract Logic Program"},{"issue":"3","key":"287_CR40","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1137\/S0097539703439088","volume":"34","author":"R Seidel","year":"2005","unstructured":"Seidel R, Sharir M (2005) Top-down analysis of path compression. SIAM J Comput 34(3):515\u2013525. https:\/\/doi.org\/10.1137\/S0097539703439088","journal-title":"SIAM J Comput"},{"issue":"1","key":"287_CR41","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TBDATA.2019.2907624","volume":"7","author":"M Shukla","year":"2020","unstructured":"Shukla M, Dharme D, Ramnarain P, Santos RD, Lu CT (2020) DIGDUG: scalable separable dense graph pruning and join operations in MapReduce. IEEE Trans Big Data 7(1):102\u2013114. https:\/\/doi.org\/10.1109\/TBDATA.2019.2907624","journal-title":"IEEE Trans Big Data"},{"key":"287_CR42","doi-asserted-by":"publisher","unstructured":"Simsiri N, Tangwongsan K, Tirthapura S, Wu KL (2016) Work-efficient parallel and incremental graph connectivity, pp 1\u201318. arXiv:1602.05232. https:\/\/doi.org\/10.48550\/arXiv.1602.05232","DOI":"10.48550\/arXiv.1602.05232"},{"key":"287_CR43","doi-asserted-by":"crossref","unstructured":"Simsiri N, Tangwongsan K, Tirthapura S, Wu KL (2016) Work-efficient parallel union-find with applications to incremental graph connectivity. In: European conference on parallel processing. Springer, pp 561\u2013573","DOI":"10.1007\/978-3-319-43659-3_41"},{"issue":"14","key":"287_CR44","doi-asserted-by":"publisher","first-page":"3055","DOI":"10.3390\/s19143055","volume":"19","author":"F Spagnolo","year":"2019","unstructured":"Spagnolo F, Perri S, Corsonello P (2019) An efficient hardware-oriented single-pass approach for connected component analysis. Sensors 19(14):3055. https:\/\/doi.org\/10.3390\/s19143055","journal-title":"Sensors"},{"key":"287_CR45","unstructured":"State Council of the PRC: trading in futures and derivatives (2022)"},{"issue":"4","key":"287_CR46","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"RE Tarjan","year":"1979","unstructured":"Tarjan RE (1979) Applications of path compression on balanced trees. J ACM (JACM) 26(4):690\u2013715. https:\/\/doi.org\/10.1145\/322154.322161","journal-title":"J ACM (JACM)"},{"issue":"2","key":"287_CR47","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"RE Tarjan","year":"1984","unstructured":"Tarjan RE, Leeuwen JV (1984) Worst-case analysis of set union algorithms. J ACM 31(2):245\u2013281","journal-title":"J ACM"},{"key":"287_CR48","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cpc.2019.01.004","volume":"239","author":"S Todo","year":"2019","unstructured":"Todo S, Matsuo H, Shitara H (2019) Parallel loop cluster quantum Monte Carlo simulation of quantum magnets based on global union-find graph algorithm. Comput Phys Commun 239:84\u201393. https:\/\/doi.org\/10.1016\/j.cpc.2019.01.004","journal-title":"Comput Phys Commun"},{"key":"287_CR49","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cpc.2019.01.004","volume":"239","author":"S Todo","year":"2019","unstructured":"Todo S, Matsuo H, Shitara H (2019) Parallel loop cluster quantum Monte Carlo simulation of quantum magnets based on global union-find graph algorithm. Comput Phys Commun 239:84\u201393","journal-title":"Comput Phys Commun"},{"issue":"3","key":"287_CR50","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ecosys.2015.01.003","volume":"39","author":"L Wei","year":"2015","unstructured":"Wei L, Zhang W, Xiong X, Shi L (2015) Position limit for the CSI 300 stock index futures market. Econ Syst 39(3):369\u2013389","journal-title":"Econ Syst"},{"issue":"4","key":"287_CR51","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TBDATA.2017.2701817","volume":"7","author":"X Wu","year":"2021","unstructured":"Wu X, Wu T, Khan M, Ni Q, Dou W (2021) Game theory based correlated privacy preserving analysis in big data. IEEE Trans Big Data 7(4):643\u2013656. https:\/\/doi.org\/10.1109\/TBDATA.2017.2701817","journal-title":"IEEE Trans Big Data"},{"key":"287_CR52","doi-asserted-by":"crossref","unstructured":"Xin RS, Crankshaw D, Dave A, Gonzalez JE, Stoica I (2014) GraphX: unifying data-parallel and graph-parallel analytics. arXiv:1402.2394","DOI":"10.1145\/2484425.2484427"},{"issue":"6","key":"287_CR53","doi-asserted-by":"publisher","first-page":"2808","DOI":"10.1109\/TVCG.2021.3074584","volume":"27","author":"J Xu","year":"2021","unstructured":"Xu J, Guo H, Shen HW, Raj M, Wang X, Xu X, Wang Z, Peterka T (2021) Asynchronous and load-balanced union-find for distributed and parallel scientific data visualization and analysis. IEEE Trans Vis Comput Graph 27(6):2808\u20132820. https:\/\/doi.org\/10.1109\/TVCG.2021.3074584","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"287_CR54","unstructured":"Yan WP, Larson P\u00c5 (1995) Eager aggregation and lazy aggregation. In: Very large data bases conference"},{"issue":"2","key":"287_CR55","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s41019-021-00154-4","volume":"6","author":"J Yang","year":"2021","unstructured":"Yang J, Yao W, Zhang W (2021) Keyword search on large graphs: a survey. Data Sci Eng 6(2):142\u2013162","journal-title":"Data Sci Eng"},{"issue":"10","key":"287_CR56","doi-asserted-by":"publisher","first-page":"6319","DOI":"10.1109\/TSMC.2019.2961378","volume":"51","author":"L Yang","year":"2021","unstructured":"Yang L, Yang Y, Mgaya GB, Zhang B, Chen L, Liu H (2021) Novel fast networking approaches mining underlying structures from investment big data. IEEE Trans Syst Man Cybern: Syst 51(10):6319\u20136329. https:\/\/doi.org\/10.1109\/TSMC.2019.2961378","journal-title":"IEEE Trans Syst Man Cybern: Syst"},{"key":"287_CR57","unstructured":"Zaharia M, Chowdhury M, Franklin MJ, Shenker S, Stoica I (2010) Spark: cluster computing with working sets. In: Proceedings of the 2nd USENIX conference on hot topics in cloud computing. USENIX Association, pp 1\u201310"},{"key":"287_CR58","doi-asserted-by":"crossref","unstructured":"Zhang Y, Azad A, Hu Z (2020) FastSV: a distributed-memory connected component algorithm with fast convergence. In: Proceedings of the 2020 SIAM conference on parallel processing for scientific computing. SIAM, pp 46\u201357","DOI":"10.1137\/1.9781611976137.5"},{"key":"287_CR59","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1109\/TPDS.2017.2776115","volume":"29","author":"Y Zhang","year":"2018","unstructured":"Zhang Y, Liao X, Xiang S, Jin H, He B (2018) Efficient disk-based directed graph processing: a strongly connected component approach. IEEE Trans Parallel Distrib Syst 29:830\u2013842. https:\/\/doi.org\/10.1109\/TPDS.2017.2776115","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"287_CR60","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s41019-016-0026-9","volume":"1","author":"N Zhou","year":"2016","unstructured":"Zhou N, Zhou X, Zhang X, Wang S (2016) An I\/O-efficient buffer batch replacement policy for update-intensive graph databases. Data Sci Eng 1:231\u2013241","journal-title":"Data Sci Eng"},{"key":"287_CR61","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s41019-016-0029-6","volume":"2","author":"L Zou","year":"2017","unstructured":"Zou L, \u00d6zsu MT (2017) Graph-based RDF data management. Data Sci Eng 2:56\u201370","journal-title":"Data Sci Eng"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00287-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-025-00287-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00287-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T08:41:36Z","timestamp":1765528896000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-025-00287-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,21]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["287"],"URL":"https:\/\/doi.org\/10.1007\/s41019-025-00287-w","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"type":"print","value":"2364-1185"},{"type":"electronic","value":"2364-1541"}],"subject":[],"published":{"date-parts":[[2025,6,21]]},"assertion":[{"value":"23 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}