Re: Array Empty Slots

["M.Baris Demiray" <baris@labristeknoloji.com>]

[-- Attachment #1: Type: text/plain, Size: 1612 bytes --]


Hi Chris,

Chris wrote:
 > ..
> The well known constraints are small memory footprint 

Well, then using a bitmap looks like a better solution. Since a minimal
node (a integer value and the next one's address) in a linked list takes
~64 bits but it'll take 1 bit in a bitmap.

But, you should calculate and compare the possible memory requirements
before ignoring the use of separate empty record list method. Since its
implementation will be much more easier than the former.

> and lack of
> computing power is really a concern, 

I think the computer itself is the real bottleneck :-)

 > but most of all is that the array is
> bigger and bigger over time, because it is and array constructed from a
> database query through a C API interface.

May be you should leave the job to DBMS by querying empty
records. I'm sure that it'll handle it more efficiently.

Also, adding a Boolean field for empty/full status and creating
an index for it will also be a good solution. But, this path ends
in off-topic.

Some benchmarking is required to tell the final word.

Regards.

> The bottleneck in the final application is this point, where the algorithm
> searches the array to find the empty slots and then fill those slots with
> data.
> Is there really sth that can 'dissapear' that bottleneck? Do u have any
> suggestions??
> 
> 
> Best regards,
> Chris.

-- 
"You have to understand, most of these people are not ready to be
unplugged. And many of them are no inert, so hopelessly dependent
on the system, that they will fight to protect it."
                                                         Morpheus

[-- Attachment #2: baris.vcf --]
[-- Type: text/x-vcard, Size: 342 bytes --]

begin:vcard
fn:M.Baris Demiray
n:Demiray;M.Baris
org:Labris Teknoloji
adr:;;Teknokent Silikon Bina No:24 ODTU;Ankara;;06531;Turkey
email;internet:baris@labristeknoloji.com
title:Yazilim Gelistirme Uzmani
tel;work:+903122101490
tel;fax:+903122101492
x-mozilla-html:FALSE
url:http://www.labristeknoloji.com
version:2.1
end:vcard