for quick traversal, we are planning to store (denormalized) some time-related properties from IN vertex into the edge.
Edge Search (new to 6.8) cannot be performed on such node as the partitioning keys (from OUT vertex) cannot be used through Tinkerpop interface, is only way to de-normalize ALL the primary from OUT vertex into edge?
UPDATE - A bit more detail:
Event <--- Account
schema.vertexLabel('Event'). ifNotExists(). partitionBy('tenantId', Ascii). clusterBy('eventCategory', Ascii, Asc). clusterBy('createTime', Timestamp, Desc). clusterBy('gid', Uuid, Asc)
schema.vertexLabel('Account'). ifNotExists(). partitionBy('tenantId', Ascii). clusterBy('entityGlobalId', Uuid, Asc)
schema.edgeLabel('WithEvent'). ifNotExists(). from('Account').to('Event') clusterBy('acknowledged', Boolean)
Question: Need to do edge search where following are provided:
edge.acknowledged + IN-Vertex with (tenantId, eventCategory, createTime>= Jan/2020)
Will DSE Graph optimize this query to just search in the Edge table? Given it contains all the fields (properties and primary key of the incident edges).