Abstract | ||
---|---|---|
OLAP provides an efficient way for business data analysis. However, most up-to-date OLAP tools often make the analysts lost in the sea of data while the analysts usually focus their interest on a subset of the whole dataset. Unfortunately, OLAP operators are usually not capsulated within the subset. What's more, the users' interests often arise in an impromptu way after the user getting some information from the data. In this paper, we give the definition of users' interests and propose the user-defined virtual cubes to solve this problem. At the same time, we present an algorithm to answer the queries upon virtual cube. All the OLAP operators will be encapsulated within this virtual cube without superfluous information retrieved. Experiments show the effectiveness and efficiency of the virtual cube mechanism. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1007/11780991_25 | NGITS |
Keywords | Field | DocType |
dynamic construction,up-to-date olap tool,user-defined virtual cube,virtual cube,superfluous information,virtual cube mechanism,whole dataset,olap operator,business data analysis,information retrieval,data analysis | Information system,Data mining,Data processing,Computer science,Greedy algorithm,Operator (computer programming),Impromptu,Online analytical processing,Database,Data cube,Cube | Conference |
Volume | ISSN | ISBN |
4032 | 0302-9743 | 3-540-35472-7 |
Citations | PageRank | References |
1 | 0.35 | 14 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dehui Zhang | 1 | 13 | 2.98 |
Shaohua Tan | 2 | 168 | 33.75 |
YANG Dong-Qing | 3 | 975 | 201.51 |
Shiwei Tang | 4 | 478 | 51.52 |
Xiuli Ma | 5 | 92 | 15.47 |
Lizheng Jiang | 6 | 3 | 2.46 |