#apache #archlinux #asterisk #centos #debian #gentoo #haskell #kde #kubuntu #lisp #math #mysql #perl #python #ruby-lang #rubyonrails #suse #ubuntu #vim #wikipedia 0 1 2 3 4 5 6 7 8 9 10
Top Prev 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 Next
#mysql
<CicciuxLa> Yes... I am trying that now...
<joeljkp> i'm trying to find a quick way to dump a list of databases, tables, and row counts for a given server; any suggestions?
<CicciuxLa> http://rafb.net/p/XLrlUl98.html
<Xgc> CicciuxLa: You can think of your logic in this form: SELECT ... FROM t1 LEFT JOIN (SELECT * FROM t2 WHERE fz='blah') t2 ON t1.fx=t2.fy;
<CicciuxLa> Oh... I am seeing another mistake...
<Xgc> CicciuxLa: Just dno't write it like that, if not necessary.
<CicciuxLa> Yes. the problem is that I was using another JOIN... and that WASN't left and it had to be joined with the first right table...
<CicciuxLa> if that makes any sense.
<Xgc> CicciuxLa: Your second JOIN is an inner join. That potentially causes problems.
<CicciuxLa> There. it workes.
<CicciuxLa> inner join?
<Xgc> CicciuxLa: Yes.
<CicciuxLa> one sec. Googling.
<CicciuxLa> the common join?
<Xgc> CicciuxLa: If you really wanted an inner join of t2 and t3 .. followed by a left join with t1, this more closely reflects that logic: SELECT ... FROM t1 LEFT JOIN (t2 JOIN t3 ON t2.fa=t3.fb) ON t1.fx=t2.fy;
<SarahS> joeljkp: Are you using MySQL 5.0?
<joeljkp> sarahs: no, 4.1
<SarahS> joeljkp: Ok, use mysqlshow
<joeljkp> sarahs: hmm, thanks
<snooplsm> what software do you guys use for erd?
<CicciuxLa> Thanks XGC.
<Xgc> CicciuxLa: You're welcome.
<agentbob> anyone available to help? having charset probs: http://pastebin.com/885592
<agentbob> INSTR == locate
#math
<exculpate> jerware: I don't believe there is a version for linux
<verbose> Level15: the probability that an element is selected any time is (n/N)
<verbose> i'm not sure about this but it might be (n/N)^(number of times you select a subset
<diseaser> 5x^(-2) = 1/5x^2 true or false?
<verbose> diseaser: it should be 5/x^2
<diseaser> ahh ok!!
<diseaser> thanks
<verbose> np
<diseaser> i knew I was doing something wrong
<asphyxia> cyclicFifths: Ok, I think I found out where my understanding has a glitch
<asphyxia> cyclicFifths: my book states that a p-cycle is a product of p-1 transpositions, as (a_1 a_2 ... a_p) = (a_1 a_p)(a_1 a_[p-1])(a_1 a_[p-2])...(a_1 a_2)
<Level15> verbose: hm, ok, i'm no mathematician... why do you say the prob is n/N? could you please explain it to me?
<verbose> Level15: actually, i think you'd use a binomial dist for that... (N choose i)((n/N)^i)(1-n/N)^N-i, where i is the number of times you choose a subgroup
<asphyxia> cyclicFifths: First of, the multiplicative nature of the expression is a composition (as in functions), as we are dealing with bijective mappings, right?
<diseaser> btw if anyone wants a sweet free plotting/graphing app (very small and very robust) for windows, check out WinPlot (google)
<cyclicFifths> asphyxia: yes, and yes: composition of functions
<verbose> Level15: i'm sorry, that's totally wrong
<asphyxia> cyclicFifths: Ok. But I still dont get why it is a composition of those p-1 transpositions
<gzl> asphyxia: write out the multiplication
<gzl> asphyxia: take (1 2)(2 3) and see what happens
<asphyxia> gzl: I dont know how to do that (seriously)
<gzl> as you should be able to see, 1 -> 2, 2 -> 3, 3 -> 1, which means that's (1 2 3)
<gzl> it's like applying functions
<asphyxia> Oh, I see
<gzl> let s = (1 2) and t = (2 3)
<gzl> then st(x) = s(t(x))
Previous Page Next Page