Mail Archive Search: <+subject:/^(?:^\s*(re|sv|fwd|fw)[\[\]\d]*[:>-]+\s*)*AW\:\s+Reconstruct\s+aggregates\s+on\s+diskpools\s*$/>

Results:

References: [ +subject:/^(?:^\s*(re|sv|fwd|fw)[\[\]\d]*[:>-]+\s*)*AW\:\s+Reconstruct\s+aggregates\s+on\s+diskpools\s*$/: 2 ]

Total 2 documents matching your query.

1. AW: Reconstruct aggregates on diskpools (score: 1): Author: Stefan Holzwarth <stefan.holzwarth AT ZENTRALE.ADAC DOT DE>; Date: Tue, 13 Nov 2001 15:51:02 +0100; Hi Bill, thanks for your input. What do you think about aggregates on diskpools over a long time? Is there much performance penalty due to inefficent aggregates with many gaps inside? Regards, Stefan; /lists/html/ADSM-L/2001-11/msg00477.html (10,294 bytes)
2. Re: AW: Reconstruct aggregates on diskpools (score: 1): Author: Bill Colwell <bcolwell AT DRAPER DOT COM>; Date: Tue, 13 Nov 2001 12:31:32 -0500; Steffan, I don't really know if moth-eaten aggregates have a performance penalty; maybe someone from development can provide an answer. My gut feeling is that there in NOT any penalty. My guess is th; /lists/html/ADSM-L/2001-11/msg00495.html (11,382 bytes)

Current List: 1 - 2
Page: [1]