From: Xiangrong Fang <xrfang@...>
Date: 2003-05-27T10:32:08+09:00
Subject: Re: Binary Tree vs. Hash

Hi Mikkel,

Thanks for the detailed explanations. I have some qusestions regarding
your explain:

1. You mentioned B-Tree and binary tree, seems that they are different?

2. I didn't used any of my own hash algorithm, I just used Ruby's hash,
and used Ruby's PStore to dump it to disk. The memory usage is an
estimation from monitoring the task list in win2k. Do you have any
comments about the efficiency of using Ruby's hash and pstore?

3. My application is related to using N-GRAM method to cut Chinese text
into words (a Chinese bigram is 4-byte string). Do you have any comments
on which algorithm is better? I am very interested in your comments
about SkipList, can you expand more?

Thanks a lot!

Shannon