Open Access
Lecture Notes in Computer Science, pages 61-75
Hierarchical Data Cube for Range Queries and Dynamic Updates
Publication type: Book Chapter
Publication date: 2003-01-01
Journal:
Lecture Notes in Computer Science
Q2
SJR: 0.606
CiteScore: 2.6
Impact factor: —
ISSN: 03029743, 16113349, 18612075, 18612083
Abstract
A range query is a very popular and important operation on data cube in data warehouses. It performs an aggregation operation (e.g., SUM) over all selected cells of an OLAP data cube where the selection is specified by providing ranges of values for dimensions. Several techniques for range sum queries on data cubes have been introduced recently. However, they can incur update costs in the order of the size of the data cube. Since the size of a data cube is exponential in the number of its dimensions, updating the entire data cube can be very costly and not realistic. To solve this problem, an effective hierarchical data cube (HDC for short) is provided in this paper. The analytical and experimental results show that HDC is superior to other cubage storage structures for both dynamic updates and range queries.
Found
Found
Top-30
Journals
|
1
|
|
|
Journal of Computer Science and Technology
1 publication, 33.33%
|
|
|
Lecture Notes in Computer Science
1 publication, 33.33%
|
|
|
AIP Conference Proceedings
1 publication, 33.33%
|
|
|
1
|
Publishers
|
1
2
|
|
|
Springer Nature
2 publications, 66.67%
|
|
|
AIP Publishing
1 publication, 33.33%
|
|
|
1
2
|
- We do not take into account publications without a DOI.
- Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
Cite this
GOST |
RIS |
BibTex
Cite this
GOST
Copy
Li J. et al. Hierarchical Data Cube for Range Queries and Dynamic Updates // Lecture Notes in Computer Science. 2003. pp. 61-75.
GOST all authors (up to 50)
Copy
Li J., Gao H. Hierarchical Data Cube for Range Queries and Dynamic Updates // Lecture Notes in Computer Science. 2003. pp. 61-75.
Cite this
RIS
Copy
TY - GENERIC
DO - 10.1007/978-3-540-39403-7_7
UR - https://doi.org/10.1007/978-3-540-39403-7_7
TI - Hierarchical Data Cube for Range Queries and Dynamic Updates
T2 - Lecture Notes in Computer Science
AU - Li, Jianzhong
AU - Gao, Hong
PY - 2003
DA - 2003/01/01
PB - Springer Nature
SP - 61-75
SN - 0302-9743
SN - 1611-3349
SN - 1861-2075
SN - 1861-2083
ER -
Cite this
BibTex (up to 50 authors)
Copy
@incollection{2003_Li,
author = {Jianzhong Li and Hong Gao},
title = {Hierarchical Data Cube for Range Queries and Dynamic Updates},
publisher = {Springer Nature},
year = {2003},
pages = {61--75},
month = {jan}
}