blob: d30639a7b2f8b40543e934ecdc32c19f8669968b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
|
[[!tag obnam-performance]]
How does Obnam perform if the live data has massive numbers of hardlinks?
Such hardlink trees are not rare, but it would be good to at least know
how Obnam handles them. Perform a benchmark comparing three cases:
1. a very large number (one million?) of small files, all unique
2. same, but all files identical
3. same, but all files hardlinks to the same content
Ideally, Obnam should perform about the same for all. --liw
[[done]] really ancient wishlist bug --liw
|
