103 lines
3.8 KiB
Python
103 lines
3.8 KiB
Python
# Relational
|
|
# Copyright (C) 2008 Salvo "LtWorf" Tomaselli
|
|
#
|
|
# Relational is free software: you can redistribute it and/or modify
|
|
# it under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation, either version 3 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# This program is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
#
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
#
|
|
# author Salvo "LtWorf" Tomaselli <tiposchi@tiscali.it>
|
|
#
|
|
# This module optimizes relational expressions into ones that require less time to be executed.
|
|
#
|
|
# expression: In all the functions expression can be either an UTF-8 encoded string, containing a valid
|
|
# relational query, or it can be a parse tree for a relational expression (ie: class parser.node).
|
|
# The functions will always return a string with the optimized query, but if a parse tree was provided,
|
|
# the parse tree itself will be modified accordingly.
|
|
|
|
from relational import optimizations
|
|
from relational import parser
|
|
|
|
|
|
# Stuff that was here before, keeping it for compatibility
|
|
RELATION = parser.RELATION
|
|
UNARY = parser.UNARY
|
|
BINARY = parser.BINARY
|
|
|
|
op_functions = parser.op_functions
|
|
node = parser.node
|
|
tokenize = parser.tokenize
|
|
tree = parser.tree
|
|
# End of the stuff
|
|
|
|
|
|
def optimize_all(expression, rels, specific=True, general=True, debug=None):
|
|
'''This function performs all the available optimizations.
|
|
|
|
expression : see documentation of this module
|
|
rels: dic with relation name as key, and relation istance as value
|
|
specific: True if it has to perform specific optimizations
|
|
general: True if it has to perform general optimizations
|
|
debug: if a list is provided here, after the end of the function, it
|
|
will contain the query repeated many times to show the performed
|
|
steps.
|
|
|
|
Return value: this will return an optimized version of the expression'''
|
|
if isinstance(expression, str):
|
|
n = tree(expression) # Gets the tree
|
|
elif isinstance(expression, node):
|
|
n = expression
|
|
else:
|
|
raise (TypeError("expression must be a string or a node"))
|
|
|
|
if isinstance(debug, list):
|
|
dbg = True
|
|
else:
|
|
dbg = False
|
|
|
|
total = 1
|
|
while total != 0:
|
|
total = 0
|
|
if specific:
|
|
for i in optimizations.specific_optimizations:
|
|
res = i(n, rels) # Performs the optimization
|
|
if res != 0 and dbg:
|
|
debug.append(n.__str__())
|
|
total += res
|
|
if general:
|
|
for i in optimizations.general_optimizations:
|
|
res = i(n) # Performs the optimization
|
|
if res != 0 and dbg:
|
|
debug.append(n.__str__())
|
|
total += res
|
|
return n.__str__()
|
|
|
|
|
|
def specific_optimize(expression, rels):
|
|
'''This function performs specific optimizations. Means that it will need to
|
|
know the fields used by the relations.
|
|
|
|
expression : see documentation of this module
|
|
rels: dic with relation name as key, and relation istance as value
|
|
|
|
Return value: this will return an optimized version of the expression'''
|
|
return optimize_all(expression, rels, specific=True, general=False)
|
|
|
|
|
|
def general_optimize(expression):
|
|
'''This function performs general optimizations. Means that it will not need to
|
|
know the fields used by the relations
|
|
|
|
expression : see documentation of this module
|
|
|
|
Return value: this will return an optimized version of the expression'''
|
|
return optimize_all(expression, None, specific=False, general=True)
|