I have a multithreaded application which is exhibiting some unexpected
behaviour in the form of SQLITE_BUSY api return codes. I've traced
this back to a fairly simple way to model the problem, but I can't
seem to find any documentation which explicitly describes this issue.
I'll summarise the
Also erros out here, sporadically.
int sqlite3OsWrite(sqlite3_file *id, const void *pBuf, int amt, i64 offset){
return id->pMethods->xWrite(id, pBuf, amt, offset);
}
Program received signal SIGSEGV, Segmentation fault.
[Switching to Thread 1075841376 (LWP 15747)]
0x0040c413 in
4 threads, shared_Cache enabled
LOOP 100
BEGIN
LOOP 50 times
INSERT
end LOOP
COMMIT
SELECT COUNT(*) ...
end LOOP
program received signal SIGSEGV, Segmentation fault.
[Switching to Thread 1080043872 (LWP 15448)]
moveToChild (pCur=0x569058, newPgno=) at
program received signal SIGSEGV, Segmentation fault.
[Switching to Thread 1080043872 (LWP 15448)]
moveToChild (pCur=0x569058, newPgno=) at btree.c:3304
(gdb)
if( rc ) return rc;
pNewPage->idxParent = pCur->idx;
pOldPage = pCur->pPage;
pOldPage->idxShift = 0; < Error
--- [EMAIL PROTECTED] wrote:
> =?ISO-8859-1?Q?Daniel_=D6nnerby?= <[EMAIL PROTECTED]> wrote:
> >
> > The new multithread-features will be great.
> > Do you think that it will be better to share one connection between all
> > theads in an application or is better to have each thread open a new
>
D R H said: >>Threads are an invention of the devil.<<
I rather think human beings were to blame; but they had probably read a lot
about the Spanish Inquisition.
Stay as far away from these fiendish abominations as you can get.<<
That's the best bit of programming advice on threads I have
Thanks,
This actually solves another problem also where the uid generation
algorithm fails to generate a true uuid. Since table u has uuid column
unique, my database will never have a uuid repeated. But the number of
uuids I can have will now be dependent on what integer can accommodate
(I am
=?ISO-8859-1?Q?Daniel_=D6nnerby?= <[EMAIL PROTECTED]> wrote:
>
> The new multithread-features will be great.
> Do you think that it will be better to share one connection between all
> theads in an application or is better to have each thread open a new
> connection and use the
Hello Igor,
Thanks. That was the problem. I had been
doing 32 bit math on SQLite's 64 bit integers.
Best regards,
Kervin
--- Igor Tandetnik <[EMAIL PROTECTED]> wrote:
> Kervin L. Pierre
>
> wrote:
> > I expected this script to work...
> >
> > create table testtable ( testcol int );
> >
On 8/29/07, Scott Hess <[EMAIL PROTECTED]> wrote:
> What was fts3 will now be fts4. fts3 will now be
> fts2-with-rowid-fixed. fts3 is already in the tree, but with an
> #error at the top to force people to not use it without reading a
> comment. I was planning to turn that off this week (what
In either case, if you use the UUID as a primary key in more than one
table, you should consider having one table to convert the UUID to a
64-bit id, and use that as the primary keys on the other tables. If
you have UUID as a primary key, your table will have 2 b-trees, one
for the index of UUID
Thanks,
I will try both (ASCII and BLOB) approaches and see speed vs. storage
trade-offs. Any more ideas are welcome.
Regards,
Prakash Reddy Bande
Altair Engg. Inc,
Troy, MI
-Original Message-
From: John Stanton [mailto:[EMAIL PROTECTED]
Sent: Wednesday, August 29, 2007 11:26 AM
To:
Hmm, and a clarification on the n-gram case ... there are no current
plans to implement any n-gram capabilities in fts. This kind of thing
has been discussed, but since it still seems like a nice-to-have type
thing and not a must-have type thing, no time is being spent on it. I
have somewhat of
What was fts3 will now be fts4. fts3 will now be
fts2-with-rowid-fixed. fts3 is already in the tree, but with an
#error at the top to force people to not use it without reading a
comment. I was planning to turn that off this week (what with the
SQLite 3.5 stuff going on, might as well!).
The
A primary constraint of the porter algorithm in fts is that it's
completely unencumbered open-source. That may-or-may-not make it a
great stemmer, of course :-). One of the reasons it's in there in the
first place is as an example of an alternative to the very basic
"simple" fts tokenizer. One
On 8/24/07, Scott Hess <[EMAIL PROTECTED]> wrote:
>
> My current focus for the next generation is international support
> (this is more of a Google Gears project, but with focus on SQLite so
> there is likely to be stuff checked in on the SQLite side), and more
> scalable/manageable indexing.
N-gram is a sequense of N Letters of a word or set of words...
http://en.wikipedia.org/wiki/N-gram
On 29/08/2007, Uma Krishnan <[EMAIL PROTECTED]> wrote:
>
> Hello Scott,
>
> I have several clarifications with respect to full text search. I'm a
> newbie in open source development, so please
RaghavendraK 70574
<[EMAIL PROTECTED]> wrote:
One another thing is how does reversing of value and column work,
i mean the internals of it. Does it create any temp table ...
No, it just scans all records one by one, and runs the test for each
record.
And i see the sqlite documentation of
What is a "best match" anyway? A fuzzy search? The LIKE operator gives
an exact match to a substring.
Simon Davies wrote:
ragha,
you want something to give you a 'best match'. The 'like' operator in
the way you are using it does not do that, but it IS working as it
should.
I am not sure
Yes,i understand it is no problem,my mistake.
One another thing is how does reversing of value and column work,
i mean the internals of it. Does it create any temp table ...
And i see the sqlite documentation of like, which say if the first char is not
a wild char then index
will be helpful.
Hello Scott,
I have several clarifications with respect to full text search. I'm a newbie in
open source development, so please bear with me if some of the questions are
irrelevant/obvious/nonsense.
I was given to understand that the potter stemming algorithm implemented in
fts2 is not robust
You could experiment with making your 128 bit entity a BLOB. The
alternative would be to represent it it in ASCII. Changing its radix
would probably be the significant overhead, not the Sqlite storage.
Prakash Reddy Bande wrote:
Hi,
I am designing a database where-in my column data is
RaghavendraK 70574 wrote:
Hi,
There are 2 testcases one works and other fails
Hope am clear.
SqliteVersion: 3.4.0
TestCase 1: works
create table test(t text);
insert into test values ('9');
insert into test values('98');
insert into test values('983');
insert into test values('9854');
Hi,
What u and Igor say is correct. Thx.
Actually i was trying to model this.
"http://algo.inria.fr/flajolet/Publications/Flajolet06.pdf;
regards
ragha
**
This email and its attachments contain
On 8/29/07, rahed <[EMAIL PROTECTED]> wrote:
>
> Thank you much.
>
Not a problem. I know how it is; when something compiles cleanly in
Linux, you can almost be guaranteed you'll need to do some kind of
song and dance to get it to work in Solaris!
cheers
-- brian
ragha,
you want something to give you a 'best match'. The 'like' operator in
the way you are using it does not do that, but it IS working as it
should.
I am not sure how to make it any clearer.
Rgds,
Simon
On 29/08/2007, RaghavendraK 70574 <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> Pls see my last
Hi,
I am designing a database where-in my column data is UUID.
I am trying to figure out which is the best way to handle UUID since if
stored as text the length would be 32 characters (though UUIDs are 128
bit size) and select query based on UUIDs might not be really fast (I
might be wrong here.)
Hi,
Pls see my last post, hope it is clear.
regards
ragha
**
This email and its attachments contain confidential information from HUAWEI,
which is intended only for the person or entity whose address is
hi ragha,
On 29/08/2007, RaghavendraK 70574 <[EMAIL PROTECTED]> wrote:
> Hi,
>
> There are 2 testcases one works and other fails
> Hope am clear.
>
It is only clear that you are misunderstanding the operation of the
'like' operator.
See Igor's post for explanation...
Rgds,
Simon
On
Hi,
There are 2 testcases one works and other fails
Hope am clear.
SqliteVersion: 3.4.0
TestCase 1: works
create table test(t text);
insert into test values ('9');
insert into test values('98');
insert into test values('983');
insert into test values('9854');
select * from test where '982'
RaghavendraK 70574
<[EMAIL PROTECTED]> wrote:
Best match is "9854002656" among the 2 records.
Pls try this simple one.It will make it clear,
create table test(t text);
insert into test values ('9');
insert into test values('98');
insert into test values('983');
insert into test
On 29/08/2007, RaghavendraK 70574 <[EMAIL PROTECTED]> wrote:
>
> select * from test where '982' like t || '%' order by t desc limit 1;
>
> This works but will not work for earlier data(9854002656).So seems to be bug.
>
> regards
> ragha
'9854002656%' is not a match for '982', so seems not to be a
Hi,
Best match is "9854002656" among the 2 records.
Pls try this simple one.It will make it clear,
create table test(t text);
insert into test values ('9');
insert into test values('98');
insert into test values('983');
insert into test values('9854');
select * from test where '982' like t ||
Show us your program.
RaghavendraK 70574 wrote:
Thx. I have modifed it to ?, but
Sqlite fails to get records for the below query. When debug it retuns
SQLITE_DONE. Pls help.
select * from 'tbl.7' where ? like column1 || '%' order by column1 desc limit 1;
Data is as below:
Version: 3.4.0
RaghavendraK 70574
<[EMAIL PROTECTED]> wrote:
Thx. I have modifed it to ?, but
Sqlite fails to get records for the below query. When debug it retuns
SQLITE_DONE. Pls help.
select * from 'tbl.7' where ? like column1 || '%' order by column1
desc limit 1;
Data is as below:
insert into 'tbl.7'
On 29/08/2007 10:37 PM, RaghavendraK 70574 wrote:
Thx. I have modifed it to ?, but
Sqlite fails to get records for the below query. When debug it retuns
SQLITE_DONE. Pls help.
select * from 'tbl.7' where ? like column1 || '%' order by column1 desc limit 1;
Data is as below:
Version: 3.4.0
Thx. I have modifed it to ?, but
Sqlite fails to get records for the below query. When debug it retuns
SQLITE_DONE. Pls help.
select * from 'tbl.7' where ? like column1 || '%' order by column1 desc limit 1;
Data is as below:
Version: 3.4.0
Re-confirm the problem in sqlite and not in my code,
I
On 29/08/2007 8:37 PM, RaghavendraK 70574 wrote:
Hi,
Am using sqlite 3.4.0
stmt= sqlite_prepareV2("select * from test where '?' like t || '%' order by t desc);
? is the sql variable.
No it isn't; it's the contents of a string constant.
Try this:
select * from test where ? like t || '%'
> Funny enough, I just ran into this problem yesterday! I used the
> information in this ticket [1] to fix the problem. All you have to do
> is find/replace B_FALSE to BOOL_FALSE and B_TRUE to BOOL_TRUE in the
> lemon.c file.
>
Thank you much.
--
Radek
On Wed, 2007-08-29 at 16:43 +0800, RaghavendraK 70574 wrote:
> Hi,
>
> create table test (t text);
>
> insert into test values ('9');
> insert into test values ('98');
> insert into test values ('986');
> insert into test values ('9867');
>
> select * from test where '98555' like t || '%'
Hi,
create table test (t text);
insert into test values ('9');
insert into test values ('98');
insert into test values ('986');
insert into test values ('9867');
select * from test where '98555' like t || '%' order by t desc limit 1;
When we try to compile the above sql as a statement,we get
Hi!
The new multithread-features will be great.
Do you think that it will be better to share one connection between all
theads in an application or is better to have each thread open a new
connection and use the sqlite3_enable_shared_cache?
Best regards
Daniel
[EMAIL PROTECTED] wrote:
The
Hi!
SQL Maestro Group announces the release of SQLite Data Wizard 7.8, a
powerful Windows GUI solution for data management.
SQLite Data Wizard provides you with a number of easy-to-use wizards for
performing the required data manipulation easily and quickly. It allows you
to generate PHP
43 matches
Mail list logo
