In a previous post, I suggested a two-way traversal (I guess it's actually a traversal done once in one direction and "n-1" times in the other direction, where "n" = number of tags you're matching posts on).
I'm willing to bet it could be pretty fast... Do you have any code that can create a dummy data set in Neo4J? If you do, I'd be willing to give it a try... -------- Original Message -------- Subject: Re: [Neo] How to efficiently query in Neo4J? From: Michael Ludwig <mil...@gmx.de> Date: Fri, April 09, 2010 2:44 pm To: Neo user discussions <user@lists.neo4j.org> Alastair James schrieb am 09.04.2010 um 14:04:37 (+0100) [Re: [Neo] How to efficiently query in Neo4J?]: > So, I suppose this question boils down to, is there an efficient way > to calculate the union of two traversals without retrieving all result > sets and performing the union in user code? No need for two traversals if you annotate your category tree in Neo4j the same way Celko has popularized for SQL, i.e. marking each category with *left* and *right*. It's really not a question of graph or sets, as in both cases what you deal with is a tree. [1]http://intelligent-enterprise.informationweek.com/001020/celko.jhtml Note that this needs some custom logic for category tree updates. But it's not difficult in SQL, and I think it's not much more difficult in Neo4j either. -- Michael Ludwig _______________________________________________ Neo mailing list User@lists.neo4j.org [2]https://lists.neo4j.org/mailman/listinfo/user References 1. http://intelligent-enterprise.informationweek.com/001020/celko.jhtml 2. https://lists.neo4j.org/mailman/listinfo/user _______________________________________________ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
