MELIORATING MM CUBE TECHNIQUE
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2013, Vol 4, Issue 4
Abstract
In this paper I have analyzed and improved MM Cube Technique to better time-efficiency. MM Cube that compute Iceberg Cubes by factorizing the lattice space according to the frequency of values. This approach, different from all the previous dimension-based approaches where the importance of data distribution is not recognized, partitions the cube lattice into one dense subspace and several sparse Subspaces. MM-Cubing is efficient and achieves high performance over all kinds of data distribution compare to previous cube techniques. Shared array is used as Data Structure in existing MM Cube. In this paper I have presented MM cube with tree as Data Structure to improve Time-Efficiency. Tree is used Approiry Pruning Strategy which cut down the node, which doesn’t satisfy the Iceberg condition. So, it reduces traversal time, which minimizes cube computation time and such a way it tries to solve fundamental issue of efficient cube computation in Data Warehouse and OLAP System.
Authors and Affiliations
RIDDHI DHANDHA
Keywords
Related Articles
- EP ID EP98564
- DOI -
- Views 133
- Downloads 0
Different sanitization techniques to prevent inference attacks on social network data
In Current Time, Social Network has become one of the most Powerful Resources for people to connect to their friends and family members or etc. and also publish their sensitive Information. Some of the information in soc...
A NON-LINEAR SCHEME FOR PMEPR REDUCTION IN MC-CDMA SYSTEM
The main feature of the next-generation wireless systems will be the convergence of multimedia services such as speech, audio, video, image, and data. This implies that a future wireless terminal, by guaranteeing high sp...
Prime Generating Algorithms by Skipping Composite Divisors
Three elementary versions of simple prime generating sieves have already been improved by skipping even divisors other than 2. All composite integers are multiples of primes. Taking help of the transitivity property of d...
Elliptic Curve Public-Key Cryptosystem Over Z(i)
A method to implement elliptic curve public-key cryptosystem over Z(i) is discussed. The method is in fact the same as the technique that works on Galois fields but here works on Z(i). The curve under Z(i) generates more...
A Comparative Study on Different Types of Sorting Algorithms (On the Basis of C and Java)
Sorting is used for arranging the data in some sequence like increasing or decreasing order. I have discussed about various sorting algorithm with their comparison to each other in basis of time complexity and space comp...