Re: most efficient method of storing records held in array

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On Mon, 23 Mar 2015 04:56:40 -0700 (PDT), tonyg wrote:

> I have several fairly long arrays of records that I want to store to disk
> on a as needed basis, but I don't want to use a database.
> 
> Especially after reading that comparison between database speed and
> persistant objects that was recently floated.
> 
> I did look at the persistent objects library  in the Dmitrys Kazakov
> components library but I'm finding it difficult to understand what is
> going on there despite the large amount of documentation.
> 
> Are there any other examples out there using this library? I was thinking
> of a generic library using direct io to save on the index whenever the
> values are changed.

The implementation of the persistence layer is based on Direct_IO,
actually.
 
> What do you guys think?

Everything depends on the intended usage. Whether data are immutable, how
frequent in relation are insertion, seek, deletion, whether elements have
fixed or variable size, should access be task-safe, which operations are
required to be atomic, should the persistent structure survive hard system
crashes, should the container file keep several structures, how they are
identified (catalogue etc), could the structures be removed independently
and so on. There is no ultimate solution and efficiency (defined in any of
multiple possible ways) highly depends on the choices made.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de