j
: Next unread message k
: Previous unread message j a
: Jump to all threads
j l
: Jump to MailingList overview
Hmm, with "main" memory being so much slower than cache, btrees might even start making sense for in-memory structures. But not necessarily for Squeak, where an "array of foo's" won't necessarily have all of the foo's next to each other, anyway, and thus where accessing items within a node still causes fetches to distant parts of memory.
You might want to take a look at:
Cache Conscious Indexing for Decision-Support in Main Memory (Jun Rao and Kenneth Ross at Columbia University)
http://citeseer.nj.nec.com/rao99cache.html
If the foo's are SmallInteger's, it could be interesting, but probably not for the general case.
-david
Attachments:
squeak-dev@lists.squeakfoundation.org