{"id":"https://openalex.org/W2076352083","doi":"https://doi.org/10.1145/1183471.1183509","title":"Towards optimal continuous nearest neighbor queries in spatial databases","display_name":"Towards optimal continuous nearest neighbor queries in spatial databases","publication_year":2006,"publication_date":"2006-11-10","ids":{"openalex":"https://openalex.org/W2076352083","doi":"https://doi.org/10.1145/1183471.1183509","mag":"2076352083"},"language":"en","primary_location":{"id":"doi:10.1145/1183471.1183509","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1183471.1183509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems","raw_type":"proceedings-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/A5101032361","display_name":"Victor Teixeira de Almeida","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"University of Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Victor Teixeira de Almeida","raw_affiliation_strings":["University of Hagen, Hagen, Germany"],"affiliations":[{"raw_affiliation_string":"University of Hagen, Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101032361"],"corresponding_institution_ids":["https://openalex.org/I120691247"],"apc_list":null,"apc_paid":null,"fwci":0.318,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.55500784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"227","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.807185173034668},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7898455262184143},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.69212806224823},{"id":"https://openalex.org/keywords/spatial-query","display_name":"Spatial query","score":0.625095546245575},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5812425017356873},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5529648065567017},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4964466691017151},{"id":"https://openalex.org/keywords/spatial-database","display_name":"Spatial database","score":0.47741663455963135},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.46050354838371277},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.4240909814834595},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.4159259796142578},{"id":"https://openalex.org/keywords/spatial-analysis","display_name":"Spatial analysis","score":0.3767735958099365},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.36139804124832153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36116868257522583},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.3378490209579468},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.25828981399536133},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.21590480208396912},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1474197804927826},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.1390577256679535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11840066313743591},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.11393654346466064},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07744663953781128}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.807185173034668},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7898455262184143},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.69212806224823},{"id":"https://openalex.org/C172722865","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial query","level":5,"score":0.625095546245575},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5812425017356873},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5529648065567017},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4964466691017151},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.47741663455963135},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.46050354838371277},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.4240909814834595},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.4159259796142578},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.3767735958099365},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.36139804124832153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36116868257522583},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.3378490209579468},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.25828981399536133},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.21590480208396912},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1474197804927826},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.1390577256679535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11840066313743591},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.11393654346466064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07744663953781128},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1183471.1183509","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1183471.1183509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1526692684","https://openalex.org/W1553387542","https://openalex.org/W1604713212","https://openalex.org/W1990111898","https://openalex.org/W2046144220","https://openalex.org/W2070074980","https://openalex.org/W2118269922","https://openalex.org/W2142338429","https://openalex.org/W2146485383","https://openalex.org/W2151135734","https://openalex.org/W2166996142","https://openalex.org/W2179375141"],"related_works":["https://openalex.org/W2122098189","https://openalex.org/W4251016002","https://openalex.org/W2171008029","https://openalex.org/W1595303882","https://openalex.org/W2362227810","https://openalex.org/W98693435","https://openalex.org/W78322106","https://openalex.org/W2179956029","https://openalex.org/W1003283331","https://openalex.org/W2383128498"],"abstract_inverted_index":{"One":[0],"of":[1,6,28,30,46,55,69,99],"the":[2,17,38,81,97,105,110],"most":[3],"important":[4],"kind":[5],"queries":[7],"in":[8,67,115],"spatial":[9,25],"data-bases":[10],"to":[11,59,64,79],"support":[12],"location-based":[13],"services":[14],"(LBS)":[15],"is":[16,85,102,113],"continuous":[18],"nearest":[19,53],"neighbors":[20],"(CNN)":[21],"query.":[22],"Given":[23],"a":[24,33,44],"data":[26],"set":[27,45],"points":[29,54],"interest":[31],"and":[32],"moving":[34],"query":[35,40,83],"point":[36],"q,":[37],"CNN":[39,82],"partitions":[41],"q":[42],"into":[43],"adjacent":[47],"disjoint":[48],"intervals":[49],"associated":[50],"with":[51,104],"their":[52],"interest.":[56],"Existing":[57],"solutions":[58],"this":[60,73],"problem":[61],"are":[62],"known":[63],"be":[65],"sub-optimal":[66],"terms":[68],"disk":[70,100],"accesses.":[71],"In":[72],"paper,":[74],"we":[75,92],"present":[76],"an":[77,89],"algorithm":[78],"compute":[80],"that":[84,94],"I/O":[86],"optimal.":[87],"With":[88],"experimental":[90],"evaluation,":[91],"show":[93],"not":[95],"only":[96],"number":[98],"accesses":[101],"reduced":[103],"optimal":[106],"algorithm,":[107],"but":[108],"also":[109],"CPU":[111],"performance":[112],"improved,":[114],"some":[116],"cases.":[117]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}