Hello all, I'm working on an application where it would be nice to perform lookups on a graph database based on real-valued properties.
For example, if I have a social network, and have assigned real-valued centrality measures to each node, I'd like to be able to choose all vertices whose centrality measure is greater than some threshold. I see that the Timeline index service offers this for integer-valued properties. Is there something similar (or in the pipeline) for doing the same with real-valued properties? Is there an easy way to adapt one of the current indexing utilities to do this (besides multiplying by 10^n for sufficiently large n and then rounding)? Thanks, Alex D'Amour Harvard Institute for Quantitative Social Science _______________________________________________ Neo mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
