Paper Info
Title
Optimization of object-oriented queries through rewriting compound weakly dependent subqueries
Abstract
A new static optimization method for object-oriented queries is presented. We deal with a special class of subqueries of a given query called "compound weakly dependent subqueries". The dependency is considered in the context of SBQL non-algebraic query operators like selection, projection, join, etc. A subquery is weakly dependent from its nearest nonalgebraic operator if it depends only on expressions that can be entirely evaluated on small collections. The subquery is considered compound if the dependency concerns at least two such expressions. The research follows the stack-based approach (SBA) to query languages and its query language SBQL (Stack-Based Query Language). Our optimization method is based on analyzing scoping and binding rules for names occurring in queries.
Year
DOI
Venue
2010
10.1007/978-3-642-15364-8_27
DEXA
Keywords
Field
DocType
new static optimization method,query language,sbql non-algebraic query operator,binding rule,nearest nonalgebraic operator,stack-based query language,compound weakly dependent subqueries,object-oriented query,optimization method,dependency concern,object oriented,query optimization
Query optimization,Query language,Programming language,Object-oriented programming,Static optimization,Expression (mathematics),Computer science,Theoretical computer science,Rewriting,Operator (computer programming),Database,Object oriented databases
Conference
ISBN
Citations 
PageRank 
3-642-15363-1
2
0.48
References 
Authors
8
3
Name
Order
Citations
PageRank
Michal Bleja171.64
Tomasz Kowalski212424.06
Kazimierz Subieta3533240.21