See: Description
| Interface | Description |
|---|---|
| HBaseGraphAssembler |
Constructs a data graph starting with a given root SDO type based on a given
HBase client result row the entire graph being found in the result row or potentially
requiring additional scans depending on the assembler implementation.
|
| Class | Description |
|---|---|
| CellConverter |
Converts a collection of
KeyValue to a single CellValues
result. |
| DefaultAssembler |
Supports both distributed and non-distributed graph assemblers by providing
default functionality.
|
| DistributedAssembler |
Supports the assembly of a directed data graph which may span multiple HBase
tables and/or rows by maintaining a stack of row readers annotated with graph
"level" and other information.
|
| ExternalEdgeRecognizerContext |
Context which supports the evaluation and "recognition" of a given external
reference or row-key by a binary expression tree.
|
| ExternalEdgeRecognizerRelationalBinaryExpr |
An
RelationalBinaryExpr implementation which uses a specific
evaluation context to locate or
recognize a given sequence based column qualifier within the context of the
expression. |
| ExternalEdgeRecognizerSyntaxTreeAssembler |
A binary expression tree assembler which constructs an operator precedence
map, then
visits
(traverses) the given predicate expression syntax tree depth-first using an
adapted shunting-yard algorithm and assembles a resulting binary tree
structure. |
| ExternalEdgeRecognizerWildcardBinaryExpr |
An
PredicateBinaryExpr implementation which uses a specific
evaluation context to locate or
recognize a given row key field within the context of the expression. |
| GraphAssembler |
Constructs a data graph starting with a given root SDO type based on a map of
selected SDO properties, where properties are mapped by selected types
required in the result graph.
|
| GraphAssemblerCallable |
A graph assembler callable task which assembles and returns a
graph on call. |
| GraphSliceAssembler |
Assembles a data graph where one or more collections may be "sliced" based on
path predicates within the "selection graph".
|
| LocalEdgeRecognizerContext |
Context which supports the evaluation and "recognition" of a given data graph
entity sequence value by a binary expression tree, within the context of the
expression syntax and a given HBase KeyValue map.
|
| LocalEdgeRecognizerRelationalBinaryExpr |
An
RelationalBinaryExpr implementation which uses a specific
evaluation context to locate or recognize
a given sequence based column qualifier within the context of the expression. |
| LocalEdgeRecognizerSyntaxTreeAssembler |
A binary expression tree assembler which constructs an operator precedence
map, then
visits
(traverses) the given predicate expression syntax tree depth-first using an
adapted shunting-yard algorithm and assembles a resulting binary tree
structure. |
| LocalEdgeRecognizerWildcardBinaryExpr |
An
PredicateBinaryExpr implementation which uses a specific
evaluation context to locate or recognize
a given sequence based column qualifier within the context of the expression. |
| ParallelGraphAssembler |
Constructs a data graph in parallel starting with a given root using the
given "selection graph", where processing proceeds as a breadth-first
traversal and tasks are dynamically added based on thread availability within
a shared thread pool.
|
| ParallelGraphSliceAssembler |
Assembles a data graph in parallel where one or more collections may be
"sliced" based on path predicates within the "selection graph".
|
| ReaderFrame |
Associates a row reader with a given graph (traversal) level.
|
| Traversal |
Encapsulates minimal recursive graph traversal information for use in
concurrent contexts, such as where a traversal is needed but the
initialization data must be captured and stored, and a traversal from a given
subroot, initiated later.
|
Copyright © 2021. All Rights Reserved.