Binary search performance

[broneill]

The primary bottleneck in Tupl when the database (mostly) fits in main memory is the binary search function. The current implementation performs byte-by-byte comparisons, but comparing by 8-byte words should be much faster. Applications which have large keys would benefit the most from an optimized binary search.