Re: Data Structure for use vs storage
"David McClain (as dbm at refined-audiometrics dot com)" <[email protected]>
| Newsgroups | gmane.lisp.lispworks.general |
|---|---|
| Message-ID | <[email protected]> |
> B-trees (et similia) make a lot of sense when you are dealing with disks and blocks (and cylinders, and tracks). If your data can stay in memory, you can use any dictionary adt you like. Thanks. That makes sense. guess I have never needed anything beyond in-memory databases, as long as they could be persisted at shutdown. _______________________________________________ Lisp Hug - the mailing list for LispWorks users [email protected] http://www.lispworks.com/support/lisp-hug.html