Informix News

  • Admin-Scout 2.3 - Übersicht neue Features in Version 2.3 (24.05.2019)
    Focus on Security - Task-Scheduler - Cluster-Configuration - DBSpace Layout History
  • Informix 14 Solution Brief (12.04.19)
    Actual IBM Solution Brief for Informix 14.10 - download here!
  • Virtual Processor Core licensing (03.05.19)
    Virtual Processor Core - the most useful alternative in processor licensing Informix
  • Informix 14 Docu (11.04.19)
    Important - Informix 14.10 comes with a new installation routine!
  • Informix SSL Connection (15.05.2019)
    How to set up a secure SSL connection for Informix servers and clients with a few commands
  • IIUG 2019 (02.07.2019)
           

    IIUG World 2019

    pfeil  
     
    International Informix Users Group
           
invispix 10x10

Fastest Informix DBA Contest Extended to September 2013!

The sixth-annual Advanced DataTools Fastest Informix DBA Contest for database administrators (DBAs) and users who manage IBM Informix databases brings a new twist to this year’s event. In the past, the contest was held at the International Informix User Group (IIUG) Conference. This year, the contest is being held over the web so that anyone, anywhere in the world can participate between July 9 and September 30, 2013.

The challenge is a combination of online transaction processing (OLTP) and batch processing applications. The winner will be the DBA who can get the most transactions per minute in an OLTP benchmark and at the same time run a batch billing job and generate the most bills in a 10-minute run.
 
How it works, and what’s at stake this year, the contest combines the OLTP benchmark from last year’s contest with a new batch billing process. The OLTP benchmark uses the Open Source BenchmarkSQL Java program to generate 1,000 sessions comprising inserts, updates, and deletes within the Informix database. The Open Source BenchmarkSQL is a Java Database Connectivity (JDBC) benchmark that closely resembles the Transaction Processing Performance Council Benchmark C (TPC-C) standard for OLTP.

The goal is to get the most transactions per minute in a 10-minute period. The batch billing process provides an SQL script to generate the billings, and the aim is to get the most bills inserted into a table in a 10-minute period. The primary challenge is to see if you can take an Informix server running 1,000 OLTP users, simultaneously run a batch job on it, and tune it.

The grand prize is an Apple iPad for the DBA who gets the best OLTP and batch processing combination in a 10-minute run. To qualify for the grand prize, entrants must be an Informix DBA, must not be employed by IBM or Advanced DataTools, and must be employed by an organization that uses Informix internally. There are also 10 honorary prize categories, as follows, which are open to anyone:

    * Fastest DBA – OLTP
    * Fastest DBA – batch processing
    * Fastest DBA who made the fewest changes
    * Fastest professional consultant DBA
    * Fastest IBM developer – IBM employee
    * Fastest senior-level DBA – 50 years or older
    * Fastest middle-aged DBA – 30 to 50 years old
    * Fastest young DBA – 30 years or younger
    * Fastest DBA with the least Informix experience
    * Fastest DBA with the most Informix experience

By Lester Knutsen | IBM data-magazine published July 17, 2013
Picture, DBA Contest Winner 2012r, (C) Lester Knutsen

For additional information about the contest and to participate,
please visit the Advanced DataTools web site.


 

invispix 10x10

News categories / back to overview ...

News OverviewNews Overview

News Overview

Informix NewsInformix News

Informix News

IBM Db2 NewsIBM Db2 News

IBM Db2 News

Scout NewsblogScout Newsblog

Scout Newsblog

Our NewsletterOur Newsletter

Our Newsletter

News ArchiveNews Archive

News Archive

invispix 10x10
Informix Monitoring and SupportInformix Monitoring and Support

Informix Monitoring and Support

Integrate IBM SoftwareIntegrate IBM Software

Integrate IBM Software

CURSOR Software AGCURSOR Software AG

About CURSOR Software AG

This site uses cookies to make it easier for us to provide you with our services. By using our site you agree to the use of cookies.
More information Ok