Name
Abstract | ||
|---|---|---|
In this article, the authors propose to use the grid file to store multi-dimensional data cubes and answer range-sum queries. The grid file is enhanced with a dynamic splitting mechanism to accommodate insertions of data. It overcomes the drawback of the traditional grid file in storing uneven data while enjoying its advantages of simplicity and efficiency. The space requirement grows linearly with the dimension of the data cube, compared with the exponential growth of conventional methods that store pre-computed aggregate values for range-sum queries. The update cost is O(1), much faster than the pre-computed data cube approaches, which generally have exponential update cost. The grid file structure can also respond to range queries quickly. They compare it with an approach that uses the R*-tree structure to store the data cube. The experimental results show that the proposed method performs favorably in file size, update speed, construction time, and query response time for both evenly and unevenly distributed data. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.4018/jdm.2009062503 | JOURNAL OF DATABASE MANAGEMENT |
Keywords | Field | DocType |
Data Management,Data Structure,Multidimensional Database,Query Processing | Data mining,Clustering high-dimensional data,Computer science,Range query (data structures),Response time,File size,Grid file,Data cube,Cube,Exponential growth | Journal |
Volume | Issue | ISSN |
20 | 4 | 1063-8016 |
Citations | PageRank | References |
0 | 0.34 | 22 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wen-Chi Hou | 1 | 387 | 274.15 |
| Xiaoguang Yu | 2 | 0 | 0.34 |
| Chih-Fang Wang | 3 | 153 | 11.14 |
| Cheng Luo | 4 | 97 | 11.48 |
| Michael Wainer | 5 | 17 | 8.26 |