Experiments
Experimented with simulated sources derived form DBLP data
- Our minimization approach reduces access costs by removing redundant recursive sources
- Minimization cost offset by the improvements in execution time
- Our source ordering approach tended to reduce the total cost over bound-is-easier approach whenever there were significant number of binding patterns that are not subsumed by HBTP