A file whose location i am not aware of contains the below text
I need to grep strictly for these two strings together "oracle:thin" and in the result just need to display "HOST=ngm2sn1p2-vip.mybank.net" "PORT=4001" for every entry found in any file and ignoring the duplicate entries for combined HOST and PORT.
Below is what i wish to extend in order to achieve the above.
Your help is appreciated.
Hello,
I have three tables.
I need an SQL query (preferably Sybase) that will return all of the stringID values of table B where the following conditions exist:
(1) B.intID = A.intID
(2) B.intID != C.intID
or (B.intID = C.intID and
(C.v1 = 0 or C.v2... (2 Replies)
Hi,
The C code we've written work ok on Mac, but make a " segmentation fault" when running on SUN. One potential bug is complex.h because the complex.h in the lib/ is licensed by Apple. Does anybody know how to add in complex.h into lib/ on the SUN so we can deal with complex numbers in our code?... (3 Replies)
I would like to use the result of a query in another query. How do I redirect/add the output to another variable?
$result = odbc_exec($connect, $query);
while ($row = odbc_fetch_array($result)) {
echo $row,"\n";
}
odbc_close($connect);
?>
This will output hostnames:
host1... (0 Replies)
Hi,
I have a requirement as below which needs to be done viz UNIX shell script
(1) I have to connect to an Oracle database
(2) Exexute "SELECT field_status from table 1" query on one of the tables.
(3) Based on the result that I get from point (2), I have to update another table in the... (6 Replies)
Hi all,
I have a bit of an issue, I am working on a bit of a CMDB for a friend, it's to do with real estate.
Anyway, this is my situation.
I have a table which contains all the properties (forsale, sold, etc) in the DB named "property".
Now, this is what I want to achieve, I wish to... (5 Replies)
Hi,
I need to query Oracle database for 100 users. I have these 100 users in a file. I need a shell script which would read this User file (one user at a time) & query database.
For instance:
USER CITY
--------- ----------
A CITY_A
B CITY_B
C ... (2 Replies)
Hi,
I wish to find the latest occurance of the below string in my log file.
Once found, I need to search the below string after the above string
and display this
Request 331489 has passed
or
Request 331489 has failed
I would like my query to be platform... (11 Replies)
If I need the output as below, what syntax I should use. I use only korn shell.
=========In file ===========================
#!/usr/bin/ksn
P1=cat
P2=dog
P3=bat
for i 1 2 3
do
echo $P$i # <---------- This line is the problem I face. What I should use.
done
========= End of file... (5 Replies)
for i in $(condition ONE);do for e in $(CONDITION TWO);do
if ; then
command 1
command 2
command 3
else if ; then
command 1
command 2
command 3
else if ; then
... (6 Replies)
Hi,
I provide the path to a folder.
I would like so drill in each folder inside the folder i gave and show me the size in human readable form du -sh <folder-name> of the top 8 folders with maximum sizes.
For example:
Path of the folder: "/opt/app/myapp" has these directories.
ls... (2 Replies)
Discussion started by: mohtashims
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)