Browse > Article

Bit-Vector-Based Space Partitioning Indexing Scheme for Improving Node Utilization and Information Retrieval  

Yeo, Myung-Ho (충북대학교 정보통신공학과)
Seong, Dong-Ook (충북대학교 정보통신공학과)
Yoo, Jae-Soo (충북대학교 정보통신공학과)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.16, no.7, 2010 , pp. 799-803 More about this Journal
Abstract
The KDB-tree is a traditional indexing scheme for retrieving multidimensional data. Much research for KDB-tree family frequently addresses the low storage utilization and insufficient retrieval performance as their two bottlenecks. The bottlenecks occur due to a number of unnecessary splits caused by data insertion orders and data skewness. In this paper, we propose a novel index structure, called as $KDB_{CS}^+$-tree, to process skewed data efficiently and improve the retrieval performance. The $KDB_{CS}^+$-tree increases the number of fan-outs by exploiting bit-vectors for representing splitting information and pointer elimination. It also improves the storage utilization by representing entries as a hierarchical structure in each internal node.
Keywords
space partitioning; index structure; KDB-tree; information retrieval;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Yu, T. Bailey, R. Orlandic and J. Somavaram, "KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data," Proceedings of the International Conference on Information Technology: Coding and Computing, pp.676-680, 2003.
2 J. Rao and K. A. Ross, "Making B+-Trees Cache Conscious in Main Memory," Proceedings of the ACM SIGMOD Conference, pp.475-486, 2000.
3 M. Yeo, Y. Min, K. Bok and J. Yoo, "The Optimization of In-Memory Space Partitioning Trees for Cache Utilization," IEICE Transaction on Information and Systems, vol.E91-D, no.2, pp.243-250, 2008.   DOI   ScienceOn
4 R. Orlandic and B. Yu, "Implementing KDB-Trees to Support High-Dimensional Data," Proceedings of the International Database Engineering & Applications Symposium, pp.58-67, 2001.
5 R. Orlandic and B. Yu, "Estimating the Probability of Overlap between Multi-Dimensional Rectangles in the Analysis of Spatial Structures," Information Sciences, 2001.
6 J. T. Robinson, "The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes," Proceedings of the ACM SIGMOD Conference, pp.10-18, 1981.
7 A. Guttman, "R-trees: A Dynamic Index Structure for Spatial Searching," Proceedings of ACM SIGMOD Conference, pp.47-57, 1984.
8 H. Lin and S. Chen "High Indexing Compression for Spatial Databases," Proceedings of the IEEE 8th International Conference on Computer and Information Technology Workshops, pp.20-25, 2008.
9 K. Chakrabarti and S. Mehrotra "The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces," Proceedings of the International Conference on Data Engineering, pp.440-447, 1999.