Re: [GENERAL] Memory efficient insertion/retrieval of bytea

2006-09-20 Thread Tomasz Ostrowski
On Wed, 20 Sep 2006, Tom Lane wrote: > Tomasz Ostrowski <[EMAIL PROTECTED]> writes: > > Now for inserting data to a bytea we need 5*data_size in a buffer for > > escaped data representation. 6*data_size if we do PQescapeByteaConn > > in one chunk. > > If you send the value as an out-of-line binar

Re: [GENERAL] Memory efficient insertion/retrieval of bytea

2006-09-20 Thread Tom Lane
Tomasz Ostrowski <[EMAIL PROTECTED]> writes: > Now for inserting data to a bytea we need 5*data_size in a buffer for > escaped data representation. 6*data_size if we do PQescapeByteaConn > in one chunk. If you send the value as an out-of-line binary parameter then you don't need any of that. See

Re: [GENERAL] Memory efficient insertion/retrieval of bytea

2006-09-20 Thread Tomasz Ostrowski
On Wed, 20 Sep 2006, Tomasz Ostrowski wrote: > I've made some experiments with attached program and > came up that for inserting 1kB of data this program needs about > 5120kB of virtual memory, 1MB - 10MB, 10MB - 55MB. Forgot to attach it. Pozdrawiam Tometzky -- Best of prhn - najzabawniejsze t

[GENERAL] Memory efficient insertion/retrieval of bytea

2006-09-20 Thread Tomasz Ostrowski
I'd like to propose something which would make an easy way for memory efficient insertion/retrieval of bytea data. Now for inserting data to a bytea we need 5*data_size in a buffer for escaped data representation. 6*data_size if we do PQescapeByteaConn in one chunk. I've made some experiments with