{"id":"https://openalex.org/W196021272","doi":null,"title":"The Universal B-Tree for multidimensional Indexing","display_name":"The Universal B-Tree for multidimensional Indexing","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W196021272","mag":"196021272"},"language":"en","primary_location":{"id":"mag:196021272","doi":null,"is_oa":false,"landing_page_url":"http://imi.unine.ch/pantheon/pdfs/ubtree.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5110020072","display_name":"Rudolf Bayer","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Rudolf Bayer","raw_affiliation_strings":["Technical University of Munich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110020072"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":6.8365,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.96386555,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":100},"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.9897000193595886,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9897000193595886,"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.007799999788403511,"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/T11269","display_name":"Algorithms and Data Compression","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multidimensional-indexing","display_name":"multidimensional indexing","score":0.8270000219345093},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-trees","score":0.7770000100135803},{"id":"https://openalex.org/keywords/balanced-trees","display_name":"balanced trees","score":0.6919999718666077},{"id":"https://openalex.org/keywords/secondary-indexes","display_name":"secondary indexes","score":0.8479999899864197},{"id":"https://openalex.org/keywords/range-queries","display_name":"range queries","score":0.8600000143051147},{"id":"https://openalex.org/keywords/geometric-database","display_name":"geometric database","score":0.6340000033378601},{"id":"https://openalex.org/keywords/spatial-data","display_name":"geospatial data","score":0.39800000190734863},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.6349999904632568}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6621189117431641},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6583728790283203},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.6513559222221375},{"id":"https://openalex.org/C70000936","wikidata":"https://www.wikidata.org/wiki/Q4672467","display_name":"Access method","level":2,"score":0.6237386465072632},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6101638078689575},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.5444383025169373},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4835819602012634},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.482063353061676},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.454156756401062},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4357622265815735},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.43481165170669556},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.42690643668174744},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.4220725893974304},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3961769938468933},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.36095815896987915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31623315811157227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3103225827217102},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.28398069739341736},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.19633817672729492},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13789156079292297},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.1322351098060608},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.11994907259941101},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11271065473556519},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:196021272","doi":null,"is_oa":false,"landing_page_url":"http://imi.unine.ch/pantheon/pdfs/ubtree.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2108908993","https://openalex.org/W2149173084"],"related_works":["https://openalex.org/W1578663408","https://openalex.org/W1570020612","https://openalex.org/W2746802445","https://openalex.org/W2122990007","https://openalex.org/W7101034387","https://openalex.org/W7097691553","https://openalex.org/W7100078250","https://openalex.org/W2001268447","https://openalex.org/W7100973259","https://openalex.org/W7025269349"],"abstract_inverted_index":{"Today":[0],"almost":[1],"all":[2,54,210],"database":[3],"systems":[4],"use":[5],"B-trees":[6],"as":[7],"their":[8],"main":[9,15,102],"access":[10,38],"method.":[11],"One":[12],"of":[13,17,59,75,91,127,142,166,170],"the":[14,18,55,72,81,84,98,116,160,167],"drawbacks":[16],"classical":[19],"B-tree":[20],"is,":[21],"however,":[22],"that":[23,87,134],"it":[24,62,88],"works":[25],"well":[26],"only":[27,135],"for":[28,45,66,71,104,112,188,198],"one-dimensional":[29],"data.":[30,47,106],"In":[31,79],"this":[32,132],"paper":[33],"we":[34],"present":[35],"a":[36,119,214],"new":[37,117],"structure,":[39],"called":[40],"UB-tree":[41,49,82,99,121,137,161,184,216],"(for":[42],"universal":[43],"B-tree)":[44],"multidimensional":[46,105],"The":[48,183],"is":[50,185],"balanced":[51],"and":[52,68,149,155,192],"has":[53,83,108,162],"guaranteed":[56],"performance":[57,178],"characteristics":[58],"B-trees,":[60],"i.e.":[61],"requires":[63],"linear":[64],"space":[65],"storage":[67,150],"logarithmic":[69],"time":[70],"basic":[73],"operations":[74],"INSERT":[76],"FIND":[77],"DELETE.":[78],"addition":[80],"fundamental":[85],"property,":[86],"preserves":[89],"clustering":[90],"objects":[92],"w.r.":[93],"to":[94],"Cartesian":[95],"distance.":[96],"Therefore,":[97],"shows":[100],"its":[101],"strengths":[103],"It":[107],"very":[109],"high":[110],"potential":[111],"parallel":[113],"processing.":[114],"With":[115],"method,":[118],"single":[120,215],"can":[122,209],"replace":[123],"an":[124],"arbitrary":[125],"number":[126],"secondary":[128,144,172,181,204],"indexes.":[129,145,173,182],"For":[130,153],"updates":[131],"means":[133],"one":[136],"must":[138],"be":[139,211],"managed":[140],"instead":[141,165],"several":[143],"This":[146,174],"reduces":[147],"runtime":[148],"requirements":[151],"substantially.":[152],"queries":[154,159],"in":[156,176,200],"particular":[157],"range":[158],"multiplicative":[163],"complexity":[164,169],"additive":[168],"multiple":[171,203],"results":[175],"dramatic":[177],"improvements":[179],"over":[180],"obviously":[186],"useful":[187],"geometric":[189],"databases,":[190],"datawarehousing":[191],"datamining":[193],"applications,":[194],"but":[195],"even":[196],"more":[197],"databases":[199],"general,":[201],"where":[202],"indexes":[205],"are":[206],"widespread,":[207],"which":[208],"replaced":[212],"by":[213],"index.":[217]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":15}],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}