Third International Conference on Information Technology and Applications (ICITA'05) Volume 2 Perfect KDB-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data Sydney, Australia July 04-July 07 ISBN: 0-7695-2316-1
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.
Index Terms:
splitting policy, spatial database, KDB-trees, storage utilization
Citation:
Hung-Yi Lin, Po-Whei Huang, "Perfect KDB-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data," icita, vol. 2, pp.411-414, Third International Conference on Information Technology and Applications (ICITA'05) Volume 2, 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb