1. store all file's in one array
2. compare $8 1st field with $8 1st field of other file, if not matching, then that filename should be moved to UNIQUE ID array(delete from main array), if suppose matched then ID is duplicate so duplicate ID should be stored in new array, there can be any number of duplicate ID's
after this I want to access Unique ID file's first
some function
once above 1 completes
I am relatively new here ...but I had a suggestion. The first time I visited this site I tried to go to unix.com and it did not go anywhere I then said ok let try www.unix.com. I think that it would be a good pratice to change the zone file file so that when you go to unix.com it comes here as... (5 Replies)
Can anyone tell me a good alternative to Windows? OS that can connect to a Windows domain and use for everyday (can use with Oracle). Easy to learn. (4 Replies)
Discussion started by: genesisX
4 Replies
3. Post Here to Contact Site Administrators and Moderators
This post should be an edit of the post I just made to start the "Suggestion to ease navigation ..." thread, but my original post is not visible to edit, since it's waiting for moderator approval ...
Additional text I wanted to add to my original post:
The title of the The UNIX and Linux... (2 Replies)
Hi,
I am having experience on Perl and C# and worked as Windows Sytem Admin and now iam planning to become a UNIX developer.
I am having knowledge on basic UNIX..
can any one suggest me any good material for c/c++ UNIX programming.
on what all things a UNIX Programmer needs to... (1 Reply)
Hi All,
Request you to suggest any other book as of year 2013. The below thread is of year 2000 and I have not found the books mentioned in the link below.
Which Unix Certification is the most needed these days?
Or please share any updated thread is there on this.
Thanks and regards,... (7 Replies)
Discussion started by: saps19
7 Replies
6. Post Here to Contact Site Administrators and Moderators
An 'addition' to the "Homework & Classes" requirements..
As i am someone without paper, i just figured i got tempred reading such a question.
To avoid such 'feelings' in future, i'd be thankfull if the 'kind & definition of the course' would be required too.
As in (i dont know about proper... (2 Replies)
Hello,
We have mid level infrastructure of all on-premises servers. All windows servers are getting authenticated by Microsoft Active Directory Services, half Unix (Solaris+Linux) servers are getting authentication by NIS and other half by LDAP.
We have plans to migrate from NIS to LDAP, so... (2 Replies)
I checked (again) and it seems like we lost 70% of our Google indexed links starting in March 2018. So far, I do not know what caused this drop:
https://www.unix.com/members/1-albums215-picture904.png
As mentioned, I have done a lot of checking, and we did not make any changes in March of... (2 Replies)
Discussion started by: Neo
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)