How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...
How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...
How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Co<strong>st</strong> of Transitive Closure<br />
► Transitive closure (TC) has many implementations<br />
► Naive: multiplication of boolean matrices O(n 3 )<br />
► Multiplication of boolean matrices with Russian Method is<br />
O(n 2.4 )<br />
► Ne<strong>st</strong>ed-loop joins from relational algebra: O(n 3 )<br />
■ Gets better with semi-naive evaluation, hashed joins, semi-joins, and<br />
indices<br />
► Munro/Purdue algorithm is almo<strong>st</strong> linear, but co<strong>st</strong>s space<br />
Prof. Uwe Aßmann, Softwaretechnologie II<br />
66