{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T23:31:54Z","timestamp":1769643114551,"version":"3.49.0"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2017-83964-R"],"award-info":[{"award-number":["TIN2017-83964-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Internet of Things"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1016\/j.iot.2021.100428","type":"journal-article","created":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T03:58:01Z","timestamp":1624679881000},"page":"100428","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["GPU-aided edge computing for processing the k nearest-neighbor query on SSD-resident data"],"prefix":"10.1016","volume":"15","author":[{"given":"Polychronis","family":"Velentzas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Corral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.iot.2021.100428_bib0001","series-title":"Multicore and GPU Programming: An Integrated Approach","author":"Barlas","year":"2014"},{"issue":"5","key":"10.1016\/j.iot.2021.100428_bib0002","first-page":"605","article-title":"Application of k-nearest neighbor (KNN) approach for predicting economic events theoretical background","volume":"3","author":"Imandoust","year":"2013","journal-title":"Int. J. Eng. Res.Appl."},{"key":"10.1016\/j.iot.2021.100428_bib0003","series-title":"MEDES Conference","first-page":"2","article-title":"A partitioning GPU-based algorithm for processing the k nearest-neighbor query","author":"Velentzas","year":"2020"},{"key":"10.1016\/j.iot.2021.100428_bib0004","unstructured":"NVIDIA, Nvidia CUDA runtime API, 2020, https:\/\/docs.nvidia.com\/cuda\/cuda-runtime-api\/index.html."},{"key":"10.1016\/j.iot.2021.100428_bib0005","series-title":"PCI Conference","first-page":"372","article-title":"An improved GPU-based algorithmfor processing the k nearest neighbor query","author":"Velentzas","year":"2020"},{"key":"10.1016\/j.iot.2021.100428_bib0006","series-title":"MEDI Conference","first-page":"264","article-title":"GPU-based algorithms for processing the k nearest-neighbor query on disk-resident data","author":"Velentzas","year":"2021"},{"key":"10.1016\/j.iot.2021.100428_bib0007","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.sysarc.2019.01.011","article-title":"A survey on optimized implementation of deep learning models on the NVIDIA Jetson platform","volume":"97","author":"Mittal","year":"2019","journal-title":"J. Syst. Archit."},{"issue":"6","key":"10.1016\/j.iot.2021.100428_bib0008","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1007\/s10766-017-0502-5","article-title":"Survey of GPU based sorting algorithms","volume":"46","author":"Singh","year":"2018","journal-title":"Int. J. Parallel Program."},{"key":"10.1016\/j.iot.2021.100428_bib0009","series-title":"CVPR Workshops","first-page":"1","article-title":"Fast k nearest neighbor search using GPU","author":"Garcia","year":"2008"},{"key":"10.1016\/j.iot.2021.100428_bib0010","series-title":"SCSCT Conference","first-page":"151","article-title":"A practical GPU based KNN algorithm","author":"Kuang","year":"2009"},{"key":"10.1016\/j.iot.2021.100428_bib0011","series-title":"YC-ICT Conference","first-page":"415","article-title":"CUKNN: a parallel implementation of k-nearest neighbor on CUDA-enabled GPU","author":"Liang","year":"2009"},{"key":"10.1016\/j.iot.2021.100428_bib0012","series-title":"ICIP Conference","first-page":"3757","article-title":"K-nearest neighbor search: fast GPU-based implementations and application to high-dimensional feature matching","author":"Garcia","year":"2010"},{"key":"10.1016\/j.iot.2021.100428_bib0013","series-title":"Euro-Par Conference","first-page":"380","article-title":"kNN query processing in metric spaces using GPUs","author":"Barrientos","year":"2011"},{"key":"10.1016\/j.iot.2021.100428_bib0014","series-title":"HPEC Conference","first-page":"1","article-title":"Parallel search of k-nearest neighbors with synchronous operations","author":"Sismanis","year":"2012"},{"issue":"8","key":"10.1016\/j.iot.2021.100428_bib0015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0044000","article-title":"GPU-FS-kNN: a software tool for fast and scalable kNN computation using GPUs","volume":"7","author":"Arefin","year":"2012","journal-title":"PLoS ONE"},{"issue":"1","key":"10.1016\/j.iot.2021.100428_bib0016","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/cpe.1718","article-title":"Multi-GPU algorithm for k-nearest neighbor problem","volume":"24","author":"Kato","year":"2012","journal-title":"Concurrency Comput. Pract.Exp."},{"issue":"5","key":"10.1016\/j.iot.2021.100428_bib0017","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0092409","article-title":"Fast k-NNG construction with GPU-based quick multi-select","volume":"9","author":"Komarov","year":"2014","journal-title":"PLoS ONE"},{"key":"10.1016\/j.iot.2021.100428_bib0018","series-title":"SISAP Conference","first-page":"259","article-title":"Brute-force k-nearest neighbors search on the GPU","author":"Li","year":"2015"},{"key":"10.1016\/j.iot.2021.100428_bib0019","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.ins.2016.08.089","article-title":"GPU-SME-kNN: scalable and memory efficient kNN and lazy learning using GPUs","volume":"373","author":"Guti\u00e9rrez","year":"2016","journal-title":"Inf. Sci."},{"issue":"10","key":"10.1016\/j.iot.2021.100428_bib0020","doi-asserted-by":"crossref","first-page":"4611","DOI":"10.1007\/s11227-017-2110-y","article-title":"GPU-based exhaustive algorithms processing kNN queries","volume":"73","author":"Barrientos","year":"2017","journal-title":"J. Supercomput."},{"key":"10.1016\/j.iot.2021.100428_bib0021","series-title":"SCCC Conference","first-page":"1","article-title":"An exhaustive algorithm based on GPU to process a kNN query","author":"Riquelme","year":"2020"},{"key":"10.1016\/j.iot.2021.100428_bib0022","unstructured":"V. Garcia,;. Debreuve, M. Barlaud, Fast k nearest neighbor search using GPU, 2018, http:\/\/vincentfpgarcia.github.io\/kNN-CUDA\/."},{"key":"10.1016\/j.iot.2021.100428_bib0023","series-title":"GISTAM Conference","first-page":"310","article-title":"In-memory k nearest neighbor GPU-based query processing","author":"Velentzas","year":"2020"},{"issue":"9","key":"10.1016\/j.iot.2021.100428_bib0024","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Commun. ACM"},{"issue":"5","key":"10.1016\/j.iot.2021.100428_bib0025","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1145\/1409060.1409079","article-title":"Real-time KD-tree construction on graphics hardware","volume":"27","author":"Zhou","year":"2008","journal-title":"ACM Trans. Graph."},{"key":"10.1016\/j.iot.2021.100428_bib0026","series-title":"ICML Conference","first-page":"172","article-title":"Buffer k-d trees: processing massive nearest neighbor queries on GPUs","author":"Gieseke","year":"2014"},{"key":"10.1016\/j.iot.2021.100428_bib0027","series-title":"STOC Conference","first-page":"604","article-title":"Approximate nearest neighbors: towards removing the curse of dimensionality","author":"Indyk","year":"1998"},{"key":"10.1016\/j.iot.2021.100428_bib0028","series-title":"IROS Conference","first-page":"2243","article-title":"Efficient nearest-neighbor computation for GPU-based motion planning","author":"Pan","year":"2010"},{"key":"10.1016\/j.iot.2021.100428_bib0029","series-title":"ACM-GIS Conference","first-page":"211","article-title":"Fast GPU-based locality sensitive hashing for k-nearest neighbor computation","author":"Pan","year":"2011"},{"key":"10.1016\/j.iot.2021.100428_bib0030","article-title":"Efficient large-scale approximate nearest neighbor search on the GPU","author":"Wieschollek","year":"2017","journal-title":"CoRR"},{"key":"10.1016\/j.iot.2021.100428_bib0031","series-title":"SIGMOD Conference","first-page":"47","article-title":"R-trees: a dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/j.iot.2021.100428_bib0032","series-title":"BigSpatial@SIGSPATIAL Workshop","first-page":"23","article-title":"Parallel spatial query processing on GPUs using r-trees","author":"You","year":"2013"},{"key":"10.1016\/j.iot.2021.100428_bib0033","series-title":"ICPP Conference","first-page":"113","article-title":"Parallel tree traversal for nearest neighbor query on the GPU","author":"Nam","year":"2016"},{"key":"10.1016\/j.iot.2021.100428_bib0034","series-title":"ICDE Conference","first-page":"516","article-title":"Similarity indexing with the SS-tree","author":"White","year":"1996"},{"issue":"3","key":"10.1016\/j.iot.2021.100428_bib0035","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10766-011-0184-3","article-title":"Nearest neighbor searches on the GPU - a massively parallel approach for dynamic point clouds","volume":"40","author":"Leite","year":"2012","journal-title":"Int. J. Parallel Program."},{"issue":"1","key":"10.1016\/j.iot.2021.100428_bib0036","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1186\/s40064-016-3035-2","article-title":"Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search","volume":"5","author":"Mei","year":"2016","journal-title":"Springerplus"},{"key":"10.1016\/j.iot.2021.100428_bib0037","first-page":"1","article-title":"Effective spatial data partitioning for scalable query processing","author":"Aji","year":"2015","journal-title":"CoRR"},{"issue":"5","key":"10.1016\/j.iot.2021.100428_bib0038","doi-asserted-by":"crossref","first-page":"1537","DOI":"10.1109\/TPDS.2015.2442980","article-title":"A survey of software techniques for using non-volatile memories for storage and main memory systems","volume":"27","author":"Mittal","year":"2016","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"10.1016\/j.iot.2021.100428_bib0039","doi-asserted-by":"crossref","first-page":"286","DOI":"10.14778\/2095686.2095688","article-title":"B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives","volume":"5","author":"Roh","year":"2011","journal-title":"Proc. VLDB Endow."},{"issue":"21","key":"10.1016\/j.iot.2021.100428_bib0040","doi-asserted-by":"crossref","first-page":"6335","DOI":"10.3390\/s20216335","article-title":"Evaluation of clustering algorithms on GPU-based edge computing platforms","volume":"20","author":"Cecilia","year":"2020","journal-title":"Sensors"},{"key":"10.1016\/j.iot.2021.100428_bib0041","doi-asserted-by":"crossref","first-page":"208337","DOI":"10.1109\/ACCESS.2020.3038714","article-title":"A taste of scientific computing on the GPU-accelerated edge device","volume":"8","author":"Kang","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.iot.2021.100428_bib0042","series-title":"ICOIN Conference","first-page":"756","article-title":"Implementing scientific simulations on GPU-accelerated edge devices","author":"Lim","year":"2020"},{"key":"10.1016\/j.iot.2021.100428_bib0043","series-title":"BigComp Conference","first-page":"117","article-title":"Benchmarking GPU-accelerated edge devices","author":"Jo","year":"2020"},{"key":"10.1016\/j.iot.2021.100428_bib0044","article-title":"Computational Geometry - An Introduction","author":"Preparata","year":"1985"},{"issue":"5","key":"10.1016\/j.iot.2021.100428_bib0045","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(88)90150-0","article-title":"Plane-sweep solves the closest pair problem elegantly","volume":"26","author":"Hinrichs","year":"1988","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.iot.2021.100428_bib0046","series-title":"SIGSPATIAL Conference","first-page":"465","article-title":"SpiderWeb: a spatial data generator on the web","author":"Katiyar","year":"2020"},{"key":"10.1016\/j.iot.2021.100428_sbref0047","series-title":"1st ACM SIGSPATIAL International Workshop on Spatial Gems (SpatialGems)","article-title":"Spatial data generators","author":"Vu","year":"2019"}],"container-title":["Internet of Things"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S254266052100072X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S254266052100072X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T14:48:28Z","timestamp":1762872508000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S254266052100072X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":47,"alternative-id":["S254266052100072X"],"URL":"https:\/\/doi.org\/10.1016\/j.iot.2021.100428","relation":{},"ISSN":["2542-6605"],"issn-type":[{"value":"2542-6605","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"GPU-aided edge computing for processing the k nearest-neighbor query on SSD-resident data","name":"articletitle","label":"Article Title"},{"value":"Internet of Things","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.iot.2021.100428","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"100428"}}