250 reputation
210
bio website linkedin.com/in/bjansen
location Netherlands
age 28
visits member for 2 years, 2 months
seen Feb 14 at 22:21
  • Consultant @ Veneficus
  • Interested in the combination of Finance and Computer Science
  • Building Web2Docx, if you have tips or ideas, please let know

May
21
awarded  Constituent
May
21
awarded  Caucus
Apr
11
awarded  Popular Question
Jan
23
awarded  Yearling
Nov
25
awarded  Autobiographer
Nov
21
accepted Selecting Without Repititions
Nov
20
asked Selecting Without Repititions
Jun
8
awarded  Caucus
Apr
28
accepted Fast general method to calculate percentiles
Apr
26
awarded  Self-Learner
Apr
26
awarded  Teacher
Apr
26
revised Fast general method to calculate percentiles
Anonymized further
Apr
26
answered Fast general method to calculate percentiles
Apr
26
comment Fast general method to calculate percentiles
I had not, many thanks.
Apr
26
asked Fast general method to calculate percentiles
Jan
25
comment Efficiently finding distinct values
In this case this solution has the added benefit that it's much more efficient if there is only a sorted index on (month, year, number) instead of a unique constraint. Of course YMMV.
Jan
24
comment Efficiently finding distinct values
Thanks, +1. A nice alternative.
Jan
24
revised Efficiently finding distinct values
Improved flow of the question.
Jan
23
comment Efficiently finding distinct values
The statement is pretty long and I'm not familiar with all the idioms (my background is CRUD MySQL apps). I had to look up with m as and the decode function. With some Googling I managed OK. So you're answer is really fine, I just missed some basic knowledge. I do wonder why the database can't optimize the query by itself. I imagine a binary tree starting with month and then year. Checking which (month, year) tuples exist seems so easy.
Jan
23
awarded  Supporter