Hey - this is a pretty dull Friday!

Andy Lankester

Hey - this is a pretty dull Friday!
New Year Blues got you all?

Here's a DB2 for z/OS teaser for you. SQL to calculate the approximate number of levels any perfectly organised NPSI would have given FULLKEYCARDF of index, CARDF of table, AVGKEYLEN, PGSIZE of index. Assume RID size is 4 and PCTFREE/FREEPAGE are 0 (am I not kind?). Obviously this assumes index key lengths and/or rids/key are not seriously skewed .

I have an idea but it is pretty ugly and, not being recursive, it is limited to a maximum level (currently 14). Anyone have more than 14 levels?

Have a good weekend!

Andy

_____

From: DB2 Data Base Discussion List [mailto:[login to unmask email] On Behalf Of Grainger, Phil
Sent: Friday, January 11, 2008 4:57 PM
To: [login to unmask email]
Subject: Re: [DB2-L] downloading fixes from CA ?


Hi Chris

So far as I understand it, your last statement is the way to go (option 4?)

Supportconnect, if it is told what your CURRENT maintenance level is, will build you a package pf PTFs (and pre-reqs and co-reqs) that you don't already have

Our tech support folks will be able to talk you through the process

Phil Grainger
CA
Product Management Director
Phone: +44 (0)1753 577 733
Mobile: +44 (0)7970 125 752
eMail: HYPERLINK "mailto:[login to unmask email]"[login to unmask email]

Ditton Park
Riding Court Road
Datchet
Slough
SL3 9LL

CA plc a company registered in England and Wales under company registration number 1282495 with its registered office at the address set out above. VAT number 697904179.



_____

From: DB2 Data Base Discussion List [mailto:[login to unmask email] On Behalf Of Chris Hoelscher
Sent: 11 January 2008 16:49
To: [login to unmask email]
Subject: [DB2-L] downloading fixes from CA ?



i am curious as to how others perform this chore.

if i want to download a small number (4) fixes, i seem to have 3 choices:

1) download the 4 - receive and apply check - look for prereq failures, go get those prereqs - go through the cycle over and over until all fixes and needed prereqs are installed
2) create a package of the 4 - perhaps hundreds of fixes - receiving them all (most are already there) and applying what needs to be applied
3) create a package of the 4 - and try to manually deleting the fixes already installed

or is there a process within CA similar to IBM where site-specific information can be introduced to the required fix-download process???

thanks in advance for any information,

Chris Hoelscher
Senior IDMS & DB2 Database Administrator
Humana Inc
502-476-2538
[login to unmask email]



The information transmitted is intended only for the person or entity to which it is addressed and may contain CONFIDENTIAL material. If you receive this material/information in error, please contact the sender and delete or destroy the material/information.
The IDUG DB2-L Listserv is only part of your membership in IDUG. DB2-L list archives, the FAQ, and delivery preferences are at HYPERLINK "http://www.idug.org/lsidug"www.idug.org under the Listserv tab. While at the site, you can also access the IDUG Online Learning Center, Tech Library and Code Place, see the latest HYPERLINK "http://www.idug.org/lsconf"IDUG conference information, and much more.
If you have not yet signed up for Basic Membership in IDUG, available at no cost, click on HYPERLINK "http://www.idug.org/lsms"Member Services


The IDUG DB2-L Listserv is only part of your membership in IDUG. DB2-L list archives, the FAQ, and delivery preferences are at HYPERLINK "http://www.idug.org/lsidug"www.idug.org under the Listserv tab. While at the site, you can also access the IDUG Online Learning Center, Tech Library and Code Place, see the latest HYPERLINK "http://www.idug.org/lsconf"IDUG conference information, and much more.
If you have not yet signed up for Basic Membership in IDUG, available at no cost, click on HYPERLINK "http://www.idug.org/lsms"Member Services


No virus found in this incoming message.
Checked by AVG Free Edition.
Version: 7.5.516 / Virus Database: 269.19.0/1218 - Release Date: 10/01/2008 13:32



No virus found in this outgoing message.
Checked by AVG Free Edition.
Version: 7.5.516 / Virus Database: 269.19.0/1218 - Release Date: 10/01/2008 13:32


