directory-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From <>
Subject Re: [database] Skiplist's are probabilistic BTrees
Date Mon, 17 Nov 2003 04:23:06 GMT
Oh I forgot another really good link or two on skiplists:

This is an applet demo of the algorithm - darn microsoft products don't have the vm so I can't
see it till later.

> From: <>
> Date: 2003/11/16 Sun PM 11:18:34 EST
> To: <>
> Subject: [database] Skiplist's are probabilistic BTrees
> Another research item to digest on the database side.  From what I understand they out
perform the conventional binary tree algorithm which our default backend is based on.  Perhaps
one day this might be worth more consideration however again I want to note it on the list
for future reference.
> "A skip list is a probabilistic alternative to binary trees. They seem to be a smart
and efficient way of achieving a similar objective, i.e. doing what binary trees are good
> Alex

View raw message