Thanks shiming
we have tried this method as u suggested , but creating an index on a 5
million records
take a long time, nearly 4 seconds.
And in our case the Database contain 5 Million to 30 or 50 million records.
so if I try to create additional indices on these tables it takes too much
tim
Hi.
in sqlite3.3.8(latest)
./configure --prefix=/sw CFLAGS=-g CPPFLAGS=-g
1 thread : 1 db model
Error on many thread's request(about 1k/sec) to same db file.
This problem repeated sometimes.
I use sqlite3_commit_hook, sqlite3_rollback_hook, sqlite3_update_hook
and sqlite3_set_authorizer AP
Thanks shiming
we have tried this method as u suggested , but creating an index on a 5
million records
take a long time, nearly 4 seconds.
And in our case the Database contain 5 Million to 30 or 50 million
records. so if I try to create additional indices on these tables it takes
too much tim
At 11:38 08/10/2006, you wrote:
Hi, all
After trying SQLite on my embedded platform, I feel that it's a
little too complicated and time-consuming to my platform, especially
the parsing.
So, could someone recommend several ISAM ones to me?(I'm a newbie of
database*^_^*)
You could have a look
Hi,
now I wrote a db-application with ms-access. Its only a single-user
application. But the size of access-dbs are limited.(2GB). Now I found
SQLite, limited at 4 TB.
My questions:
- with access it is possible to integrate "pseudo-stored-procedure". can I
do this with SQLite too?
- where can I f
Hi,
I have a query regarding transactions and tables.
Say in a DB if you have 4 tables, now in my code I will say , "begin
transaction" and start modifying a table, say tbl1, now a journal would be
backed up for the tbl1 that I am going to modify, now if in the same
transaction if I
chetana bhargav <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I have a query regarding transactions and tables.
>
> Say in a DB if you have 4 tables, now in my code I will say , "begin
> transaction" and start modifying a table, say tbl1, now a journal would be
> backed up for the tbl1 that I
He Shiming <[EMAIL PROTECTED]> wrote:
select * from hvh5m,itm where hvh5m.Column4=itm.Icol1 order by
Column8
You can try creating two additional indexes, one on hvh5m.Column4 and
the other on hvh5m.Column8. They should speed things up.
Actually, what would help here is a compound index on (Co
mimuel1 <[EMAIL PROTECTED]> wrote:
- with access it is possible to integrate "pseudo-stored-procedure".
can I do this with SQLite too?
SQLite has triggers, which can be used as poor man's stored procedures.
That's the only kind of "code" that can be stored in a database. Your
program can inst
Hi He,
sqlite3 Disney.db "SELECT * FROM Characters"
When I get the result of a SELECT statement, the output has
columns separated by pipe characters and rows by new lines. So, if
a value contains a return, it prematurely starts a new line, and
messes up my output result.
Well, you didn'
DBTools Software is pleased to announce the new DBManager Professional 3.4.0
Enterprise Edition.
This is a major update with plenty of bugs fixed and new improvements to the
application. See the details:
NEW FEATURES AND IMPROVEMENTS
- Added Context Menu for Default Servers
- Diagram Designer (ad
On 10/9/06, T&B <[EMAIL PROTECTED]> wrote:
Hi He,
>> sqlite3 Disney.db "SELECT * FROM Characters"
>>
>> When I get the result of a SELECT statement, the output has
>> columns separated by pipe characters and rows by new lines. So, if
>> a value contains a return, it prematurely starts a new line
hi,
i dont know if anyone is interested in my new open source project...
i implemented a little webserver with javascript as backend-language
(1.7 from mozilla 2.0.rc1) and sqlite as datastorage (3.3.7)
the server is serving himself on "http://greschenz.dyndns.org"; :-)
the source can be download
Sorting data is time consuming, a physical law is involved. At best it
is an nlog(n) process. Sorting a result set or sorting the keys to
build an index invokes the nlog(n) timing.
If you cannot tolerate time spent sorting, you need to redesign your
database to avoid sorts, or to maintain re
What'ch got it running on, a 286? Tried three different times and got
tired waiting all three times :-(
Not going to stir much interest with response times like that!
> -Original Message-
> From: Günter Greschenz [mailto:[EMAIL PROTECTED]
> Sent: Monday, October 09, 2006 12:04 PM
> To:
Gunter,
I cannot access your web site. The address is resolved, then the server
hangs. It would be interesting to look at your www server.
Günter Greschenz wrote:
hi,
i dont know if anyone is interested in my new open source project...
i implemented a little webserver with javascript as bac
* John Stanton <[EMAIL PROTECTED]> [2006-10-09 19:35]:
> Sorting data is time consuming, a physical law is involved. At
> best it is an nlog(n) process.
Only when you sort by comparing elements with each other. Bucket
sort runs in O(n), f.ex. And quantum sort is O(1). ;-) Algorithms
that run faste
A. Pagaltzis wrote:
* John Stanton <[EMAIL PROTECTED]> [2006-10-09 19:35]:
Sorting data is time consuming, a physical law is involved. At
best it is an nlog(n) process.
Only when you sort by comparing elements with each other. Bucket
sort runs in O(n), f.ex. And quantum sort is O(1). ;-) Alg
I am attaching external database 'b' to database 'a',
ATTACH DATABASE b AS d_b;
and then trying to create a view that uses tables from the attached database,
CREATE VIEW v AS
SELECT d_b_t.col, d_a_t.col
FROM d_b.tbl AS d_b_t JOIN tbl AS d_a_t ON...
I get the following error --
view v cannot
Fred Williams wrote:
What'ch got it running on, a 286? Tried three different times and
got tired waiting all three times :-(
Seems ok now. Quite fast even.
mj
-
To unsubscribe, send email to [EMAIL PROTECTED]
---
I am eager to try out full text search using SQLite and Tcl on WinXP.
I downloaded the Tcl bindings and executable for SQLite 3.3.8 and the
fts1.dll file, and copied them all (after unzipping) to a directory. The
fts1.dll loads fine using the stand-alone executable, but I get a "not
authorized
Martin Jenkins wrote:
Fred Williams wrote:
What'ch got it running on, a 286? Tried three different times and
got tired waiting all three times :-(
Seems ok now. Quite fast even.
mj
-
To unsubscribe, send email
Gerry Snyder <[EMAIL PROTECTED]> wrote:
> I am eager to try out full text search using SQLite and Tcl on WinXP.
>
> I downloaded the Tcl bindings and executable for SQLite 3.3.8 and the
> fts1.dll file, and copied them all (after unzipping) to a directory. The
> fts1.dll loads fine using the sta
[EMAIL PROTECTED] wrote:
FTS1 is built into the starkit. So if you use the starkit, there
is nothing to do to enable full-text search. It's just there.
I thought I did the same for the TCL DLL as well - FTS1 is built in.
But I admit that I might have not gotten that exactly right. Did
you try
Hi,
yes i know, the problem is, its single-threaded (because of
protability), so if anyone starts a download with a slow connection, the
server is blocked for other connections.. im still thinking about this
problem... single-threading whle rendering th pages and multithreading
for sending th
A. Pagaltzis wrote:
* John Stanton <[EMAIL PROTECTED]> [2006-10-09 19:35]:
Sorting data is time consuming, a physical law is involved. At
best it is an nlog(n) process.
Only when you sort by comparing elements with each other. Bucket
sort runs in O(n), f.ex. And quantum sort is O(1).
26 matches
Mail list logo