Some vertices have several unique attributes appart from the primary key. In SQL databases it is taken advantage of this characteristic to implement some hashing in order to accelerate the search by these attributes. Is there any equivalent way to implement this on TigerGraph? Also ensuring that the loaded information on the attribute is unique. Thanks in advance.
You can index the attribute to speed up searches. Note that CREATE INDEX needs to be part of a SCHEMA_CHANGE job.
We don’t have support at present for a UNIQUE constraint.
Ok, I will try to use that. Thanks!!