That's normally what id's are for, so you can determine identity without looking at every property.
But if you really need to do this you could create a string hash of the key value pairs, replace any unsupported characters (see
fb docs) and create a node for storing the link between hash and id. Total hash would be need to be less than 768 bytes, so you might need to use a checksum if data too big.
So if you had:
+ things
+ key123
+ name: 'bob'
+ age: 12
+ color: 'blue'
+ key456
+ name: 'jill'
+ age: 14
+ color: 'red'
Then you'd also have:
+ lookup
+ name:bob;age:12;color:blue: key123
+ name:jill;age:14:color:red: key 456