企业绩效管理网

 找回密码
 立即注册

QQ登录

只需一步,快速开始

查看: 782|回复: 2

Peformance of a rule within a cube vs across cubes

[复制链接]

67

主题

416

帖子

566

积分

高级会员

Rank: 4

积分
566
发表于 2014-6-16 14:13:01 | 显示全部楼层 |阅读模式
Just wondering if there is a performance hit when using a rule that crosses a cube vs a rule that works within the same cube?

The example here might by a driver based planning cube where the drivers could exist in a separate cube vs within the same cube. Just wondering as many times we keep the drivers separate from the output so that you have a clean "Reporting" cube.
回复

使用道具 举报

86

主题

415

帖子

604

积分

高级会员

Rank: 4

积分
604
QQ
发表于 2014-6-16 15:15:25 | 显示全部楼层
The significant difference is between ['item'] style references and DB( ... ) references. You have to use DB for inter-cube references but you also have to use them when referencing string cells in the same cube and when the source position in the same cube is variable and dependent on the target, e.g. "previous period" or "hierarchical parent". I have seen a performance difference of 3:1 between DB and [] in some cases (with [] being faster), although I do not know how this ratio varies with the dimensionality.
回复 支持 反对

使用道具 举报

91

主题

437

帖子

644

积分

高级会员

Rank: 4

积分
644
QQ
发表于 2014-6-16 15:47:41 | 显示全部楼层
So the question would be if you took a simple example

A = B x C as your calc

If B and C came from another cube with the same dimensionality using a DB function would there be a performance difference?  Under the hood is there overhead to a DB function or is it only self created when you add calculations and dynamic referneces to determine elements within the DB?
回复 支持 反对

使用道具 举报

您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

QQ|手机版|小黑屋|企业绩效管理网 ( 京ICP备14007298号   

GMT+8, 2021-10-20 01:25 , Processed in 0.108952 second(s), 11 queries , Memcache On.

Powered by Discuz! X3.1 Licensed

© 2001-2013 Comsenz Inc.

快速回复 返回顶部 返回列表