Searching for "B-tree and UB-tree." – sorted by Relevance.
-
Multidimensional Mapping and Indexing of XML
- the performance of UB-Trees and compound B-Trees for the indexing of this mapping scheme. The rest of the paper
- Add To MetaCart
-
On Range Queries in Universal B-trees
- . 1.2 General Concepts of the UB-trees The Universal B-tree (UB-tree) was introduced in [1
- Add To MetaCart
-
Native Multidimensional Indexing in Relational Databases
- and preserves the distances among the points well. The Universal B-tree (UB-tree) [2] uses the Z-curve (Fig. 3a
- Add To MetaCart
-
Interval Processing with the UB-Tree
- they cannot perform as good as clustering indexes like the B-Tree or the UB-Tree. The Relational Interval Tree
- Cited by 1 (0 self) – Add To MetaCart
-
Indexing XML Data with UB-trees
- conventional approaches. 3 The Universal B-tree (UB-tree) The Universal B-tree (UB-tree) belongs to methods
- Add To MetaCart
-
MISTRAL: Processing Relational Queries using a Multidimensional Access Technique
- is a very promising effort to introduce universal B-trees (UB-trees), the multidimensional variant
- Add To MetaCart
-
Bulk loading a Data Warehouse built upon a UB-Tree
- The UB-Tree The UB-Tree is a multidimensional clustering index, which inherits all good properties of B-Tree
- Cited by 1 (1 self) – Add To MetaCart
-
B-trees: Bearing Fruits of All Kinds
- 15], String B-tree [12] Spatial databases location-key based [1], UB-tree [24] Z-ordering [22] High
- Cited by 3 (0 self) – Add To MetaCart
-
Parameter Estimation for Interactive Visualisation of Scientific Data
- a UB-Tree is a B-Tree into which tuples 〈 f (zt(Ki)),Di〉 are inserted. Furthermore, we assume
- Add To MetaCart
-
multidimensional index: Integration, Optimization, and Enhancement of UB-Trees
- mentioned deficiencies and promote the universal B-Tree (UB-Tree) as a premier candidate for a general
- Add To MetaCart

