Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

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

by nikosv (Chaplain)
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 taking refuge in the Monastery: (9)
As of 2016-08-30 17:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    The best thing I ever won in a lottery was:















    Results (420 votes). Check out past polls.