{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:06:24Z","timestamp":1743044784932,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031155116"},{"type":"electronic","value":"9783031155123"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15512-3_5","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T04:02:55Z","timestamp":1661486575000},"page":"63-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient kNN Join over\u00a0Dynamic High-Dimensional Data"],"prefix":"10.1007","author":[{"given":"Nimish","family":"Ukey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangjian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boge","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binghao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,27]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Database-friendly random projections. In: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 274\u2013281 (2001)","DOI":"10.1145\/375551.375608"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegal, H.P.: The pyramid-technique: towards breaking the curse of dimensionality. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"issue":"6","key":"5_CR3","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":"5_CR4","unstructured":"Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: a new approach to indexing high dimensional spaces. In: VLDB Conference (2000)"},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00778-012-0265-y","volume":"21","author":"MA Cheema","year":"2012","unstructured":"Cheema, M.A., Zhang, W., Lin, X., Zhang, Y.: Efficiently processing snapshot and continuous reverse k nearest neighbors queries. VLDB J. 21(5), 703\u2013728 (2012)","journal-title":"VLDB J."},{"key":"5_CR6","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":"5_CR7","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: VLDB, vol. 97, pp. 426\u2013435 (1997)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Cui, B., Ooi, B.C., Su, J., Tan, K.L.: Contorting high dimensional data for efficient main memory KNN processing. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management Of Data, pp. 479\u2013490 (2003)","DOI":"10.1145\/872757.872815"},{"key":"5_CR9","unstructured":"Gionis, A., et al.: Similarity search in high dimensions via hashing. In: VLDB, vol. 99, pp. 518\u2013529 (1999)"},{"issue":"6","key":"5_CR10","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. Personal Ubiquit. Comput. 25(6), 1001\u20131011 (2021)","journal-title":"Personal Ubiquit. Comput."},{"issue":"2","key":"5_CR11","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":"5_CR12","doi-asserted-by":"crossref","unstructured":"Ooi, B.C., Tan, K.L., Yu, C., Bressan, S.: Indexing the edges-a simple and yet efficient approach to high-dimensional indexing. In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 166\u2013174 (2000)","DOI":"10.1145\/335168.335219"},{"key":"5_CR13","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":"5_CR14","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":"5_CR15","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"},{"issue":"4","key":"5_CR16","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."},{"issue":"1","key":"5_CR17","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"}],"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-15512-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T04:03:13Z","timestamp":1661486593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15512-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031155116","9783031155123"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15512-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 August 2022","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":"Sidney, NSW","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc2022.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","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":"9","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":"8","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":"25% - 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":"3","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)"}}]}}