Articles & Content

Archives

How Many 's' are There in Mississippi? (G01)

Topic: 2007 NA

Subtopic: DB2 for z/OS



DATE: 2007-5-7 (09:50 AM - 10:50 AM)
SPEAKERS: Peter Backlund (Peter Backlund DB2-Konsult AB)

A classical problem in computing is finding the needle in a haystack. This presentation will first discuss various ways of solving this problem.A more intersting problem is to find the number of needles and also their positions in the haystack.Various ways of solving this problem is discussed, using UDFs, recursive UDFs, Stored Procedures, recursive Stored Procedures, and recursive SQL

EXP. LEVEL: Intermediate,Advanced

OBJECTIVES:

Understanding the various ways of finding a needle in a haystack

Understanding the use of recursive SQL

Understanding the use of UDFs

Understanding the use of recursive UDFs

Understanding the use of recursive Stored Procedures



This file is being provided by IDUG. We would encourage you to join IDUG to get full access to all of our files and resources. Joining IDUG is FREE and signing up is simple. Click here to join! or login!

Download File
Click to Download

NOTE: These are only open to members of IDUG. If you are not a member, please CLICK HERE for more information.