Paper Info
Title
Perfect KDB-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data
Abstract
Many literatures have improved the techniques of traditional KDB-tree and its variants for acquiring some performance enhancement. However, they all suffer from the low storage utilization problem caused by their imperfect "splitting policies." Frequent splits do not only increase the size of index structure but also deteriorate the performance of the system. A new insertion algorithm with the new splitting policy was proposed, which can insert data entries in the leaves as much as possible to increase storage utilization up to nearly 100%. Analytical and experimental results show that our indexing method outperforms the traditional KDB-tree and its variants.
Year
DOI
Venue
2005
10.1109/ICITA.2005.209
ICITA (2)
Keywords
Field
DocType
new insertion algorithm,compact kdb-tree structure,data entry,splitting policy,storage utilization,new splitting policy,indexing multidimensional data,traditional kdb-tree,performance enhancement,low storage utilization problem,frequent split,perfect kdb-tree,database indexing,computer science,tree data structures,tree structure,finance,multidimensional systems,indexing,tree data structure,information technology,spatial database,indexation
High-definition video,Data mining,Imperfect,Computer science,Tree (data structure),Search engine indexing,Tree structure,Database index,Spatial database,Multidimensional systems
Conference
ISBN
Citations 
PageRank 
0-7695-2316-1
5
0.48
References 
Authors
3
2
Name
Order
Citations
PageRank
Hung-Yi Lin1398.74
Po-Whei Huang230720.59