Pavel
Pavel
TP 3.5.0 has support of null semantics, so possibly to remove special tokens https://tinkerpop.apache.org/docs/3.5.0-SNAPSHOT/upgrade/#_use_of_null
Full changelog https://github.com/apache/tinkerpop/blob/3.5.0/CHANGELOG.asciidoc#release-3-5-0
For support queries like this: ``` MATCH (n) WITH datetime.truncate('day', n.date) as day RETURN day, count(day) ``` Where `n.date` it is Date or Instant https://neo4j.com/docs/cypher-manual/current/functions/#header-query-functions-temporal
Consider next query ``` MATCH (n:V) WHERE n.p = '123' RETURN count(n)" ``` And translated gremlin ``` g.V().hasLabel('V') .has('p', eq('123')) .is(neq(' cypher.null')) .count() .project('count').by(__.identity()) ``` It seems `is` step is...
Exception: ``` java.lang.UnsupportedOperationException: Unsupported match pattern: NamedPatternPart(Variable(p),ShortestPaths(... ```
First, if we use multilable options, that labels not sorted, and we have some problem during queries Second, if we try search vertices with partial label, that found nothing I...
For confirmed bugs, please report: - Version: 0.6.0 - Storage Backend: all - Mixed Index Backend: all - Link to discussed bug: - Expected Behavior: correct answer - Current Behavior:...
Currently AdjacentVertexHasIdOptimizerStrategy does not support hasContainers with more than 1 step So next traversal not optimized ``` graph.traversal().V().hasId(P.within(1L)).bothE().otherV().hasId(2L).has('a','b').explain() ``` ``` AdjacentVertexHasIdOptimizerStrategy [P] [GraphStep(vertex,[]), HasStep([~id.within([1])]), VertexStep(BOTH,vertex), HasStep([~id.eq(2), a.eq(b)])] AdjacentVertexFilterOptimizerStrategy [P] [GraphStep(vertex,[]),...
Fix for #1709 Signed-off-by: Pavel Ershov ----- Thank you for contributing to JanusGraph! In order to streamline the review of the contribution we ask you to ensure the following steps...
Example of code ``` @Test void deadlock(@TempDir File file) throws InterruptedException { JanusGraph graph = JanusGraphFactory.open("berkeleyje:" + file.getAbsolutePath()); graph.traversal().addV().property("a", "b").iterate(); graph.tx().commit(); for (int i = 0; i < 2; i++)...