summaryrefslogtreecommitdiff
path: root/bugs/performance-with-many-hardlinks.mdwn
diff options
context:
space:
mode:
Diffstat (limited to 'bugs/performance-with-many-hardlinks.mdwn')
-rw-r--r--bugs/performance-with-many-hardlinks.mdwn14
1 files changed, 0 insertions, 14 deletions
diff --git a/bugs/performance-with-many-hardlinks.mdwn b/bugs/performance-with-many-hardlinks.mdwn
deleted file mode 100644
index d30639a..0000000
--- a/bugs/performance-with-many-hardlinks.mdwn
+++ /dev/null
@@ -1,14 +0,0 @@
-[[!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