MySQL - Count call answered within certain ranges 0 to 10 sec, group by count -


i need count call answered within ranges 0 10 sec, 0 20 sec, etc. count increase while delta different count between current , next. % current count / final count total.

here sqlfiddle can use data testing: http://sqlfiddle.com/#!9/803d2/2

sample table of callsdetails: 

+-----+----------------+----------+----------+---------------+ | id  | callid         | callerno | duration | status        | +-----+----------------+----------+----------+---------------+ | 634 | 1479097551.228 | 1000     |        2 | complete      | | 635 | 1479102518.248 | 1000     |       12 | complete      | +-----+----------------+----------+----------+---------------+

expected result:

+------------------------+----------+----------+----------+ | ranges                 | count    | delta    |    %     |  +------------------------+----------+----------+----------+ | between 0 10 secs   |       44 | +44      |  84.62 % | | between 0 20 secs   |       48 | +4       |  92.31 % | | between 0 30 secs   |       50 | +2       |  96.15 % | | between 0 40 secs   |       51 | +1       |  98.08 % | | between 0 50 secs   |       51 | +0       |  98.08 % | | between 0 60 secs   |       51 | +0       |  98.08 % | | between 0 70 secs   |       51 | +0       |  98.08 % | | between 0 80 secs   |       52 | +1       | 100.00 % | | between 0 90 secs   |       52 | +0       | 100.00 % | | between 0 100+ secs |       52 | +0       | 100.00 % | +------------------------+----------+----------+----------+ total                            52

what able create below query, if can provide better solution, please advice. problem face (priority) not able count , (secondary) final count total (52) %, manually put in final count total (52). please help. 

select ranges,delta,round(delta/52*100,2) '%' (     select      (         if(duration<=10,'10',if(duration<=20,'20',if(duration<=30,'30',         if(duration<=40,'40',if(duration<=50,'50',         if(duration<=60,'60',if(duration<=70,'70',if(duration<=80,         '80',if(duration<=90,'90','100+'))))))))))          ranges,count(duration) delta         callsdetails         group ranges     ) group ranges;

current result:

+--------+-------+-------+ | ranges | delta | %     | +--------+-------+-------+ | 10     |    44 | 84.62 | | 20     |     4 |  7.69 | | 30     |     2 |  3.85 | | 40     |     1 |  1.92 | | 80     |     1 |  1.92 | +--------+-------+-------+

one way (using variable obtain cumulative sum, , using join intervals. @ last added join select count(*) obtain 52): 

select ran, tot_count, delta, round(tot_count/e.tot*100,2) '%' (select b.ran, a.ranges, coalesce(a.delta,0) delta       , @r:=@r+coalesce(a.delta,0) tot_count       (select (                     if(duration<=10,'10',if(duration<=20,'20',if(duration<=30,'30',                     if(duration<=40,'40',if(duration<=50,'50',                     if(duration<=60,'60',if(duration<=70,'70',if(duration<=80,                     '80',if(duration<=90,'90','100+'))))))))))                      ranges,count(duration) delta             callsdetails c             group ranges)         right join (select '10' ran, 1 ord union select '20', 2 ord union select '30', 3                 union select '40', 4 union select '50', 5 union select '60',6 union select '70',7                  union select '80',8 union select '90',9 union select '100+',10) b on a.ranges=b.ran         cross join (select @r:=0) t         order ord       ) d cross join (select count(*) tot callsdetails) e  ;

output:

ran tot_count   delta  % 10      44      44  84.62 20      48       4  92.31 30      50       2  96.15 40      51       1  98.08 50      51       0  98.08 60      51       0  98.08 70      51       0  98.08 80      52       1  100 90      52       0  100 100+    52       0  100

Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more