greg/hanoidb
1
0
Fork 0
Code Issues 10 Pull requests 3 Projects Releases Packages Wiki Activity
hanoidb/src/lsm_btree.hrl

37 lines
1 KiB
Erlang
Raw Normal View History

Improve nursery handling - Code moved to separate module - Recovery now operational; re-opening a tree will actually read the nursery log. We use a sequential log file for the nursery and also keep inserted {K,V} in memory only 32 K/V pairs at a time. NURSERY_SIZE = (1 bsl TOP_LEVEL) configured in src/lsm_btree.htl
2012-01-10 22:04:13 +00:00
%% smallest levels are 32 entries
-define(TOP_LEVEL, 5).
Use ?BTREE_SIZE macro everywhere
2012-01-20 09:09:54 +00:00
-define(BTREE_SIZE(Level), (1 bsl (Level))).
Improve nursery handling - Code moved to separate module - Recovery now operational; re-opening a tree will actually read the nursery log. We use a sequential log file for the nursery and also keep inserted {K,V} in memory only 32 K/V pairs at a time. NURSERY_SIZE = (1 bsl TOP_LEVEL) configured in src/lsm_btree.htl
2012-01-10 22:04:13 +00:00
-define(TOMBSTONE, 'deleted').
Introduce btree_range record for range queries This allows specifying ranges with from/to being inclusive or not, and providing a result limit (latter not implemented yet). This change just makes all current tests pass.
2012-01-22 23:51:31 +00:00
-define(KEY_IN_FROM_RANGE(Key,Range),
((Range#btree_range.from_inclusive andalso
(Range#btree_range.from_key =< Key))
orelse
(Range#btree_range.from_key < Key))).
-define(KEY_IN_TO_RANGE(Key,Range),
((Range#btree_range.to_key == undefined)
orelse
((Range#btree_range.to_inclusive andalso
(Key =< Range#btree_range.to_key))
orelse
(Key < Range#btree_range.to_key)))).
-define(KEY_IN_RANGE(Key,Range),
((Range#btree_range.from_inclusive andalso
(Range#btree_range.from_key =< Key))
orelse
(Range#btree_range.from_key < Key))
andalso
((Range#btree_range.to_key == undefined)
orelse
((Range#btree_range.to_inclusive andalso
(Key =< Range#btree_range.to_key))
orelse
(Key < Range#btree_range.to_key)))).
Reference in a new issue Copy permalink