Hello,
I have a couple questions about sqlite3_extended_result_codes():
1) Once I enable it, is it possible to determine whether extended
result codes is enabled for a given a sqlite3* handle?
2) Do I have to process each result code in order to obtain the
"regular" SQLite code, or can I com
On Jun 27, 2009, at 6:49 PM, João Eiras wrote:
> Hi !
>
> I really missing having feeds to track sqlite releases. Currently I
> either have to go through the mailing list, which is not low
> traffic, or open the website.
> Would you consider having an rss feed for sqlite releases ?
There is
João Eiras wrote:
> I really missing having feeds to track sqlite releases. Currently I
> either have to go through the mailing list, which is not low traffic,
> or open the website. Would you consider having an rss feed for sqlite
> releases ?
See if this helps:
http://www.sqlite.org/cvstrac/tim
Hi,
there already is an RSS feed -
http://www.sqlite.org/cvstrac/timeline.rss - unfortunately it can't be
limited to display only the milestones as regular web timeline can.
Best regards,
Filip Navara
On Sun, Jun 28, 2009 at 12:49 AM, João Eiras wrote:
> Hi !
>
> I really missing having feeds to
uralmaza...@pop3.ru wrote:
> sqlite3_open_v2( "testdat", &sqlDB, SQLITE_OPEN_READWRITE |
> SQLITE_OPEN_CREATE, NULL );
> sqlite3_prepare_v2( sqlDB, "SELECT b FROM whee WHERE a='bing';", -1,
> &sqlStat, NULL );
> sqlite3_step( sqlStat );
> const unsigned char *testValue = sqlite3_column_text( sqlSta
Hi !
I really missing having feeds to track sqlite releases. Currently I either have
to go through the mailing list, which is not low traffic, or open the website.
Would you consider having an rss feed for sqlite releases ?
Thanks.
___
sqlite-users mai
Greetings,
maybe it's just me being stupid, I'll best jump right to the code:
sqlite3_open_v2( "testdat", &sqlDB, SQLITE_OPEN_READWRITE |
SQLITE_OPEN_CREATE, NULL );
sqlite3_prepare_v2( sqlDB, "SELECT b FROM whee WHERE a='bing';", -1,
&sqlStat, NULL );
sqlite3_step( sqlStat );
const unsigned ch
I have actually implemented such a structure, and it worked well.
Kosenko Max wrote:
> You're talking about db size much less than 1 billion records.
>
> In 1 billion records db with described scenario cache hit ratio so small
> that everything you're talking about just very close to zero differen
SQLite version 3.6.16 is now available on the SQLite website:
http://www.sqlite.org/
Version 3.6.16 is a regular monthly maintenance release. Curiously,
even though it is released at the end of June, version 3.6.16 is
considered the monthly maintenance release for July. We have
accelerat
THANKS MAN!
On Sat, Jun 27, 2009 at 10:14 AM, P Kishor wrote:
> On Sat, Jun 27, 2009 at 10:03 AM, Jamiil Abd Al Qadir
> wrote:
> > Hey kids!
> > I wanted to know if there is a tutorial of how to create new database
> > tables, sort tables, etc., etc.
> >
> ..
>
> Its called Google. It opens door
I am really sorry, The correct code is given below:
//
#include
#include
#include
#include
#include
const char *create_and_insert = "create table some_tbl (id int primary
key, version text check (version in (\"1
On Sat, Jun 27, 2009 at 10:03 AM, Jamiil Abd Al Qadir wrote:
> Hey kids!
> I wanted to know if there is a tutorial of how to create new database
> tables, sort tables, etc., etc.
>
..
Its called Google. It opens doors to all kinds of tutorials. You can
also try your luck with Bing.
___
Hey kids!
I wanted to know if there is a tutorial of how to create new database
tables, sort tables, etc., etc.
TIA
--
Happiness has many doors, and when one of them closes another opens, yet we
spent so much time looking at the one that is shut that we don't see the one
that just opened..
_
You're talking about db size much less than 1 billion records.
In 1 billion records db with described scenario cache hit ratio so small
that everything you're talking about just very close to zero difference in
effect. Because 1 uncached random IO operation is 10ms. Any reasonable
calculations (i
On 27 Jun 2009, at 8:47am, chandan wrote:
> const char *create_and_insert = "create table some_tbl (id int primary
> key, version text check (version in (\"1.0\")));"
>"insert into some_tbl (id) values (1);";
> const char *update_sql = "update some_tbl set version = ? where id
> = ?";
I no
On 27/06/2009 3:36 AM, Kalyani Phadke wrote:
> Is there any way to find the version of SQlite3 database. eg. I have
> test.DB file . I want to know which SQLite3 version its using ..eg 3.5.4
> or 3.6.15?
Short answer: You can't know. What problem do you face that makes you
want to know? If the p
Quite wrong. Searching a B-Tree is relatively inexpensive but node
splits are expensive.
Inserting a non-terminal key in a part filled leaf node is cheap,
inserting a terminal key is more expensive and a split is more expensive
again
The reason we spend the extra resources maintaining B-tree
Expenses in B-Tree not in the node splitting (that is really not that often
and takes small amount of time). As I've said - it's in finding right place
to insert.
Root level which takes 1 page will do the same as your hash index. And will
use much less space in cache. This root page in such DB wi
On Jun 27, 2009, at 2:47 PM, chandan wrote:
> The code snippet is shown below:
>
> /
> **/
> #include
> #include
> #include
> #include
> #include
>
> const char *create_and_insert = "create table
This technique is used extensively in disk cacheing and in maintaining
file directories with huge numbers of files..
I would expect it toincrease key insertion speed because it removes a
level of index in the B-tree of each index. The expensive activity in a
B-tree index insertion is a node sp
The code snippet is shown below:
/**/
#include
#include
#include
#include
#include
const char *create_and_insert = "create table some_tbl (id int primary
key, version text check (version in (\"1.
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
chandan wrote:
>I have attached the C program along this mail.
This mailing list strips all attachments, so we can't see your code :-)
> Am i doing anything wrong in the program?
Yes. SQLite does fundamentally work. We'd have noticed by now if
22 matches
Mail list logo