Hyper-lattice model for optimized sequencing of online analytical processing (OLAP) operations on data warehouses
AssigneeUniversity of Calcutta
InventorsNabendu Chaki, Soumya Sen
Life of this patent
Estimating the term…
Abstract
Systems and methods are provided for Online Analytical Processing of data included within data warehouses. According to one example, a method for adding a dimension to a hyper-lattice structure is provided and includes adding a new base cuboid to a hyper-lattice that describes functionality of the data warehouses. According to another example, a method for determining an optimal path through an existing hyper-lattice by which to generate a destination cuboid from a source cuboid is also provided.
Claims16
A non-transitory computer readable storage medium (CRM) having instructions stored thereon, which when executed by a computing device, causes the computing device to perform functions, the functions comprising:
- in a hyper-lattice representation of possible cuboid dimension patterns, determining a set of intermediate cuboids, which represent data summarized on dimensions, that may be generated from a source cuboid in the hyper-lattice,
- wherein the hyper-lattice comprises two or more base cuboids at the lowest level of summarization,
- wherein at least one dimension pattern of the possible cuboid dimension patterns corresponds to a first base cuboid and at least one other dimension pattern of the possible cuboid dimension patterns corresponds to the first base cuboid and a second base cuboid, and
- wherein the hyper-lattice is formed by merging the at least one dimension pattern with the at least one other dimension pattern of the possible cuboid dimension patterns;
- determining which intermediate cuboids in the set are summarized on at least the same dimensions as a destination cuboid in the hyper-lattice;
- calculating a size of each intermediate cuboid in the set that is summarized on at least the same dimensions as the destination cuboid in the hyper-lattice;
- determining, based on the calculated sizes, a given intermediate cuboid that has a smallest size;
- and
- determining, as an optimal path through the hyper-lattice to the destination cuboid from the source cuboid, a path that includes at least the given intermediate cuboid.
An online analytical processing (OLAP) server comprising:
- a computing device;
- memory storage coupled to the computing device;
- and
- instructions stored in the memory storage, which when executed by the computing device, cause the computing device to carry out operations, the operations comprising:
- determining an optimal path through a hyper-lattice for which to generate a destination cuboid from a source cuboid, the hyper-lattice representing possible cuboid dimension patterns, wherein the optimal path includes one or more intermediate cuboids,
- wherein the hyper-lattice comprises two or more base cuboids at the lowest level of summarization,
- wherein at least one dimension pattern of the possible cuboid dimension patterns corresponds to a first base cuboid, and at least one other dimension pattern of the possible cuboid dimension patterns corresponds to the first base cuboid and a second base cuboid, and
- wherein the hyper-lattice is formed by merging the at least one dimension pattern with the at least one other dimension pattern of the possible cuboid dimension patterns;
- generating the destination cuboid via the determined optimal path;
- and
- providing to a client device, a representation of the generated destination cuboid.
Dependencies are inferred from the claim text.