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

Authors:
A. Kumar
Affiliations:
-
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
1994

Citing 12
Cited 19

Implementation of the grid file: design concepts and experience

BIT
Spatial query processing in an object-oriented database system

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Algorithms for BD trees

Software—Practice & Experience
The BANG file: A new kind of grid file

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures

The design and analysis of spatial data structures
The Grid File: An Adaptable, Symmetric Multikey File Structure

ACM Transactions on Database Systems (TODS)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Attribute based file organization in a paged memory environment

Communications of the ACM
Multidimensional binary search trees used for associative searching

Communications of the ACM
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A class of data structures for associative searching

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Storage mappings for multidimensional linear dynamic hashing

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems

Performance evaluation of G-tree and its application in fuzzy databases

CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Multidimensional access methods

ACM Computing Surveys (CSUR)
A New Indexing Scheme for Content-Based Image Retrieval

Multimedia Tools and Applications
Efficient Management of Persistent Knowledge

Journal of Intelligent Information Systems
A Region Splitting Strategy for Physical Database Design of Multidimensional File Organizations

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
An Efficient Storage Manager

ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
The Arc-Tree: A Novel Symmetric Access Method for Multidimensional Data

ADBIS '01 Proceedings of the 5th East European Conference on Advances in Databases and Information Systems
The Gr_Tree: The Use of Active Regions in G-Trees

ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
A top-down approach for density-based clustering using multidimensional indexes

Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Distributed top-N query processing with possibly uncooperative local systems

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient and compact indexing structure for processing of spatial queries in line-based databases

Data & Knowledge Engineering
Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree

Pattern Recognition
A B+-tree based indexing technique for fuzzy numerical data

Fuzzy Sets and Systems
Flexible and efficient transfer of multidimensional data in grid

CHINA HPC '07 Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing
Using B+-trees for processing of line segments in large spatial databases

Journal of Intelligent Information Systems
An Indexing Technique for Fuzzy Numerical Data

SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
A simple, compact and dynamic partition scheme based on co-centric spheres

PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Transforming range queries to equivalent box queries to optimize page access

Proceedings of the VLDB Endowment
On the behavior of indexes for imprecise numerical data and necessity measured queries under skewed data sets

FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The author 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 comparison 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.