{"id":"https://openalex.org/W2155773919","doi":"https://doi.org/10.1109/tkde.2003.1245286","title":"An efficient technique for nearest-neighbor query processing on the spy-tec","display_name":"An efficient technique for nearest-neighbor query processing on the spy-tec","publication_year":2003,"publication_date":"2003-11-01","ids":{"openalex":"https://openalex.org/W2155773919","doi":"https://doi.org/10.1109/tkde.2003.1245286","mag":"2155773919"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2003.1245286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2003.1245286","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5100609746","display_name":"Dong-Ho Lee","orcid":"https://orcid.org/0000-0002-7679-5167"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Dong-Ho Lee","raw_affiliation_strings":["OOPSLA Laboratory, Department of Computer Engineering, Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"OOPSLA Laboratory, Department of Computer Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102980943","display_name":"Hyoung-Joo Kim","orcid":"https://orcid.org/0000-0003-2574-720X"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyoung-Joo Kim","raw_affiliation_strings":["OOPSLA Laboratory, Department of Computer Engineering, Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"OOPSLA Laboratory, Department of Computer Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":0.8823,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.7658035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"6","first_page":"1472","last_page":"1486"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9936000108718872,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.8696416020393372},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.789211630821228},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7604156732559204},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7268762588500977},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6906687021255493},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.6331256628036499},{"id":"https://openalex.org/keywords/tec","display_name":"TEC","score":0.6127650737762451},{"id":"https://openalex.org/keywords/pyramid","display_name":"Pyramid (geometry)","score":0.5922730565071106},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.5491061210632324},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.4984574317932129},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4932677149772644},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.4813471734523773},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4579938054084778},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.4380798637866974},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4185390770435333},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.39970868825912476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37152957916259766},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2522863447666168},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.18538761138916016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14395084977149963},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.10950958728790283},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.08820739388465881},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.07996386289596558}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.8696416020393372},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.789211630821228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7604156732559204},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7268762588500977},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6906687021255493},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.6331256628036499},{"id":"https://openalex.org/C176379880","wikidata":"https://www.wikidata.org/wiki/Q18031939","display_name":"TEC","level":3,"score":0.6127650737762451},{"id":"https://openalex.org/C142575187","wikidata":"https://www.wikidata.org/wiki/Q3358290","display_name":"Pyramid (geometry)","level":2,"score":0.5922730565071106},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.5491061210632324},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.4984574317932129},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4932677149772644},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.4813471734523773},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4579938054084778},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.4380798637866974},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4185390770435333},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.39970868825912476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37152957916259766},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2522863447666168},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.18538761138916016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14395084977149963},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.10950958728790283},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.08820739388465881},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.07996386289596558},{"id":"https://openalex.org/C116403925","wikidata":"https://www.wikidata.org/wiki/Q162219","display_name":"Ionosphere","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2003.1245286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2003.1245286","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W29246612","https://openalex.org/W1529267782","https://openalex.org/W1541459201","https://openalex.org/W1672197616","https://openalex.org/W1770616178","https://openalex.org/W1972635511","https://openalex.org/W1975830550","https://openalex.org/W1978447605","https://openalex.org/W1990111898","https://openalex.org/W2000830496","https://openalex.org/W2046144220","https://openalex.org/W2066799613","https://openalex.org/W2068272887","https://openalex.org/W2068520194","https://openalex.org/W2091503252","https://openalex.org/W2097042476","https://openalex.org/W2104128006","https://openalex.org/W2108908993","https://openalex.org/W2109424811","https://openalex.org/W2118269922","https://openalex.org/W2129938590","https://openalex.org/W2133542527","https://openalex.org/W2137565219","https://openalex.org/W2145725688","https://openalex.org/W2149173084","https://openalex.org/W2155776210","https://openalex.org/W2164213684","https://openalex.org/W2165558283","https://openalex.org/W2169351022","https://openalex.org/W2238624099","https://openalex.org/W2427881153","https://openalex.org/W4243869499","https://openalex.org/W6601158432","https://openalex.org/W6631644730","https://openalex.org/W6632397832","https://openalex.org/W6718184248"],"related_works":["https://openalex.org/W4246757943","https://openalex.org/W2182477562","https://openalex.org/W1558159560","https://openalex.org/W1595303882","https://openalex.org/W2375128115","https://openalex.org/W2351157934","https://openalex.org/W2571415506","https://openalex.org/W2245581955","https://openalex.org/W325985789","https://openalex.org/W2108882154"],"abstract_inverted_index":{"The":[0],"SPY-TEC":[1,79],"(spherical":[2],"pyramid-technique)":[3],"was":[4,41,62],"proposed":[5],"as":[6],"a":[7,16,22,44,89],"new":[8],"indexing":[9],"method":[10],"for":[11,36,51,73],"high-dimensional":[12],"data":[13,24],"spaces":[14],"using":[15],"special":[17,45],"partitioning":[18,46],"strategy":[19],"that":[20,91,111],"divides":[21],"d-dimensional":[23],"space":[25],"into":[26],"2d":[27],"spherical":[28],"pyramids.":[29],"In":[30,65],"the":[31,49,78,82,106,116,127,129,132],"SPY-TEC,":[32],"an":[33,70,97],"efficient":[34,71],"algorithm":[35,72],"processing":[37,52,74,120],"hyperspherical":[38],"range":[39],"queries":[40,76,122],"introduced":[42],"with":[43],"strategy.":[47],"However,":[48],"technique":[50,113],"k-nearest-neighbor":[53,121],"queries,":[54],"which":[55],"are":[56],"frequently":[57],"used":[58,94],"in":[59,119],"similarity":[60],"search,":[61],"not":[63],"proposed.":[64],"this":[66],"paper,":[67],"we":[68,109],"propose":[69],"nearest-neighbor":[75,84],"on":[77,105],"by":[80,123],"extending":[81],"incremental":[83],"algorithm.":[85],"We":[86],"also":[87],"introduce":[88],"metric":[90],"can":[92],"be":[93],"to":[95,126],"guide":[96],"ordered":[98],"best-first":[99],"traversal":[100],"when":[101],"finding":[102],"nearest":[103],"neighbors":[104],"SPY-TEC.":[107],"Finally,":[108],"show":[110],"our":[112],"significantly":[114],"outperforms":[115],"related":[117],"techniques":[118],"comparing":[124],"it":[125],"R*-tree,":[128],"X-tree,":[130],"and":[131],"sequential":[133],"scan":[134],"through":[135],"extensive":[136],"experiments.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}