2016 | OriginalPaper | Buchkapitel
SkyCube-Tree Based Group-by Query Processing in OLAP Skyline Cubes
verfasst von : Hideki Sato, Takayuki Usami
Erschienen in: Intelligent Interactive Multimedia Systems and Services 2016
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.