Matches in DBpedia 2014 for { <http://dbpedia.org/resource/UB-tree> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- UB-tree abstract "The UB-tree as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving multidimensional data. It is basically a B+ tree (information only in the leaves) with records stored according to Z-order, also called Morton order. Z-order is simply calculated by bitwise interlacing the keys. Insertion, deletion, and point query are done as with ordinary B+ trees. To perform range searches in multidimensional point data, however, an algorithm must be provided for calculating, from a point encountered in the data base, the next Z-value which is in the multidimensional search range. The original algorithm to solve this key problem was exponential with the dimensionality and thus not feasible ("GetNextZ-address"). A solution to this "crucial part of the UB-tree range query" linear with the z-address bit length has been described later. This method has already been described in an older paper where using Z-order with search trees has first been proposed.".
- UB-tree wikiPageExternalLink mistral.in.tum.de.
- UB-tree wikiPageID "5786138".
- UB-tree wikiPageRevisionID "560293970".
- UB-tree hasPhotoCollection UB-tree.
- UB-tree subject Category:Database_index_techniques.
- UB-tree subject Category:Trees_(data_structures).
- UB-tree type Ability105616246.
- UB-tree type Abstraction100002137.
- UB-tree type Cognition100023271.
- UB-tree type DatabaseIndexTechniques.
- UB-tree type Know-how105616786.
- UB-tree type Method105660268.
- UB-tree type PsychologicalFeature100023100.
- UB-tree type Technique105665146.
- UB-tree comment "The UB-tree as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving multidimensional data. It is basically a B+ tree (information only in the leaves) with records stored according to Z-order, also called Morton order. Z-order is simply calculated by bitwise interlacing the keys. Insertion, deletion, and point query are done as with ordinary B+ trees.".
- UB-tree label "UB-Baum".
- UB-tree label "UB-tree".
- UB-tree sameAs UB-Baum.
- UB-tree sameAs m.0f4h30.
- UB-tree sameAs Q2466492.
- UB-tree sameAs Q2466492.
- UB-tree sameAs UB-tree.
- UB-tree wasDerivedFrom UB-tree?oldid=560293970.
- UB-tree isPrimaryTopicOf UB-tree.