zoukankan      html  css  js  c++  java
  • BWAbout Hierarchy

     

    1)Hierarchy Type

     

    Hierarchy Type

    Description

    Hierarchy definition for characteristics

    Characteristic hierarchy

    Characteristic values of a characteristic in a tree structure. Characteristic hierarchies are stored in their own data tables. Like master data, they can be used in all InfoProviders.

    Example: Hierarchy of cost centers that are assembled in cost center groups.

    Determining hierarchical structures in InfoCube modeling

    In the dimensions of an InfoCube

     

    Example: Time dimension. The definitions of InfoObjects 0CALDAY, 0CALMONTH, and 0CALYEAR form a hierarchy.

    Example: 04.09.2003 ® 04.2003 ® 2003

    Specification of hierarchical structures in InfoCube maintenance

    In the attributes of a characteristic

    Example: The definitions of InfoObjects 0MATERIAL, 0MATL_GROUP, 0MATL_TYPE, and 0IND_SECTOR form a hierarchy.

    To use attributes in the query as hierarchy levels, they have to be defined as navigation attributes.

    2)Comparison of modeling in different hierarchical structures

    Characteristic Hierarchy

    Hierarchical Structures in InfoCube Dimensions or DataStore Objects

    Hierarchical Structures in Attributes Characteristics

    As Posted view is not possible.

    Different views (such as version, key date) of the data are possible.

    As Posted view is possible.

    As Posted view is not possible.

    Different data views are not possible. Exception: The view for the key date is possible if the characteristic or respective attributes are time dependent.

    Cross-InfoProvider

    Only valid for an InfoProvider

    Cross-InfoProvider, because it is modeled in the master data.

    Changeable

    Not changeable, unless you reload the InfoProvider.

    Changeable (with master data changes or with the addition of attributes).

    Drill-down path is defined by the structure.

    Drill-down path is not defined by the structure. Levels can therefore be skipped.

    Drill-down path is not defined by the structure. Levels can therefore be skipped.

    Duplicate leaves are always displayed.

    Duplicate leaves are only possible in As Posted view.

    Duplicate leaves are not possible.

    Balanced and unbalanced hierarchies are possible.

    Hierarchy structures have to be balanced.

    Hierarchy structures have to be balanced.

    注意点:

    A hierarchy can contain 50,000-100,000 leaves at most. If your hierarchy is larger, you should insert a level that is used as a navigation attribute or preferably as a separate characteristic in the dimension table.

  • 相关阅读:
    [算法]位运算问题之二
    [算法]位运算问题之一
    [算法]海量数据问题之二
    [算法]海量数据问题之一
    [算法]旋转词问题
    [算法]去掉字符串中连续出现的k个0子串
    [算法]字符串中数字子串的求和
    [算法]字符串之变形词问题
    Linux常用命令
    数据库中的事物
  • 原文地址:https://www.cnblogs.com/xiaomaohai/p/6157053.html
Copyright © 2011-2022 走看看