DSE 6.8: Edge is created with partition keys from "OUT" vertex's primary key (contains few clustering keys), this implies edge and vertex are going reside on separate nodes?
Hi,
Both the vertex and the edge coming out of the vertex have the same partition key, so this implies that the edge and the vertex reside on the same node. The node is determined by the consistent hashing algorithm from the partition key. The clustering keys do not come into this.
You can test for endpoints with nodetool getendpoints
: https://docs.datastax.com/en/dse/6.8/dse-admin/datastax_enterprise/tools/nodetool/toolsGetEndPoints.html
6 People are following this question.
What is the maximum array size allowed in a within() clause?
When do we need indices for edges? How did you implement them?
What is the gremlin recipe to use traversal induced values in the predicate of a __.has( ,,) step?
Graph transactions tx() returns UnsupportedOperationException in DSE 6.8
Do you have examples for running Graph queries with Java driver 4.8.0?
DataStax Enterprise is powered by the best distribution of Apache Cassandra ™
© 2023 DataStax, Titan, and TitanDB are registered trademarks of DataStax, Inc. and its subsidiaries in the United States and/or other countries.
Apache, Apache Cassandra, Cassandra, Apache Tomcat, Tomcat, Apache Lucene, Lucene, Apache Solr, Apache Hadoop, Hadoop, Apache Spark, Spark, Apache TinkerPop, TinkerPop, Apache Kafka and Kafka are either registered trademarks or trademarks of the Apache Software Foundation or its subsidiaries in Canada, the United States and/or other countries.
Privacy Policy Terms of Use