sql - Append from dynamic temp table -


this question might have been asked before, i've spent considerable time looking answer withouth success... because i'm quite new @ this, answer might there, fail identify it.

i raw data in csv showing me times our agents spent on statuses (break, email, meeting, lunch, ...). there column each status.

i import csv temporary tabel in access, append master table. have several times day.

the problem is, in morning, if none of agents went on lunch status, column not in csv file.the columns there if used. thus, when try append it, give error , ask parameter value column.

this append code in access:

insert t0_reason_codes ( [date], agent, [agent first name], [agent last name], [agent email], [hour], [break / agent state time], [casenotes / agent state time], [email / agent state time], [lunch / agent state time], [project / agent state time], [remote session / agent state time], [training / agent state time] )  select q0_reason_codes.date, q0_reason_codes.agent, q0_reason_codes.[agent first name], q0_reason_codes.[agent last name], q0_reason_codes.[agent email], q0_reason_codes.hour, q0_reason_codes.[break / agent state time], q0_reason_codes.[casenotes / agent state time], q0_reason_codes.[email / agent state time], q0_reason_codes.[lunch / agent state time], q0_reason_codes.[project / agent state time], q0_reason_codes.[remote session / agent state time], q0_reason_codes.[training / agent state time]  q0_reason_codes left join t0_reason_codes on (q0_reason_codes.[date] = t0_reason_codes.[date]) , (q0_reason_codes.[hour] = t0_reason_codes.[hour]) , (q0_reason_codes.[agent] = t0_reason_codes.[agent])  (((([t0_reason_codes].[date] null) , [t0_reason_codes].[agent] null , [t0_reason_codes].[hour]) null));

the workaround can think of is, in excel write script checks if column exists , create if not.

are there better ways this?


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