Why:
Reduce CPU and improve performance of read and seek operation, especially when data resides in memory
What:
Accelerate the index search by using a more sophisticated searching algorithm than binary search.
By utilizing a probabilistic search algorithm (will be explained in a different scientific paper) save on search time and cpu cycles (do less searches then binary search)
In order to select between binary search and probabilistic search another step in the sst creation needs to be done to not waste time on “trying” the right search algorithm.
Why: Reduce CPU and improve performance of read and seek operation, especially when data resides in memory
What: Accelerate the index search by using a more sophisticated searching algorithm than binary search. By utilizing a probabilistic search algorithm (will be explained in a different scientific paper) save on search time and cpu cycles (do less searches then binary search) In order to select between binary search and probabilistic search another step in the sst creation needs to be done to not waste time on “trying” the right search algorithm.