{"id":"https://openalex.org/W2301519167","doi":"https://doi.org/10.5353/th_b4784954","title":"Evaluating nearest neighbor queries over uncertain databases","display_name":"Evaluating nearest neighbor queries over uncertain databases","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2301519167","doi":"https://doi.org/10.5353/th_b4784954","mag":"2301519167"},"language":"en","primary_location":{"id":"doi:10.5353/th_b4784954","is_oa":true,"landing_page_url":"https://doi.org/10.5353/th_b4784954","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The University of Hong Kong","raw_type":"dissertation"},"type":"dissertation","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5353/th_b4784954","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037366245","display_name":"Xike Xie","orcid":"https://orcid.org/0000-0001-5290-5408"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xike Xie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5037366245"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9983999729156494,"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.9983999729156494,"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.9708999991416931,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9282000064849854,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6921144723892212},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6172093749046326},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.5216041803359985},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5053927898406982},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.4755125641822815},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21545568108558655}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6921144723892212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6172093749046326},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.5216041803359985},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5053927898406982},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.4755125641822815},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21545568108558655}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5353/th_b4784954","is_oa":true,"landing_page_url":"https://doi.org/10.5353/th_b4784954","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The University of Hong Kong","raw_type":"dissertation"},{"id":"pmh:oai:hub.hku.hk:10722/174512","is_oa":true,"landing_page_url":"http://hdl.handle.net/10722/174512","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hub.hku.hk/bib/B4784954X","raw_type":"PG_Thesis"}],"best_oa_location":{"id":"doi:10.5353/th_b4784954","is_oa":true,"landing_page_url":"https://doi.org/10.5353/th_b4784954","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The University of Hong Kong","raw_type":"dissertation"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W2382290278","https://openalex.org/W4395014643"],"abstract_inverted_index":{"\ufeffNearest":[0],"Neighbor":[1,267],"(NN":[2],"in":[3,8,38,67,232,275],"short)":[4],"queries":[5,54,62,83],"are":[6,23,58],"important":[7,44],"emerging":[9],"applications,\\n\\nsuch":[10],"as":[11,139,326],"wireless":[12],"networks,":[13],"location-based":[14],"services,":[15],"and":[16,91,132,151,200,217,353,365],"data":[17,21,31,37,57],"stream":[18],"applications,\\n\\nwhere":[19],"the":[20,49,61,98,125,145,148,156,159,183,193,249,279,284,312,321],"obtained":[22],"often":[24],"imprecise.":[25],"The":[26,223],"imprecision":[27],"or":[28,71,319],"imperfection":[29],"of\\n\\nthe":[30],"sources":[32],"is":[33,43,117,162,170,180,198,278,287,303,360],"modeled":[34],"by":[35],"uncertain":[36,56,85,95,324],"recent":[39],"research":[40],"works.":[41],"Handling\\n\\nuncertainty":[42],"because":[45],"this":[46,75,208,276,336,345,356],"issue":[47],"affects":[48],"quality":[50],"of":[51,69,94,106,128,175,195,248,261,323],"query":[52,88,102,149,160,235,285,313,332],"answers.\\n\\nAlthough":[53],"on":[55,63,84,311],"useful,":[59],"evaluating":[60],"them":[64],"can\\n\\nbe":[65],"costly,":[66],"terms":[68],"I/O":[70],"computational":[72],"efficiency.":[73],"In":[74,293],"thesis,":[76],"we":[77,154,210,338],"study":[78],"how\\n\\nto":[79],"efficiently":[80,257],"evaluate":[81],"NN":[82,262],"data.\\n\\n\\n\\nGiven":[86],"a":[87,92,104,173,290,299,330],"point":[89,179,286],"q":[90],"set":[93,105,127,174],"objects":[96,325],"O,":[97],"possible":[99,129,186],"nearest":[100,130,187,281],"neighbor":[101,282],"returns":[103],"candidates":[107],"which":[108,229,244],"have":[109],"non-zero":[110],"probabilities":[111],"to":[112,120,289,305,363],"be":[113,204],"the\\n\\nquery":[114],"answer.":[115],"It":[116],"also":[118,361],"interesting":[119],"ask":[121],"\\\\which":[122,133],"region":[123,134],"has":[124,135,225],"same":[126],"neighbors\",":[131],"one":[136],"specific":[137],"object":[138],"its":[140,185],"possible\\n\\nnearest":[141],"neighbor\".":[142],"To":[143,206,334],"reveal":[144],"relationship":[146],"between":[147],"space":[150,161],"nearest\\n\\nneighbor":[152],"answers,":[153],"propose":[155,211],"UV-diagram,":[157],"where":[158],"split":[163],"into\\n\\ndisjoint":[164],"partitions,":[165],"such":[166,196,264,317],"that":[167,349],"each":[168],"partition":[169],"associated":[171],"with":[172],"objects.":[176],"If":[177],"a\\n\\nquery":[178],"located":[181],"inside":[182],"partition,":[184],"neighbors":[188,307],"could":[189,256],"be\\n\\ndirectly":[190],"retrieved.":[191],"However,":[192],"number":[194],"partitions":[197],"exponential":[199],"the\\n\\nconstruction":[201],"effort":[202],"can":[203],"expensive.":[205],"tackle":[207],"problem,":[209,337],"an":[212,226,239],"alternative":[213],"concept,":[214],"called":[215,242],"UV-cell,":[216],"efficient":[218,340],"algorithms":[219],"for":[220,308,344],"constructing":[221],"it.":[222],"UV-cell":[224],"irregular":[227],"shape,":[228],"incurs":[230],"difficulties":[231],"storage,":[233],"maintenance,\\n\\nand":[234],"evaluation.":[236],"We":[237],"design":[238,339],"index":[240],"structure,":[241],"UV-index,":[243],"is\\n\\nan":[245],"approximated":[246],"version":[247],"UV-diagram.":[250],"Extensive":[251],"experiments":[252],"show":[253,348],"that\\n\\nthe":[254],"UV-index":[255],"answer":[258,355],"different":[259],"variants":[260],"queries,":[263],"as\\n\\nProbabilistic":[265],"Nearest":[266,271],"Queries,":[268],"Continuous":[269],"Probabilistic":[270],"Neighbor\\n\\nQueries.\\n\\n\\n\\nAnother":[272],"problem":[273],"studied":[274],"thesis":[277],"trajectory":[280],"query.\\n\\nHere":[283],"restricted":[288],"pre-known":[291],"trajectory.":[292,314],"applications":[294],"(e.g.\\n\\nmonitoring":[295],"potential":[296],"threats":[297],"along":[298],"flight/vessel's":[300],"trajectory),":[301],"it":[302],"useful":[304],"derive\\n\\nnearest":[306],"all":[309],"points":[310],"Simple":[315],"solutions,":[316],"as\\n\\nsampling":[318],"approximating":[320],"locations":[322],"points,":[327],"fails":[328],"to\\n\\nachieve":[329],"good":[331],"quality.":[333],"handle":[335],"algorithms\\n\\nand":[341],"optimization":[342],"methods":[343],"query.":[346,357],"Experiments":[347],"our":[350],"solution":[351,359],"can\\n\\nefficiently":[352],"accurately":[354],"Our":[358],"scalable":[362],"large\\n\\ndatasets":[364],"long":[366],"trajectories.":[367]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}