On Fri, 20 Apr 2012 10:40:29 +0400, Alex Peshkoff
wrote:
> On 04/19/12 22:48, Mark Rotteveel wrote:
>> On 19-4-2012 10:17, Dmitry Yemanov wrote:
>>> 19.04.2012 12:02, Mark Rotteveel wrote:
>>>
Ok, that sounds relatively easy. What is the hashing algorithm, and
where
in the Firebird
On 04/20/12 11:10, Mark Rotteveel wrote:
> On Fri, 20 Apr 2012 10:40:29 +0400, Alex Peshkoff
> wrote:
>> On 04/19/12 22:48, Mark Rotteveel wrote:
>>> On 19-4-2012 10:17, Dmitry Yemanov wrote:
19.04.2012 12:02, Mark Rotteveel wrote:
> Ok, that sounds relatively easy. What is the hash
On Fri, 20 Apr 2012 11:19:18 +0400, Alex Peshkoff
wrote:
>> I am going to think it over, not having to implement it is of course
far
>> easier.
>>
>
> The main problem is that I do not know good reason to waste time
> implementing it ...
The challenge to get it to work of course ;)
>>> It's muc
On 04/20/12 11:33, Mark Rotteveel wrote:
> On Fri, 20 Apr 2012 11:19:18 +0400, Alex Peshkoff
> wrote:
>>> I am going to think it over, not having to implement it is of course
> far
>>> easier.
>>>
>> The main problem is that I do not know good reason to waste time
>> implementing it ...
> The cha
Le 13/04/2012 18:39, Alex Peshkoff a écrit :
> Yes, certainly. But not less than 70% of server code is protocol
> implementation. And to work efficiently with pipeline you probably need
> another thread polling logic.
I started playing with the firebird tcp protocol. I'm happy, it's easier
than I
Henri Gourvest [2012-04-20 14:46] :
> I started playing with the firebird tcp protocol. I'm happy, it's easier
> than I thought :)
good news !
> I think there is great potential with nodejs if the pipeline mode can be
> implemented.
>
may be not only for node.js
Dmitry, may be that's a way to
multi-user access of DB fails in 2.5.1 CS
-
Key: CORE-3824
URL: http://tracker.firebirdsql.org/browse/CORE-3824
Project: Firebird Core
Issue Type: Bug
Components: Engine
Affects Versions:
Hello, All.
IIRC, sorting in Firebird has three phases:
1) Quick sort in memory buffer
2) Write sorted buffer to temp file
3) Merge sort of data from temp files
Do anybody know how much time in percent of total sort time is spent to each
phase?
--
SY, SD.
Dimitry,
>IIRC, sorting in Firebird has three phases:
>
> 1) Quick sort in memory buffer
> 2) Write sorted buffer to temp file
> 3) Merge sort of data from temp files
>
>Do anybody know how much time in percent of total sort time is spent to
> each phase?
There is no one answer to that
20.04.2012 18:02, Philippe Makowski wrote:
> Dmitry, may be that's a way to improve our networking performance more
> generally
There could be different ways. But I cannot think about them all at once.
Dmitry
--
For D
If an autocommit transaction (i.e. transaction started with isc_tpb_autocommit
option) run DDL using EXECUTE STATEMENT it will produce a bugcheck 287 (Too
many savepoints)
11 matches
Mail list logo