Hi all!
I'd like to know the differences between hard links and soft links. I've already read the ln manpage, but i'm not quite sure of what i understood.
Does a hard link sort of copy the file to a new name, give it the same inode number and same rights?
What exactly should I do to do this:... (3 Replies)
I am curious about one thing.
Lets say I have a file file-a to which new generations are created on demand by simply archiving it (ex: file-a.tar.gz) and having the new one created with the same original filename file-a.
Now what I want to know is if I create a hard/soft link to file-a, what... (1 Reply)
Hi
PLease let me know the usage of Hard Link vs Soft Link
i.e what is the basic difference and what happens when one file is changed or deleted in both the cases???
thanks (3 Replies)
Hi Experts,
Please help me out to find out difference between a hard link and a soft link.
I am new in unix plz help me with some example commands ( for creating such links).
Regards
S.Kamakshi :) (2 Replies)
Hi,
I have created soft links for some devices /dev/xvd*1. The owner of the soft links is oracle:dba. The problem is after reboot the ownership is changed to root:root. How can I permanently change the ownership to oracle:dba?
Thanks. (2 Replies)
Hi ,
When installing oracle software a set of directories are created under
the home directories.
Since the home directory is usually not big , i would like to create a soft link
from the home directory to mount point with alot of free space , that way the logs will not be wriiten under the... (1 Reply)
hi
i have create a soft link using below command.
ln -s <filename> <dirmane>where file name i use is t1 and dir name was t2.
i deleted the dir t2 using command rm -rf to remove the soft link .
however again i create a file a using the name t2 and when i just try to link t1 to t2 ... (1 Reply)
I did restore from netbackup for root file system on separate slice instead of corrupted one. After restoration I found there are number of soft link issues lie
e.g
libabcxyx > /mnt/usr/lib
it should be
libabcxyz > /usr/lib
does any have solution to change symbolic link changed in... (1 Reply)
Hi All,
I tried creating a soft link with the file itself. It got created successfully.
bash-3.2$ ls -l a
lrwxrwxrwx 1 ebrigup other 1 Oct 5 19:14 a -> a
bash-3.2$
Can anyone explain what is the possible use of it. I dont see any except practically wasting an inode... (2 Replies)
Discussion started by: brij123
2 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)