Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
General Heuristics (Agarwal et al. VLDB’96)
- Sorting, hashing, and grouping operations are applied to the dimension attributes in order to reorder and cluster related tuples
- Aggregates may be computed from previously computed aggregates, rather than from the base fact table
- Smallest-child: computing a cuboid from the smallest, previously computed cuboid
- Cache-results: caching results of a cuboid from which other cuboids are computed to reduce disk I/Os
- Amortize-scans: computing as many as possible cuboids at the same time to amortize disk reads
- Share-sorts: sharing sorting costs cross multiple cuboids when sort-based method is used
- Share-partitions: sharing the partitioning cost across multiple cuboids when hash-based algorithms are used
Speaker notes:
Content Tools
Tools
Sources (0)
Tags (0)
Comments (0)
History
Usage
Questions (0)
Playlists (0)
Quality
Sources
There are currently no sources for this slide.