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.
The Frag-Shells Algorithm
- Partition set of dimension (A1,…,An) into a set of k fragments (P1,…,Pk).
-
Scan base table once and do the following
-
insert
into ID_measure table. -
for each attribute value ai of each dimension Ai
-
build inverted index entry
-
build inverted index entry
-
insert
-
For each fragment partition Pi
- build local fragment cube Si by intersecting tid-lists in bottom- up fashion.
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.