09-04-2001
i beleave i understand yourstatement. I already have the size of the Logical Volume. I am trying to find out the actual size of the db space used. that way i can reduce the lv size acordingly.
the 4096 from what i was told is the size of each page in bytes. the colume for size and free are in pages. this is where i was getting my math from to figure out how big the actual dbspace is.
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
How do I access Informix from unix? It's been about 2 years since I've last used unix and I've forgotten the command. (2 Replies)
Discussion started by: pbouknight
2 Replies
2. Solaris
hi ,
we are using Veritas netbackup 5 to backup all databases at our site.
i noticed lately that a specific filesystem on the netbackup servers in running critically out of space , after some investigations i found that there are images that are increasing in size everytime a backup is taken .... (6 Replies)
Discussion started by: ppass
6 Replies
3. Shell Programming and Scripting
Hi All
Please let me know if there is command to check the version of the informix database installed..?
Thanks in advance.
Suresh (4 Replies)
Discussion started by: sureshg_sampat
4 Replies
4. HP-UX
Hi all ,
How to know the size of a oracle database running in hp-ux server. (1 Reply)
Discussion started by: megh
1 Replies
5. UNIX and Linux Applications
Can anybody tell me how to look for the size of the database on the solariis servers.
I am using Solaris 5.6 and Solaris 1.1.1
Any help will be appreciated.................. (1 Reply)
Discussion started by: asalman.qazi
1 Replies
6. HP-UX
I just used the dbsize command to find the size, but i guess, it doesn't gets me what i look for. (0 Replies)
Discussion started by: dvah
0 Replies
7. UNIX for Dummies Questions & Answers
Can anyone point me toward information on setting up a Debian server ODBC connection to an Informix server? I have a Windows server set up with the Informix drivers in ODBC and I'd like to do the same thing on Debian so that my Rails apps can query the database beneath our call-logging software. ... (1 Reply)
Discussion started by: badmoon75
1 Replies
8. Shell Programming and Scripting
Hello,
I'm not very good at scripting as my job is an DBA for a small firm, but now I'd like to implement a few cron jobs which access and report on the databases on an automatic basis.
This is my SQL TEXT
# -- Total size of Database Size in GB
set echo off feedback off verify off pause... (2 Replies)
Discussion started by: jnrpeardba
2 Replies
9. UNIX for Dummies Questions & Answers
Hello,
I'm not very good at scripting as my job is an DBA for a small firm, but now I'd like to implement a few cron jobs which access and report on the databases on an automatic basis.
This is my SQL TEXT
# -- Total size of Database Size in GB set echo off feedback off verify off... (4 Replies)
Discussion started by: jnrpeardba
4 Replies
10. Shell Programming and Scripting
Hi,
Below is my input file:
Long list of significant figure
1.757E-4
7.51E-3
5.634E-5
.
.
.
Desired output file:
0.0001757
0.00751
0.00005634
.
.
. (10 Replies)
Discussion started by: perl_beginner
10 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)