Loading [a11y]/accessibility-menu.js
Optimization of object-oriented queries addressing large and small collections | IEEE Conference Publication | IEEE Xplore

Optimization of object-oriented queries addressing large and small collections


Abstract:

When a query jointly addresses very large and very small collections it may happen that an iteration caused by a query operator is driven by a large collection and in eac...Show More

Abstract:

When a query jointly addresses very large and very small collections it may happen that an iteration caused by a query operator is driven by a large collection and in each cycle it evaluates a subquery that depends on an element of a small collection. For each such element the result returned by the subquery is the same. In effect, such a subquery is unnecessarily evaluated many times. The optimization rewrites such a query to reverse the situation: the loop is to be performed on a small collection and inside each its cycle a subquery addressing a large collection is evaluated. We illustrate the method on comprehensive examples and then present the general rewriting rule. The research follows the Stack-Based Approach to query languages having roots in the semantics of programming languages. The optimization method consists in analyzing of scoping and binding rules for names occurring in queries.
Date of Conference: 12-14 October 2009
Date Added to IEEE Xplore: 11 December 2009
Print ISBN:978-1-4244-5314-6
Print ISSN: 2157-5525
Conference Location: Mragowo, Poland

References

References is not available for this document.