Haas Computing to Host Advanced T- SQL Jan 9-13

Greetings and Happy Holidays

Haas Computing Services is hosting an Advanced T-SQL training for
Microsoft 2000, but many of the topics covered apply to other database
platforms. We have organized this course to cover topics that are beyond
the topics and depth covered by the standard Microsoft T-SQL, and SQL 2000
classes. It will cover joins, subqueries, data types, stored procedures,
user defined functions, security considerations including sql injection and
server configuration, case functions, arrays, performance tuning and other
topics. See the outline and the instructor's comments below for more
information.

Advanced Transact-SQL techniques for SQL Server 2000
January 9 - 13, 2006 for $1500
  Monday - Friday 9:30 am - 4:30pm (4:30 - 5:00 optional lab time)
  at the Haas School of Business in S300T
Reg Fees include instructor fees and electronic access to course materials
which you may choose to print if you want a hard copy. 5 day
training
<http://groups.haas.berkeley.edu/HCS/training_and_classes/HAAS-Adv-SQL-Details-Jan-06.ppt>outline.ppt

The instructor will be
<http://www.objectdatalabs.com/instructors.asp>Hemant
<http://www.objectdatalabs.com/instructors.asp>Kirpekar, Object & Data
Labs, some of you may be familiar with his work teaching courses through UC
Extension.

Advanced Transact-SQL techniques for SQL Server 2000

Say you have been using SQL for a long time. But have you noticed that if
you are using complicated queries using SQL, the performance deteriorates
exponentially as the SQL complexity increases? The SQL Query Optimizer can
only take you so far. After a point it actually produces worse performing
code than one could implement by hand.

If you have been doing serious SQL programming for some time you must have
stumbled on co-related subqueries and on self-joins. Both these SQL forms
are extremely useful and necessary for analysis algorithms but are highly
inefficient. Using Group By's and Having clauses with characteristic
functions generated with a simple ORACLE DECODE or a SQL Server CASE
IF..ELSE is much more optimal. This seminar shows how characterizing
techniques can be used to produce "ugly" code, yet be:
             orders of magnitude faster,
             allow for loop free execution
             and eliminate the need to perform expensive 3GL operations.

It also shows why negative clauses such as "NOT EXISTS" are much more
useful than positive clauses for in-depth analysis

The seminar provides several examples of table pivoting and folding and
various types of report generations using characteristic functions among
other techniques.

It explores temporal and null data and explains 3-valued logic applicable
to Nulls.

It shows several examples of subsets and sequence for analysis of the kind
done in the Stock Market.

In bioinformatics Advanced SQL class is very useful for analyzing SNP data
to discover potential associations with candidate genes or loci.

Arrays, Matrices, Tree and Graph algorithms are excellent for problems in
the telecommunication and disk drive industries.

All of these are discussed with an emphasis on various types of support
structures that make algorithms easy for Extract, Transform and Load (ETL)
on data from an Operational System.

Stored Procedures for efficient & secure analysis, user defined functions,
SQL Server vulnerabilities and Security are explored.

Of course, the course is not complete unless a discussion on the Optimizer
and how SQL can be tweaked for it is discussed, along with pointers and
suggestions for writing optimal SQL code.
****************************************************************************************

If you'd like to register mailto:valerio@haas.berkeley.edu
We can accept payment by IOC - chartstring, or Check to UC Regents

Thanks-KV

Kathleen Valerio
Training Operations Manager
Haas Computing Services
S545 Student Services
Berkeley, CA 94720-1900

ph: (510) 642-8438
fx: (510) 642-5307
-----------------------------------------------------------------------
The following was automatically added to this message by the list server:

Webnet information is available at http://webnet.berkeley.edu. Email sent to this list is archived at http://ls.berkeley.edu/mail/webnet/ . This archive is open to the general public and browsable by search engine spiders, email-address harvesting robots, your bosses, etc.
Received on Wed Dec 14 12:49:54 2005