[x]
Posted via EE Mobile

Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again.

07/24/2009 at 02:38AM PDT, ID: 24597342
[x]
Attachment Details
[x]
The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

  • The Grade of the Solution
  • The Zone Rank of the Expert Providing the Solution
  • The Number of Author and Expert Comments
  • The Number of Experts Contributing
  • The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

4.6

SSAS 2008 and MDX:  What is the fastest way of segmenting a set in MDX?

Asked by carlkelley in OLAP, MS SQL Server

Tags: SSAS 2008 MDX

We have an SSAS 2008 cube that stores revenue by line-of-business (LOB) for each Company.  Each company will have revenue in a subset of LOBs.  We need to divide the set of all Companies into two sets:  
1.  Companies with at least one LOB that exceeds some cutoff and
2.  Companies that have no LOB with revenue that exceeds the cutoff.  
There is an [Organization] and an [LOB] dimension.  What MDX expression is the fastest way to segment the set of all Organizations into two sets by an arbitrary cutoff given that the set of selected LOBs may change?  I'm hoping that you can come up with something that is much faster than the following code snippet:
1:
2:
3:
4:
with
set [CompaniesWithRevenue] as NonEmpty([Company].[All].Children, [Measures].[LOB Revenue])
set [CompaniesAboveCutoff] as filter([CompaniesWithRevenue], Max(Existing [LOB].Members, [Measures].[LOB Revenue]) > CUTOFF)
set [CompaniesBelowCutoff] as ([CompaniesWithRevenue] - [CompaniesAboveCutoff] )
[+][-]07/24/09 12:37 PM, ID: 24938336

View this solution now by starting your 30-day free trial. Setting up your free trial is quick, easy, and secure. We will return you to this solution, unlocked, when you're done.

 

About this solution

Zones: OLAP, MS SQL Server
Tags: SSAS 2008 MDX
Sign Up Now!
Solution Provided By: agandau
Participating Experts: 1
Solution Grade: C
 
 
[+][-]07/25/09 02:30 AM, ID: 24941125

Often, when Experts are collaborating with members who have asked questions, they will request additional information about the problem. Askers respond with an author comment like this one.

Start your 30-day free trial to view this Author Comment or ask the Experts your question.

 
[+][-]07/28/09 12:46 PM, ID: 24964419

At Experts Exchange, members can ask their questions to thousands of technology professionals, also known as Experts. Experts compete and collaborate to answer those questions by leaving comments like this one.

Start your 30-day free trial to view this Expert Comment or ask the Experts your question.

 
[+][-]07/30/09 03:13 PM, ID: 24984854

Often, when Experts are collaborating with members who have asked questions, they will request additional information about the problem. Askers respond with an author comment like this one.

Start your 30-day free trial to view this Author Comment or ask the Experts your question.

 
 
Loading Advertisement...
20091111-EE-VQP-91 - Hierarchy / EE_QW_3_20080625