현재 위치
Home
Ag+-tree : an Index Structure for Range-aggregation Queries in Data Warehouse Environments
-
- 발행기관
- 보안공학연구지원센터(IJDTA) 바로가기
-
- 간행물
- International Journal of Database Theory and Application 바로가기
-
- 통권
- vol.4 no.2 (2011.06)바로가기
-
- 페이지
- pp.51-64
-
- 저자
-
- 언어
- 영어(ENG)
-
- URL
- https://www.earticle.net/Article/A147696
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
- 영어
- Range-aggregate queries are popular in many applications in data warehouse environments with large business relational databases. To evaluate these efficiently, several studies on data cubes (such as the aggregate cubetree) have been carried out. In the well-known aggregate cubetree, each entry in every node stores the aggregate values of its corresponding subtree. Therefore, range-aggregate queries can be processed without visiting the child subtree whose nodes are all fully included in the query range. However, the aggregate cubetree does not consider range queries using partial dimensions and range queries without aggregation operations. Concretely, 1) a great deal of information that is irrelevant to the queries also has to be read from the disk for partial-dimensional range queries, and 2) while it improves the performance of range queries with aggregate operations, it degrades the performance of range queries without aggregate operations. As part of our research on this problem, previously we proposed an index structure, called the Aggregate-tree (denoted as Ag-tree), which does away with the above-mentioned weaknesses of the aggregate cubetree. Additionally in this paper, we make the Ag-tree more complete by sorting the entries in each of the nodes. The final index structure proposed in this study is called an Ag+-tree.
목차
Abstract
1. Introduction
2. Related Works
3. Our Proposal
3.1 General Structure
3.2 Sorting Entries in Each Node
3.3 Algorithms
3.4 Performance Discussion: Ag+-tree vs. Aggregate Cubetree
3.5 Performance Discussion: Ag+-tree vs. R*-tree
4. Experiments
4.1 Range Queries without Aggregate Operations
4.2 Range Queries with Aggregate Operations
5. Conclusion
References
키워드
Range-aggregate query; Multi-dimensional index; Range query; Aggregation operation저자
간행물 정보
발행기관
-
- 발행기관명
- 보안공학연구지원센터(IJDTA) [Science & Engineering Research Support Center, Republic of Korea(IJDTA)]
- 설립연도
- 2006
- 분야
- 공학>컴퓨터학
- 소개
- 1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업
간행물
-
- 간행물명
- International Journal of Database Theory and Application
- 간기
- 격월간
- pISSN
- 2005-4270
- 수록기간
- 2008~2016
- 십진분류
- KDC 505 DDC 605
이 권호 내 다른 논문 / International Journal of Database Theory and Application vol.4 no.2
피인용수 : 0건 (자료제공 : 네이버학술정보)
함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.
출처 : 네이버학술정보
0개의 논문이 장바구니에 담겼습니다.