Alex, due to floating point precision issues, you might be best off determining some type of integral rounded or scaled key as you suggest. If you end up using the Lucene indexing engine, you'd probably want to do something like this anyway, since indexing is string-based under the hood.
That said, I wonder if any of the graph algos available for Neo could be used to determine centrality during traversal rather than storing it statically? -----Original Message----- From: [email protected] [mailto:[email protected]] On Behalf Of Alex D'Amour Sent: Monday, March 22, 2010 5:06 PM To: Neo user discussions Subject: [Neo] Indexing on Doubles in Neo4j 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 _______________________________________________ Neo mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
