Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

ROLAP optimization method for efficient multi-dimensional cache building

IP.com Disclosure Number: IPCOM000232462D
Publication Date: 2013-Nov-11
Document File: 4 page(s) / 84K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is a process that dynamically decides whether a multi-dimensional cache (cube) can be incrementally built with multiple relational queries or built as a whole with a single relational query. During incremental cache building, the same process also decides whether combining multiple cache building relational queries could have a negative performance impact.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 52% of the total text.

Page 01 of 4

ROLAP optimization method for efficient multi-dimensional cache building

Typically, a relational Online Analytical Processing (OLAP) database uses a local cache to avoid repeatedly querying against the underlying relational database. For performance reasons, many relational OLAP database cache members and cell values within a multi-dimensional cache (cube).

This cache can be built incrementally with multiple relational queries or built as a

whole using a single relational query. One approach might be best for some scenarios, while the other better fits different scenarios. Incrementally building a multi-dimensional cache (cube) might not be an efficient way because it can result in non-optimal relational database access.

Combining multiple relational queries into one query is an efficient way to reduce costly relational queries against underlying database. However, this approach often leads to data over-fetching and tends to generate complex relational queries. A

relational query's performance becomes exponentially worse when the complexity of the query increases. Data over-fetching impacts query performance because of processing unused data.

The solution is a process that dynamically decides whether a multi-dimensional cache (cube) can be incrementally built with multiple relational queries or built as a

whole with a single relational query. During incremental cache building, the same process also decides whether combining multiple cache building relational queries could have a negative performance impact.

The core idea is to evaluate a set of attributes of a relational OLAP query . Each attribute might have a positive or a negative performance impact on different multi-dimensional cache (cub...