Before revision:  In an experimental study, we compare a variety of algorithms with respect to their index-building and query times as well as their memory footprint .
After revision:  Our new algorithm O'Reach can be easily combined with previously developed solutions for the problem or run standalone. In a detailed experimental study, we compare a variety of algorithms with respect to their index-building and query times as well as their memory footprint .