Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^2: fast disk db with bulk insert, fast read access, compact storage

by nikosv (Hermit)
on Sep 15, 2010 at 10:04 UTC ( #860179=note: print w/ replies, xml ) Need Help??


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

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


Comment on Re^2: fast disk db with bulk insert, fast read access, compact storage

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://860179]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (12)
As of 2014-08-29 18:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (286 votes), past polls