Displaying Dynamic Data using Sysdate - Oracle SQL -


is possible return fno column results data when data in column null?

current code:

select a.sno, a.tcode, a.fno airplane a, scheduled_flight s a.fno = s.fno or sdt >= trunc(sysdate);

example output oracle sql:

sno     tcode                          fno ------- ------------------------------ ------- 0000001 a320 0000002 a320                           va12190 0000003 a330                           va82716 0000004 a330                           va82723 0000005 a330                           va82722 0000006 a330                           va82123 0000007 a330 0000001 a320 0000002 a320                           va12190 0000003 a330                           va82716 0000004 a330                           va82723  sno     tcode                          fno ------- ------------------------------ ------- 0000005 a330                           va82722 0000006 a330                           va82123 0000007 a330 0000001 a320 0000002 a320                           va12190 0000003 a330                           va82716 0000004 a330                           va82723 0000005 a330                           va82722 0000006 a330                           va82123 0000007 a330 0000002 a320                           va12190  sno     tcode                          fno ------- ------------------------------ ------- 0000004 a330                           va82723 0000006 a330                           va82123

i want display results in flight number (fno) column flights scheduled today. other flights, not scheduled today, should return null value in fno column, whilst still listing flights. appreciated new sql.

edit: output when removing where sdt >= trunc (sysdate); show sno below fno of sno 0000003 , 0000005. not other flights not scheduled today.

sql> select a.sno, a.tcode, a.fno   2    airplane left outer join scheduled_flight s on a.fno = s.fno;  sno     tcode                          fno ------- ------------------------------ ------- 0000001 a320 0000002 a320                           va12190 0000003 a330                           va82716 0000004 a330                           va82723 0000005 a330                           va82722 0000006 a330                           va82123 0000007 a330  7 rows selected.

edit 2: 

 select a.sno, a.tcode, a.fno   2    airplane left outer join scheduled_flight s on a.fno = s.fno   3   , sdt >= trunc (sysdate)   4   order a.sno;  sno     tcode                          fno ------- ------------------------------ ------- 0000001 a320 0000002 a320                           va12190 0000003 a330                           va82716 0000004 a330                           va82723 0000005 a330                           va82722 0000006 a330                           va82123 0000007 a330

edit 3: display following.

sno     tcode                          fno ------- ------------------------------ ------- 0000001 a320 0000002 a320                            0000003 a330                           va82716 0000004 a330                            0000005 a330                           va82722 0000006 a330                            0000007 a330

edit 4: can group sdt , show fno shown sdt's?

sno     tcode                          fno     sdt ------- ------------------------------ ------- -------------------- 0000001 a320 0000002 a320                           va12190 0000003 a330                           va82716 11/sep/2017 21:59:00 0000004 a330                           va82723 0000005 a330                           va82722 11/sep/2017 14:00:00 0000006 a330                           va82123 0000007 a330

you must use left join

select a.sno, a.tcode,s.fno     airplane left outer join scheduled_flight s on a.fno = s.fno

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