9 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
I am very very new to Unix, working on a shell script for my job and was just trying to come up with the correct find command. I get a > symbol on a new line. I can't exit the program either, it will not go back to the $. I am using Cygwin. I don't know if this means no result, or if the fact none... (3 Replies)
Discussion started by: kimberlyg2007
3 Replies
2. Shell Programming and Scripting
Hi all.
I need help with a command to locate a substring from a string.
My problem is I am passing a direcotry name as a command line argument and I need to ensure that user should not pass certain directories.
E.g ther are Directories under ==> /opt/projects/* which should not be passed... (3 Replies)
Discussion started by: Veenak15
3 Replies
3. SCO
Hello. I need to reinstall my Unix Open Server Release: 5 on my Compaq proliant 800, but, my floppy bootdisk Release:5.0.4 is bad. Where can I download that version. That release of Unix is no longer supported by SCO.
Thanks. (4 Replies)
Discussion started by: Junior Rod
4 Replies
4. UNIX for Dummies Questions & Answers
Hi!
I'm new here and glad to meet everyone!
I've been wrestling with a problem lately however! How do I recursively (recursive means to keep going through the subdirectories until no more are there) search a bunch of textfiles in a long directory structure for a specific string.. but only... (1 Reply)
Discussion started by: skwadim
1 Replies
5. UNIX for Dummies Questions & Answers
Hello,
I am new to UNIX OS and I am planning to learn on how to use it since I was granted with the joy of being responsible of SCO UNIX on our network :-)
So, can someone please tell me how to search for a particular string on our UNIX box specifying a server name...???
For some reason... (6 Replies)
Discussion started by: George26
6 Replies
6. UNIX for Dummies Questions & Answers
Please let me know which command and its format to use to search for a file.
Windows provides a find option but i would like to know the equivalent in UNIX.
for example i need to search for a file called uv.config and where exactly it is located in a unix server.
TIA. (4 Replies)
Discussion started by: jhmr7
4 Replies
7. UNIX for Dummies Questions & Answers
Is it possible to search all the file systems on a Unix server for a specific phrase? (1 Reply)
Discussion started by: mmcaleer
1 Replies
8. UNIX for Dummies Questions & Answers
Hi there all
I am looking for both a web browser as well as a web server (Ie. Netscape Fasttrack) that will run on HPUX 10.
If you know where I can get these free via FTP, please contact me as soon as possible!!
Thanks,
Mark (1 Reply)
Discussion started by: mleathers
1 Replies
9. UNIX for Dummies Questions & Answers
Hi,
my company is considering a new development of our web site, which used to run on Apachi over Solaris.
The company who is going to do this for us knows only about developing it in ASP.
I guess this means we'll have to have another ISS server on NT for these dynamic pages :(
What are... (5 Replies)
Discussion started by: me2unix
5 Replies
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)