Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: Help performing "random" access on very very large file

by Moron (Curate)
on Jul 16, 2007 at 15:48 UTC ( #626867=note: print w/replies, xml ) Need Help??

in reply to Help performing "random" access on very very large file

Where the information exceeds what can be stored in memory, the most usual solution is some kind of DBMS. Relational databases are only semi-infeasible for this kind of data structure in the sense you could store say 100000 lines in a BLOB and index those - an approach talked about but I have never seen tried.

The most common custom DBMS structure is indeed flat-file-based as has been mentioned.

But the most useful Perl implementations of non-relational database architecture are probably going to be the DBM family of modules. In particular, DBM::Deep (which has an underlying flat-file storage) looks perfect for your requirement.


^M Free your mind!

  • Comment on Re: Help performing "random" access on very very large file

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://626867]
[shmem]: but the results of both operations are different.
[shmem]: result := the discarded result (what's leftmost of the statement)
[shmem]: push returns the number of elements in @foo, the assignment returns all the elements in the (renewed) @foo
[Lady_Aleena]: Sanity check please? push @line, ref($list_addition ) eq 'ARRAY' ? @$list_addition : $list_addiction; # so I don't have the change existing uses of the sub.
[shmem]: $list_addiction should be $list_addition
Discipulus loose the tozzetto party!
[shmem]: .oO( addition of cookies for addiction to cookies )
[Lady_Aleena]: Other than my typos shmem. 8)
[shmem]: otherwise fine

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (7)
As of 2017-04-27 11:40 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (503 votes). Check out past polls.