The IDUG DB2-L Listserv is only part of your membership in IDUG. DB2-L list archives, the FAQ, and delivery preferences are at http://www.idug.org/lsidug under the Listserv tab. While at the site, you can also access the IDUG Online Learning Center, Tech Library and Code Place, see the latest IDUG conference information, and much more. If you have not yet signed up for Basic Membership in IDUG, available at no cost, click on Member Services at http://www.idug.org/lsms

Avram Friedman

Re: Hey - this is a pretty dull Friday!
(in response to Andy Lankester)
Andy

three opening remarks
1) i am not a SQL coder
2) ignore non unique indexes
3) my assumption is the number of leaf pointers at Level N is
INT((KeyLength+4)/4056) ** N
for example if you could have 10 pointers per page then
level pointers
0 10
1 100
2 1000

So my static style SQL would look something like this
EXEC SQL BEGIN DECLARE SECTION;
DCL IDXLVL int;
DCL PTRPAGE int;
EXEC SQL END DECLARE SECTION;
SET PTRPAGE=((avgKeyLen+4)/4056); -- adjust for usable space in page
SET IDXLVL = 0;
FINDLVL: WHILE POWER(PTRPAGE,IDXLVL) < fullkeycardf DO
SET IDXLVL = IDXLVL + 1;
END WHILE FINDLVL;
/* answer is in variable IDXLVL at this point */


Best Wishes
Avram Friedman

PS please deposit commisions and royalties to my PayPal account.


On Fri, 11 Jan 2008 11:31:05 -0600, Andy Lankester
<[login to unmask email]> wrote:

>New Year Blues got you all?
>
>Here's a DB2 for z/OS teaser for you. SQL to calculate the approximate
number of levels any perfectly organised NPSI would have given
FULLKEYCARDF of index, CARDF of table, AVGKEYLEN, PGSIZE of index.
Assume RID size is 4 and PCTFREE/FREEPAGE are 0 (am I not kind?).
Obviously this assumes index key lengths and/or rids/key are not seriously
skewed .
>
>I have an idea but it is pretty ugly and, not being recursive, it is limited to a
maximum level (currently 14). Anyone have more than 14 levels?
>
>Have a good weekend!
>
>Andy
>
> _____

The IDUG DB2-L Listserv is only part of your membership in IDUG. DB2-L list archives, the FAQ, and delivery preferences are at http://www.idug.org/lsidug under the Listserv tab. While at the site, you can also access the IDUG Online Learning Center, Tech Library and Code Place, see the latest IDUG conference information, and much more. If you have not yet signed up for Basic Membership in IDUG, available at no cost, click on Member Services at http://www.idug.org/lsms

Raymond Bell

Re: Hey - this is a pretty dull Friday!
(in response to Avram Friedman)
Well, I got to level 15 in Pacman a few years ago. Cost me a bundle of 20c coins (about 8p at today's rates) too, I can tell ya. Does that count?

Have fun in .eg,


Raymond

________________________________

From: DB2 Data Base Discussion List on behalf of Andy Lankester
Sent: Fri 1/11/2008 5:31 PM
To: [login to unmask email]
Subject: [DB2-L] Hey - this is a pretty dull Friday!


New Year Blues got you all?

Here's a DB2 for z/OS teaser for you. SQL to calculate the approximate number of levels any perfectly organised NPSI would have given FULLKEYCARDF of index, CARDF of table, AVGKEYLEN, PGSIZE of index. Assume RID size is 4 and PCTFREE/FREEPAGE are 0 (am I not kind?). Obviously this assumes index key lengths and/or rids/key are not seriously skewed .

I have an idea but it is pretty ugly and, not being recursive, it is limited to a maximum level (currently 14). Anyone have more than 14 levels?

Have a good weekend!

Andy

The IDUG DB2-L Listserv is only part of your membership in IDUG. DB2-L list archives, the FAQ, and delivery preferences are at http://www.idug.org/lsidug under the Listserv tab. While at the site, you can also access the IDUG Online Learning Center, Tech Library and Code Place, see the latest IDUG conference information, and much more. If you have not yet signed up for Basic Membership in IDUG, available at no cost, click on Member Services at http://www.idug.org/lsms