{"id":"https://openalex.org/W2160152607","doi":"https://doi.org/10.14778/1687627.1687754","title":"Efficient method for maximizing bichromatic reverse nearest neighbor","display_name":"Efficient method for maximizing bichromatic reverse nearest neighbor","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W2160152607","doi":"https://doi.org/10.14778/1687627.1687754","mag":"2160152607"},"language":"en","primary_location":{"id":"doi:10.14778/1687627.1687754","is_oa":false,"landing_page_url":"https://doi.org/10.14778/1687627.1687754","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","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/A5049858061","display_name":"Raymond Chi-Wing Wong","orcid":"https://orcid.org/0000-0001-7045-6503"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Raymond Chi-Wing Wong","raw_affiliation_strings":["Hong Kong University of Science and Technology"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014972038","display_name":"M. TAMER \u00d6ZSU","orcid":"https://orcid.org/0000-0002-8126-1717"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"M. Tamer \u00d6zsu","raw_affiliation_strings":["University of Waterloo"],"affiliations":[{"raw_affiliation_string":"University of Waterloo","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036357902","display_name":"Philip S. Yu","orcid":"https://orcid.org/0000-0002-3491-5968"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip S. Yu","raw_affiliation_strings":["University of Illinois at Chicago"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Chicago","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110164824","display_name":"Ada Wai-Chee Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ada Wai-Chee Fu","raw_affiliation_strings":["Chinese University of Hong Kong"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100351579","display_name":"Lian Liu","orcid":"https://orcid.org/0000-0002-7833-2131"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Lian Liu","raw_affiliation_strings":["Hong Kong University of Science and Technology"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5049858061"],"corresponding_institution_ids":["https://openalex.org/I200769079"],"apc_list":null,"apc_paid":null,"fwci":9.6417,"has_fulltext":false,"cited_by_count":129,"citation_normalized_percentile":{"value":0.98687003,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"2","issue":"1","first_page":"1126","last_page":"1137"},"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9832000136375427,"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"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9819999933242798,"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/computer-science","display_name":"Computer science","score":0.7348250150680542},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5464994311332703},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5266841650009155},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5150082111358643},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.45916610956192017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45208635926246643},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.43216776847839355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3525034189224243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20551615953445435},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1730715036392212}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7348250150680542},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5464994311332703},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5266841650009155},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5150082111358643},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.45916610956192017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45208635926246643},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.43216776847839355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3525034189224243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20551615953445435},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1730715036392212},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.14778/1687627.1687754","is_oa":false,"landing_page_url":"https://doi.org/10.14778/1687627.1687754","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.2650","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.2650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://softbase.uwaterloo.ca/~ddbms/publications/spatial/VLDB09-maxRNN.pdf","raw_type":"text"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-42400","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-42400","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W175308317","https://openalex.org/W1503832576","https://openalex.org/W1537829861","https://openalex.org/W1851312640","https://openalex.org/W2017157078","https://openalex.org/W2076287166","https://openalex.org/W2079093471","https://openalex.org/W2088659184","https://openalex.org/W2103205229","https://openalex.org/W2120767835","https://openalex.org/W2123011740","https://openalex.org/W2129658824","https://openalex.org/W2136963423","https://openalex.org/W2149906774","https://openalex.org/W2151135734","https://openalex.org/W2151489238","https://openalex.org/W2151700547","https://openalex.org/W2160152607","https://openalex.org/W2162202557","https://openalex.org/W4244343699","https://openalex.org/W4385265209"],"related_works":["https://openalex.org/W2375128115","https://openalex.org/W2371554206","https://openalex.org/W2350448713","https://openalex.org/W2355974634","https://openalex.org/W3038047164","https://openalex.org/W3140443735","https://openalex.org/W2926234975","https://openalex.org/W2057189162","https://openalex.org/W3164373716","https://openalex.org/W4299965259"],"abstract_inverted_index":{"Bichromatic":[0],"reverse":[1],"nearest":[2],"neighbor":[3],"(BRNN)":[4],"has":[5,36,96],"been":[6],"extensively":[7],"studied":[8],"in":[9],"spatial":[10],"database":[11],"literature.":[12],"In":[13],"this":[14],"paper,":[15],"we":[16,112],"study":[17],"a":[18,34,46,78],"related":[19],"problem":[20,35,43],"called":[21,119],"MaxBRNN:":[22],"find":[23],"an":[24,116],"optimal":[25],"region":[26],"that":[27,50,71,127],"maximizes":[28],"the":[29,42,65,87,92,101,110,135],"size":[30],"of":[31,44,83,89,109],"BRNNs.":[32],"Such":[33],"many":[37,53,131],"real":[38],"life":[39],"applications,":[40],"including":[41],"finding":[45],"new":[47],"server":[48],"point":[49],"attracts":[51],"as":[52,55],"customers":[54],"possible":[56,69,84],"by":[57],"proximity.":[58],"A":[59],"straightforward":[60],"approach":[61],"is":[62,130],"to":[63,125],"determine":[64],"BRNNs":[66],"for":[67],"all":[68],"points":[70],"are":[72,77,123],"not":[73],"feasible":[74],"since":[75],"there":[76],"large":[79],"(or":[80],"infinite)":[81],"number":[82],"points.":[85],"To":[86],"best":[88],"our":[90,128],"knowledge,":[91],"fastest":[93],"known":[94],"method":[95],"exponential":[97],"time":[98],"complexity":[99],"on":[100,105],"data":[102],"size.":[103],"Based":[104],"some":[106],"interesting":[107],"properties":[108],"problem,":[111],"come":[113],"up":[114],"with":[115],"efficient":[117],"algorithm":[118,129],"MaxOverlap.":[120],"Extensive":[121],"experiments":[122],"conducted":[124],"show":[126],"times":[132],"faster":[133],"than":[134],"best-known":[136],"technique.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}