This has been discussed before. Read it here http://weblogs.sqlteam.com/davidm/archive/2003/10/30/412.aspx

Hello,

sorry. I missed the link. Now i read it. Quite interesting what you guys did there. But this all ends up in implementing a welln known algorithm in T-SQL imperative...

Jeff Moden (12/28/2010)

---

hreisterp (12/28/2010)

---

OK. Another try... 😉

Used then outstanding LINQPad [/url]tool to do the same.

int[] data=data=Enumerable.Range(2,65536).ToArray(); // learned this today 🙂

var q = from s in data where !(from o...

After a while of using OracleXE (this a creapled 10g version) the results could not be any worth....

1.) The thing installs an HTTP server!! Without even asking.

2.) there is no...

Oracle is such an amzing source of annoyance:

- downlad -> MUST register

- register. Does not respect international aspects. My first name contains an ö. For Oracle this seems to be...

Thanks for your post. But that was not the challenge. Actually loading all prime number from a pre-computed list is MUCH faster (if it is not huge number you need...

OK. Another try... 😉

Used then outstanding LINQPad [/url]tool to do the same.

int[] data=data=Enumerable.Range(2,65536).ToArray(); // learned this today 🙂

var q = from s in data where !(from o in data where...

The performance challenge is not to insert the data but to select the prime number. 🙂

OK. Gave it a try in the "FAST" MySQL -> out of the box: 50 sec on the same machine. Silly. MySQL is ridiculously :laugh:

Switching from InnoDB engine to MyISAM...

Hello,

great post so far. The idea of using row_num is really smart.

I did this unsing standard SQL in the following way:

insert into numbers values (1)

insert into numbers select (select...