Hello Apologies if this is the incorrect forum - I was pointed here from another mailing list.
I had an idea for an access control scheme that could be applied to vertices, edges or vertex properties and would allow a server to check whether a user has permission to retrieve or traverse that particular graph element. The access control property would be a set of rules outlining the attributes, and the combination of those attributes, that establish whether or not a user has sufficient privileges for that graph element. I have experimented with attempting to use the existing Gremlin language to do this, but I have so far been unable to achieve the level of fine-grained access control that I believe would be useful in a variety of situations. I have tested this with a prototype that uses a Java object and a custom predicate that tests a user's profile against the access control, and then used a traversal strategy to constrain a query to those elements which pass the test. I was curious as to whether people would see such a feature as something that could be part of Gremlin, or whether it would be better left to specific implementations of Tinkerpop. Thanks for your consideration.
