Greg Doherty wrote: > > I did not want to comment because I thought someone else would. > B-trees were originally designed for disk access - they may Perhaps I wrongly expressed myself. I understood that BTrees where mainly for disk access. I just wanted to say that the ROOT implementation (TBTree) was for resident memory uses. Sure, for the kind of analyses people are trying to do with ROOT, most of the time, one doesn't need BTrees on disk. But sometimes, it can be something valuable, as the need was expressed by a few people for a random access of data, indexed by something else than the tree index number. Cheers Damir -- ===================================================================== | 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