Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: Strategy for managing a very large database with Perl

by dws (Chancellor)
on Jun 18, 2010 at 05:55 UTC ( #845310=note: print w/ replies, xml ) Need Help??

in reply to Strategy for managing a very large database with Perl

A typical search would be to retrieve all the values of a <variable> for or for a particular year+yday combination.

If those are the typical search patterns, is a relational database the right hammer to reach for? Why not flat files? Appending to a flat file is a quick operation. If you keep one flat file per day, scanning for the subset of records for that day is trivial. If you have to do a full scan through all the data, one file per day is also easy, and allows the scan to be parallelized if you ever need to throw more machines at the problem.

10Tb over 20 years is 500Mb a year, or very roughly 1.5Mb a day. That's not an unreasonable size for a flat file.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (5)
As of 2015-11-28 12:10 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (741 votes), past polls