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.

Shell Fragment Cubes: Size and Design

  • Given a database of T tuples, D dimensions, and F shell fragment size, the fragment cubes’ space requirement is:
    \[ O\left ( T\left \lceil \frac{D}{F} \right \rceil(2^{F}-1) \right ) \]  
    • For F < 5, the growth is sub-linear
  • Shell fragments do not have to be disjoint
  • Fragment groupings can be arbitrary to allow for maximum online performance
    • Known common combinations (e.g., ) should be grouped together.
  • Shell fragment sizes can be adjusted for optimal balance between offline and online computation 

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.