logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A BALANCED HIERARCHICAL DATA STRUCTURE FOR MULTIDIMENSIONAL DATA WITH HIGHLY EFFICIENT DYNAMIC CHARACTERISTICS

delete1993-01-01
delete25
PRE
AI
Y
Yuichi Nakamura *
S
Shigeo Abe
M
Masao Sakauchi
DOI：10.1109/69.234779delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A new multidimensional data structure, multidimensional tree (MD-tree), is proposed. The MD-tree is developed by extending the concept of the B-tree to the multidimensional data, so that the MD-tree is a height balanced tree similar to the B-tree. The theoretical worst-case storage utilization is guaranteed to hold more than 66.7%(2/3) of full capacity. In this paper, the structure of the MD-tree and the algorithms to perform the insertion, deletion, and spatial searching am described. By the series of simulation tests, the performances of the MD-tree and conventional methods are compared. The results indicate that storage utilization is more than 80% in practice, and that retrieval performance and dynamic characteristics are superior to conventional methods.
Keywords:
B-TREE
BINARY TREE
HEIGHT BALANCED TREES
HIERARCHICAL DATA STRUCTURES
GEOGRAPHIC INFORMATION SYSTEM
MULTIDIMENSIONAL DATA STRUCTURES
RANGE QUERIES
SPATIAL DATA STRUCTURES
TREE STRUCTURES
2-3 TREE
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.8K
Citations:
3.2W

Organization

No organization information available