Christian Smith <[EMAIL PROTECTED]> wrote:
>>
> Version 2 used a Red/Black balanced tree in :memory:, whereas version 3
> appears to have done away with this optimisation. I'm curious as to why?
>
It is simpler to support a single algorithm (b-trees) rather than
two (b-tree + red/black trees).
Manzoor Ilahi Tamimy uttered:
I found that Version 2.8 was much Faster than 3.6 using ":memory:", 30
Seconds and 60 seconds in case of 2.8 and 3.6 respectively.
can I use 2.8 in my project when i have a huge amount of data to handle.
Version 2 used a Red/Black balanced tree in :memory:,
On Wed, 9 Aug 2006 18:51:30 +0600, you wrote:
>hi All,
>
>I have to use SQLite for one of my project as ":memory:" db.
[snip]
>which PRAGMA statements can improve the query speed.
>the main queries are, INSERT and SELECT with joins.
>
>I have just tried the following PRAGMA
>
>
Am 09.08.2006 um 05:51 schrieb Manzoor Ilahi Tamimy:
hi All,
I have to use SQLite for one of my project as ":memory:" db.
//
-
Can I get a better speed if I change or omit some macros.
I saw "
hi All,
I have to use SQLite for one of my project as ":memory:" db.
//
-
Can I get a better speed if I change or omit some macros.
I saw " http://www.sqlite.org/compile.html ". the macros defined here can
only
5 matches
Mail list logo