Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

RE (tilly) 3: Schwartzian Transform

by tilly (Archbishop)
on Aug 17, 2000 at 18:04 UTC ( #28293=note: print w/ replies, xml ) Need Help??


in reply to RE: RE: Schwartzian Transform
in thread Schwartzian Transform

No.

First of all mixing references and arrays tied to disk without thinking carefully about it is asking for serious problems.

Secondly passing the array to Perl's sort function is asking for very serious trouble. That will pass it all into memory!

What I would do for large data structures would be to use DB_File to tie a hash to a BTree, and use properly formatted strings as keys. Blech. But it will work up to the maximum file size for your OS. (OK, up to about half that - BTrees waste something like 40% of the space in the tree.) Or use a proper database.


Comment on RE (tilly) 3: Schwartzian Transform

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (18)
As of 2014-07-23 10:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (140 votes), past polls