05-18-2011
grep would not work because requirement states to match a specific column, grep will match any line regarless of column.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
I need a help in deleting a line matching a particular pattern in a file using shell script without opening the file. The file is a .c/.cpp file. Is it possible?
Thanks (6 Replies)
Discussion started by: naan
6 Replies
2. UNIX for Dummies Questions & Answers
Hi UNIX Gurus,
I have got the following requirement and totally :confused: how to proceed.
A file is dummy.lst is there in the following format:--
ID NAME TYPE_ID
-------- --------- -----------
1947 Asia ... (1 Reply)
Discussion started by: rahul26
1 Replies
3. Shell Programming and Scripting
I have a text file, with a fixed format of certain data.
I have to extract certain fields of data.
Then store it in a structure.
Is it possible to use shell commands by making a system call from a C PROGRAM and then store the extracted data in the structure (which has been declared in the C... (1 Reply)
Discussion started by: umanglalani
1 Replies
4. AIX
Hi all,
Could you please give me the command to know which is the default block size for a file on AIX ?
Thank a lot ! :b: (2 Replies)
Discussion started by: V3l0
2 Replies
5. UNIX for Advanced & Expert Users
Hi,
I need help with using an awk or sed filter on the below line
ALTER TABLE "ACCOUNT" ADD CONSTRAINT "ACCOUNT_PK" PRIMARY KEY ("ACCT_ID") USING INDEX PCTFREE 10 INITRANS 2 MAXTRANS 255 STORAGE(INITIAL 65536 FREELISTS 1 FREELIST GROUPS 1) TABLESPACE "WMC_DATA" LOGGING ENABLE
Look for... (1 Reply)
Discussion started by: rajan_san
1 Replies
6. Shell Programming and Scripting
Hello there,
I'm trying to write an awk program in bash shell with the following three input files:
File 1
1001 1 2 3
1002 4 5 6
1003 7 8 9
1004 10 11 12
File 2
1001 11 22 33
1002 44 55 66
1004 100 111 122
... (4 Replies)
Discussion started by: kbirde
4 Replies
7. UNIX for Dummies Questions & Answers
HI All ,
Pardon me for asking some very basic questions,
I would be grateful if someone can help.
I am trying to execute a shell script which runs multiple processes in background. It includes various operations like copying , DB operations etc etc.
Now problem is that the complete... (1 Reply)
Discussion started by: gpta_varun
1 Replies
8. Shell Programming and Scripting
my files are as follows
fileA sepearated by tab /t
00 lieferungen
00 attractiop
01 done
02 forness
03 rasp
04 alwaysisng
04 funny
05 done1
fileB
funnymou120112
funnymou234470
mou3raspnhdhv
rddfgmoudone1438748
so all those record which are greater than 3 and which are not... (6 Replies)
Discussion started by: rajniman
6 Replies
9. Shell Programming and Scripting
Hi All,
i have two files file1 ,file 2
file 1
col1|col2|col3|col4|col5|col6|col7|col8
11346925|0|2009-09-20|9999-12-31|100|0
11346925|0|2009-09-20|9999-12-31|120|0
12954311|0|2009-09-11|9999-12-31|100|0
12954311|0|2009-07-23|2999-12-31|120|0
12954312|0|2009-09-11|9999-12-31|100|0... (9 Replies)
Discussion started by: mohanalakshmi
9 Replies
10. Shell Programming and Scripting
Hi Guys,
I am having two requirement in one of my scripts. please help out to find a fast solution using AWK (since there is lot of data to be processed)
1) First snippet -
File1 has two columns and file2 has three columns
If any value of column 1 of file1 matches with column 1... (4 Replies)
Discussion started by: stormfield
4 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)