{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T07:29:54Z","timestamp":1766388594872,"version":"3.48.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032131089","type":"print"},{"value":"9783032131096","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:00:00Z","timestamp":1766448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:00:00Z","timestamp":1766448000000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-13109-6_21","type":"book-chapter","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T07:27:25Z","timestamp":1766388445000},"page":"294-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Breaking the Latency Barrier: Real-Time Incremental Community Detection with Live Graph Data on a Unified Graph Database Framework"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8099-2063","authenticated-orcid":false,"given":"Victor","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3025-4500","authenticated-orcid":false,"given":"Ricky","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5761-0413","authenticated-orcid":false,"given":"Jason","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,23]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Zakrzewska, A., Bader, D.: A dynamic algorithm for local community detection in graph. ASONAM\u201915, 2015. https:\/\/doi.org\/10.1145\/2898797.2809375","DOI":"10.1145\/2898797.2809375"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1016\/j.neucom.2024.128169","volume":"600","author":"J Li","year":"2024","unstructured":"Li, J., Lai, S., Shuai, Z.: A comprehensive review of community detection in graphs. Neurocomputing 600, 2024 (2024). https:\/\/doi.org\/10.1016\/j.neucom.2024.128169","journal-title":"Neurocomputing"},{"key":"21_CR3","unstructured":"Sharma, C.: Community Detection in Social Networks. WIREs Data Mining and Knowledge Discovery 2015, 2016"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Liu, X., Iftikhar, N., Xie, X.: Survey of real-time processing systems for big data. In: Proceedings of IDEAS\u201914, 2014. https:\/\/doi.org\/10.1145\/2628194.2628251","DOI":"10.1145\/2628194.2628251"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Gurusamy, V., Kanan, S., Nandhini, K.: The real time big data processing freamwork: advantages and limitations. IJCSE 5(12) (2017). E-ISSN: 2347\u20132693","DOI":"10.26438\/ijcse\/v5i12.305312"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Blondel, V., Guillaume, J., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008(10), P10008 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"21_CR7","unstructured":"Aynaud, T., Guillaume, J.: Static community detection algorithms for evolving networks. In: 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks. IEEE, IEEE, Avignon, France, pp. 513\u2013519 2010"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Zarayeneh, N., Kalyanaraman, A.: Delta-screening: a fast and efficient technique to update communities in dynamic graphs. IEEE Trans. Netw. Sci. Eng. 8(2(Apr 2021)), 1614\u20131629 (2021)","DOI":"10.1109\/TNSE.2021.3067665"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Sahu, S.: DF Louvain: Fast Incrementally Expanding Approach for Community Detection on Dynamic Graphs (2024). https:\/\/doi.org\/10.48550\/arXiv.2404.19634","DOI":"10.48550\/arXiv.2404.19634"},{"key":"21_CR10","unstructured":"Gonzalez, J., Xin, R., Dave, A.: GraphX: graph processing in a distributed dataflow framework. In: OSDI\u201914 Proceedings of the 11th USENIX on OS Design and Implementation, pp. 599\u2013613 (2014)"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Xin, R., Gonzalez, J., Franklin, M.: GraphX: A resilient distributed graph system on spark. In: First International Workshop on Graph Data Management, 2013. https:\/\/doi.org\/10.1145\/2484425.2484427","DOI":"10.1145\/2484425.2484427"},{"key":"21_CR12","unstructured":"Cypher Projection. Neo4j Docs. https:\/\/neo4j.com\/docs\/graph-data-science\/current\/management-ops\/graph-creation\/graph-project-cypher-projection\/"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Sun, R.: The Essential Criteria of Graph Databases. 1st Edition Chapter 6\u20137. Elsevier, London (2024)","DOI":"10.1016\/B978-0-443-14162-1.00004-0"},{"key":"21_CR14","doi-asserted-by":"publisher","unstructured":"Lin, L., Chen, J., Sun, R.: A Unified Graph Framework for Storage-Compute Coupled Cluster and High-Density Computing Cluster. BiDEDE\u201924 (2024). https:\/\/doi.org\/10.1145\/3663741.3664790","DOI":"10.1145\/3663741.3664790"},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Sun, R., Chen, J.: Design of Highly Scalable Graph Database Systems without Exponential Performance Degradation, 2023. https:\/\/doi.org\/10.1145\/3579142.3594293","DOI":"10.1145\/3579142.3594293"},{"key":"21_CR16","unstructured":"Sun, R., Zhang, J., Simione, Y.: Getting Started with the Graph Query Language (GQL). Packt Publishing, UK (2025). ISBN: 9781836204015"},{"key":"21_CR17","unstructured":"Ultipa GQL Online Documents. https:\/\/www.ultipa.com\/docs\/gql\/introduction"},{"key":"21_CR18","unstructured":"Ultipa UQL Online Documents. https:\/\/www.ultipa.com\/docs\/uql\/introduction"},{"key":"21_CR19","doi-asserted-by":"publisher","unstructured":"Sun, R., Wang, V.: A Graph Analytics Case Study of GPU Versus CPU on Performance, Greenness, and Cost. ISDM 2024 (2025). https:\/\/doi.org\/10.1007\/978-981-96-1206-2_28","DOI":"10.1007\/978-981-96-1206-2_28"},{"key":"21_CR20","doi-asserted-by":"publisher","unstructured":"Fan, W., Hu, C., Tian, C.: Incremental graph computations: doable and undoable. In: SIGMOD\u201917: 2017 ACM Conference on Management of Dat., 2018. https:\/\/doi.org\/10.1145\/3035918.3034944","DOI":"10.1145\/3035918.3034944"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Tang, Z., He, M., Fu, Z.: IncGraph: An Improved Distributed Incremental Graph Computing Model. IEEE, vol. 34, 2022","DOI":"10.1109\/TKDE.2020.3014150"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Sengupta, D., Sundaram, N., Zhu, X.: GraphIn: An Online High Performance Incremental Graph Processing Framework. Euro-Par 2016, 2016.https:\/\/doi.org\/10.1007\/978-3-329-43659-3_24","DOI":"10.1007\/978-3-329-43659-3_24"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, L., Gao, J.: Incremental Graph Pattern Matching Algorithm for Big Graph Data. Scientific Programming 2018, 2018","DOI":"10.1155\/2018\/6749561"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Pokorn\u00fd, J.: Graph Databases: Their Power and Limitations. CISIM 2015, vol. 9339. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-24369-6_5"},{"key":"21_CR25","doi-asserted-by":"publisher","unstructured":"Heidari, S., Simmhan, Y., Calheiros, R.: Scalable Graph Processing Frameworks: A Taxonomy and Open Challenges. ACM 2019, 2018.https:\/\/doi.org\/10.1145\/3199523","DOI":"10.1145\/3199523"},{"key":"21_CR26","unstructured":"Danilenko, N.: Exploring non-determinism in graph algorithms. In: 28th Workshop on Logic Programming, WLP 2014 (2014). http:\/\/ceur-ws.org\/Vol-1335\/wflp2015-paper4.pdf"},{"key":"21_CR27","doi-asserted-by":"publisher","unstructured":"Panyala, A., Subasi, O., Halappanavar, M.: Approximate computing techniques for iterative graph algorithms. In: 2017 IEEE 24th HiPC, 2017. https:\/\/doi.org\/10.1109\/HiPC.2017.00013","DOI":"10.1109\/HiPC.2017.00013"},{"key":"21_CR28","doi-asserted-by":"publisher","unstructured":"Sattar, N., Arifuzzaman, S.: Parallelizing louvain algorithms: distributed memory challenge. In: 2018 IEEE 16th DASC\/PiCom, 2018. https:\/\/doi.org\/10.1109\/DASC\/PiCom\/2018.00122","DOI":"10.1109\/DASC\/PiCom\/2018.00122"},{"key":"21_CR29","doi-asserted-by":"publisher","unstructured":"Fan, W., Yuan, W., Xu, J.: Parallelizing sequential graph computations. ACM TODS 43(4) (2018). abs\/https:\/\/doi.org\/10.1145\/3282488","DOI":"10.1145\/3282488"},{"key":"21_CR30","doi-asserted-by":"publisher","unstructured":"Fan, W., He, K., Li, Q.: Graph algorithms: parallelization and scalability. Sci. China Inf. Sci. 64, 203101 (2020). https:\/\/doi.org\/10.1007\/s11432-020-2952-7","DOI":"10.1007\/s11432-020-2952-7"},{"key":"21_CR31","doi-asserted-by":"publisher","unstructured":"Yoon, M., Gervet, T., Hooi, B.: Autonomous Graph Mining Algorithm Search with Best Speed\/Accuracy Trade-off. 2020 ICDM, 2020. https:\/\/doi.org\/10.1109\/ICDM50108.2020.00084","DOI":"10.1109\/ICDM50108.2020.00084"},{"key":"21_CR32","doi-asserted-by":"publisher","unstructured":"Campinas, S., Debru, R., Tummarello, G.: Efficiency and Precision Trade-offs in Graph Summary Algorithms. IDEAS\u201913, pp. 38\u201347, 2013. https:\/\/doi.org\/10.1145\/2513591.2513654","DOI":"10.1145\/2513591.2513654"},{"key":"21_CR33","doi-asserted-by":"publisher","unstructured":"Gao, J., Li, X., Xu, E.: Efficient Knowledge Graph Accuracy Evaluation. Databases (cs.DB) 2019. https:\/\/doi.org\/10.48550\/arXiv.1907.09657","DOI":"10.48550\/arXiv.1907.09657"},{"key":"21_CR34","doi-asserted-by":"publisher","unstructured":"Singh, D., Garg, R.: NI-Louvain algorithm to detect overlapping communities with influence analysis, 2021.https:\/\/doi.org\/10.1016\/j.jksuci.2021.07.006","DOI":"10.1016\/j.jksuci.2021.07.006"}],"container-title":["Lecture Notes in Computer Science","Knowledge Graphs and Semantic Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13109-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T07:27:31Z","timestamp":1766388451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13109-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,23]]},"ISBN":["9783032131089","9783032131096"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13109-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,23]]},"assertion":[{"value":"23 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KGSWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Knowledge Graph and Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leipzig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"kgswc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kgsw.org\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}