v0.2.0

Release notes

• New feature: auxiliary node index enables fast node lookup using handles other than node handle. In particular, edge handles can index to source node.
• New feature: property based predicate checks---such as less, greater, startswith, contains---in node programs. This enables node programs that depend on predicates other than property equality/existence.
• New node programs: get_node, get_edge, get_edges, discover_paths. discover_paths returns all paths between two vertices that satisfy node/edge preficates.
• Reduced memory consumption due to smaller node/edge objects.
• Much faster, multi-threaded initial bulk loading of graphs.
• Use timestamp pointers instead of copies of timestamps. Much more memory efficient, especially while bulk loading a large graph.
• Bugfix: delete node handle from HyperDex index space when deleting node.
• Weaver client returns descriptive error codes on failure of a transaction or node program.
• Fixed memory leaks in Kronos time oracle. Old events are now properly cleaned up in Kronos.