Hello,

I have an in-memory Janusgraph instance and I would like to merge that with my Cassandra/ES based graph. What is the best (efficient) way to do this?

When I merge, I don't need to insert the vertices that are already in my Cassandra/ES based graph. I know which vertices in the in-memory graph exists in the Cassandra/ES based graph. 

I don't see any Java API to take a Vertex (or list of Vertices) from one Janusgraph instance and add them to another. All I see is the following:

• addVertex(String)
• addVertex(Object... objects)

My original plan is to insert the new vertices from in-memory graph into my Cassandra/ES based graph, get the IDs back and use them to insert Edges.

I appreciate any help.

Thanks.

I want use JanusGraph in my production,but I need two feature: cassandra-cql and es 5.x

It seems Geoshape GraphSON support is hardcoded to v1 although I couldn't get it to work with that either.  If you have to use GraphSON instead of Gryo, then you could checkout master, apply this patch, and rebuild. I created an  issue to support multiple versions of serializers  https://github.com/JanusGraph/janusgraph/issues/420

diff --git a/janusgraph-core/src/main/java/org/janusgraph/graphdb/tinkerpop/io/graphson/JanusGraphSONModule.java b/janusgraph-core/src/main/java/org/janusgraph/graphdb/tinkerpop/io/graphson/JanusGraphSONModule.java
index 6ef907b..8168309 100644
--- a/janusgraph-core/src/main/java/org/janusgraph/graphdb/tinkerpop/io/graphson/JanusGraphSONModule.java
+++ b/janusgraph-core/src/main/java/org/janusgraph/graphdb/tinkerpop/io/graphson/JanusGraphSONModule.java
@@ -50,10 +50,10 @@ public class JanusGraphSONModule extends TinkerPopJacksonModule {
     private JanusGraphSONModule() {
         super("janusgraph");
         addSerializer(RelationIdentifier.class, new RelationIdentifierSerializer());
-        addSerializer(Geoshape.class, new Geoshape.GeoshapeGsonSerializerV1d0());
+        addSerializer(Geoshape.class, new Geoshape.GeoshapeGsonSerializerV2d0());
 
         addDeserializer(RelationIdentifier.class, new RelationIdentifierDeserializer());
-        addDeserializer(Geoshape.class, new Geoshape.GeoshapeGsonDeserializerV1d0());
+        addDeserializer(Geoshape.class, new Geoshape.GeoshapeGsonDeserializerV2d0());
     }
 
     private static final JanusGraphSONModule INSTANCE = new JanusGraphSONModule();

On Tuesday, July 18, 2017 at 5:47:50 PM UTC-4, Conrad Rosenbrock wrote:

I am trying to assign a value to a property with the native Geoshape type. I have it serialized into JSON as follows (where g is aliased to the traversal on gremlin server):

{"@value": {"type": "point", "coordinates": [{"@value": 1.1, "@type": "g:Double"}, {"@value": 2.2, "@type": "g:Double"}]}, "@type": "g:Geoshape"}

In the gremlin console, I can easily type 

Geoshape.point(1.1, 2.2)

and it works perfectly. I am sure that it is something quite simple. Here is the error:

Request [PooledUnsafeDirectByteBuf(ridx: 653, widx: 653, cap: 687)] could not be deserialized by org.apache.tinkerpop.gremlin.driver.ser.AbstractGraphSONMessageSerializerV2d0.

For reference, I do have the following serializer in the gremlin server config:

{ className: org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerGremlinV2d0, config: { ioRegistries: [org.janusgraph.graphdb.tinkerpop.JanusGraphIoRegistry] }}

which should direct gremlin server to the relevant deserializer in Janus.

Thanks!

My graph has about 100 million vertexes and 200 million edges. But if use the following code, it is too slow.

GraphTraversal<Vertex, Long> countV = traversal.V().count();

while (countV.hasNext()){
    System.out.println("countV:" + countV.next());
}

GraphTraversal<Edge, Long> countE = traversal.E().count();
while (countE.hasNext()){
    System.out.println("countE:" + countE.next());
}

I want to computer the count of vertex or edge directly through Hbase. The following code is:

 SnapshotCounter.HBaseGetter entryGetter = new SnapshotCounter.HBaseGetter();
        EntryList entryList = StaticArrayEntryList.ofBytes(
                result.getMap().get(Bytes.toBytes("e")).entrySet(),
                entryGetter);
        StandardTitanTx tx = (StandardTitanTx) graph.newTransaction();
        System.out.println("Entry list size: " + entryList.size());
        int cnt = 0;
//        IDInspector inspector = graph.getIDInspector();
        for (Entry entry : entryList) {
            RelationCache relation = graph.getEdgeSerializer().readRelation(entry, false, tx);
//            Direction direction = graph.getEdgeSerializer().parseDirection(entry);
//            System.out.println("Direction is:" + direction.name());
//            System.out.println("relation is:" + relation);

//            System.out.println("numProperties: " + relation.numProperties());
//            Iterator<LongObjectCursor<Object>> longObjectCursorIterator = relation.propertyIterator();
//            LongObjectCursor<Object> next = longObjectCursorIterator.next();
//            System.out.println("key is:" + next.key);
//            System.out.println("value is:" + next.value);
//            System.out.println("next.toString is:" + next.toString());



            RelationType type = tx.getExistingRelationType(relation.typeId);

            Iterator<Edge> edgeIterator1 = type.edges(Direction.BOTH);
            while (edgeIterator1.hasNext()){
                Edge next11 = edgeIterator1.next();
                System.out.println("relType is :" + next11.property("relType"));
            }

//             if (type.isEdgeLabel() && !tx.getIdInspector().isEdgeLabelId(relation.relationId)){
//            if (type.isEdgeLabel() &&  !graph.getIDManager().isEdgeLabelId(relation.relationId) &&
//                    !tx.getIdInspector().isRelationTypeId(type.longId())) {
            if (type.isEdgeLabel() ) {
                cnt++;
                System.out.print("isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.typeId));

                System.out.print("isEdgeLabelId: ");
                System.out.println(graph.getIDManager().isEdgeLabelId(relation.typeId));

                System.out.print("type isEdgeLabel: ");
                System.out.println(type.isEdgeLabel());

                System.out.print("relationId isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.relationId));
                System.out.println(entry.getValue().toString());
            }
        }
        System.out.println("Edge count: " + cnt);

I made a test by making a small graph-- two vertexes and two edges.

But I just get the count of the edge is one, expecting two. Is there any problem? Please help....This problem bugs me. Thanks~~~

If you scroll back just a few days in the message history of this group, you'll find a link to this nice blog post: "Configuring JanusGraph for spark-yarn" https://groups.google.com/d/msg/janusgraph-users/9e82gcUTB4M/evKFnB3cAgAJ

HadoopMarc covers doing an OLAP vertex count with JanusGraph + HBase, which it sounds like what you're trying to do, and it has an example properties file.

I can't really tell what you're trying to do in that code snippet. It would be best if you would share the code publicly on GitHub or BitBucket or something similar so if somebody wanted to try it out, it would be easy to do.

> anybody online?  please help me~

JanusGraph is run by volunteers contributing to the open source project. Immediate responses may not happen. Using the mailing list and searching its archive is your best bet for learning from the community because there are several hundred folks that are subscribed to this list.


On Monday, July 17, 2017 at 11:35:47 PM UTC-4, spirit888hill wrote:

anybody online?  please help me~

在 2017年7月17日星期一 UTC+8下午5:53:32，写道：

My graph has about 100 million vertexes and 200 million edges. But if use the following code, it is too slow.

GraphTraversal<Vertex, Long> countV = traversal.V().count();

while (countV.hasNext()){
    System.out.println("countV:" + countV.next());
}

GraphTraversal<Edge, Long> countE = traversal.E().count();
while (countE.hasNext()){
    System.out.println("countE:" + countE.next());
}

I want to computer the count of vertex or edge directly through Hbase. The following code is:

 SnapshotCounter.HBaseGetter entryGetter = new SnapshotCounter.HBaseGetter();
        EntryList entryList = StaticArrayEntryList.ofBytes(
                result.getMap().get(Bytes.toBytes("e")).entrySet(),
                entryGetter);
        StandardTitanTx tx = (StandardTitanTx) graph.newTransaction();
        System.out.println("Entry list size: " + entryList.size());
        int cnt = 0;
//        IDInspector inspector = graph.getIDInspector();
        for (Entry entry : entryList) {
            RelationCache relation = graph.getEdgeSerializer().readRelation(entry, false, tx);
//            Direction direction = graph.getEdgeSerializer().parseDirection(entry);
//            System.out.println("Direction is:" + direction.name());
//            System.out.println("relation is:" + relation);

//            System.out.println("numProperties: " + relation.numProperties());
//            Iterator<LongObjectCursor<Object>> longObjectCursorIterator = relation.propertyIterator();
//            LongObjectCursor<Object> next = longObjectCursorIterator.next();
//            System.out.println("key is:" + next.key);
//            System.out.println("value is:" + next.value);
//            System.out.println("next.toString is:" + next.toString());



            RelationType type = tx.getExistingRelationType(relation.typeId);

            Iterator<Edge> edgeIterator1 = type.edges(Direction.BOTH);
            while (edgeIterator1.hasNext()){
                Edge next11 = edgeIterator1.next();
                System.out.println("relType is :" + next11.property("relType"));
            }

//             if (type.isEdgeLabel() && !tx.getIdInspector().isEdgeLabelId(relation.relationId)){
//            if (type.isEdgeLabel() &&  !graph.getIDManager().isEdgeLabelId(relation.relationId) &&
//                    !tx.getIdInspector().isRelationTypeId(type.longId())) {
            if (type.isEdgeLabel() ) {
                cnt++;
                System.out.print("isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.typeId));

                System.out.print("isEdgeLabelId: ");
                System.out.println(graph.getIDManager().isEdgeLabelId(relation.typeId));

                System.out.print("type isEdgeLabel: ");
                System.out.println(type.isEdgeLabel());

                System.out.print("relationId isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.relationId));
                System.out.println(entry.getValue().toString());
            }
        }
        System.out.println("Edge count: " + cnt);

I made a test by making a small graph-- two vertexes and two edges.

But I just get the count of the edge is one, expecting two. Is there any problem? Please help....This problem bugs me. Thanks~~~

I am trying to assign a value to a property with the native Geoshape type. I have it serialized into JSON as follows (where g is aliased to the traversal on gremlin server):

{"@value": {"type": "point", "coordinates": [{"@value": 1.1, "@type": "g:Double"}, {"@value": 2.2, "@type": "g:Double"}]}, "@type": "g:Geoshape"}

In the gremlin console, I can easily type 

Geoshape.point(1.1, 2.2)

and it works perfectly. I am sure that it is something quite simple. Here is the error:

Request [PooledUnsafeDirectByteBuf(ridx: 653, widx: 653, cap: 687)] could not be deserialized by org.apache.tinkerpop.gremlin.driver.ser.AbstractGraphSONMessageSerializerV2d0.

For reference, I do have the following serializer in the gremlin server config:

{ className: org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerGremlinV2d0, config: { ioRegistries: [org.janusgraph.graphdb.tinkerpop.JanusGraphIoRegistry] }}

which should direct gremlin server to the relevant deserializer in Janus.

Thanks!

If you scroll back just a few days in the message history of this group, you'll find a link to this nice blog post: "Configuring JanusGraph for spark-yarn" https://groups.google.com/d/msg/janusgraph-users/9e82gcUTB4M/evKFnB3cAgAJ

HadoopMarc covers doing an OLAP vertex count with JanusGraph + HBase, which it sounds like what you're trying to do, and it has an example properties file.

I can't really tell what you're trying to do in that code snippet. It would be best if you would share the code publicly on GitHub or BitBucket or something similar so if somebody wanted to try it out, it would be easy to do.

> anybody online?  please help me~

JanusGraph is run by volunteers contributing to the open source project. Immediate responses may not happen. Using the mailing list and searching its archive is your best bet for learning from the community because there are several hundred folks that are subscribed to this list.


On Monday, July 17, 2017 at 11:35:47 PM UTC-4, spirit888hill wrote:

anybody online?  please help me~

在 2017年7月17日星期一 UTC+8下午5:53:32，写道：

My graph has about 100 million vertexes and 200 million edges. But if use the following code, it is too slow.

GraphTraversal<Vertex, Long> countV = traversal.V().count();

while (countV.hasNext()){
    System.out.println("countV:" + countV.next());
}

GraphTraversal<Edge, Long> countE = traversal.E().count();
while (countE.hasNext()){
    System.out.println("countE:" + countE.next());
}

I want to computer the count of vertex or edge directly through Hbase. The following code is:

 SnapshotCounter.HBaseGetter entryGetter = new SnapshotCounter.HBaseGetter();
        EntryList entryList = StaticArrayEntryList.ofBytes(
                result.getMap().get(Bytes.toBytes("e")).entrySet(),
                entryGetter);
        StandardTitanTx tx = (StandardTitanTx) graph.newTransaction();
        System.out.println("Entry list size: " + entryList.size());
        int cnt = 0;
//        IDInspector inspector = graph.getIDInspector();
        for (Entry entry : entryList) {
            RelationCache relation = graph.getEdgeSerializer().readRelation(entry, false, tx);
//            Direction direction = graph.getEdgeSerializer().parseDirection(entry);
//            System.out.println("Direction is:" + direction.name());
//            System.out.println("relation is:" + relation);

//            System.out.println("numProperties: " + relation.numProperties());
//            Iterator<LongObjectCursor<Object>> longObjectCursorIterator = relation.propertyIterator();
//            LongObjectCursor<Object> next = longObjectCursorIterator.next();
//            System.out.println("key is:" + next.key);
//            System.out.println("value is:" + next.value);
//            System.out.println("next.toString is:" + next.toString());



            RelationType type = tx.getExistingRelationType(relation.typeId);

            Iterator<Edge> edgeIterator1 = type.edges(Direction.BOTH);
            while (edgeIterator1.hasNext()){
                Edge next11 = edgeIterator1.next();
                System.out.println("relType is :" + next11.property("relType"));
            }

//             if (type.isEdgeLabel() && !tx.getIdInspector().isEdgeLabelId(relation.relationId)){
//            if (type.isEdgeLabel() &&  !graph.getIDManager().isEdgeLabelId(relation.relationId) &&
//                    !tx.getIdInspector().isRelationTypeId(type.longId())) {
            if (type.isEdgeLabel() ) {
                cnt++;
                System.out.print("isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.typeId));

                System.out.print("isEdgeLabelId: ");
                System.out.println(graph.getIDManager().isEdgeLabelId(relation.typeId));

                System.out.print("type isEdgeLabel: ");
                System.out.println(type.isEdgeLabel());

                System.out.print("relationId isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.relationId));
                System.out.println(entry.getValue().toString());
            }
        }
        System.out.println("Edge count: " + cnt);

I made a test by making a small graph-- two vertexes and two edges.

But I just get the count of the edge is one, expecting two. Is there any problem? Please help....This problem bugs me. Thanks~~~

If you scroll back just a few days in the message history of this group, you'll find a link to this nice blog post: "Configuring JanusGraph for spark-yarn" https://groups.google.com/d/msg/janusgraph-users/9e82gcUTB4M/evKFnB3cAgAJ

HadoopMarc covers doing an OLAP vertex count with JanusGraph + HBase, which it sounds like what you're trying to do, and it has an example properties file.

I can't really tell what you're trying to do in that code snippet. It would be best if you would share the code publicly on GitHub or BitBucket or something similar so if somebody wanted to try it out, it would be easy to do.

> anybody online?  please help me~

JanusGraph is run by volunteers contributing to the open source project. Immediate responses may not happen. Using the mailing list and searching its archive is your best bet for learning from the community because there are several hundred folks that are subscribed to this list.


On Monday, July 17, 2017 at 11:35:47 PM UTC-4, spirit888hill wrote:

anybody online?  please help me~

在 2017年7月17日星期一 UTC+8下午5:53:32，写道：

My graph has about 100 million vertexes and 200 million edges. But if use the following code, it is too slow.

GraphTraversal<Vertex, Long> countV = traversal.V().count();

while (countV.hasNext()){
    System.out.println("countV:" + countV.next());
}

GraphTraversal<Edge, Long> countE = traversal.E().count();
while (countE.hasNext()){
    System.out.println("countE:" + countE.next());
}

I want to computer the count of vertex or edge directly through Hbase. The following code is:

 SnapshotCounter.HBaseGetter entryGetter = new SnapshotCounter.HBaseGetter();
        EntryList entryList = StaticArrayEntryList.ofBytes(
                result.getMap().get(Bytes.toBytes("e")).entrySet(),
                entryGetter);
        StandardTitanTx tx = (StandardTitanTx) graph.newTransaction();
        System.out.println("Entry list size: " + entryList.size());
        int cnt = 0;
//        IDInspector inspector = graph.getIDInspector();
        for (Entry entry : entryList) {
            RelationCache relation = graph.getEdgeSerializer().readRelation(entry, false, tx);
//            Direction direction = graph.getEdgeSerializer().parseDirection(entry);
//            System.out.println("Direction is:" + direction.name());
//            System.out.println("relation is:" + relation);

//            System.out.println("numProperties: " + relation.numProperties());
//            Iterator<LongObjectCursor<Object>> longObjectCursorIterator = relation.propertyIterator();
//            LongObjectCursor<Object> next = longObjectCursorIterator.next();
//            System.out.println("key is:" + next.key);
//            System.out.println("value is:" + next.value);
//            System.out.println("next.toString is:" + next.toString());



            RelationType type = tx.getExistingRelationType(relation.typeId);

            Iterator<Edge> edgeIterator1 = type.edges(Direction.BOTH);
            while (edgeIterator1.hasNext()){
                Edge next11 = edgeIterator1.next();
                System.out.println("relType is :" + next11.property("relType"));
            }

//             if (type.isEdgeLabel() && !tx.getIdInspector().isEdgeLabelId(relation.relationId)){
//            if (type.isEdgeLabel() &&  !graph.getIDManager().isEdgeLabelId(relation.relationId) &&
//                    !tx.getIdInspector().isRelationTypeId(type.longId())) {
            if (type.isEdgeLabel() ) {
                cnt++;
                System.out.print("isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.typeId));

                System.out.print("isEdgeLabelId: ");
                System.out.println(graph.getIDManager().isEdgeLabelId(relation.typeId));

                System.out.print("type isEdgeLabel: ");
                System.out.println(type.isEdgeLabel());

                System.out.print("relationId isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.relationId));
                System.out.println(entry.getValue().toString());
            }
        }
        System.out.println("Edge count: " + cnt);

I made a test by making a small graph-- two vertexes and two edges.

But I just get the count of the edge is one, expecting two. Is there any problem? Please help....This problem bugs me. Thanks~~~

anybody online?  please help me~

在 2017年7月17日星期一 UTC+8下午5:53:32，写道：

My graph has about 100 million vertexes and 200 million edges. But if use the following code, it is too slow.

GraphTraversal<Vertex, Long> countV = traversal.V().count();

while (countV.hasNext()){
    System.out.println("countV:" + countV.next());
}

GraphTraversal<Edge, Long> countE = traversal.E().count();
while (countE.hasNext()){
    System.out.println("countE:" + countE.next());
}

I want to computer the count of vertex or edge directly through Hbase. The following code is:

 SnapshotCounter.HBaseGetter entryGetter = new SnapshotCounter.HBaseGetter();
        EntryList entryList = StaticArrayEntryList.ofBytes(
                result.getMap().get(Bytes.toBytes("e")).entrySet(),
                entryGetter);
        StandardTitanTx tx = (StandardTitanTx) graph.newTransaction();
        System.out.println("Entry list size: " + entryList.size());
        int cnt = 0;
//        IDInspector inspector = graph.getIDInspector();
        for (Entry entry : entryList) {
            RelationCache relation = graph.getEdgeSerializer().readRelation(entry, false, tx);
//            Direction direction = graph.getEdgeSerializer().parseDirection(entry);
//            System.out.println("Direction is:" + direction.name());
//            System.out.println("relation is:" + relation);

//            System.out.println("numProperties: " + relation.numProperties());
//            Iterator<LongObjectCursor<Object>> longObjectCursorIterator = relation.propertyIterator();
//            LongObjectCursor<Object> next = longObjectCursorIterator.next();
//            System.out.println("key is:" + next.key);
//            System.out.println("value is:" + next.value);
//            System.out.println("next.toString is:" + next.toString());



            RelationType type = tx.getExistingRelationType(relation.typeId);

            Iterator<Edge> edgeIterator1 = type.edges(Direction.BOTH);
            while (edgeIterator1.hasNext()){
                Edge next11 = edgeIterator1.next();
                System.out.println("relType is :" + next11.property("relType"));
            }

//             if (type.isEdgeLabel() && !tx.getIdInspector().isEdgeLabelId(relation.relationId)){
//            if (type.isEdgeLabel() &&  !graph.getIDManager().isEdgeLabelId(relation.relationId) &&
//                    !tx.getIdInspector().isRelationTypeId(type.longId())) {
            if (type.isEdgeLabel() ) {
                cnt++;
                System.out.print("isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.typeId));

                System.out.print("isEdgeLabelId: ");
                System.out.println(graph.getIDManager().isEdgeLabelId(relation.typeId));

                System.out.print("type isEdgeLabel: ");
                System.out.println(type.isEdgeLabel());

                System.out.print("relationId isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.relationId));
                System.out.println(entry.getValue().toString());
            }
        }
        System.out.println("Edge count: " + cnt);

I made a test by making a small graph-- two vertexes and two edges.

But I just get the count of the edge is one, expecting two. Is there any problem? Please help....This problem bugs me. Thanks~~~

My graph has about 100 million vertexes and 200 million edges. But if use the following code, it is too slow.

GraphTraversal<Vertex, Long> countV = traversal.V().count();

while (countV.hasNext()){
    System.out.println("countV:" + countV.next());
}

GraphTraversal<Edge, Long> countE = traversal.E().count();
while (countE.hasNext()){
    System.out.println("countE:" + countE.next());
}

I want to computer the count of vertex or edge directly through Hbase. The following code is:

 SnapshotCounter.HBaseGetter entryGetter = new SnapshotCounter.HBaseGetter();
        EntryList entryList = StaticArrayEntryList.ofBytes(
                result.getMap().get(Bytes.toBytes("e")).entrySet(),
                entryGetter);
        StandardTitanTx tx = (StandardTitanTx) graph.newTransaction();
        System.out.println("Entry list size: " + entryList.size());
        int cnt = 0;
//        IDInspector inspector = graph.getIDInspector();
        for (Entry entry : entryList) {
            RelationCache relation = graph.getEdgeSerializer().readRelation(entry, false, tx);
//            Direction direction = graph.getEdgeSerializer().parseDirection(entry);
//            System.out.println("Direction is:" + direction.name());
//            System.out.println("relation is:" + relation);

//            System.out.println("numProperties: " + relation.numProperties());
//            Iterator<LongObjectCursor<Object>> longObjectCursorIterator = relation.propertyIterator();
//            LongObjectCursor<Object> next = longObjectCursorIterator.next();
//            System.out.println("key is:" + next.key);
//            System.out.println("value is:" + next.value);
//            System.out.println("next.toString is:" + next.toString());



            RelationType type = tx.getExistingRelationType(relation.typeId);

            Iterator<Edge> edgeIterator1 = type.edges(Direction.BOTH);
            while (edgeIterator1.hasNext()){
                Edge next11 = edgeIterator1.next();
                System.out.println("relType is :" + next11.property("relType"));
            }

//             if (type.isEdgeLabel() && !tx.getIdInspector().isEdgeLabelId(relation.relationId)){
//            if (type.isEdgeLabel() &&  !graph.getIDManager().isEdgeLabelId(relation.relationId) &&
//                    !tx.getIdInspector().isRelationTypeId(type.longId())) {
            if (type.isEdgeLabel() ) {
                cnt++;
                System.out.print("isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.typeId));

                System.out.print("isEdgeLabelId: ");
                System.out.println(graph.getIDManager().isEdgeLabelId(relation.typeId));

                System.out.print("type isEdgeLabel: ");
                System.out.println(type.isEdgeLabel());

                System.out.print("relationId isSystemRelationTypeId: ");
                System.out.println(graph.getIDManager().isSystemRelationTypeId(relation.relationId));
                System.out.println(entry.getValue().toString());
            }
        }
        System.out.println("Edge count: " + cnt);

I made a test by making a small graph-- two vertexes and two edges.

But I just get the count of the edge is one, expecting two. Is there any problem? Please help....This problem bugs me. Thanks~~~

Don't mix the Graph API and the Traversal API.  Prefer the Traversal API.

// in two traversals

newNode = g.addV("B").property("x",x).property("y",y).property("z",z).property("w", w).next()

g.V().hasLabel("A").has("x",x).has("y").addE("rt").to(V(newNode)).iterate()

// In one traversal

g.addV("B").property("x",x).property("y",y).property("z",z).property("w", w).as("newNode").V().hasLabel("A").has("x",x).has("y").addE("rt").to("newNode").iterate()

g.tx().commit()

See also http://tinkerpop.apache.org/docs/current/reference/#addedge-step

Robert Dale

On Mon, Jul 17, 2017 at 6:53 PM, aa5186 <aru...@...> wrote:

Hi all,

I am trying to add a new vertex and associate a new edge from it to an existing vertex. It doesn't allow me to add the edge and throws the exception:
java.lang.IllegalStateException: The vertex or type is not associated with this transaction [v[16552]]

```

List<Vertex> nodes = g.V().hasLabel("A").
                            has("x",x).
                            has("y",y).toList();

Vertex newNode = tx.addVertex(T.label,"B",
                                    "x",x,
                                    "y",y,
                                    "z",z,
                                    "w",w);
for(Vertex node: nodes){

    node.addEdge("rt",newNode);
}
graph.tx().commit();
```
From what I understand, the "nodes" are not part of the tx transaction (...?) and therefore, the edge between "node" and "newNode" is not possible.
Can someone please point me in the right direction as I am new to Graph databases?

Thanks!

--
You received this message because you are subscribed to the Google Groups "JanusGraph users list" group.
To unsubscribe from this group and stop receiving emails from it, send an email to janusgraph-use...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.