{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:51:21Z","timestamp":1742971881861,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683084"},{"type":"electronic","value":"9783031683091"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68309-1_7","type":"book-chapter","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T14:02:25Z","timestamp":1723903345000},"page":"81-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Indexing Method for\u00a0Dynamic Graph kNN"],"prefix":"10.1007","author":[{"given":"Shohei","family":"Matsugu","sequence":"first","affiliation":[]},{"given":"Suomi","family":"Kobayashi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8530-2651","authenticated-orcid":false,"given":"Hiroaki","family":"Shiokawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,18]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-55699-4_26","volume-title":"Database Systems for Advanced Applications","author":"T Abeywickrama","year":"2017","unstructured":"Abeywickrama, T., Cheema, M.A.: Efficient landmark-based candidate generation for kNN queries on road networks. In: Candan, S., Chen, L., Pedersen, T.B., Chang, L., Hua, W. (eds.) DASFAA 2017. LNCS, vol. 10178, pp. 425\u2013440. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55699-4_26"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alom, Z., Carminati, B., Ferrari, E.: Detecting spam accounts on Twitter. In: 2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 1191\u20131198. IEEE (2018)","DOI":"10.1109\/ASONAM.2018.8508495"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Barthelemy, M.: Morphogenesis of Spatial Networks. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-20565-6","DOI":"10.1007\/978-3-319-20565-6"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D.: Ultrafast shortest-path queries via transit nodes. In: The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, 13\u201314 November 2006, vol.\u00a074, pp. 175\u2013192. DIMACS\/AMS (2006)","DOI":"10.1090\/dimacs\/074\/07"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Benson, A., Kleinberg, J.: Link prediction in networks with core-fringe data. In: The World Wide Web Conference, pp. 94\u2013104 (2019)","DOI":"10.1145\/3308558.3313626"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Z., Li, P., Xiao, J., Nie, L., Liu, Y.: An order dispatch system based on reinforcement learning for ride sharing services. In: 2020 IEEE 22nd International Conference on High Performance Computing and Communications, pp. 758\u2013763 (2020)","DOI":"10.1109\/HPCC-SmartCity-DSS50907.2020.00099"},{"key":"7_CR7","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: SODA, vol.\u00a05, pp. 156\u2013165 (2005)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Analysis of multilevel graph partitioning. In: Proceedings Supercomputing \u201995, San Diego, CA, USA, 4\u20138 December 1995, p.\u00a029. ACM (1995)","DOI":"10.1145\/224170.224229"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s13278-022-00904-w","volume":"12","author":"S Kobayashi","year":"2022","unstructured":"Kobayashi, S., Matsugu, S., Shiokawa, H.: Indexing complex networks for fast attributed kNN queries. Soc. Netw. Anal. Min. 12(1), 82 (2022)","journal-title":"Soc. Netw. Anal. Min."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Kobayashi, S., Matsugu, S., Shiokawa, H.: Fast indexing algorithm for efficient kNN queries on complex networks. In: Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 343\u2013347. ASONAM \u201921, Association for Computing Machinery, New York, NY, USA (2022)","DOI":"10.1145\/3487351.3489442"},{"key":"7_CR11","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection (2014). http:\/\/snap.stanford.edu\/data"},{"issue":"5","key":"7_CR12","doi-asserted-by":"publisher","first-page":"509","DOI":"10.14778\/2735479.2735484","volume":"8","author":"RH Li","year":"2015","unstructured":"Li, R.H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. Proc. VLDB Endow. 8(5), 509\u2013520 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Li, Z., Chen, L., Wang, Y.: G*-tree: an efficient spatial index on road networks. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 268\u2013279. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00032"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Matsugu, S., Fujiwara, Y., Shiokawa, H.: Uncovering the largest community in social networks at scale. In: Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI2023), pp. 2251\u20132260 (2023)","DOI":"10.24963\/ijcai.2023\/250"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Matsugu, S., Shiokawa, H., Kitagawa, H.: Fast and accurate community search algorithm for attributed graphs. In: Hartmann, S., K\u00fcng, J., Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) Database and Expert Systems Applications. DEXA 2020. LNCS, vol. 12391, pp. 233\u2013249. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59003-1_16","DOI":"10.1007\/978-3-030-59003-1_16"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s41019-017-0034-4","volume":"2","author":"M Onizuka","year":"2017","unstructured":"Onizuka, M., Fujimori, T., Shiokawa, H.: Graph partitioning for distributed graph processing. Data Sci. Eng. 2(1), 94\u2013105 (2017)","journal-title":"Data Sci. Eng."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 43\u201354 (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Shiokawa, H.: Scalable affinity propagation for massive datasets. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence, vol. 35, no. 11, pp. 9639\u20139646 (2021)","DOI":"10.1609\/aaai.v35i11.17160"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Shiokawa, H., Amagasa, T., Kitagawa, H.: Scaling fine-grained modularity clustering for massive graphs. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 4597\u20134604. IJCAI\u201919 (2019)","DOI":"10.24963\/ijcai.2019\/639"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Shiokawa, H., Fujiwara, Y., Onizuka, M.: Scan++: efficient algorithm for finding clusters, hubs and outliers on large-scale graphs. Proc. VLDB Endow. 8(11), 1178\u20131189 (2015)","DOI":"10.14778\/2809974.2809980"},{"issue":"8","key":"7_CR21","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1109\/TKDE.2015.2399306","volume":"27","author":"R Zhong","year":"2015","unstructured":"Zhong, R., Li, G., Tan, K.L., Zhou, L., Gong, Z.: G-Tree: an efficient and scalable index for spatial search on road networks. IEEE Trans. Knowl. Data Eng. 27(8), 2175\u20132189 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68309-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T20:16:16Z","timestamp":1732652176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68309-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683084","9783031683091"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68309-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}