𝔖 Bobbio Scriptorium
✦   LIBER   ✦

G-tree: a new data structure for organizing multidimensional data

✍ Scribed by Kumar, A.

Book ID
115446526
Publisher
IEEE
Year
1994
Tongue
English
Weight
740 KB
Volume
6
Category
Article
ISSN
1041-4347

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

RMD-tree: A hierarchical data structure
RMD-tree: A hierarchical data structure for multidimensional nonzero size spatial objects using MD-tree
✍ Yasuaki Nakamura; Shigeru Abe; Yutaka Ohsawa; Masao Sakauchi πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 906 KB

## Abstract This paper proposes an RMD‐tree (region multidimensional tree), which is a method of data management based on the tree structure, aiming at the efficient management and retrieval of spatial objects with nonzero sizes. In the proposed method, the spatial object in the __N__‐dimensional

A Data Structure for Dynamically Maintai
A Data Structure for Dynamically Maintaining Rooted Trees
✍ Greg N. Frederickson πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 274 KB

The directed topology tree data structure is developed for maintaining binary trees dynamically. Each of a certain set of tree operations is shown to take Ž . Olog n time, where n is the number of vertices in the trees. The directed topology trees are used to implement link᎐cut trees and dynamic exp