Jan Steemann
|
2bbcaa868f
|
fixed invalid memory usages
|
2015-12-01 16:48:55 +01:00 |
Michael Hackstein
|
d79c2f9048
|
Added a test if the traverser prunes early
|
2015-11-27 17:03:24 +01:00 |
Michael Hackstein
|
a7b7d1ec18
|
Adapted traverser implementations to new Path Enumerator for improved pruning
|
2015-11-27 16:25:02 +01:00 |
Michael Hackstein
|
bba4fe6089
|
Added a basic implementation to receive filtered documents in the cluster. Right now it does not yet filter and is inefficent but serves the API
|
2015-11-27 11:20:12 +01:00 |
Michael Hackstein
|
d109a4e2aa
|
Filtered edges are now able to react to a list of expressions instead of only one expression. The list symbolises an AND
|
2015-11-26 11:38:09 +01:00 |
Michael Hackstein
|
6572806300
|
Fixed ClusterTraverser if there is a vertex without edges
|
2015-11-16 20:24:10 +01:00 |
Michael Hackstein
|
21cf784cbc
|
First attempt for multi collection graphs. Not yet functional.
|
2015-11-16 15:36:00 +01:00 |
Michael Hackstein
|
e8cdc5190f
|
Single Collection Traversals are now functional within the cluster.
|
2015-11-16 14:55:07 +01:00 |
Michael Hackstein
|
b391d9cb22
|
Fixed a bug when the cluster iterates over more than one edge
|
2015-11-16 13:20:32 +01:00 |
Michael Hackstein
|
fa4b08a4b8
|
Further implemenetation for ClusterTraverser. It now returns the correct format. However there seems to be an undefined state which can be reached
|
2015-11-16 11:37:29 +01:00 |
Michael Hackstein
|
3923c7936e
|
EdgeCollections are now evaluated to cids later in TraversalBlock. This change was necessary for the Cluster
|
2015-11-16 09:09:34 +01:00 |
Michael Hackstein
|
04da539ba1
|
Further implementation of Cluster Traverser. It now has code that in theory should fetch the first set of edges. Right now it fails for undefined collection name
|
2015-11-13 17:12:33 +01:00 |
Michael Hackstein
|
9a95e1d36b
|
Added Files for Cluster Traverser.
|
2015-11-13 14:53:46 +01:00 |