No, it is not because this will not be efficient. Imagine a database with a billion "people" - how would you efficiently retrieve those?
--
You received this message because you are subscribed to the Google Groups "Aurelius" group.
To unsubscribe from this group and stop receiving emails from it, send an email to aureliusgraph...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/5cac4934-c5cd-4482-a28b-63f3a6535d1d%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/CAEsQWxqrwAq33NcMqppesRa0K4kyEG1UcunsaXyLbKYV8ebW%3DA%40mail.gmail.com.
Oh, I misunderstood. This is absolutely possible. You can define an index for the name property key and then use the indexOnly (person) call to build this index for person vertices only. Then, calls involving g.query().has("name","xyz").has("label","person") will be very fast.
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/CAP%2BbOhzg5tMXjfVZ6zP4UpPC3hMhT1DTi%3Dzf9vhLiL9AHy1bLg%40mail.gmail.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/CAEsQWxqBj2cex-sbahvPfB5-NOaAu%2Bs6Vf48Xj4_9CAP3DBgMQ%40mail.gmail.com.
We were thinking about altering this but then thought that the likelihood for abuse is too high, I.e. people will use it on small datasets, think that it works and then notice issues when they try to scale.
If you feel strongly about this, please file an issue and we will reconsider in the future.
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/CAP%2BbOhx-BrvR9R7wbwgdtxFJ%2B3ZHfRwCGvCJVmdQMRu7zAcreQ%40mail.gmail.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/CAEsQWxpK_Db-9eAjKrqGb9hC7c2U2%3D47PgxkMUU1Q2qk%3D9hYhg%40mail.gmail.com.
For labels, the unidirected edge goes the other way. But if you know there will only be a small number of products you can create a dedicated property or one product root vertex that points to all products.
--
You received this message because you are subscribed to the Google Groups "Aurelius" group.
To unsubscribe from this group and stop receiving emails from it, send an email to aureliusgraph...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/f9a565b2-df26-4a45-9f5e-aebd81f9db07%40googlegroups.com.
Does this retrieve all name:xyz + label:person set through indexing. Or does it first retrieve by name then scan all of them to find the correctly labeled ones?
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/de0214ae-c062-425a-bb15-115fe8202ccf%40googlegroups.com.
What if the vertex has a property called "label"?
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/e47fc74c-63b1-408a-8793-38efedbc1f1b%40googlegroups.com.