Skip Lists?!

Pennell, David DPennell at quallaby.com
Mon Oct 1 13:08:54 UTC 2001


> 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
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.squeakfoundation.org/pipermail/squeak-dev/attachments/20011001/a9cef9f0/attachment.htm


More information about the Squeak-dev mailing list