Many to many with multiple rows in SQL Server -


i have table containing following columns:

seq_no | detail_no |user_id |guid_key

and table following:

header| guid_key| date_entered| login_details| summary_transaction| trailer

now wish map 2 tables such final answer way:

the first row should value header , subsequent rows should values seq_no, detail_no , user_id. there multiple rows of seq_no, detail_no , user_id. last row should trailer.

the first table contains multiple rows need referenced multiple rows in second table. i'm new sql programming. i've looked many-many relationships unable find efficient way this. using guid generator write unique keys both tables. however, key not unique per row rather set of rows--> set of data.

this how want be

sql not presentation tool you're trying achieve here. you're trying make 2 results sets present 1 result set (you want columns table 1 on rows on columns table 2 on others). 

create table #temp (id int identity(1,1), col1 varchar(200), col2 varchar(200) etc.)  insert #temp col1, col2, etc values (select seq_no, guid_key, detail_no, user_id table1)  insert #temp col1, col2 etc. values (select seq_no, guid_key, header,  date_entered, login_details, summary_transaction table1 inner join table2 on table1.guid_key = table2.guidkey trailer null)  insert #temp col1, col2 etc. values (select seq_no, guid_key, trailer,  date_entered, login_details, summary_transaction table1 inner join table2 on table1.guid_key = table2.guidkey trailer not null)  select * #temp order col1, id

so enter headers first followed detail, followed trailer. when order seq_no , id come out in order desired.


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