11-02-2010
More specifically
5 columns in file 1
11 columns in file 2
file 1 has more lines than file 2
cols 1, 2, 4, 5, 6, 7 match info between the two files
based on the matching cols (1,2,4,5, 6,7) to only record count of file 2 i want to extract cols 3,5 from file 1 and merge them with file 2
10 More Discussions You Might Find Interesting
1. Solaris
Hey guys I am new here and like this forum alot. I went to get into Solaris and would like to buy a sun box on ebay. NON rackmount. Problem is there is so many diff types. I am looking for one under the $800 range that can support solaris 10 and have the basics and decent ram.
Can you guys... (11 Replies)
Discussion started by: Gnfanatic
11 Replies
2. UNIX for Dummies Questions & Answers
How can i pick distinct records which consists of duplicate data from a ASCII file using UNIX commands (3 Replies)
Discussion started by: ss4u
3 Replies
3. Shell Programming and Scripting
Hi,
How do i pick a particular value from a group of lines using python.
for instance from the below sample. How do I pick Value=1 of OuterLines=1 and InnerLine=1 (11 Replies)
Discussion started by: ahmedwaseem2000
11 Replies
4. Shell Programming and Scripting
I need a scriptto print only those files from a list of files starting with STMT* which are not of zero bytes ...i.e they have some size
if these are the files
631
-rw-r--r-- 1 assrisa assrisa 39099 Aug 19 07:16 STMT_05_D1090819_T071320
-rw-r--r-- 1 assrisa assrisa 0 Aug 19... (2 Replies)
Discussion started by: viv1
2 Replies
5. Shell Programming and Scripting
Hi, I have a problem I am trying to solve with bash.
I need to search in a file system (data base) with hundreds of directories and thousands of subdirectories and millions of files. The files have a specific format with a header that gives the properties. Directories are organized so... (1 Reply)
Discussion started by: majest
1 Replies
6. Shell Programming and Scripting
Hi Friends,
I'm facing an issue. I am having a file as under :
a1
b1
c1
a2
a3
a4
b4
a5
b5
and I need to get the output as under:
a1 b1
a4 b4
a5 b5
i.e. to pick the columns where a and b are consecutive and ignoring rest.
I was trying some thing sily as: (2 Replies)
Discussion started by: vanand420
2 Replies
7. UNIX for Dummies Questions & Answers
Hi Everyone:
I'm new to linux and I was wondering what the best way to approach the following problem was.
I have 2 files:
File A:
ID123
ID234
ID456
File B:
ID123 ID234 ID345 ID456
A B C D
E F G H
I J K L
Based on the list of IDs in File A, I want to output only the... (3 Replies)
Discussion started by: chongm88
3 Replies
8. Shell Programming and Scripting
Hi,
I have sar disk reports like below sample:
01:01:00 hdisk24 0 0.0 0 0 0.0 0.0
hdisk15 0 0.0 0 3 0.0 5.5
hdisk20 0 0.0 2 1 0.0 1.9
hdisk19 1 ... (3 Replies)
Discussion started by: reddyr
3 Replies
9. Filesystems, Disks and Memory
Hi all,
I'm a bit new to advanced filesystem types. I've just only learned that if you wish to share a single fibre channel extent with many servers you need to use a clustered filesystem to prevent data corruption.
looking through a list of clustered file systems I saw gfs2 which I thought... (1 Reply)
Discussion started by: jokken
1 Replies
10. Shell Programming and Scripting
looking for any advise on how to export Pick data from an AIX implementation. i have someone with limited experience that knows how to create a text file from a pick database. (1 Reply)
Discussion started by: jgt
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)