Gregory Todd Williams SPARQL BGP Optimization Presentation Joshua Taylor 1

Question is for the Presentation: Gregory Todd Williams SPARQL BGP Optimization Presentation
Question is asked by: Joshua Taylor
The Question is: It seems that 3.2 Optimization Algorithm is simply building a minimum spanning tree, where edges are selected based are weighted based on estimated selectivity (which aren't discussed until later). Is this correct, or is there more to it?
Answer: The algorithm does construct a MST, but the output we are interested in is the order of nodes visited during the tree construction, not the tree itself.

Answer	The algorithm does construct a MST, but the output we are interested in is the order of nodes visited during the tree construction, not the tree itself.
Question asked	It seems that 3.2 Optimization Algorithm is simply building a minimum spanning tree, where edges are selected based are weighted based on estimated selectivity (which aren't discussed until later). Is this correct, or is there more to it?
Question asked by	Joshua Taylor +
Question for the Presentation	Gregory Todd Williams SPARQL BGP Optimization Presentation +