Browse Prior Art Database

Database Stress Test via Web Activity Simulation

IP.com Disclosure Number: IPCOM000013948D
Original Publication Date: 2001-Aug-28
Included in the Prior Art Database: 2003-Jun-19
Document File: 3 page(s) / 83K

Publishing Venue

IBM

Abstract

An algorithm and a program is disclosed that generates a workload against a database server that might originate from a web based application. In an environment where a database is accessed via a web application a guarantee of a uniform connection distribution is unlikely. An expected connection pattern against a database throughout the day might look like the graph in Figure 1 but a more likely pattern is in Figure 2.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 3

Database Stress Test via Web Activity Simulation

  An algorithm and a program is disclosed that generates a workload against a database server that might originate from a web based application. In an environment where a database is accessed via a web application a guarantee of a uniform connection distribution is unlikely. An expected connection pattern against a database throughout the day might look like the graph in Figure 1 but a more likely pattern is in Figure 2.

Figure 1.

Figure 2.

In Figure 2 there are more peaks in usage. A method of producing this workload against the database in this environment is necessary to ensure the system is robust enough to handle these peaks in demands on resources.

This situation could arise from a web user doing a search for material via a web site which accesses a database. The user would enter the search criteria via the web and then hit a submit button. Due to network loads or database delay the answer or result may not be presented immediately. The user in this case may click the submit button repeatedly thinking the transaction did not go through. Multiply this affect by a number of users and a random, non-uniform connection pattern illustrated in Figure 2 arises.

1

[This page contains 2 pictures or other non-text objects]

Page 2 of 3

How is this pattern simulated easily? An algorithm is described below.

1. Select a random number between some user determined limits (x)

2. Issue x connections and have those connections sleep for x seconds prior to disconnecting. The user can produce a test application that simply connects to a database and sleeps for a certain amount of time. Rather than sleeping for x seconds, another application that runs some simple transactions could be used to simulate an on-line transaction processing (OLTP) environment.

3. Sleep for a user determined amount of time prior to launching more connections

4. A check can be done to ensure the number of connections is not above some user determined threshold.

5. Repeat steps 1 to 4.

Below is an implementation of this solution.. It calls a C application with embedded SQL (connect). The connect...