The LexGrid Model defines relationships in terms of a source and target node with an edge defined separately in the AssociationPredicate model element. These are the construction basics for larger coded node graphs which are currently represented in a relational schema. The performance restrictions of the relational schema have been well documented above. A mapping of the source and target structure of LexGrid will be mapped to the structure of the higher performing graph database OrientDB.
While the graph based database seems capable to handle the functions shown in the diagram above some calls to LexEVS will continue to access some of the model elements that define metadata about the association.
