You could use the LuceneFulltextQueryIndexService to index relationship count for a node and then ask with a range query.
indexService.index( myNode, "rel_count", theRelationshipCount ); indexService.getNodes( "rel_count", "[0 TO 10000]" ); This would return all nodes with an indexed "rel_count" of 0-10000... see http://lucene.apache.org/java/2_9_1/queryparsersyntax.html#Range%20Searches Also read about fulltext indexing at http://wiki.neo4j.org/content/Indexing_with_IndexService#Fulltext_indexing 2009/12/31 Lorenzo Livi <[email protected]>: > Hi > >> >> Storing the relationship count as a property on the node is a good >> solution to the problem. I do not know why you would have to index the >> property using lucene unless you plan to query for for "give me all >> nodes with relationship count X". > > If I need to know all the nodes that has the degree at least X this is > not a good solution..... > >> >> From a performance point of view the bottleneck for writes is the >> disk. If you update different parts of the graph in different threads >> and have good hardware (raid) you may get a higher insert/update >> speed. Batch inserter mode does not support concurrent updates. > > yes > >> >> Regards, >> -Johan > > Thanks. Any other tips on concurrency are very appreciated. > > best regard, > strozzino > _______________________________________________ > Neo mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > -- Mattias Persson, [[email protected]] Neo Technology, www.neotechnology.com _______________________________________________ Neo mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
