G-Tree: A New Data Structure for Organizing Multidimensional Data

Research output: Contribution to journalArticle

43 Citations (Scopus)

Abstract

This paper describes an efficient data structure called the G-tree (or grid tree) for organizing multidimensional data. The data structure combines the features of grids and B-trees in a novel manner. It also exploits an ordering property that numbers the partitions in such a way that partitions that are spatially close to one another in a multidimensional space are also close in terms of their partition numbers. This structure adapts well to dynamic data spaces with a high frequency of insertions and deletions, and to nonuniform distributions of data. We demonstrate that it is possible to perform insertion, retrieval, and deletion operations, and to run various range queries efficiently using this structure. A comparision with the BD tree, zkdb tree and the KDB tree is carried out, and the advantages of the G-tree over the other structures are discussed. The simulated bucket utilization rates for the G-tree are also reported.

Original languageEnglish (US)
Pages (from-to)341-347
Number of pages7
JournalIEEE Transactions on Knowledge and Data Engineering
Volume6
Issue number2
DOIs
StatePublished - Jan 1 1994

Fingerprint

Data structures

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

@article{04c4bb2c3d144116a9392d71addd20e5,
title = "G-Tree: A New Data Structure for Organizing Multidimensional Data",
abstract = "This paper describes an efficient data structure called the G-tree (or grid tree) for organizing multidimensional data. The data structure combines the features of grids and B-trees in a novel manner. It also exploits an ordering property that numbers the partitions in such a way that partitions that are spatially close to one another in a multidimensional space are also close in terms of their partition numbers. This structure adapts well to dynamic data spaces with a high frequency of insertions and deletions, and to nonuniform distributions of data. We demonstrate that it is possible to perform insertion, retrieval, and deletion operations, and to run various range queries efficiently using this structure. A comparision with the BD tree, zkdb tree and the KDB tree is carried out, and the advantages of the G-tree over the other structures are discussed. The simulated bucket utilization rates for the G-tree are also reported.",
author = "Akhil Kumar",
year = "1994",
month = "1",
day = "1",
doi = "10.1109/69.277778",
language = "English (US)",
volume = "6",
pages = "341--347",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "2",

}

G-Tree : A New Data Structure for Organizing Multidimensional Data. / Kumar, Akhil.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 6, No. 2, 01.01.1994, p. 341-347.

Research output: Contribution to journalArticle

TY - JOUR

T1 - G-Tree

T2 - A New Data Structure for Organizing Multidimensional Data

AU - Kumar, Akhil

PY - 1994/1/1

Y1 - 1994/1/1

N2 - This paper describes an efficient data structure called the G-tree (or grid tree) for organizing multidimensional data. The data structure combines the features of grids and B-trees in a novel manner. It also exploits an ordering property that numbers the partitions in such a way that partitions that are spatially close to one another in a multidimensional space are also close in terms of their partition numbers. This structure adapts well to dynamic data spaces with a high frequency of insertions and deletions, and to nonuniform distributions of data. We demonstrate that it is possible to perform insertion, retrieval, and deletion operations, and to run various range queries efficiently using this structure. A comparision with the BD tree, zkdb tree and the KDB tree is carried out, and the advantages of the G-tree over the other structures are discussed. The simulated bucket utilization rates for the G-tree are also reported.

AB - This paper describes an efficient data structure called the G-tree (or grid tree) for organizing multidimensional data. The data structure combines the features of grids and B-trees in a novel manner. It also exploits an ordering property that numbers the partitions in such a way that partitions that are spatially close to one another in a multidimensional space are also close in terms of their partition numbers. This structure adapts well to dynamic data spaces with a high frequency of insertions and deletions, and to nonuniform distributions of data. We demonstrate that it is possible to perform insertion, retrieval, and deletion operations, and to run various range queries efficiently using this structure. A comparision with the BD tree, zkdb tree and the KDB tree is carried out, and the advantages of the G-tree over the other structures are discussed. The simulated bucket utilization rates for the G-tree are also reported.

UR - http://www.scopus.com/inward/record.url?scp=0028405250&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028405250&partnerID=8YFLogxK

U2 - 10.1109/69.277778

DO - 10.1109/69.277778

M3 - Article

AN - SCOPUS:0028405250

VL - 6

SP - 341

EP - 347

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 2

ER -