Section 6 develops an algorithm to adorn a program for a given query using b, c, and f adornments, based on bcf sips. Section 8 discusses the conditions under which GMST is applicable. Section 9 presents the GMST algorithm and applies it to an example. The material reflects an interest in improving the performance of relational databases by optimizing and speeding up the evaluation of the more complex queries required by newer database applications. The work is valuable not only for extending the magic-sets transformation and the bf adornment, but also for building a unified framework to deal with several types of predicates in a database query and suggesting future extensions to larger classes of restrictions.
Examples illustrate several steps of the algorithm.
The issues are grounded on thorough mathematical results, which are proven throughout the paper. The Digital Library is published by the Association for Computing Machinery.