{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:08:44Z","timestamp":1743113324870,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031478420"},{"type":"electronic","value":"9783031478437"}],"license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"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-47843-7_1","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:27:25Z","timestamp":1699306045000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["kNN Join for\u00a0Dynamic High-Dimensional Data: A Parallel Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0600-8543","authenticated-orcid":false,"given":"Nimish","family":"Ukey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1772-6863","authenticated-orcid":false,"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenke","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binghao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runze","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-540-45227-0_50","volume-title":"Database and Expert Systems Applications","author":"C B\u00f6hm","year":"2003","unstructured":"B\u00f6hm, C., Krebs, F.: Supporting KDD applications by the k-nearest neighbor join. In: Ma\u0159\u00edk, V., Retschitzegger, W., \u0160t\u011bp\u00e1nkov\u00e1, O. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 504\u2013516. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45227-0_50"},{"issue":"6","key":"1_CR2","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm, C., Krebs, F.: The k-nearest neighbour join: turbo charging the KDD process. Knowl. Inf. Syst. 6(6), 728\u2013749 (2004)","journal-title":"Knowl. Inf. Syst."},{"key":"1_CR3","unstructured":"Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: a new approach to indexing high dimensional spaces. In: VLDB Conference (2000)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Chua, T.S., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.: NUS-WIDE: a real-world web image database from national university of Singapore. In: Proceedings of the ACM International Conference on Image and Video Retrieval, pp. 1\u20139 (2009)","DOI":"10.1145\/1646396.1646452"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., El Abbadi, A.: Approximate nearest neighbor searching in multimedia databases. In: Proceedings 17th International Conference on Data Engineering, pp. 503\u2013511. IEEE (2001)","DOI":"10.1109\/ICDE.2001.914864"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Giacinto, G.: A nearest-neighbor approach to relevance feedback in content based image retrieval. In: Proceedings of the 6th ACM International Conference on Image and Video Retrieval, pp. 456\u2013463 (2007)","DOI":"10.1145\/1282280.1282347"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Gowanlock, M.: KNN-joins using a hybrid approach: exploiting CPU\/GPU workload characteristics. In: Proceedings of the 12th Workshop on General Purpose Processing Using GPUs, pp. 33\u201342 (2019)","DOI":"10.1145\/3300053.3319417"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jpdc.2020.11.004","volume":"149","author":"M Gowanlock","year":"2021","unstructured":"Gowanlock, M.: Hybrid KNN-join: parallel nearest neighbor searches exploiting CPU and GPU architectural features. J. Parallel Distrib. Comput. 149, 119\u2013137 (2021)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1007\/s00779-019-01282-5","volume":"25","author":"Y Hu","year":"2021","unstructured":"Hu, Y., Yang, C., Zhan, P., Zhao, J., Li, Y., Li, X.: Efficient continuous KNN join processing for real-time recommendation. Pers. Ubiquit. Comput. 25, 1001\u20131011 (2021)","journal-title":"Pers. Ubiquit. Comput."},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.L., Yu, C., Zhang, R.: iDistance: an adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. (TODS) 30(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kouiroukidis, N., Evangelidis, G.: The effects of dimensionality curse in high dimensional KNN search. In: 2011 15th Panhellenic Conference on Informatics, pp. 41\u201345. IEEE (2011)","DOI":"10.1109\/PCI.2011.45"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Lu, W., Shen, Y., Chen, S., Ooi, B.C.: Efficient processing of k nearest neighbor joins using MapReduce. arXiv preprint arXiv:1207.0141 (2012)","DOI":"10.14778\/2336664.2336674"},{"key":"1_CR13","unstructured":"McSherry, F., Isard, M., Murray, D.G.: Scalability! But at what $$\\{$$COST$$\\}$$? In: 15th Workshop on Hot Topics in Operating Systems (HotOS XV) (2015)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Shahvarani, A., Jacobsen, H.A.: Distributed stream KNN join. In: Proceedings of the 2021 International Conference on Management of Data, pp. 1597\u20131609 (2021)","DOI":"10.1145\/3448016.3457269"},{"key":"1_CR15","unstructured":"Tanenbaum, A.S.: Distributed systems principles and paradigms (2007)"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"629","DOI":"10.3390\/s23020629","volume":"23","author":"N Ukey","year":"2023","unstructured":"Ukey, N., Yang, Z., Li, B., Zhang, G., Hu, Y., Zhang, W.: Survey on exact kNN queries over high-dimensional data space. Sensors 23(2), 629 (2023)","journal-title":"Sensors"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-031-15512-3_5","volume-title":"Databases Theory and Applications","author":"N Ukey","year":"2022","unstructured":"Ukey, N., Yang, Z., Zhang, G., Liu, B., Li, B., Zhang, W.: Efficient kNN join over dynamic high-dimensional data. In: Hua, W., Wang, H., Li, L. (eds.) ADC 2022. LNCS, vol. 13459, pp. 63\u201375. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15512-3_5"},{"key":"1_CR18","unstructured":"Wang, J., Lin, L., Huang, T., Wang, J., He, Z.: Efficient k-nearest neighbor join algorithms for high dimensional sparse data. arXiv preprint arXiv:1011.2807 (2010)"},{"key":"1_CR19","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, vol. 98, pp. 194\u2013205 (1998)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Xia, C., Lu, H., Ooi, B.C., Hu, J.: GORDER: an efficient method for KNN join processing. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, vol. 30, pp. 756\u2013767 (2004)","DOI":"10.1016\/B978-012088469-8\/50067-X"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Yang, C., Yu, X., Liu, Y.: Continuous KNN join processing for real-time recommendation. In: 2014 IEEE International Conference on Data Mining, pp. 640\u2013649. IEEE (2014)","DOI":"10.1109\/ICDM.2014.20"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Yao, B., Li, F., Kumar, P.: K nearest neighbor queries and kNN-joins in large relational databases (almost) for free. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 4\u201315. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447837"},{"issue":"4","key":"1_CR23","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.infsof.2006.05.006","volume":"49","author":"C Yu","year":"2007","unstructured":"Yu, C., Cui, B., Wang, S., Su, J.: Efficient index-based KNN join processing for high-dimensional data. Inf. Softw. Technol. 49(4), 332\u2013344 (2007)","journal-title":"Inf. Softw. Technol."},{"key":"1_CR24","unstructured":"Yu, C., Ooi, B.C., Tan, K.L., Jagadish, H.: Indexing the distance: an efficient method to KNN processing. In: VLDB, vol. 1, pp. 421\u2013430 (2001)"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10707-009-0076-5","volume":"14","author":"C Yu","year":"2010","unstructured":"Yu, C., Zhang, R., Huang, Y., Xiong, H.: High-dimensional kNN joins with incremental updates. GeoInformatica 14(1), 55\u201382 (2010)","journal-title":"GeoInformatica"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, C., Li, F., Jestes, J.: Efficient parallel kNN joins for large data in MapReduce. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 38\u201349 (2012)","DOI":"10.1145\/2247596.2247602"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47843-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T13:50:31Z","timestamp":1730469031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47843-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"ISBN":["9783031478420","9783031478437"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47843-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"7 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}