Examples of org.neo4j.collections.indexedrelationship.IndexedRelationship$RelationshipIterator

org.neo4j.collections.indexedrelationship.IndexedRelationship

A specialized relationship type using a {@link NodeCollection} index.Every relationship is stored in the index, making it possible to have a sorted collection of relationships, or to enforce a unicity constraint on the relationship.

This class is also useful when confronted with situations where normal relationships would lead to densely populated nodes.

Given an end node, the start node of the relationship can be found by traversing:

KEY_VALUE, INCOMING
KEY_ENTRY, INCOMING
SUB_TREE, INCOMING
TREE_ROOT, INCOMING

The name of the RelationshipType is stored as a property with keyname "tree_name" on both the TREE_ROOT and the KEY_VALUE relationships.

Given a start node of the relationship, all end nodes can be found by traversing:

TREE_ROOT, OUTGOING
SUB_TREE, OUTGOING
KEY_ENTRY, OUTGOING
KEY_VALUE, OUTGOING

    return (ComparablePropertyType<T>) getByName(getDb(), (String)getNode().getProperty(PROPERTY_TYPE));
  }
  
  @Override
  public SortableBinaryEdge<T> createEdge(Vertex startVertex, Vertex endVertex) {
        IndexedRelationship idxRel = new IndexedRelationship( startVertex.getNode(),
            DynamicRelationshipType.withName(this.getName()), Direction.OUTGOING );
        if ( !idxRel.exists() )
        {
            PropertySortedTree<T> propertySortedTree = new PropertySortedTree<T>( getDb().getGraphDatabaseService(),
                getPropertyType(), true, getName() );
            idxRel.create( propertySortedTree );
        }
    Relationship rel = idxRel.createRelationshipTo(endVertex.getNode());
    return new SortableBinaryEdgeImpl<T>(db, rel.getId(), idxRel);
  }

Examples of org.neo4j.collections.indexedrelationship.IndexedRelationship$RelationshipIterator

Related Classes of org.neo4j.collections.indexedrelationship.IndexedRelationship$RelationshipIterator