Before revision:  We provide such a study here, via a systematic experimental comparison of known efficient implementations of Sorted Table Search procedures  and their Learned counterparts developed here , obtaining valuable methodological insights into the use of those latter. Specifically, we characterize the scenarios in which those latter can be profitably used with respect to the former, accounting for both CPU and GPU computing.
After revision:  We provide such a study here, via a systematic experimental comparison of known efficient implementations of Sorted Table Search procedures and their Learned counterparts developed here . We characterize the scenarios in which those latter can be profitably used with respect to the former, accounting for both CPU and GPU computing.