Hi Sue, No, I never implemented the Hints method. The algorithm depends essentially on the access patterns to the Tree. For example, if you select large buffer sizes, this will be excellent for sequential read of all entries. If you select small buffer sizes, it will be better in case you read only a small percentage of all entries. It may be difficult to enter this parameter in a Hints function. Rene Brun selective readSusan Kasahara wrote: > I also observe what I think is an increase in time spent AutoSaving as > the number of events increases, at least when running with compression level=1. > I think this is just because the Tree buffers still in memory as the number of > entries increases are fuller. My solution to this has been to not allow the basket > sizes to be too big (but you don't want to make them too small either due to size > and read performance issues - there has to be a compromise). > There was some discussion of this issue of optimizing the performance of > AutoSave on an earlier posting: > http://root.cern.ch/root/roottalk/roottalk99/2564.html > Rene, at that time you suggested providing a method of automatically > tuning the basket size to optimize the performance with AutoSave. > Did anything come of that? I think that this would be extremely useful. > > Sue Kasahara
This archive was generated by hypermail 2b29 : Tue Jan 02 2001 - 11:50:35 MET