Browse Prior Art Database

Heuristic Extent Estimator For GUI Form Completion

IP.com Disclosure Number: IPCOM000218134D
Publication Date: 2012-May-23
Document File: 2 page(s) / 78K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is a tooling mechanism for creating data objects that generates customized extent values within a wizard such that a user needs only to answer two simple questions about future usage, and then the tooling provides workable extent values.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 71% of the total text.

Page 01 of 2

Heuristic Extent Estimator For GUI Form Completion

When creating data objects such as relational database tables, users must estimate storage and space needed to identify the optimum allocation unit, herein referred to as extents. This is a difficult and dynamic problem to solve for users because the estimates include the current needs and future growth needs. The knowledge to perform this task requires significant experience in both using the database, applications, and creating tables to provide workable/optimal values. It tends to be a trial and error learning process. Poor estimates can result in critical performance issues and may result in loss of functionality. In order to reduce error and lower the skill required to operate and maintain the database products, an aid/tool must be developed to assist lower skilled users with entering usable values for extent estimates.

The invention generates customized extent values within a wizard such that a user can answer two simple questions about future usage, and then the tooling can provide

workable extent values.

The invention estimates extent values by programmatically providing a set of simple heuristic rules to generate the first extent and next extent values. The user needs to answer two simple questions:


1. How many rows will the table contain?

2. What is the expected activity or growth rate on the table (from a list of static, slight growth, or aggressive growth)?

An algorithm generates the first and next e...