in reply to fast disk db with bulk insert, fast read access, compact storage

Normally, when I hear "I need to optimize for fast reads with few inserts and can't use SQL" my first two thoughts are "why can't you use SQL?" and "LDAP or some other directory service is great for lots of reads and only a few inserts". However, I'm having trouble understanding your need to fully rebuild the database every night. Is that really what you meant to say? Will your users and the data you search really change that much every day?
  • Comment on Re: fast disk db with bulk insert, fast read access, compact storage

Replies are listed 'Best First'.
Re^2: fast disk db with bulk insert, fast read access, compact storage
by nikosv (Deacon) on Sep 15, 2010 at 10:04 UTC

    my first two thoughts are "why can't you use SQL?" true,or to extended the thought a bit "why not an RDBMS?"

    For the bulk inserts just use a HEAP structured table which has no keys and so it is the prefered structure for bulk inserts.

    are your keys unique? then create primary index on the key in the structure of your choice and requirements. I need very fast read access;for example a HASH index would make exact key lookups very fast which at the same time does not make it suitable for pattern matching

[reply]

In Section Seekers of Perl Wisdom