Bugs item #2821251, was opened at 2009-07-14 12:27
Message generated for change (Comment added) made by tsheyar
You can respond by visiting:
https://sourceforge.net/tracker/?func=detail&atid=482468&aid=2821251&group_id=56967
Please note that this message will contain a full copy of the comment thread,
including the initial issue submission, for this request,
not just the latest update.
>Category: PF/compiler
Group: Pathfinder "stable"
>Status: Closed
>Resolution: Fixed
Priority: 5
Private: No
Submitted By: Floris Ouwendijk (floris233)
Assigned to: Jan Rittinger (tsheyar)
>Summary: PF: Complex optimization overly complex
Initial Comment:
The following query took extremely long to execute:
doc("bookmarks.xml")/bookmarks/fold...@name='builtin']/fold...@name='Standard
Query Blocks']/fold...@name='Files']/fold...@name='File
extensions']/bookmark-definiti...@name="Microsoft Office files"]/query/*
Running /opt/MonetDB-May2009-SP1/bin/pf -TA produced the following output:
parsing: 000ms
module import: 000ms
normalization: 000ms
semantical analysis: 000ms
XML Schema import: 000ms
core mapping: 000ms
core simplification: 000ms
type checking: 008ms
core tree optimization: 012ms
logical algebra tree generation: 001ms
map to unique column names: 002ms
constant optimization: 000ms
icol optimization: 000ms
key optimization: 000ms
complex optimization: 010ms
general optimization: 000ms
required value optimization: 000ms
general optimization: 000ms
equi-join pushdown: 002ms
icol optimization: 000ms
set optimization: 000ms
icol optimization: 000ms
general optimization: 000ms
structural CSE optimization: 000ms
complex optimization: 001ms
set optimization: 000ms
required value optimization: 000ms
rank optimization: 000ms
constant optimization: 000ms
key optimization: 000ms
required nodes optimization: 000ms
introduce proxy operators: 000ms
mvd optimization: 005ms
thetajoin optimization: 011ms
resolve proxy operators: 000ms
equi-join pushdown: 075ms
icol optimization: 001ms
set optimization: 003ms
step-join push-down: 000ms
icol optimization: 000ms
general optimization: 001ms
projection removal: 001ms
structural CSE optimization: 198ms
complex optimization: 18m 37s 415ms
set optimization: 000ms
required value optimization: 000ms
rank optimization: 000ms
introduce proxy operators: 000ms
mvd optimization: 000ms
thetajoin optimization: 000ms
resolve proxy operators: 000ms
equi-join pushdown: 000ms
icol optimization: 000ms
set optimization: 000ms
step-join push-down: 000ms
icol optimization: 000ms
constant optimization: 000ms
key optimization: 000ms
general optimization: 000ms
projection removal: 000ms
structural CSE optimization: 000ms
complex optimization: 006ms
set optimization: 000ms
required value optimization: 000ms
rank optimization: 000ms
MonetDB specific optimizations: 000ms
complex optimization: 001ms
general optimization: 000ms
complete property inference: 000ms
logical algebra optimization: 18m 37s 785ms
CSE in logical algebra tree: 000ms
compilation to physical algebra: 000ms
introduction of recursion boundaries: 000ms
MIL code generation: 000ms
dead code elimination: 000ms
MIL code serialization: 000ms
----------------------------------------------
overall compilation time: 18m 37s 813ms
18mins is a bit much for a query describing exactly what path to follow. Is
there, in the meantime, a better method to execute te query?
----------------------------------------------------------------------
>Comment By: Jan Rittinger (tsheyar)
Date: 2009-07-14 18:04
Message:
Fixed in CVS -- now compiles within 170 msec.
(The problem was that we didn't remove unused constant
expressions---attach operators---timely, which resulted in hundreds of
cross products appearing in the plan. The property inference in the complex
optimization phase than took quite some time before the rewrites threw away
the superfluous cross products.)
----------------------------------------------------------------------
Comment By: Stefan Manegold (stmane)
Date: 2009-07-14 12:30
Message:
Guess this one is for Jan ...
----------------------------------------------------------------------
You can respond by visiting:
https://sourceforge.net/tracker/?func=detail&atid=482468&aid=2821251&group_id=56967
------------------------------------------------------------------------------
Enter the BlackBerry Developer Challenge
This is your chance to win up to $100,000 in prizes! For a limited time,
vendors submitting new applications to BlackBerry App World(TM) will have
the opportunity to enter the BlackBerry Developer Challenge. See full prize
details at: http://p.sf.net/sfu/Challenge
_______________________________________________
Monetdb-bugs mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/monetdb-bugs
