{"id":"https://openalex.org/W2127811403","doi":"https://doi.org/10.1109/ideas.2002.1029666","title":"An index structure for improving closest pairs and related join queries in spatial databases","display_name":"An index structure for improving closest pairs and related join queries in spatial databases","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2127811403","doi":"https://doi.org/10.1109/ideas.2002.1029666","mag":"2127811403"},"language":"en","primary_location":{"id":"doi:10.1109/ideas.2002.1029666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2002.1029666","pdf_url":null,"source":{"id":"https://openalex.org/S4210202518","display_name":"Proceedings - International Database Engineering and Applications Symposium","issn_l":"1098-8068","issn":["1098-8068"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Database Engineering and Applications Symposium","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/A5030394656","display_name":"Congjun Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Congjun Yang","raw_affiliation_strings":["Division of Computer Science, Department of Mathematical Sciences, University of Memphis, Memphis, TN, USA","[Div. of Comput. Sci., Univ. of Memphis, TN, USA]"],"affiliations":[{"raw_affiliation_string":"Division of Computer Science, Department of Mathematical Sciences, University of Memphis, Memphis, TN, USA","institution_ids":["https://openalex.org/I94658018"]},{"raw_affiliation_string":"[Div. of Comput. Sci., Univ. of Memphis, TN, USA]","institution_ids":["https://openalex.org/I94658018"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036026859","display_name":"King-Ip Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"King-Ip Lin","raw_affiliation_strings":["Division of Computer Science, Department of Mathematical Sciences, University of Memphis, Memphis, TN, USA","[Div. of Comput. Sci., Univ. of Memphis, TN, USA]"],"affiliations":[{"raw_affiliation_string":"Division of Computer Science, Department of Mathematical Sciences, University of Memphis, Memphis, TN, USA","institution_ids":["https://openalex.org/I94658018"]},{"raw_affiliation_string":"[Div. of Comput. Sci., Univ. of Memphis, TN, USA]","institution_ids":["https://openalex.org/I94658018"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030394656"],"corresponding_institution_ids":["https://openalex.org/I94658018"],"apc_list":null,"apc_paid":null,"fwci":1.7783,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.86336223,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"140","last_page":"149"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9930999875068665,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/joins","display_name":"Joins","score":0.8632806539535522},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.8586953282356262},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7515213489532471},{"id":"https://openalex.org/keywords/spatial-database","display_name":"Spatial database","score":0.5660616159439087},{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.5621694326400757},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5550711154937744},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5505781173706055},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5242633819580078},{"id":"https://openalex.org/keywords/spatial-query","display_name":"Spatial query","score":0.520969033241272},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.51943039894104},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4827360510826111},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4414634704589844},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.4233849346637726},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42224520444869995},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.34182751178741455},{"id":"https://openalex.org/keywords/spatial-analysis","display_name":"Spatial analysis","score":0.28645163774490356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17475450038909912},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.159688800573349},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12170711159706116},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.10173419117927551},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.08292314410209656},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.08034232258796692}],"concepts":[{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.8632806539535522},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.8586953282356262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7515213489532471},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.5660616159439087},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.5621694326400757},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5550711154937744},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5505781173706055},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5242633819580078},{"id":"https://openalex.org/C172722865","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial query","level":5,"score":0.520969033241272},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.51943039894104},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4827360510826111},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4414634704589844},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.4233849346637726},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42224520444869995},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.34182751178741455},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.28645163774490356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17475450038909912},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.159688800573349},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12170711159706116},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.10173419117927551},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.08292314410209656},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.08034232258796692},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ideas.2002.1029666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2002.1029666","pdf_url":null,"source":{"id":"https://openalex.org/S4210202518","display_name":"Proceedings - International Database Engineering and Applications Symposium","issn_l":"1098-8068","issn":["1098-8068"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Database Engineering and Applications Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.8731","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.8731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.msci.memphis.edu/~linki/_mypaper/ideas02.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W91532282","https://openalex.org/W2014879296","https://openalex.org/W2025405721","https://openalex.org/W2058903936","https://openalex.org/W2059378307","https://openalex.org/W2063296107","https://openalex.org/W2067082782","https://openalex.org/W2076287166","https://openalex.org/W2123060058","https://openalex.org/W2125233616","https://openalex.org/W2137507206","https://openalex.org/W2144402047","https://openalex.org/W4206499008","https://openalex.org/W4244343699","https://openalex.org/W6603691434","https://openalex.org/W6678750184","https://openalex.org/W6681779468"],"related_works":["https://openalex.org/W799526280","https://openalex.org/W2923247510","https://openalex.org/W3088660274","https://openalex.org/W2350865074","https://openalex.org/W2726114508","https://openalex.org/W2362227810","https://openalex.org/W2289674787","https://openalex.org/W2045235113","https://openalex.org/W4254786824","https://openalex.org/W3135393699"],"abstract_inverted_index":{"Spatial":[0],"databases":[1],"have":[2,30,48],"grown":[3],"in":[4,6,95,116],"importance":[5],"various":[7,13,92],"fields.":[8],"Together":[9],"with":[10],"them":[11],"come":[12],"types":[14],"of":[15],"queries":[16,24,35,94,131],"that":[17,136],"need":[18],"to":[19,65,74,132],"be":[20,113],"answered":[21],"effectively.":[22],"While":[23],"involving":[25],"a":[26,58,141],"single":[27],"data":[28,38],"set":[29],"been":[31],"studied":[32],"extensively,":[33],"join":[34,68,93],"on":[36,83,128],"multi-dimensional":[37],"like":[39],"the":[40,44,62,75,110,134],"k-closest":[41,103,129],"pairs":[42],"and":[43],"nearest":[45,79],"neighbor":[46,80],"joins":[47],"only":[49],"recently":[50],"received":[51],"attention.":[52],"In":[53],"this":[54,84,122],"paper":[55],"we":[56,88,124],"propose":[57],"new":[59,85],"index":[60,86,138],"structure,":[61,87],"b-Rdnn":[63],"tree,":[64],"solve":[66],"different":[67],"queries.":[69,81],"The":[70],"structure":[71,139],"is":[72,99,140],"similar":[73],"Rdnn-tree":[76],"for":[77,91,102],"reverse":[78],"Based":[82],"give":[89],"algorithms":[90,108],"spatial":[96],"databases.":[97],"It":[98],"especially":[100],"effective":[101],"pair":[104,130],"queries,":[105],"where":[106],"earlier":[107],"using":[109],"R*-tree":[111],"can":[112],"very":[114],"inefficient":[115],"many":[117],"real":[118],"life":[119],"circumstances.":[120],"To":[121],"end":[123],"present":[125],"experimental":[126],"results":[127],"support":[133],"fact":[135],"our":[137],"better":[142],"alternative.":[143]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}