SQL Server Express 2012: cannot select data from table in server instance -


i have strange issue in server instance of dev machine:

i have view called vwaktivespieler (active players), having miid (pk), name, surname, etc. provides members tbl members joined tbl function. can open view, shows me correct players, having function=1.

i have tbl 'mitgliedsbeitraege' (member fees), id (pk), miid (int) , description of fee (nvarchar(max)). when run query

select vwaktivespieler.miid, vwaktivespieler.nname + ' ' +[mannschaft] nname vwaktivespieler     inner join mitgliedsbeitraege on vwaktivespieler.miid = mitgliedsbeitraege.miid (mitgliedsbeitraege.beitragstext 'einschreibgebühr%')

i 1 record!! sure tbl 'mitgliedsbeitraege' holds 120 records beitragstext 'einschreibgebühr%'. because when avoid using view , use tbl members joined tbl function instead , join tbl 'mitgliedsbeitraege' correct result.

when run above query on production machine members payed fee!!! must say, on dev machine there exact copy of data production machine.

it seems, view cannot joined correctly on dev machine reason. have absolutely no explanation that, , have spent hours , hours find problem.

never before had issue other databases. use views "preselections" quiet often. checked collaction , settings, cannot find difference between dev machine , prod machine instance.

i deleted view , created new. selection beitragstext of fee, such "training" correct(!) records on both machines.

any idea? michael


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