OLAP query execution costs many minutes by its enormous data and OLAP query properties. On the other hand, MOLAP has fast responses. But it has a physical space limit to materialize all cells in possible combinations. Therefore, MOLAP is unsuited to analyze large data. In this paper, to provide not only flexibility and expandability of ROLAP but also the speediness of MOLAP, the cloud server architecture is proposed which shares clients’ cube cache by P2P and manages central index on cube data on P2P nodes. Also, volatile inquiry-cubes on servers become efficient when it is queried in local memory. The Cloud P2P OLAP is grafted onto hierarchical hybrid P2P for fast query results and multi-dimensional range query, so that the index loads are distributed and the performance is improved..
목차
Abstract 1. Introduction 2. Related Works 3. Cloud P2P OLAP 4. Experiments 5. Conclusion References
키워드
OLAPP2P. Cloud computingCube Index
저자
Nam Hun Park [ Dept. of Computer Science, Anyang Univ., Incheon, Korea ]
Kil Hong Joo [ Dept. of Computer Education, Gyeongin National Univ. of Education, Anyang, Korea ]
Corresponding Author
Jin Tak Choi [ Dept. of Computer Science, Incheon Univ., Incheon, Korea ]
보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Software Engineering and Its Applications
간기
월간
pISSN
1738-9984
수록기간
2008~2016
등재여부
SCOPUS
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.10 No.2