Package com.bigdata.btree.raba.codec

See:
Description

Interface Summary

ICodedRaba	Interface for an coded logical byte[][].
IRabaCoder	Interface for coding (compressing) a logical byte[][] and for accessing the coded data in place.

Class Summary

AbstractCodedRaba	Abstract implementation throws UnsupportedOperationException for all mutation operations.
CanonicalHuffmanRabaCoder	This class provides (de-)compression for logical byte[][]s based on canonical Huffman codes.
CanonicalHuffmanRabaCoder.AbstractCodingSetup	Abstract base class for preparing a logical byte[][] for coding.
CanonicalHuffmanRabaCoder.CodedRabaImpl	Decoder.
CanonicalHuffmanRabaCoder.RabaCodingSetup	Sets up for coding an IRaba representing B+Tree values.
EmptyRabaValueCoder	Useful when a B+Tree uses keys but not values.
FixedLengthValueRabaCoder	This class does not offer any compression.
FrontCodedRabaCoder	Class provides (de-)compression for logical byte[][]s based on front coding.
FrontCodedRabaCoder.DefaultFrontCodedRabaCoder	A pre-parameterized version of the FrontCodedRabaCoder which is used as the default IRabaCoder for B+Tree keys for both nodes and leaves.
SimpleRabaCoder	This class does not offer any compression.

Package com.bigdata.btree.raba.codec Description

This package provides several implementations for coding keys and values in found in a B+Tree node or leaf, including no coding, prefix coding, and canonical huffman coding (which preserves the lexical order of the uncoded values for which the dictionary may be coded and transmitted in fewer bits).