{"id":"https://openalex.org/W2032010241","doi":"https://doi.org/10.1145/2618243.2618290","title":"A system for efficient and simultaneous processing of moving K nearest neighbor and spatial keyword queries","display_name":"A system for efficient and simultaneous processing of moving K nearest neighbor and spatial keyword queries","publication_year":2014,"publication_date":"2014-06-24","ids":{"openalex":"https://openalex.org/W2032010241","doi":"https://doi.org/10.1145/2618243.2618290","mag":"2032010241"},"language":"en","primary_location":{"id":"doi:10.1145/2618243.2618290","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2618243.2618290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on Scientific and Statistical Database Management","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/A5091464412","display_name":"Chongsheng Zhang","orcid":"https://orcid.org/0000-0003-1632-7238"},"institutions":[{"id":"https://openalex.org/I173899330","display_name":"Henan University","ror":"https://ror.org/003xyzq10","country_code":"CN","type":"education","lineage":["https://openalex.org/I173899330"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chongsheng Zhang","raw_affiliation_strings":["Henan University, China","Henan University, China#TAB#"],"affiliations":[{"raw_affiliation_string":"Henan University, China","institution_ids":["https://openalex.org/I173899330"]},{"raw_affiliation_string":"Henan University, China#TAB#","institution_ids":["https://openalex.org/I173899330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091464412"],"corresponding_institution_ids":["https://openalex.org/I173899330"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10277778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9943000078201294,"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.9876686334609985},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7151503562927246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7021247148513794},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5341863632202148},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5255367159843445},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5166361927986145},{"id":"https://openalex.org/keywords/spatial-query","display_name":"Spatial query","score":0.4856628179550171},{"id":"https://openalex.org/keywords/weighted-voronoi-diagram","display_name":"Weighted Voronoi diagram","score":0.4715828001499176},{"id":"https://openalex.org/keywords/centroidal-voronoi-tessellation","display_name":"Centroidal Voronoi tessellation","score":0.42949575185775757},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.41357892751693726},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.32784879207611084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.325313925743103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2223944067955017},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21203452348709106},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.15616360306739807},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.10455355048179626},{"id":"https://openalex.org/keywords/web-query-classification","display_name":"Web query classification","score":0.10002979636192322},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08235764503479004},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.07351455092430115}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.9876686334609985},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7151503562927246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7021247148513794},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5341863632202148},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5255367159843445},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5166361927986145},{"id":"https://openalex.org/C172722865","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial query","level":5,"score":0.4856628179550171},{"id":"https://openalex.org/C20468658","wikidata":"https://www.wikidata.org/wiki/Q17130624","display_name":"Weighted Voronoi diagram","level":3,"score":0.4715828001499176},{"id":"https://openalex.org/C205672865","wikidata":"https://www.wikidata.org/wiki/Q5062961","display_name":"Centroidal Voronoi tessellation","level":3,"score":0.42949575185775757},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.41357892751693726},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.32784879207611084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.325313925743103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2223944067955017},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21203452348709106},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.15616360306739807},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.10455355048179626},{"id":"https://openalex.org/C118689300","wikidata":"https://www.wikidata.org/wiki/Q7978614","display_name":"Web query classification","level":4,"score":0.10002979636192322},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08235764503479004},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.07351455092430115}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2618243.2618290","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2618243.2618290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G5814680588","display_name":null,"funder_award_id":"61300215, 61272545","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G650590343","display_name":null,"funder_award_id":"2013YBZR014, 0000A40442","funder_id":"https://openalex.org/F4320322878","funder_display_name":"Henan University"},{"id":"https://openalex.org/G8589669012","display_name":null,"funder_award_id":"246016","funder_id":"https://openalex.org/F4320320885","funder_display_name":"European Research Consortium for Informatics and Mathematics"}],"funders":[{"id":"https://openalex.org/F4320320885","display_name":"European Research Consortium for Informatics and Mathematics","ror":"https://ror.org/055zrhj18"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322878","display_name":"Henan University","ror":"https://ror.org/003xyzq10"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1829285201","https://openalex.org/W1852700332","https://openalex.org/W1989519960","https://openalex.org/W2006307108","https://openalex.org/W2092924973","https://openalex.org/W2099996440","https://openalex.org/W2100156887","https://openalex.org/W2122868005","https://openalex.org/W2140048308","https://openalex.org/W2151369660","https://openalex.org/W4239339957"],"related_works":["https://openalex.org/W2383087774","https://openalex.org/W2015548030","https://openalex.org/W2739428663","https://openalex.org/W2389906634","https://openalex.org/W1992160534","https://openalex.org/W4239527536","https://openalex.org/W2000970671","https://openalex.org/W2116864555","https://openalex.org/W2747977909","https://openalex.org/W1562406979"],"abstract_inverted_index":{"We":[0,27],"study":[1],"the":[2,36,64,86,98,108,116,125,134],"efficient,":[3],"generic":[4,19],"processing":[5,20],"of":[6,67,133],"moving":[7],"K":[8,130],"nearest":[9,38,131],"neighbor":[10,39],"(MKNN)":[11],"and":[12,127],"top-K":[13],"spatial":[14,37],"keyword":[15],"(MKSK)":[16],"queries.":[17],"Such":[18],"is":[21,50],"attractive":[22],"during":[23],"high":[24],"query":[25,87,103],"loads.":[26],"propose":[28],"GridVoronoi--an":[29],"index":[30],"that":[31],"enables":[32],"users":[33],"to":[34,58,78,97,110,122],"find":[35,80,124],"(NN)":[40],"from":[41],"uniformly":[42],"distributed":[43],"datasets":[44],"in":[45,62],"almost":[46],"O(1)":[47],"time.":[48],"GridVoronoi":[49,105],"based":[51],"upon":[52],"Voronoi":[53,70,73,83,99,113,120],"diagram":[54,74,121],"which":[55,82,112],"has":[56],"proven":[57],"be":[59],"highly":[60],"efficient":[61],"exploring":[63],"local":[65],"neighborhood":[66],"a":[68,76,92],"given":[69],"cell.":[71],"However,":[72],"needs":[75],"method":[77],"promptly":[79],"out":[81],"cell":[84,114],"contains":[85,115],"point.":[88],"So":[89],"we":[90],"add":[91],"virtual":[93],"(i.e.,":[94,129],"conceptual)":[95],"grid":[96,109],"diagram.":[100],"For":[101],"any":[102],"point,":[104],"first":[106],"uses":[107],"compute":[111],"query,":[117],"next":[118],"utilizes":[119],"quickly":[123],"NN":[126],"KNN":[128],"neighbors)":[132],"query.":[135]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}