Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: memory-efficient hash kind for incremental sort

by dragonchild (Archbishop)
on Jan 07, 2009 at 01:30 UTC ( #734537=note: print w/ replies, xml ) Need Help??


in reply to memory-efficient hash kind for incremental sort

Look at CouchDB. It's kinda designed for just this problem.


My criteria for good software:
  1. Does it work?
  2. Can someone else come in, make a change, and be reasonably certain no bugs were introduced?


Comment on Re: memory-efficient hash kind for incremental sort
Re^2: memory-efficient hash kind for incremental sort
by Arunbear (Parson) on Jan 15, 2009 at 11:56 UTC
    Do you have a favourite out of the several CouchDB clients on CPAN ?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (7)
As of 2014-07-31 06:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (245 votes), past polls