{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T23:06:58Z","timestamp":1746313618477,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"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":["61672389"],"award-info":[{"award-number":["61672389"]}],"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":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Streaming graph partitioning methods have recently gained attention due to their ability to scale to very large graphs with limited resources. However, many such methods do not consider workload and graph characteristics. This may degrade the performance of queries by increasing inter-node communication and computational load imbalance. Moreover, existing workload-aware methods cannot consistently provide good performance as they do not consider dynamic workloads that keep emerging in graph applications. We address these issues by proposing a novel workload-adaptive streaming partitioner named WASP, that aims to achieve low-latency and high-throughput online graph queries. As each workload typically contains frequent query patterns, WASP exploits the existing workload to capture active vertices and edges which are frequently visited and traversed, respectively. This information is used to heuristically improve the quality of partitions either by avoiding the concentration of active vertices in a few partitions proportional to their visit frequencies or by reducing the probability of the cut of active edges proportional to their traversal frequencies. In order to assess the impact of WASP on a graph store and to show how easily the approach can be plugged on top of the system, we exploit it in a distributed graph-based RDF store. Our experiments over three synthetic and real-world graph datasets and the corresponding static and dynamic query workloads show that WASP achieves a better query performance against state-of-the-art graph partitioners, especially in dynamic query workloads.<\/jats:p>","DOI":"10.1007\/s41019-021-00156-2","type":"journal-article","created":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T16:04:44Z","timestamp":1618502684000},"page":"163-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Workload-Adaptive Streaming Partitioner for Distributed Graph Stores"],"prefix":"10.1007","volume":"6","author":[{"given":"Ali","family":"Davoudian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8245-2355","authenticated-orcid":false,"given":"Mengchi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,15]]},"reference":[{"key":"156_CR1","doi-asserted-by":"crossref","unstructured":"Alu\u00e7 G, Hartig O, \u00d6zsu MT, Daudjee K (2014) Diversified stress testing of RDF data management systems. In: International semantic web conference. Springer, pp 197\u2013212","DOI":"10.1007\/978-3-319-11964-9_13"},{"key":"156_CR2","doi-asserted-by":"crossref","unstructured":"Angles R (2012) A comparison of current graph database models. In: 28th international conference on data engineering workshops (ICDEW). IEEE, pp 171\u2013177","DOI":"10.1109\/ICDEW.2012.31"},{"key":"156_CR3","doi-asserted-by":"crossref","unstructured":"Angles R, Arenas M, Barcelo P, Hogan A, Reutter J, Vrgoc D (2016) Foundations of modern graph query languages. arXiv preprint arXiv:1610.06264","DOI":"10.1145\/3104031"},{"key":"156_CR4","doi-asserted-by":"crossref","unstructured":"Angles R, Gutierrez C (2018) An introduction to graph data management. In: Graph data management. Springer, pp 1\u201332","DOI":"10.1007\/978-3-319-96193-4_1"},{"issue":"7","key":"156_CR5","doi-asserted-by":"publisher","first-page":"926","DOI":"10.3390\/sym11070926","volume":"11","author":"K Bok","year":"2019","unstructured":"Bok K, Kim J, Yoo J (2019) Dynamic partitioning supporting load balancing for distributed RDF graph stores. Symmetry 11(7):926","journal-title":"Symmetry"},{"key":"156_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-49487-6_4","volume-title":"Algorithm engineering","author":"A Bulu\u00e7","year":"2016","unstructured":"Bulu\u00e7 A, Meyerhenke H, Safro I, Sanders P, Schulz C (2016) Recent advances in graph partitioning. In: Kliemann L, Sanders P (eds) Algorithm engineering. Springer, pp 117\u2013158"},{"key":"156_CR7","unstructured":"Carlson JL (2013) Redis in action. Manning Publications Co"},{"issue":"4","key":"156_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1978915.1978919","volume":"39","author":"R Cattell","year":"2011","unstructured":"Cattell R (2011) Scalable SQL and NoSQL data stores. ACM SIGMOD Rec 39(4):12\u201327","journal-title":"ACM SIGMOD Rec"},{"issue":"3","key":"156_CR9","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 (2019) Powerlyra: differentiated graph computation and partitioning on skewed graphs. ACM Trans Parallel Comput 5(3):1\u201339","journal-title":"ACM Trans Parallel Comput"},{"key":"156_CR10","doi-asserted-by":"crossref","unstructured":"Dai D, Zhang W, Chen Y (2017) IOGP: an incremental online graph partitioning algorithm for distributed graph databases. In: Proceedings of the 26th international symposium","DOI":"10.1145\/3078597.3078606"},{"issue":"2","key":"156_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3158661","volume":"51","author":"A Davoudian","year":"2018","unstructured":"Davoudian A, Chen L, Liu M (2018) A survey on NoSQL stores. ACM Comput Surv 51(2):1\u201343","journal-title":"ACM Comput Surv"},{"key":"156_CR12","doi-asserted-by":"crossref","unstructured":"Davoudian A (2019) Helios: an adaptive and query workload-driven partitioning framework for distributed graph stores.In: Proceedings of the ACM SIGMOD international conference on management of data","DOI":"10.1145\/3299869.3300103"},{"issue":"5","key":"156_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3408314","volume":"53","author":"A Davoudian","year":"2020","unstructured":"Davoudian A, Liu M (2020) Big Data Systems: A Software Engineering Perspective. ACM Comput Surv 53(5):1\u201339","journal-title":"ACM Comput Surv"},{"key":"156_CR14","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: Proceedings of the ACM SIGCOMM special interest group on data communication, vol\u00a029","DOI":"10.1145\/316188.316229"},{"key":"156_CR15","unstructured":"Firth H, Missier P (2016) Workload-aware streaming graph partitioning. In: EDBT\/ICDT workshops"},{"issue":"2","key":"156_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10619-017-7196-y","volume":"35","author":"H Firth","year":"2017","unstructured":"Firth H, Missier P (2017) TAPER: query-aware, partition-enhancement for large, heterogenous graphs. Proc Distrib Parallel Databases 35(2):85\u2013115","journal-title":"Proc Distrib Parallel Databases"},{"key":"156_CR17","doi-asserted-by":"crossref","unstructured":"Gal\u00e1rraga L, Hose K, Schenkel R (2014) Partout: a distributed engine for efficient RDF processing. In: Proceedings of the 23rd international conference on World Wide Web. ACM, pp 267\u2013268","DOI":"10.1145\/2567948.2577302"},{"key":"156_CR18","doi-asserted-by":"crossref","unstructured":"Garey MR, Johnson DS, Stockmeyer L (1974) Some simplified NP-complete problems. In: Proceedings of the 6th annual ACM symposium on theory of computing","DOI":"10.1145\/800119.803884"},{"key":"156_CR19","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) PowerGraph: Distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX OSDI conference on operating systems design and implementation"},{"issue":"3","key":"156_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3199523","volume":"51","author":"S Heidari","year":"2018","unstructured":"Heidari S, Simmhan Y, Calheiros RN, Buyya R (2018) Scalable graph processing frameworks: a taxonomy and open challenges. ACM Comput Surv 51(3):1\u201353","journal-title":"ACM Comput Surv"},{"key":"156_CR21","doi-asserted-by":"crossref","unstructured":"Hose K, Schenkel R (2013) WARP: workload-aware replication and partitioning for RDF. In: 29th international conference on data engineering workshops (ICDEW). IEEE, pp 1\u20136","DOI":"10.1109\/ICDEW.2013.6547414"},{"issue":"7","key":"156_CR22","doi-asserted-by":"publisher","first-page":"540","DOI":"10.14778\/2904483.2904486","volume":"9","author":"J Huang","year":"2016","unstructured":"Huang J, Abadi DJ (2016) Leopard: lightweight edge-oriented partitioning and replication for dynamic graphs. Proc VLDB Endow 9(7):540\u2013551","journal-title":"Proc VLDB Endow"},{"issue":"11","key":"156_CR23","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.14778\/3402707.3402747","volume":"4","author":"J Huang","year":"2011","unstructured":"Huang J, Abadi DJ, Ren K (2011) Scalable SPARQL querying of large RDF graphs. Proc VLDB Endow 4(11):1123\u20131134","journal-title":"Proc VLDB Endow"},{"key":"156_CR24","doi-asserted-by":"crossref","unstructured":"Iordanov B (2010) HyperGraphDB: a generalized graph database. In: Proceedings of the Springer international conference on web-age information management","DOI":"10.1007\/978-3-642-16720-1_3"},{"issue":"1","key":"156_CR25","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"156_CR26","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1137\/S0036144598334138","volume":"41","author":"G Karypis","year":"1999","unstructured":"Karypis G, Kumar V (1999) Parallel multilevel series k-way partitioning scheme for irregular graphs. SIAM Rev 41(2):278\u2013300","journal-title":"SIAM Rev"},{"key":"156_CR27","doi-asserted-by":"crossref","unstructured":"Khayyat Z, Awara K, Alonazi A, Jamjoom H, Williams D, Kalnis P (2013) Mizan: a system for dynamic load balancing in large-scale graph processing. In: Proceedings of the 8th ACM European conference on computer systems","DOI":"10.1145\/2465351.2465369"},{"issue":"2","key":"156_CR28","doi-asserted-by":"publisher","first-page":"167","DOI":"10.3233\/SW-140134","volume":"6","author":"J Lehmann","year":"2015","unstructured":"Lehmann J, Isele R, Jakob M, Jentzsch A, Kontokostas D, Mendes PN, Hellmann S, Morsey M, Van Kleef P, Auer S et al (2015) DBpedia\u2014a large-scale, multilingual knowledge base extracted from Wikipedia. Semant Web 6(2):167\u2013195","journal-title":"Semant Web"},{"issue":"8","key":"156_CR29","doi-asserted-by":"publisher","first-page":"891","DOI":"10.14778\/3324301.3324306","volume":"12","author":"D Li","year":"2019","unstructured":"Li D, Zhang Y, Wang J, Tan KL (2019) Topox: topology refactorization for efficient graph partitioning and processing. Proc VLDB Endow 12(8):891\u2013905","journal-title":"Proc VLDB Endow"},{"key":"156_CR30","doi-asserted-by":"crossref","unstructured":"Martella C, Logothetis D, Loukas A, Siganos G (2017) Spinner: scalable graph partitioning in the cloud. In: Proceedings of the 33rd IEEE ICDE international conference on data engineering","DOI":"10.1109\/ICDE.2017.153"},{"key":"156_CR31","doi-asserted-by":"crossref","unstructured":"Martinez-Bazan N, Gomez-Villamor S, Escale-Claveras F (2011) DEX: a high-performance graph database management system. In: Proceedings of the 27th IEEE ICDEW international conference on data engineering workshops","DOI":"10.1109\/ICDEW.2011.5767616"},{"key":"156_CR32","doi-asserted-by":"crossref","unstructured":"Mondal J, Deshpande A (2012) Managing large dynamic graphs efficiently. In: Proceedings of the ACM SIGMOD international conference on management of data","DOI":"10.1145\/2213836.2213854"},{"key":"156_CR33","unstructured":"Nicoara D, Kamali S, Daudjee K, Chen L (2015) Hermes: dynamic partitioning for distributed social network graph databases. In: Proceedings of the 18th EDBT international conference on extending database technology"},{"key":"156_CR34","doi-asserted-by":"crossref","unstructured":"Nishimura J, Ugander J (2013) Restreaming graph partitioning: simple versatile algorithms for advanced balancing. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/2487575.2487696"},{"key":"156_CR35","doi-asserted-by":"crossref","unstructured":"Pacaci A, \u00d6zsu MT (2019) Experimental analysis of streaming algorithms for graph partitioning. In: Boncz PA, Manegold S, Ailamaki A, Deshpande A, Kraska T (eds) Proceedings of the 2019 international conference on management of data, SIGMOD conference 2019, Amsterdam, The Netherlands, June 30\u2013July 5, 2019. ACM, pp 1375\u20131392","DOI":"10.1145\/3299869.3300076"},{"key":"156_CR36","unstructured":"Peng P, Zou L, Chen L, Zhao D (2016) Query workload-based RDF graph fragmentation and allocation. EDBT"},{"issue":"4","key":"156_CR37","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1109\/TKDE.2018.2841389","volume":"31","author":"P Peng","year":"2019","unstructured":"Peng P, Zou L, Chen L, Zhao D (2019) Adaptive distributed RDF graph fragmentation and allocation based on query workload. IEEE Trans Knowl Data Eng 31(4):670\u2013685","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"156_CR38","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1145\/1851275.1851227","volume":"40","author":"JM Pujol","year":"2010","unstructured":"Pujol JM, Erramilli V, Siganos G, Yang X, Laoutaris N, Chhabra P, Rodriguez P (2010) The little engine (s) that could: scaling online social networks. Proc ACM SIGCOMM Comput Commun Rev 40(4):375\u2013386","journal-title":"Proc ACM SIGCOMM Comput Commun Rev"},{"issue":"2","key":"156_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2714568","volume":"10","author":"F Rahimian","year":"2015","unstructured":"Rahimian F, Payberah AH, Girdzijauskas S, Jelasity M, Haridi S (2015) A distributed algorithm for large-scale graph partitioning. Proc ACM TAAS Trans Auton Adapt Syst 10(2):1\u201324","journal-title":"Proc ACM TAAS Trans Auton Adapt Syst"},{"key":"156_CR40","doi-asserted-by":"crossref","unstructured":"Saleem M, Ali MI, Hogan A, Mehmood Q, Ngomo ACN (2015) LSQ: the linked SPARQL queries dataset. In: International semantic web conference. Springer, pp 261\u2013269","DOI":"10.1007\/978-3-319-25010-6_15"},{"key":"156_CR41","unstructured":"Schloegel K, Karypis G, Kumar V (2000) Graph partitioning for high performance scientific simulations. Army High Performance Computing Research Center"},{"key":"156_CR42","unstructured":"Shang Z, Yu JX (2013) Catch the wind: graph workload balancing on cloud. In: Proceedings of the 29th IEEE ICDE international conference on data engineering"},{"key":"156_CR43","doi-asserted-by":"crossref","unstructured":"Shao B, Wang H, Li Y (2013) Trinity: a distributed graph engine on a memory cloud. In: Proceedings of the ACM SIGMOD international conference on management of data","DOI":"10.1145\/2463676.2467799"},{"key":"156_CR44","first-page":"317","volume":"16","author":"J Shi","year":"2016","unstructured":"Shi J, Yao Y, Chen R, Chen H, Li F (2016) Fast and concurrent RDF queries with RDMA-based distributed graph exploration. OSDI 16:317\u2013332","journal-title":"OSDI"},{"key":"156_CR45","doi-asserted-by":"crossref","unstructured":"Stanton I, Kliot G (2012) Streaming graph partitioning for large distributed graphs. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/2339530.2339722"},{"key":"156_CR46","unstructured":"Stegemann T, Ziegler J (2017) Pattern-based analysis of SPARQL queries from the LSQ dataset. In: International semantic web conference (posters, demos and industry tracks), pp 1\u20134"},{"key":"156_CR47","unstructured":"SWAT-Projects: The Lehigh University Benchmark (LUBM). http:\/\/swat.cse.lehigh.edu\/projects\/lubm\/"},{"issue":"3","key":"156_CR48","doi-asserted-by":"publisher","first-page":"193","DOI":"10.14778\/2732232.2732238","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian Y, Balmin A, Corsten SA, Tatikonda S, McPherson J (2013) From think like a vertex to think like a graph. Proc VLDB Endow 7(3):193\u2013204","journal-title":"Proc VLDB Endow"},{"key":"156_CR49","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Gkantsidis C, Radunovic B, Vojnovic M (2014) Fennel: streaming graph partitioning for massive scale graphs. In: Proceedings of the 7th ACM international conference on Web search and data mining","DOI":"10.1145\/2556195.2556213"},{"key":"156_CR50","doi-asserted-by":"crossref","unstructured":"Ugander J, Backstrom L (2013) Balanced label propagation for partitioning massive graphs. In: Proceedings of the 6th ACM international conference on Web search and data mining","DOI":"10.1145\/2433396.2433461"},{"key":"156_CR51","unstructured":"Vaquero L, Cuadrado F, Logothetis D, Martella C (2013) xDGP: a dynamic graph processing system with adaptive partitioning. arXiv preprint arXiv:1309.1049"},{"key":"156_CR52","doi-asserted-by":"crossref","unstructured":"Vaquero LM, Cuadrado F, Logothetis D, Martella C (2014) Adaptive partitioning for large-scale dynamic graphs. In: Proceedings of the 34th IEEE ICDCS international conference on distributed computing systems","DOI":"10.1109\/ICDCS.2014.23"},{"key":"156_CR53","doi-asserted-by":"crossref","unstructured":"Webber J (2012) A programmatic introduction to Neo4j. In: Proceedings of the 3rd ACM conference on systems, programming, and applications: software for humanity","DOI":"10.1145\/2384716.2384777"},{"key":"156_CR54","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.neunet.2019.05.010","volume":"117","author":"Z Wu","year":"2019","unstructured":"Wu Z, Karimi HR, Dang C (2019) An approximation algorithm for graph partitioning via deterministic annealing neural network. Neural Netw 117:191\u2013200","journal-title":"Neural Netw"},{"issue":"14","key":"156_CR55","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.14778\/2733085.2733097","volume":"7","author":"N Xu","year":"2014","unstructured":"Xu N, Chen L, Cui B (2014) LogGP: a log-based dynamic graph partitioning method. Proc VLDB Endow 7(14):1917\u20131928","journal-title":"Proc VLDB Endow"},{"key":"156_CR56","doi-asserted-by":"crossref","unstructured":"Yang S, Yan X, Zong B, Khan A (2012) Towards effective partition management for large graphs. In: Proceedings of the ACM SIGMOD international conference on management of data","DOI":"10.1145\/2213836.2213895"},{"key":"156_CR57","doi-asserted-by":"publisher","first-page":"265","DOI":"10.14778\/2535570.2488333","volume":"6","author":"K Zeng","year":"2013","unstructured":"Zeng K, Yang J, Wang H, Shao B, Wang Z (2013) A distributed graph engine for web scale RDF data. Proc VLDB Endow 6:265\u2013276","journal-title":"Proc VLDB Endow"},{"key":"156_CR58","doi-asserted-by":"crossref","unstructured":"Zheng A, Labrinidis A, Chrysanthis PK(2016) Planar: parallel lightweight architecture-aware adaptive graph repartitioning. In: Proceedings of the 32nd IEEE ICDE international conference on data engineering","DOI":"10.1109\/ICDE.2016.7498234"},{"key":"156_CR59","doi-asserted-by":"crossref","unstructured":"Zheng A, Labrinidis A, Faloutsos C (2017) Skew-resistant graph partitioning. In: Proceedings of the 33rd IEEE ICDE international conference on data engineering","DOI":"10.1109\/ICDE.2017.62"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00156-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-021-00156-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00156-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,22]],"date-time":"2021-05-22T11:09:35Z","timestamp":1621681775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-021-00156-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,15]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["156"],"URL":"https:\/\/doi.org\/10.1007\/s41019-021-00156-2","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"type":"print","value":"2364-1185"},{"type":"electronic","value":"2364-1541"}],"subject":[],"published":{"date-parts":[[2021,4,15]]},"assertion":[{"value":"27 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}