[plt-scheme] PLT with very large datasets?

From: Eric Hanchrow (offby1 at blarg.net)
Date: Mon Jun 30 08:58:40 EDT 2008

>>>>> "Yavuz" == Yavuz Arkun <yarkun at gmail.com> writes:

    Yavuz> I am afraid any sort of relational DB is going to be slow.

Berkeley DB is not a relational DB; it's basically a big on-disk hash
table.  Dunno how fast it is, though.

If you're trying to choose between two theories and one gives
you an excuse for being lazy, the other one is probably right.
        -- Paul Graham

Posted on the users mailing list.