Hello,
I am trying to do graph traversal with a custom Iterator. Simplifying a
bit, a “node” is a unique row id and edges are represented as an entry
where the Key.row is the source node and the Key.colQualifier is the target
node. The custom iterator maintains a stack and uses a subordinate itera
022 at 2:40 PM Scott Kirklin
> wrote:
> >
> > Hello,
> >
> > I am trying to do graph traversal with a custom Iterator. Simplifying a
> bit, a “node” is a unique row id and edges are represented as an entry
> where the Key.row is the source node and the Key.colQ
Hi,
I am working with an accumulo instance that has over time collected quite a
few old and invalid entries in the replication table. Some rows correspond
to files that no longer exist, others are for tables that no longer exist,
and still others are for tables that no longer have replication targ