{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T04:48:29Z","timestamp":1769143709022,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819557158","type":"print"},{"value":"9789819557165","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-981-95-5716-5_28","type":"book-chapter","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T13:07:25Z","timestamp":1769087245000},"page":"453-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Efficient Graph Similarity Search in\u00a0Cloud Environments"],"prefix":"10.1007","author":[{"given":"Yuzhan","family":"Gao","sequence":"first","affiliation":[]},{"given":"Gang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Mengxiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ningning","family":"Cui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,23]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Wang, H.: Managing and mining graph data. vol. 40. Springer(2010)","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"28_CR2","unstructured":"Yan, X., Han, J.: GSPAN: graph-based substructure pattern mining. In: IEEE International Conference on Data Mining, pp. 721\u2013724 (2002)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Liang, Y., Zhao, P.: Similarity search in graph databases: a multi-layered indexing approach. In: IEEE International Conference on Data Engineering, pp. 783\u2013794.(2017)","DOI":"10.1109\/ICDE.2017.129"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"79180","DOI":"10.1109\/ACCESS.2022.3194559","volume":"10","author":"J Kim","year":"2022","unstructured":"Kim, J.: Efficient Top-k graph similarity search with GED constraints. IEEE Access 10, 79180\u201379191 (2022)","journal-title":"IEEE Access"},{"issue":"6","key":"28_CR5","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00778-013-0306-1","volume":"22","author":"X Zhao","year":"2013","unstructured":"Zhao, X., Xiao, C., Lin, X., Wang, W., Ishikawa, Y.: Efficient processing of graph similarity queries with edit distance constraints. VLDB J. 22(6), 727\u2013752 (2013). https:\/\/doi.org\/10.1007\/s00778-013-0306-1","journal-title":"VLDB J."},{"issue":"7","key":"28_CR6","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., et al.: Comparing stars: on approximating graph edit distance. Proc. VLDB Endowment 2(1), 25\u201336 (2009)","journal-title":"Proc. VLDB Endowment"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Wang, X., Ding, X., Tung, A.K.H., et al.: An efficient graph indexing method. In: IEEE International Conference on Data Engineering, pp. 210\u2013221 (2012)","DOI":"10.1109\/ICDE.2012.28"},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TKDE.2010.28","volume":"24","author":"G Wang","year":"2010","unstructured":"Wang, G., Wang, B., Yang, X., et al.: Efficiently indexing large sparse graphs for similarity search. IEEE Trans. Knowl. Data Eng. 24(3), 440\u2013451 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Zheng, W., Zou, L., Lian, X., et al.: Graph similarity search with edit distance constraint in large graph databases. In: ACM International Conference on Information & Knowledge Management, pp. 1595\u20131600 (2013)","DOI":"10.1145\/2505515.2505723"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Kim, J.: Boosting graph similarity search through pre-computation. In: ACM International Conference on Management of Data, pp. 951\u2013963 (2021)","DOI":"10.1145\/3448016.3452780"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Ranu, S., Hoang, M., Singh, A.: Answering top-k representative queries on graph databases. In: ACM SIGMOD International Conference on Management of Data, pp. 1163\u20131174 (2014)","DOI":"10.1145\/2588555.2610524"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Zhao, X., Xiao, C., Lin, X., et al.: A partition-based approach to structure similarity search. VLDB Endowment 7(3), 169\u2013180 (2013)","DOI":"10.14778\/2732232.2732236"},{"issue":"8","key":"28_CR14","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/TKDE.2019.2906608","volume":"32","author":"Y Zhu","year":"2019","unstructured":"Zhu, Y., Qin, L., Yu, J.X., et al.: Answering Top-$$k$$ graph similarity queries in graph databases. IEEE Trans. Knowl. Data Eng. 32(8), 1459\u20131474 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient subgraph similarity search on large probabilistic graph databases. Proc. VLDB Endowment, 800\u2013811 (2012)","DOI":"10.14778\/2311906.2311908"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Luo, Y., Guan, J., Zhou, S.: Towards efficient subgraph search in cloud computing environments. In: Springer International Conference on Database Systems for Advanced Applications, pp. 2\u201313 (2011)","DOI":"10.1007\/978-3-642-20244-5_2"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Kao, B., Cheung, D.W.L., et al.: Secure query processing with data interoperability in a cloud database environment. In: ACM SIGMOD International Conference on Management of Data, pp. 1395\u20131406 (2014)","DOI":"10.1145\/2588555.2588572"},{"issue":"1","key":"28_CR18","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TDSC.2018.2880981","volume":"18","author":"C Liu","year":"2018","unstructured":"Liu, C., Zhu, L., He, X., et al.: Enabling privacy-preserving shortest distance queries on encrypted graph data. IEEE Trans. Dependable Secure Comput. 18(1), 192\u2013204 (2018)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"28_CR19","unstructured":"Patwary, M.A.K.: Dynamic graph partitioning in streaming manner. Ph.D. thesis, University of Tasmania (2020)"},{"key":"28_CR20","unstructured":"Kim, J., Choi, D.H., Li, C.: Inves: incremental partitioning-based verification for graph similarity search. In: International Conference on Extending Database Technology, pp. 229\u2013240 (2019)"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of IEEE International Conference on Data Mining, pp. 313\u2013320. IEEE (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"8","key":"28_CR22","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.14778\/3594512.3594514","volume":"16","author":"C Piao","year":"2023","unstructured":"Piao, C., Xu, T., Sun, X., et al.: Computing graph edit distance via neural graph matching. Proc. VLDB Endowment 16(8), 1817\u20131829 (2023)","journal-title":"Proc. VLDB Endowment"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"65254","DOI":"10.1109\/ACCESS.2021.3075457","volume":"9","author":"D Choi","year":"2021","unstructured":"Choi, D., Han, J., Lim, J., Han, J., Bok, K., Yoo, J.: Dynamic graph partitioning scheme for supporting load balancing in distributed graph environments. IEEE Access 9, 65254\u201365265 (2021)","journal-title":"IEEE Access"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Durbeck, L., Athanas, P.: Incremental streaming graph partitioning. In: IEEE High Performance Extreme Computing Conference, pp. 1\u20138 (2020)","DOI":"10.1109\/HPEC43674.2020.9286181"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Sun, S., Luo, Q.: Scaling up subgraph query processing with efficient subgraph matching. IEEE International Conference on Data Engineering, pp. 220\u2013231. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00028"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5716-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T13:07:32Z","timestamp":1769087252000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5716-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819557158","9789819557165"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5716-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"23 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"28 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2025.sau.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}