What are you trying to achieve?
I see no problem description, just a solution, and I don't understand what
it is supposed to solve.
Your first mail looks like it might be a response to some other mail, but in
that case the first e-mail never made it to the list.
Cheers,
Tobias
On Fri, May 14,
and that's it.
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
, Apr 9, 2010 at 12:33 AM, Michael Ludwig mil...@gmx.de wrote:
rick.bullotta schrieb am 08.04.2010 um 15:16:11 (-0700)
[Re: [Neo] How to efficiently query in Neo4J?]:
Factor in a wide range of SLAs needed for performance vs availability
vs affordability vs scalability vs adminstration costs
On 9 April 2010 14:21, Max De Marzi Jr. maxdema...@gmail.com wrote:
On first traversal, add a relationship to a found node to each node that
would return, and check for this relationship on the second traversal?
Maybe create a unique id, set a property or add a node property with the
unique
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
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
to explore domain-specific approaches.
Does that make any sense?
Original Message
Subject: Re: [Neo] How to efficiently query in Neo4J?
From: Craig Taverner cr...@amanzi.com
Date: Wed, April 07, 2010 7:05 pm
To: Neo user discussions user@lists.neo4j.org
Hi
Alastair James schrieb am 07.04.2010 um 15:53:50 (+0100)
[[Neo] How to efficiently query in Neo4J?]:
Briefly, the site consists of posts, each tagged with various
attributes, e.g. (its a travel site) location, theme, cost etc... Also
the tags are hierarchical. So, for location we have (say
Max De Marzi Jr. schrieb am 08.04.2010 um 16:48:18 (-0500)
[Re: [Neo] How to efficiently query in Neo4J?]:
You know this is something that I think needs to be made clear...
using just the graph is not the right way to go unless you have a very
special application.
Some things are better
Message
Subject: Re: [Neo] How to efficiently query in Neo4J?
From: Michael Ludwig mil...@gmx.de
Date: Thu, April 08, 2010 6:02 pm
To: Neo user discussions user@lists.neo4j.org
Max De Marzi Jr. schrieb am 08.04.2010 um 16:48:18 (-0500)
[Re: [Neo] How to efficiently query
Hi...
On 8 April 2010 22:35, Michael Ludwig mil...@gmx.de wrote:
After giving this some thought, it looks to me as if there is nothing
particularly graphy in your example. I know, most everything is a graph,
but here the data is more regular: Your hierarchical catalog of tags
immediately
?.
Al
Original Message
Subject: Re: [Neo] How to efficiently query in Neo4J?
From: Michael Ludwig mil...@gmx.de
Date: Thu, April 08, 2010 6:02 pm
To: Neo user discussions user@lists.neo4j.org
Max De Marzi Jr. schrieb am 08.04.2010 um 16:48:18 (-0500)
[Re
rick.bullotta schrieb am 08.04.2010 um 15:16:11 (-0700)
[Re: [Neo] How to efficiently query in Neo4J?]:
Factor in a wide range of SLAs needed for performance vs availability
vs affordability vs scalability vs adminstration costs, and the
equation gets a whole lot more complicated.
Granted
Hi there...
I am looking at moving a website to a model based on Neo4J, however, I am
having trouble seeing how to optimise the 'main query' type for Neo4J.
Briefly, the site consists of posts, each tagged with various attributes,
e.g. (its a travel site) location, theme, cost etc... Also the
I've had similar issues and they way I've done it (which may not be the
right way) is to run the first traversal and store the returned nodes. Then
run the second traversal and return only if it is contained in the set of
returned nodes in the first traversal.
The traverses hit each node only
effective way to do this as well!
Rick
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Alastair James
Sent: Wednesday, April 07, 2010 10:54 AM
To: Neo user discussions
Subject: [Neo] How to efficiently query in Neo4J?
Hi there...
I
H...
I am guessing the most efficient way might be to have a two stage return
evaluator.
E.g. The custom return evaluator class has a hash table of node id =
count pairs. Each time 'isReturnableNode' is called, it increments the
count for that node id in the hash. If count = total number of
This is a very interesting discussion because I've been working on a
solution I call a 'composite index' that, for some datasets, should return
the correct results in one simple traverse, with no temporary memory used,
but first my high level view of this:
I think there are several types of
18 matches
Mail list logo
