umgeher/leveled
0
Fork 0
Code Issues Pull requests Releases Activity Actions

Update SST comments

Browse source
This commit is contained in:
martinsumner 2017-03-04 20:47:46 +00:00
parent 4ec7d835bd
commit bc5388710b
1 changed files with 5 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

9
src/leveled_sst.erl
View file

@ -711,10 +711,11 @@ lookup_slots(StartKey, EndKey, Tree) ->
%% critical considerations has been the cost of the binary_to_term and
%% term_to_binary calls for different sizes of slots and different data types.
%%
%% Microbenchmarking indicated that flat lists were the fastest. However, the
%% lists need scanning at query time - and so give longer lookups. Bigger slots
%% did better at term_to_binary time. However term_to_binary is an often
%% repeated task, and this is better with smaller slots.
%% Microbenchmarking indicated that flat lists were the fastest at sst build
%% time. However, the lists need scanning at query time - and so give longer
%% lookups. Bigger slots did better at term_to_binary time. However
%% binary_to_term is an often repeated task, and this is better with smaller
%% slots.
%%
%% The outcome has been to divide the slot into four small blocks to minimise
%% the binary_to_term time. A binary index is provided for the slot for all