{"id":"https://openalex.org/W2070665098","doi":"https://doi.org/10.1109/icnc.2010.5582974","title":"A new method about spatial data query based on the R*Q-tree","display_name":"A new method about spatial data query based on the R*Q-tree","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2070665098","doi":"https://doi.org/10.1109/icnc.2010.5582974","mag":"2070665098"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2010.5582974","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5582974","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101993529","display_name":"Guobin Li","orcid":"https://orcid.org/0000-0002-5921-9766"},"institutions":[{"id":"https://openalex.org/I4210166499","display_name":"Henan Polytechnic University","ror":"https://ror.org/05vr1c885","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210166499"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guobin Li","raw_affiliation_strings":["School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, China","institution_ids":["https://openalex.org/I4210166499"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050931109","display_name":"Jine Tang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166499","display_name":"Henan Polytechnic University","ror":"https://ror.org/05vr1c885","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210166499"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jine Tang","raw_affiliation_strings":["School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, China","institution_ids":["https://openalex.org/I4210166499"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210166499"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":null,"first_page":"1044","last_page":"1047"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9861999750137329,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9836999773979187,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.676324725151062},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6688502430915833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6202894449234009},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.5558708310127258},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5363525152206421},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5050159096717834},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5014626979827881},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.48855552077293396},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.4873286187648773},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.45992833375930786},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4117549657821655},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.41089802980422974},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.34848058223724365},{"id":"https://openalex.org/keywords/spatial-database","display_name":"Spatial database","score":0.33752334117889404},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3080497682094574},{"id":"https://openalex.org/keywords/spatial-analysis","display_name":"Spatial analysis","score":0.2975624203681946},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27661803364753723},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2528303861618042},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20006868243217468},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.176846444606781},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.11203768849372864},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09936356544494629}],"concepts":[{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.676324725151062},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6688502430915833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6202894449234009},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.5558708310127258},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5363525152206421},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5050159096717834},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5014626979827881},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.48855552077293396},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.4873286187648773},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.45992833375930786},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4117549657821655},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.41089802980422974},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.34848058223724365},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.33752334117889404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3080497682094574},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.2975624203681946},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27661803364753723},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2528303861618042},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20006868243217468},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.176846444606781},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.11203768849372864},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09936356544494629}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2010.5582974","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5582974","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2118269922","https://openalex.org/W2391197945","https://openalex.org/W4242599275"],"related_works":["https://openalex.org/W22108090","https://openalex.org/W2351720606","https://openalex.org/W4244673516","https://openalex.org/W2107390755","https://openalex.org/W2221940102","https://openalex.org/W2383581812","https://openalex.org/W2243469488","https://openalex.org/W272774291","https://openalex.org/W2024199467","https://openalex.org/W2131383217"],"abstract_inverted_index":{"Based":[0],"on":[1],"the":[2,19,22,38,45,58,61,64,70,73,86,89,95,99],"conventional":[3,23],"R*Q-tree":[4,8,24,33,49,101],"study,":[5],"a":[6],"novel":[7,32],"spatial":[9,75],"database":[10],"indexing":[11],"technology":[12],"is":[13,34,66,77,102],"designed":[14],"in":[15],"order":[16],"to":[17,25],"solve":[18],"shortcoming":[20],"of":[21,48,54,63,72,98],"insert":[26],"data":[27,46,76],"into":[28,79],"which":[29],"quard.":[30],"The":[31,91],"created":[35],"by":[36,51],"adding":[37],"parent":[39],"node":[40],"VR*-tree":[41],"and":[42,69,88],"HR*-tree,":[43],"making":[44],"set":[47],"near":[50],"partition":[52],"forms":[53],"narrow-band":[55],"line":[56],"shape,":[57],"overlapping":[59],"between":[60,85],"sub-tree":[62],"R*-tree":[65,87],"greatly":[67],"reduced":[68],"scope":[71],"entire":[74],"divided":[78],"narrow-band.":[80],"There":[81],"isn't":[82],"any":[83],"repeat":[84],"sub-regions.":[90],"experiment":[92],"shows":[93],"that":[94],"query":[96],"efficiency":[97],"improved":[100],"significantly":[103],"enhanced.":[104]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}