Acknowledgement
This research was supported by a grant (07KLSGC05) from Cutting-edge Urban Development - Korean Land Spatialization Research Project funded by Ministry of Construction & Transportation of Korean government.
Proceedings of the Korea Information Processing Society Conference (한국정보처리학회:학술대회논문집)
- 2008.11a
- /
- Pages.332-335
- /
- 2008
- /
- 2005-0011(pISSN)
- /
- 2671-7298(eISSN)
DOI QR Code
1H*-tree: An Improved Data Cube Structure for Multi-dimensional Analysis of Data Streams
1H*-tree: 데이터 스트림의 다차원 분석을 위한 개선된 데이터 큐브 구조
- XiangRui Chen (Dept. of Computer Science and Information Engineering, Inha University) ;
- YuXiang Cheng (Dept. of Computer Science and Information Engineering, Inha University) ;
- Yan Li (Dept. of Computer Science and Information Engineering, Inha University) ;
- Song-Sun Shin (Dept. of Computer Science and Information Engineering, Inha University) ;
- Dong-Wook Lee (Dept. of Computer Science and Information Engineering, Inha University) ;
- Hae-Young Bae (Dept. of Computer Science and Information Engineering, Inha University)
- 심상예 (인하대학교 컴퓨터정보공학과) ;
- 정우상 (인하대학교 컴퓨터정보공학과) ;
- 이연 (인하대학교 컴퓨터정보공학과) ;
- 신승선 (인하대학교 컴퓨터정보공학과) ;
- 이동욱 (인하대학교 컴퓨터정보공학과) ;
- 배혜영 (인하대학교 컴퓨터정보공학과)
- Published : 2008.11.14
Abstract
In this paper, based on H-tree, which is proposed as the basic data cube structure for multi-dimensional data stream analysis, we have done some analysis. We find there are a lot of redundant nodes in H-tree, and the tree-build method can be improved for saving not only memory, but also time used for inserting tuples. Also, to facilitate more fast and large amount of data stream analysis, which is very important for stream research, H*-tree is designed and developed. Our performance study compare the proposed H*-tree and H-tree, identify that H*-tree can save more memory and time during inserting data stream tuples.
Keywords