Multi-dimensional database and data cube compression for aggregate query support on numeric dimensions
AssigneeMicrosoft Corporation
InventorsUsama Fayyad, Jayavel Shanmugasundaram
Life of this patent
Estimating the term…
Loading patent…
AssigneeMicrosoft Corporation
InventorsUsama Fayyad, Jayavel Shanmugasundaram
Estimating the term…
An apparatus and method for efficiently compressing contents of a database system to support ad hoc querying and OLAP type aggregation queries. This invention consists of a new compressed representation of the data cube that (a) drastically reduces storage requirements, (b) does not require the discretization hierarchy along each query dimension to be fixed beforehand and (c) treats each dimension as a potential target measure and supports multiple aggregation functions without additional storage costs. The tradeoff is approximate, yet relatively accurate, answers to queries. We outline mechanisms to reduce the error in the approximation. Our performance evaluation indicates that our compression technique effectively addresses the limitation of existing approaches. The basic method relies on representing the contents of the database by a probability distribution consisting of a mixture of Gaussians. Aggregation queries, be they multi-dimensional, conjunctive, or disjunctive, can be answered by performing integration over the probability distribution.
A method of querying a database containing data records stored in the database comprising the steps of:
Apparatus for querying a database containing data records comprising:
Data mining apparatus for querying a database containing data records comprising:
A method of counting data records containing continuous attributes that are stored in the database;
A computer-readable medium having computer executable instructions for performing steps comprising:
A database management system for querying a database containing data records comprising:
Dependencies are inferred from the claim text.