« first day (3671 days earlier)      last day (42 days later) » 

1:14 AM
@MaxVernon Thanks a lot for your kind words. I was involved in several time-consuming activities during the last year, but I'm planning on getting more involved in the near future as things become less hectic over here
2
Is there anything I can do to help in solving the top tags issue? I'd be glad to take part if possible
 
1:27 AM
I'm thinking about retagging one of the questions I answered and see what happens, as suggested in a comment in thejcolebrand's meta post...
 
 
3 hours later…
4:21 AM
Morning all
 
 
2 hours later…
6:28 AM
Dia dhaoibh a chairde - morning all! Well, some good on the science front - Fauci is back in the driving seat wrt. Covid in the States...
 
6:55 AM
Morning
@MDCCL welcome back
 
 
1 hour later…
8:11 AM
Morning
 
 
1 hour later…
9:18 AM
Morning
 
 
3 hours later…
11:51 AM
@Vérace for sure they must, otherwise durability would be tricky. Perhaps disk-oriented vs memory-oriented would be better classifiers? That said, I've read opinion that with sufficient replicas and geographic dispersal a purely RAM resident solution gives the same surety as disk-based system. Don't think I'll be trying it, though.
 
12:10 PM
@MichaelGreen Maybe have a Kinsey type scale from 0-5 (1 - exclusively disk --> 5 exclusively memory). You could have D-oriented (Dame...?) or M-oriented (Mr...?) and in dba circles one could ask "Are you M- or D-"? I don't think that marketing departments would be very keen on "Acually, I'm Bi-..." - sorry for the purple patch... chomping at the bit to get out for walk...
 
12:41 PM
@MDCCL did you try that?
 
Any SSAS specialists in here (@TomV) that could possibly provide a mathematical explanation for this question which I answered?
2
Q: cube and one example

Betty Anderssonif a data presented with 4-dimension in which each dimension is dependent to hierarchical 3-level aggregate like (country, city, street), then we can summarize it into 4096 ways ! we know for cube with n dimension in which none of dimension is hierarchical we have 2^n summarizing ways, but in th...

or even provide an answer in full?
 
@MaxVernon - doesn't appear to have worked - I can't see MDCCL's tags but I can see my own and yours. FWIW...
 
 
1 hour later…
2:04 PM
@Vérace yah depends on whether or not they edit tags on a question where they answered, and when they performed the edit. "Top Tags" are updated once per day, and may be based on recent contributions to the site.
 
2:27 PM
@mdoerators Who is allowed to post here:
It's been pretty silent in there for the last 8 years.
 
I don't think anyone is anymore. Blogs got discontinued. See here
 
Good morning.
@JohnK.N. I'm not a SSAS specialist but I somehow got a degree in math. I'll go look.
 
morning!
 
@bbaird Thank you.
@MaxVernon that's sad
 
2:44 PM
@JohnK.N. I must not be understanding the question - it doesn't seem like 4096 OR 256 is the right answer?
 
Well according to what OP wrote, 4096 is the correct answer.
OP wrote down a formula to calculate what she thought was right and added that to the question.
Looks a bit like a homework/studying question.
You might want to ask for clarification.
 
As each combination would need to contain unique elements (disregarding order), for a four-dimension array we would have: (), (A,B,C,D), (A), (B), (C), (D), (A,B), (A,C), (A,D), (B,C), (B,D), (C,D), (A,B,C), (A,B,D), (A,C,D), (B,C,D) which is 16
I haven't figured out the combinatorics yet, but it would seem at face value to be off
Which is 2^4
 
Sounds reasonable.
 
Oh, they are combining that with an existing 3 dimensional
 
:-)
Isn't the CUBE just 3-dimensional (year, month, week)?
 
2:54 PM
I think they're saying a 3 dimensional rollup
It's possible they're doing super wacky rollups say the rollup is A, B, C, the cube is D, E, F, G, then you could do bonkers ((A,B)D,A(G)) but I'm not sure that makes any sense?
If that's the case then I think I see how this might permutate
 
There are 4 independent dimensions, each with a rollup that has 8 possible combinations of choices of how it could be asked for. 8^4 = 4096
 
@CadeRoux They're not getting into the combinations of each level of a dimension, just the combination of dimensions.
 
There are usually an unknown combination of dimensions
How many years are loaded?
 
@CadeRoux This is a HW problem someone posted. Just trying to understand exactly what the question is asking.
 
3:12 PM
If you have a single hierarchichal triple-dimension (which itself internally is orthogonal), then there are 8 ways to ask to slice it - that's given in the diagram. And then you have 4 of those, so it's 8^4.
If instead you treat it as 12 dimensions (which it is), then there are sum_(n=0)^12 binomial(12, n) = 4096 way
 
(swears in combinatorics)
 
This statement is incorrect:

we know for cube with n dimension in which none of dimension is hierarchical we have 2^n summarizing ways, but in this case that each dimension has hierarchical 3-level aggregate have 4^4=256 ways.
 
this conversation would have been over faster if you just asked @ypercubeᵀᴹ
 
Or is it?
2^12 = 4096
That's right too, because all the dimensions are independent - even the "hierarchical" dimensions.
The binary power is just choosing which to include or not to include, so I guess that makes sense. Maybe Wolfram ALpha can just prove they are always the same.
 
I think I was getting stuck thinking there wouldn't be dumb permutations, but I think you're right
 
3:27 PM
Yup - It's probably some theorem long-proved.
 
Like, (City, State, Year),(City, Year, Month) which is ???? but technically possible
 
@CadeRoux that's assuming "choose" is a word, though ;)
 
@Lamak A math word
 
@bbaird Yeah, when I first looked at it, I was like, why do they offer (month, week) and (year, week) - that only makes sense if week is week of the year and then you got calendar year issues within months (assuming you haven't adopted some calendar like the Internation Fixed Calendar/Eastman/Cotsworth)
I have to switch brains and go to meeting. I will check back in and answer the question on SO if it hasn't already been closed/answered.
 
I need the name of this company so I never ever use them dba.stackexchange.com/questions/283783/…
I ran into someone at a SQL Saturday that worked for an insurance company that put all the policies into... Access databases. Of course, they would max out, so each year was its own Access database and... uh, like, we do things terrible but NOT THAT terrible.
 
4:01 PM
@JohnK.N. Seems like it might have been a good place to post musings (database related) that aren't directly relevant to the site (meta) or a question - or a longer treatise on a subject already discussed/answered? It appears to be dead/mort/muerto/marbh/holt/mrtav - pity... maybe in need of ressurection?
 
4:48 PM
@JohnK.N. Thank you very much :)
@MaxVernon I just edited one of the questions I answered a very long time ago. Let's see what happens
 
@MDCCL perfect
@Vérace this explains why they were shut down.
at the time of shutdown, our blog site hadn't been updated in over 5 years.
also, if anyone is interested in writing a blog post and doesn't have a blog setup, I could probably be convinced to add an author or two to mine at sqlserverscience.com
 
@MaxVernon I might take you up on that since I'm too lazy to start my own and add to the pile of blogs upon blogs
 
5:08 PM
@bbaird are you ok if I contact you via email?
 
Sure
 
5:22 PM
@bbaird Hi there. You have posted very interesting database design answers
 
Answered that dimension counting question
 
Morning!
 
5:43 PM
Morning
 

« first day (3671 days earlier)      last day (42 days later) »