Browse Prior Art Database

Method And System For Representing Hierarchies Using A Stacked Tree Model

IP.com Disclosure Number: IPCOM000194923D
Publication Date: 2010-Apr-14
Document File: 2 page(s) / 67K

Publishing Venue

The IP.com Prior Art Database

Abstract

A method and system for representing hierarchies using a stacked tree model is disclosed. The tree model improves the aggregation and query performance in an Online Analytical Processing (OLAP) system and also improves the performance of editing hierarchies, such as element inserting and element deleting.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 55% of the total text.

Page 1 of 2

Method And System For Representing Hierarchies Using A Stacked Tree Model

Disclosed is a method and system for representing hierarchies using a stacked tree model. The method and system involves creating an aggregation tree or a calculation tree using children tree of an element.

A children tree is a stacked tree wherein the first

level tree in the stacked tree is used to store the elements of a hierarchy keyed by their 32-bit unique index. The second level tree in the stacked tree is used to store an element's children, keyed by their 32-bit unique index. Tree data cells are used to store the element weight in the hierarchy. The element in a dimension can have different

weight values under different hierarchies. Figure 1 illustrates a children stacked tree.

The calculation tree is used in the aggregation calculation in an Online Analytical Processing (OLAP) system.

Figure 1

On creating the aggregation tree, the default-hierarchy elements are shared using elements overlay.

which include leaf and consolidation elements in

the default hierarchy, can be shared in the hierarchies of a dimension. The consolidation elements that are created for a hierarchy are not shared.

allowed to contain consolidation elements unique to the hierarchy. The memory for these consolidation elements is released when the hierarchy is destroyed.

All the

elements that belong to a hierarchy are added to a dimension global element map keyed by their 32-bit index. Thus, sharing of default hier...