On formal methods of multidimensional databases.
Published: 2006
Language: eng
Number of pages: 162
ISBN-13: 9780494218013
Description: In order to extend the expressive power of the query language to relational completeness which is beyond that of the structured sets, we defined a typed functional query language. The OLAP data objects and query constructs are uniformly represented by functional symbols typed by a polymorphic record-based type system. In order to model the OLAP-specific query constructs, our type system differs in several ways from the existing type systems. We studied the type checking and type inference problem of our type system.The algebraic properties of the functions in the functional OLAP query language can be described as equations. We show that the OLAP related equations can be oriented into an infinite but finitely representable term rewrite system which is both terminating and confluent. The term rewrite system forms the basis of a complete algorithmic decision procedure for query equivalence with respect to the OLAP equational theory. We further show that this rewrite system can be used to solve an equational-theoretic version of the OLAP summarizability problem. Our solution to the OLAP summarizability problem covers cases which have not been dealt with by other work in summarizability.This thesis focuses on the formal aspects of Online Analytic Processing (OLAP) databases and the underlying data model, known as the multidimensional data model. We begin by studying the hierarchical and multidimensional structures of OLAP databases from a set-theoretic approach. We define structured sets to be sets equipped with alphabets which are interpreted to nested subsets. We demonstrate that structured sets can be used to model hierarchical dimensions and multidimensional data cubes. Moreover, OLAP selection queries of the data cubes can be seen as descriptions of subsets of structured sets. We define the minimal length description (MDL) problem of the structured sets, and study its computational complexity, tractability and the algorithmic solutions. The solution to the MDL problem is applied to OLAP selection query optimization and OLAP query results summarization.
Notes: Source: Dissertation Abstracts International, Volume: 68-01, Section: B, page: 0402.

Thesis (Ph.D.)--University of Toronto, 2006.

Electronic version licensed for access by U. of T. users.