Summary

• Argued that source call ordering for information gathering plans is significantly different from the traditional join ordering

• Developed an approach for source call ordering that takes both access and transfer costs into account

  • Use of $ and % annotations to represent access limitations
  • Use of HTBP table to indicate binding patterns that produce high-traffic
    • Does not require elaborate statistics
    • Subsumes bound-is-easier as a special case
  • Supports bushy joins--thus allowing parallelism and reduce the impact of connection delays

Previous slide

Next slide

Back to first slide

View graphic version