Interface | Description |
---|---|
ICodedRaba |
Interface for an coded logical byte[][].
|
IRabaCoder |
Interface for coding (compressing) a logical
byte[][] and for
accessing the coded data in place. |
IRabaGenerator |
Interface for
IRaba data generators. |
Class | Description |
---|---|
AbstractCodedRaba |
Abstract implementation throws
UnsupportedOperationException for all
mutation operations. |
AbstractFrontCodedRabaCoderTestCase |
Test suite for the
FrontCodedRabaCoder . |
AbstractRabaCoderTestCase |
Abstract test suite for
IRabaCoder implementations. |
AbstractRabaCoderTestCase.TestOp |
Tests of the
Op test helper class. |
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. |
FrontCodedRabaCoderDupKeys |
Variant of the
FrontCodedRabaCoder that supports duplicate keys. |
MutableRabaCoder |
This "codes" a raba as a
MutableKeyBuffer or
MutableValueBuffer depending on whether it represents B+Tree keys or
values. |
RandomKeysGenerator |
Random B+Tree keys generator.
|
RandomURIGenerator |
Generate n random and distinct URIs.
|
SimpleRabaCoder |
This class does not offer any compression.
|
TestAll |
Aggregates test suites into increasing dependency order.
|
TestCanonicalHuffmanRabaCoder |
Test suite for the
CanonicalHuffmanRabaCoder . |
TestConditionalRabaCoder_keys_simple_frontCoded |
Test suite for the
ConditionalRabaCoder . |
TestConditionalRabaCoder_values_simple_canonical |
Test suite for the
ConditionalRabaCoder . |
TestEmptyRabaCoder |
Unit tests for the
EmptyRabaValueCoder . |
TestFixedLengthValueRabaCoder |
Test suite for the
FixedLengthValueRabaCoder . |
TestFrontCodedRabaCoderRatio2 |
Test suite for the
FrontCodedRabaCoder . |
TestFrontCodedRabaCoderRatio32 |
Test suite for the
FrontCodedRabaCoder . |
TestFrontCodedRabaCoderRatio8 |
Test suite for the
FrontCodedRabaCoder . |
TestSimpleRabaCoder |
Test suite for the
SimpleRabaCoder . |
TokenizeKeysGenerator |
Tokenize an input file, collect the set of distinct keywords, and encode
those keywords as unsigned byte[]s.
|
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).
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.