Tree - Balanced and unbalanced

Data System Architecture

About

In a balanced tree (balanced/standard), the branches of the tree all descend to the same level, with each member's parent being at the level immediately above the member. A common example of a balanced hierarchy is one that represents time, where the depth of each level (year, quarter, and month) is consistent.

Unbalanced

A tree where the leaves do not have the same depth.

For example, an organization might choose to have data for the current month at the day level, data for the previous year at the month level, and data for the previous five years at the quarter level.

Unbalanced hierarchies include levels that have a consistent parent-child relationship, but have logically inconsistent levels. The hierarchy branches can also have inconsistent depths. An example of an unbalanced hierarchy is an organization chart, which shows reporting relationships among employees in an organization. The levels within the organizational structure are unbalanced, with some branches in the hierarchy having more levels than others.

In an unbalanced hierarchy, null values can appear on the lower levels of the hierarchy. A parent member's children will always be at a level below that of the parent. In this hierarchy, the levels do not provide a meaningful context to its members - Washington DC is at the same level as CA in this example. A better example of an unbalanced hierarchy might be an organizational chart.

Level 1 Level 2 Level 3
USA CA San Francisco
USA CA Los Angeles
USA Washington DC <NULL>
Vatican City Vatican City <NULL>





Discover More
Star Schema
Dimensional Data Modeling - Hierarchy

in dimensional data modeling A hierarchy is a set of levels having many-to-one relationships between each other, and the set of levels collectively makes up a dimension in the form of a tree (A tree...
Obiee Essbase Unbalanced Hierarchy
Essbase

Cube scope: Member attributesunbalanced hierarchies“”“”hierarchy columnattribute column Support...
Data System Architecture
Index - Btree structure (Balanced Tree)

BTree indexes : has a tree structure provides fast access, by key, to an individual row or range of rows normally requiring few reads to find the correct row are similar in implementation to a...



Share this page:
Follow us:
Task Runner