The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Tree-based models have proven to be an effective solution for web ranking as well as other problems in diverse domains. This paper focuses on optimizing the runtime performance of applying such models to make predictions, given an already-trained model. Although exceedingly simple conceptually, most implementations of tree-based models do not efficiently utilize modern superscalar processor architectures. By laying out data structures in memory in a more cache-conscious fashion, removingarXiv:1212.2287v2 fatcat:k6xw6a54bvaqvjli7d4xn7wcke