Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/UB-tree> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples 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 wikiPageID "5786138".
- UB-tree wikiPageLength "2317".
- UB-tree wikiPageOutDegree "7".
- UB-tree wikiPageRevisionID "668746241".
- UB-tree wikiPageWikiLink B+_tree.
- UB-tree wikiPageWikiLink Balanced_tree.
- UB-tree wikiPageWikiLink Category:Database_index_techniques.
- UB-tree wikiPageWikiLink Category:Search_trees.
- UB-tree wikiPageWikiLink Rudolf_Bayer.
- UB-tree wikiPageWikiLink Self-balancing_binary_search_tree.
- UB-tree wikiPageWikiLink Volker_Markl.
- UB-tree wikiPageWikiLink Z-order_(curve).
- UB-tree wikiPageWikiLink Z-order_curve.
- UB-tree wikiPageWikiLinkText "UB-tree".
- UB-tree hasPhotoCollection UB-tree.
- UB-tree wikiPageUsesTemplate Template:Algorithm-stub.
- UB-tree wikiPageUsesTemplate Template:CS-Trees.
- UB-tree subject Category:Database_index_techniques.
- UB-tree subject Category:Search_trees.
- UB-tree hypernym Tree.
- UB-tree type Plant.
- UB-tree type Structure.
- UB-tree type Technique.
- 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-tree".
- UB-tree sameAs UB-Baum.
- UB-tree sameAs m.0f4h30.
- UB-tree sameAs УБ_-_стабло.
- UB-tree sameAs Q2466492.
- UB-tree sameAs Q2466492.
- UB-tree wasDerivedFrom UB-tree?oldid=668746241.
- UB-tree isPrimaryTopicOf UB-tree.