I saw that you both seem to have the same problem questions, and was just curious if during your research you found an explanation as to how the algorithms deployed on sparse cubes to manage their empty cells specifically work? Is there a standard amount in how much they are able to compact the empty space? Is there a benchmark performance improvement that they are required or able to hit? Just some of the many questions I have in regard to how they are utilized. I realize a lot of this will be dependent on a number of parameters but thought I would ask anyway. Thank you both for the informative posts!