SkyCube-tree based query processing in OLAP skyline cubes
Hideki Sato, Takayuki Usami · 2017
Skyline Cube (SC) has been proposed as an extension of Data Cube by using the skyline operator. Although both range queries and group-by queries are useful for decision making support, they impose much burdens upon a query processing system. To cope with the difficulty, this paper presents efficient query processing methods for both type of queries. It is relied on SkyCube-tree, R-tree like hierarchical index structure, which organizes precomputed extended skyline information for processing queries efficiently. According to the performance evaluation, the query processing time for range queries and group-by queries is under 20% and 10% respectively compared with that of each corresponding materialized view based method, within allowable storage size of SkyCube-tree.