2016 | OriginalPaper | Chapter
SkyCube-Tree Based Group-by Query Processing in OLAP Skyline Cubes
Authors : Hideki Sato, Takayuki Usami
Published in: Intelligent Interactive Multimedia Systems and Services 2016
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
-
The size of SkyCube-trees is sufficiently allowable, since it is at most 2.5 times as large as that of materialized view.
-
The time of SkyCube-tree based sequential processing is nearly equal to that of materialized view based one, regardless of its dedication to range query processing.
-
The time of SkyCube-tree based parallel processing is comparatively small and stable. Even though cell-granularity is over 80 \(\%\), its processing time is around 10 \(\%\) of that of materialized view based one.