{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T03:28:32Z","timestamp":1771558112539,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030784270","type":"print"},{"value":"9783030784287","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-78428-7_21","type":"book-chapter","created":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:03:11Z","timestamp":1623625391000},"page":"264-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["GPU-Based Algorithms for Processing the k Nearest-Neighbor Query on\u00a0Disk-Resident Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8992-9796","authenticated-orcid":false,"given":"Polychronis","family":"Velentzas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2256-5523","authenticated-orcid":false,"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0069-4642","authenticated-orcid":false,"given":"Antonio","family":"Corral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,14]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Barlas, G.: Multicore and GPU Programming: An Integrated Approach. 1 edn, Morgan Kaufmann, Amsterdam (2014)","DOI":"10.1016\/B978-0-12-417137-4.00001-0"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Garcia, V., Debreuve, E., Nielsen, F., Barlaud, M.: K-nearest neighbor search: Fast gpu-based implementations and application to high-dimensional feature matching. In: ICIP Conference, pp. 3757\u20133760 (2010)","DOI":"10.1109\/ICIP.2010.5654017"},{"key":"21_CR3","unstructured":"Gieseke, F., Heinermann, J., Oancea, C.E., Igel, C.: Buffer k-d trees: Processing massive nearest neighbor queries on GPUs. In: ICML Conference, pp. 172\u2013180 (2014)"},{"issue":"5","key":"21_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0020-0190(88)90150-0","volume":"26","author":"KH Hinrichs","year":"1988","unstructured":"Hinrichs, K.H., Nievergelt, J., Schorn, P.: Plane-sweep solves the closest pair problem elegantly. Inf. Process. Lett. 26(5), 255\u2013261 (1988)","journal-title":"Inf. Process. Lett."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Katiyar, P., Vu, T., Eldawy, A., Migliorini, S., Belussi, A.: Spiderweb: a spatial data generator on the web. In: SIGSPATIAL Conference, pp. 465\u2013468 (2020)","DOI":"10.1145\/3397536.3422351"},{"issue":"5","key":"21_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0092409","volume":"9","author":"I Komarov","year":"2014","unstructured":"Komarov, I., Dashti, A., D\u2019Souza, R.M.: Fast k-NNG construction with GPU-based quick multi-select. PloS ONE 9(5), 1\u20139 (2014)","journal-title":"PloS ONE"},{"key":"21_CR7","unstructured":"Kuang, Q., Zhao, L.: A practical GPU based KNN algorithm. In: SCSCT Conference, pp. 151\u2013155 (2009)"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10766-011-0184-3","volume":"40","author":"PJS Leite","year":"2012","unstructured":"Leite, P.J.S., Teixeira, J.M.X.N., de Farias, T.S.M.C., Reis, B., Teichrieb, V., Kelner, J.: Nearest neighbor searches on the GPU - a massively parallel approach for dynamic point clouds. Int. J. Parallel Program. 40(3), 313\u2013330 (2012)","journal-title":"Int. J. Parallel Program."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Li, S., Amenta, N.: Brute-force k-nearest neighbors search on the GPU. In: SISAP Conference, pp. 259\u2013270 (2015)","DOI":"10.1007\/978-3-319-25087-8_25"},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1109\/TPDS.2015.2442980","volume":"27","author":"S Mittal","year":"2016","unstructured":"Mittal, S., Vetter, J.S.: A survey of software techniques for using non-volatile memories for storage and main memory systems. IEEE Trans. Parallel Distributed Syst. 27(5), 1537\u20131550 (2016)","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Nam, M., Kim, J., Nam, B.: Parallel tree traversal for nearest neighbor query on the GPU. In: ICPP Conference, pp. 113\u2013122 (2016)","DOI":"10.1109\/ICPP.2016.20"},{"key":"21_CR12","unstructured":"Pan, J., Lauterbach, C., Manocha, D.: Efficient nearest-neighbor computation for GPU-based motion planning. In: IROS Conference, pp. 2243\u20132248 (2010)"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Texts and Monographs in Computer Science, Springer, New York (1985) https:\/\/doi.org\/10.1007\/978-1-4612-1098-6","DOI":"10.1007\/978-1-4612-1098-6"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"286","DOI":"10.14778\/2095686.2095688","volume":"5","author":"H Roh","year":"2011","unstructured":"Roh, H., Park, S., Kim, S., Shin, M., Lee, S.: B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives. Proc. VLDB Endow. 5(4), 286\u2013297 (2011)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1007\/s10586-019-03013-0","volume":"23","author":"G Roumelis","year":"2020","unstructured":"Roumelis, G., Velentzas, P., Vassilakopoulos, M., Corral, A., Fevgas, A., Manolopoulos, Y.: Parallel processing of spatial batch-queries using xbr$${}^{\\text{+ }}$$-trees in solid-state drives. Clust. Comput. 23(3), 1555\u20131575 (2020)","journal-title":"Clust. Comput."},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Sismanis, N., Pitsianis, N., Sun, X.: Parallel search of k-nearest neighbors with synchronous operations. In: HPEC Conference, pp. 1\u20136 (2012)","DOI":"10.1109\/HPEC.2012.6408667"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Velentzas, P., Vassilakopoulos, M., Corral, A.: In-memory k nearest neighbor GPU-based query processing. In: GISTAM Conference, pp. 310\u2013317 (2020)","DOI":"10.5220\/0009781903100317"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Velentzas, P., Vassilakopoulos, M., Corral, A.: A partitioning gpu-based algorithm for processing the k nearest-neighbor query. In: MEDES Conference. pp. 2\u20139 (2020)","DOI":"10.1145\/3415958.3433071"},{"key":"21_CR19","unstructured":"Vu, T., Migliorini, S., Eldawy, A., Belussi, A.: Spatial data generators. In: SpatialGems - SIGSPATIAL International Workshop on Spatial Gems, pp. 1\u20137 (2019)"}],"container-title":["Lecture Notes in Computer Science","Model and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78428-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:20:21Z","timestamp":1623626421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78428-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030784270","9783030784287"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78428-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MEDI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Model and Data Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tallinn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"medi2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.ttu.ee\/events\/medi2021\/","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":"47","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":"16","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":"34% - 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","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)"}},{"value":"Due to the Corona pandemic the event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}