Searching for "Height-balanced multiway trees." – sorted by Relevance.
-
How to Avoid Building DataBlades That Know the Value of Everything and the Cost of Nothing
-
ST generalizes the height-balanced, multiway
tree. Each tree node contains a number of node
entries, e =
- Cited by 9 (0 self) – Add To MetaCart
-
Generalizing “Search” in Generalized Search Trees
- familiarity with these design aspects. 2.1. Basic Definitions and Structure A GiST is a height-balanced
- Cited by 19 (2 self) – Add To MetaCart
-
Efficient Concurrency Control in Multidimensional Access Methods
- used in presenting the algorithms. Generalized Search Trees GiST is a height balanced multiway tree
- Cited by 8 (2 self) – Add To MetaCart
-
Generalizing "Search" in Generalized Search Trees (Extended Abstract)
-
ST is a height-balanced, multiway tree. Each tree
node contains a number of entries, E =
, where
- Cited by 4 (0 self) – Add To MetaCart
-
Algorithms for Index-Assisted Selectivity Estimation
- properties of this framework. GiST generalizes the notion of a height-balanced, multiway tree. Each tree node
- Cited by 4 (2 self) – Add To MetaCart
-
Efficient Concurrency Control in Multidimensional Access Methods
- GiST is a height balanced multiway tree. Each tree node contains a number of node entries, E = hp
- Add To MetaCart
-
Efficient Bulk Operations on Dynamic R-Trees
- proposed by Guttman [17], is a height-balanced multiway tree similar to a B-tree [7], [11]. The leaf nodes
- Cited by 32 (9 self) – Add To MetaCart
-
Efficient Bulk Operations on Dynamic R-trees (Extended Abstract)
- proposed by Guttman [16], is a height-balanced multiway tree similar to a B-tree [12, 7]. The leaf nodes
- Add To MetaCart
-
The hs file: a new dynamic signature file method for efficient information retrieval
- file overcomes the problem of light query signature weights. The HS file is a height balanced multiway
- Cited by 1 (0 self) – Add To MetaCart

