Browse Prior Art Database

Efficient Processing of Dynamic Queries via Static SQL

IP.com Disclosure Number: IPCOM000111186D
Original Publication Date: 1994-Feb-01
Included in the Prior Art Database: 2005-Mar-26
Document File: 2 page(s) / 22K

Publishing Venue

IBM

Related People

Roller, D: AUTHOR

Abstract

This algorithm allows to process queries in a relational database, which are not known at the time of the generation of a specific application, with an enhanced performance and security.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 100% of the total text.

Efficient Processing of Dynamic Queries via Static SQL

      This algorithm allows to process queries in a relational
database, which are not known at the time of the generation of a
specific application, with an enhanced performance and security.

      For each database table a number of elementary static queries
is generated.  These queries are selected according to their
efficiency when used in the database system.  For carrying out an
arbitrary query, a specific query is selected.  The selection
criteria for the query is maximum processing efficiency, which best
meets the arbitrary query.

      Any remaining selection is performed after retrieval from the
table, i.e., the number of rows in the result table is minimal as
compared to all available static queries.  Thereby it is made
possible to use the advantages of static SQL in the dynamic case.