A BTree on disk ?

From: Damir Buskulic (buskulic@lapp.in2p3.fr)
Date: Thu Apr 29 1999 - 09:29:05 MEST


Hi,

Searching solutions for my "big file" sorting problem, I found something
interesting. BTree's are implemented for main memory use. Would it be
possible to make a special Branch that would be a BTree on disk and
allow people to very quickly access data by something else than the
index of an event ?.
It's not just putting a TBTree inside a branch, because in the case of
very big (1Gig) btree's, one cannot put it in main memory.
I don't know what is the amount of work to do that, but it seems to me
that all the building blocks are here (TBranch, TBTree,...)

Fons ?

Cheers

Damir

P.S. For people thinking "but what the hell is a BTree ?", a question
that I asked myself some days ago, look here :

http://www.semaphorecorp.com/btp/algo.html

It's quite well explained
-- 
=====================================================================
| Damir Buskulic                  | Universite de Savoie/LAPP       |
|                                 | Chemin de Bellevue, B.P. 110    |
| Tel : +33 (0)450091600          | F-74941 Annecy-le-Vieux Cedex   |
| e-mail: buskulic@lapp.in2p3.fr  | FRANCE                          |
=====================================================================
mailto:buskulic@lapp.in2p3.fr



This archive was generated by hypermail 2b29 : Tue Jan 04 2000 - 00:43:32 MET