Class LSMTreeIndexAbstract

  • Direct Known Subclasses:
    LSMTreeIndexCompacted, LSMTreeIndexMutable

    public abstract class LSMTreeIndexAbstract
    extends PaginatedComponent
    Abstract class for LSM-based indexes. The first page contains 2 bytes to store key and value types. The pages are populated from the head of the page with the pointers to the pair key/value that starts from the tail. A page is full when there is no space between the head (key pointers) and the tail (key/value pairs).
    When a page is full, another page is created, waiting for a compaction.
    HEADER ROOT PAGE (1st) = [offsetFreeKeyValueContent(int:4),numberOfEntries(int:4),mutable(boolean:1),compactedPageNumberOfSeries(int:4),subIndexFileId(int:4),numberOfKeys(byte:1),keyType(byte:1)*]
    HEADER Nst PAGE = [offsetFreeKeyValueContent(int:4),numberOfEntries(int:4),mutable(boolean:1),compactedPageNumberOfSeries(int:4)]