{"id":"https://openalex.org/W2111034147","doi":null,"title":"Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs","display_name":"Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2111034147","mag":"2111034147"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.664.2025","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.664.2025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jmlr.org/proceedings/papers/v32/gieseke14.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023532714","display_name":"Fabian Cristian Gieseke","orcid":"https://orcid.org/0000-0001-7093-5803","observed_orcids":["https://orcid.org/0000-0001-7093-5803"]},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Fabian Gieseke","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-7093-5803","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080187001","display_name":"Justin Heinermann","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Justin Heinermann","raw_affiliation_strings":["Department of Computing Science, University of Oldenburg, Uhlhornsweg 84, 26111 Oldenburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Oldenburg, Uhlhornsweg 84, 26111 Oldenburg, Germany","institution_ids":["https://openalex.org/I129877168"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080735312","display_name":"Cosmin E. Oancea","orcid":"https://orcid.org/0000-0001-5421-6876","observed_orcids":["https://orcid.org/0000-0001-5421-6876"]},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Cosmin E. Oancea","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-5421-6876","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042628612","display_name":"Christian Igel","orcid":"https://orcid.org/0000-0003-2868-0856","observed_orcids":["https://orcid.org/0000-0003-2868-0856"]},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Christian Igel","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-2868-0856","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":14.4538,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.98947072,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.5327000021934509,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.5327000021934509,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.2134999930858612,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.06449999660253525,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.9599999785423279},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"nearest neighbor search","score":0.996999979019165},{"id":"https://openalex.org/keywords/gpu-acceleration","display_name":"GPU acceleration","score":0.7649999856948853},{"id":"https://openalex.org/keywords/big-data-processing","display_name":"big data processing","score":0.5270000100135803},{"id":"https://openalex.org/keywords/many-core-computing","display_name":"many-core computing","score":0.6399999856948853},{"id":"https://openalex.org/keywords/hierarchical-subdivision","display_name":"hierarchical subdivision","score":0.5580000281333923},{"id":"https://openalex.org/keywords/astronomical-data","display_name":"astronomical data","score":0.5789999961853027},{"id":"https://openalex.org/keywords/memory-access-optimization","display_name":"memory access optimization","score":0.6660000085830688}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7562981843948364},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.6825580596923828},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6408358216285706},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.638904333114624},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5604323744773865},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5272200107574463},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46272292733192444},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.44611456990242004},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.431820273399353},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.407787024974823},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3692404627799988},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32803502678871155},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.24515947699546814},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.155079185962677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1486465036869049},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13830244541168213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13638436794281006},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.08708938956260681},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.664.2025","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.664.2025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jmlr.org/proceedings/papers/v32/gieseke14.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.700.5410","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.700.5410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.diku.dk/%7Ezgh600/Publications/BufferKDtree.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/3c714218-0cab-4cf8-9d15-0e6fd46f545b","doi":null,"is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/3c714218-0cab-4cf8-9d15-0e6fd46f545b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gieseke , F C , Heinermann , J , Oancea , C E & Igel , C 2014 , Buffer k-d trees : processing massive nearest neighbor queries on GPUs . in Proceedings of the 31 st International Conference on Machine Learning, Beijing, China, 2014 . JMLR: Workshop and Conference Proceedings , vol. 32 , International Conference on Machine Learning 2014 , Beijing , China , 21/06/2014 . < http://jmlr.org/proceedings/papers/v32/gieseke14.pdf >","raw_type":"contributionToPeriodical"},{"id":"mag:2111034147","doi":null,"is_oa":false,"landing_page_url":"http://proceedings.mlr.press/v32/gieseke14.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419644","display_name":"International Conference on Machine Learning","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Machine Learning","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W100945772","https://openalex.org/W1480376833","https://openalex.org/W1811859202","https://openalex.org/W1848593906","https://openalex.org/W1906217704","https://openalex.org/W1975627161","https://openalex.org/W2000931227","https://openalex.org/W2001100395","https://openalex.org/W2020572638","https://openalex.org/W2024668293","https://openalex.org/W2028960610","https://openalex.org/W2038142281","https://openalex.org/W2038276547","https://openalex.org/W2069730382","https://openalex.org/W2080135560","https://openalex.org/W2081198904","https://openalex.org/W2105156747","https://openalex.org/W2110764701","https://openalex.org/W2119114072","https://openalex.org/W2121756870","https://openalex.org/W2130026741","https://openalex.org/W2133296809","https://openalex.org/W2147717514","https://openalex.org/W2151642217","https://openalex.org/W2153226019","https://openalex.org/W2159714423","https://openalex.org/W2165558283","https://openalex.org/W2185675025","https://openalex.org/W2225787779","https://openalex.org/W2397770138","https://openalex.org/W2539190955","https://openalex.org/W2539468248","https://openalex.org/W3151172278"],"related_works":["https://openalex.org/W2571435659","https://openalex.org/W2963180703","https://openalex.org/W2907861810","https://openalex.org/W2156711662","https://openalex.org/W4399282318","https://openalex.org/W2261553819","https://openalex.org/W2889593075","https://openalex.org/W7099455442","https://openalex.org/W3135737983","https://openalex.org/W3135394869"],"abstract_inverted_index":{"We":[0,95],"present":[1],"a":[2,22,30,47],"new":[3],"approach":[4],"for":[5,13],"combining":[6],"k-d":[7,52,58,83],"trees":[8,84],"and":[9,37,85],"graphics":[10],"processing":[11],"units":[12],"near-est":[14],"neighbor":[15,109],"search.":[16,67],"It":[17],"is":[18],"well":[19],"known":[20],"that":[21,71],"di-rect":[23],"combination":[24],"of":[25,49,76,99,106],"these":[26,43],"tools":[27],"leads":[28],"to":[29,34,64,112],"non-satisfying":[31],"performance":[32],"due":[33],"conditional":[35],"com-putations":[36],"suboptimal":[38],"memory":[39],"accesses.":[40],"To":[41],"alleviate":[42],"problems,":[44],"we":[45,72],"propose":[46],"variant":[48],"the":[50,66,78,86,97],"classical":[51],"tree":[53],"data":[54],"structure,":[55],"called":[56],"buffer":[57],"tree,":[59],"which":[60],"can":[61,73],"be":[62,113],"used":[63],"reorganize":[65],"Our":[68],"experiments":[69],"show":[70],"take":[74],"advantage":[75],"both":[77],"hierarchical":[79],"subdivi-sion":[80],"induced":[81],"by":[82,91],"huge":[87],"computa-tional":[88],"resources":[89],"provided":[90],"today\u2019s":[92],"many-core":[93],"devices.":[94],"demonstrate":[96],"potential":[98],"our":[100],"ap-proach":[101],"in":[102],"astronomy,":[103],"where":[104],"hundreds":[105],"million":[107],"nearest":[108],"queries":[110],"have":[111],"processed.":[114],"1.":[115]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":2}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}