ext4, ok...try these, although I have not used either, so your mileage may vary. Plus you may want to mount the FS read only ASAP, so that it can prevent any more writes. Basically your recovery chances are maximixed if the underlying inode data structure is preserved and no more changes are allowed.
We have a situation in a large dept of programmers where critical accounting data files were deleted. Is there any way in UNIX to trace deletions and or possibly retrieve the deleted file? (14 Replies)
I had a user run, by accident, the following line command on our UNIX server:
rm -f /usr/*
This apparently deleted some needed files on your system. Having very limited knowledge in UNIX, I thought I would ask the group if anyone knows how I can recover these file?
The version of UNIX is... (3 Replies)
One of the files got deleted and i want to find who deleted that file.
I think we can get the list using history command. Could you please let me know how to get the list of rm commands from history and who previously logged in and did that?
Any other suggestions other than history also... (2 Replies)
Hi All,
I am using Fedora Core and Windows Xp. I deleted all the files from root
directory. When i am trying to restart the computer it showing some grub > prompt. What i will do ? I have lots of data in XP OS.
Please help me
i used
# rm * (8 Replies)
Just looking for some guidance on how to figure out who might have deleted some files off one of my systems.
These files are not root owned files so could be deleted by a handful of folks in the group responsible for these files besides the root users.
Anyway I have been tasked with trying to... (1 Reply)
Discussion started by: juredd1
1 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS --predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO bup-midx(1), bup-save(1)BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown-bup-margin(1)