I am out of the office from June 13th through the July 4th. I will be back in
the office on July 5th. I will only have intermittent access to email and my
cell phone during that time. I will read and reply to your message when I get
back to the office.
If you need assistance with a Berkeley DB
I am out of the office from June 13th through the July 4th. I will be back in
the office on July 5th. I will only have intermittent access to email and my
cell phone during that time. I will read and reply to your message when I get
back to the office.
If you need assistance with a Berkeley DB
I need to add a new where clause to my query, one that checks to see
if the file actually exits. I am thinking the correct solution is a
user defined function, something like:
bool DoesFilesReallyExist(char* rootPath, char* relativePath, char* filename)
Where I could do a query like this:
Selec
I am out of the office from June 13th through the July 4th. I will be back in
the office on July 5th. I will only have intermittent access to email and my
cell phone during that time. I will read and reply to your message when I get
back to the office.
If you need assistance with a Berkeley DB
I am out of the office from June 13th through the July 4th. I will be back in
the office on July 5th. I will only have intermittent access to email and my
cell phone during that time. I will read and reply to your message when I get
back to the office.
If you need assistance with a Berkeley DB
On 6/18/2010 7:01 PM, Scott Hess wrote:
>
> The old-school solution to this problem is an external sort (*). The
> basic idea is that you process the incoming data in memory-sized
> chunks (ie, fast), then write out sorted subfiles. Then you process
> the sorted files in parallel, merging to the
Jay A. Kreibich wrote:
> Try getting rid of the PK definition and see how much that buys you.
> It might be worth it, or it might not.
and Simon Slavin wrote:
> We know you are doing a huge amount of writing to this database. Are
> you also reading it frequently ? If not, then it might
On 19 Jun 2010, at 1:24am, Eric Smith wrote:
> It's not in any way a result of my schema? My primary key is a pair of
> integers A,B. The first column in this particular use case is in the
> range A = [0, 2million) and the second is in the range B = [0, infinity).
> We
>
> insert records A=0-
Hi,
I'm running two different processes, both access the same database at given
times, without synchronization. In order to handle a simultaneous access, I
was testing for the BUSY condition. However, one of the processes is
receiving a LOCKED status form SQLITE, resulting in a eternal deadlock.
Ac
Using version 3.6.23.1 amalgamation
When processing an sql commands from a script file, if exactly two
errors occur, then the shell exits.
To replicate:
Example file called test.sql
End transaction;
End transaction;
Open the shell with no database and run:
.read
10 matches
Mail list logo