Optimization of object-oriented queries through pushing selections

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a new optimization method for object-oriented queries. The method enables pushing selection conditions before structure constructors, joins and quantifiers. A less general variant of this method is known from relational systems and SQL as pushing a selection before a join. If a query involves a selection which predicates refer to proper arguments of a structure constructor or a join or a quantifier that occurs at the left-hand subquery of this query then it can be rewritten. The rewriting consists in pushing such predicates down before a proper operator. The approach follows the stack-based approach (SBA) and its query language SBQL (Stack-Based Query Language). The assumed strong typing based on the compile time simulation of run-time actions gives the possibility to solve this optimization problem in its full generality. The paper presents examples how the optimization method works. General features of the implemented algorithm are also presented. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Drozd, M., Bleja, M., Stencel, K., & Subieta, K. (2013). Optimization of object-oriented queries through pushing selections. In Advances in Intelligent Systems and Computing (Vol. 186 AISC, pp. 57–68). Springer Verlag. https://doi.org/10.1007/978-3-642-32741-4_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free