Abstract
SkyCube-tree has been developed to realize efficient range query processing for Skyline Cube (SC). Apart from range queries, this paper demonstrates that SkyCube-tree can be made use of efficient group-by query processing, though it is originally designed to realize efficient range query processing. Since a group-by query for SC includes the entire dataset as its processing range, the query processing time is potentially large. From the experimental evaluation, the followings are clarified: 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
