in reply to Re: Implementing a buffered read-and-insert algorithm
in thread Implementing a buffered read-and-insert algorithm

According to the MySQL manual, INSERT DELAYED gets its benefit from allowing chunks of data from many different clients to be inserted as one block. So, even if I were using MySQL, this particular application would not benefit from it.

By reading chunks of data and then inserting them in rapid sequence, I have managed to ask the database to write in larger blocks -- and that has increased performance. But, you solved another bugger of a problem I've been having, saving me another SoPW post. Thank you! ;-)

radiantmatrix
require General::Disclaimer;
s//2fde04abe76c036c9074586c1/; while(m/(.)/g){print substr(' ,JPacehklnorstu',hex($1),1)}

  • Comment on Re^2: Implementing a buffered read-and-insert algorithm

Replies are listed 'Best First'.
Re^3: Implementing a buffered read-and-insert algorithm
by eric256 (Parson) on Dec 13, 2004 at 22:09 UTC

    Glad to have helped in someway. The previous paragraph in the documentation shows the advantage in your situation. Like i said before with them both on the same machine this might not yeild a great amount of benifit, but when transfering between machines its great.

    When a client uses INSERT DELAYED, it gets an okay from the server at once, and the row is queued to be inserted when the table is not in use by any other thread.

    Another major benefit of using INSERT DELAYED is that inserts from many clients are bundled together and written in one block. This is much faster than doing many separate inserts.


    ___________
    Eric Hodges