>> BTW, Just committed a partial btree implementation to memcouchd: >> >> https://github.com/pcapr/memcouchd/blob/master/lib/btree.js >> > > You might have a look at nStore or node-dirty. Some work has already > gone into making these efficient. > As I recall from talking to Tim Caswell, the major limitation to > nStore at some time was file size limitations due to js not handling > big integers with 100% precision. > It may be that a database size limit is an acceptable limitation.
Just looked at the code and based on a quick glance, both of them seem to be key/value store's with no collation. For views to work in any capacity, collation is a prerequisite (think startkey/endkey style of iteration). K. --- http;//twitter.com/pcapr http://labs.mudynamics.com
