Hi!
I just updated the IMDB example to use Neo4j 1.5, the code is here:
https://github.com/neo4j-examples/imdb
(the wiki says otherwise ... I'll fix that)
Neoclipse 1.5 is available here:
http://neo4j.org/download/
Neoclipse is tied to specific Neo4j versions, and if an database needs
to be
Hi guys,
I have a graph of about 2.5M nodes and 8M relationships and I am trying to
find all simple paths between two nodes with maximum depth of 8.
The allSimplePaths graph algo works well for maximum depth of 5, but for 8
it runs really long (I didn't even wait for it to finish). So I thought
Petar,
very cool if this worked out. Maybe you could write up a testcase that
verifies that the results are the same, and then put this as a fork to
the graphalgo package? Sounds like a great addition if this works out?
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype
Hi Peter,
I now have a graph with the 'geom' index + testnode from the above code and
imported some OSM data afterwards. I now want to find 2 nodes by bbox query
- 550349 and 205372 (see http://dl.dropbox.com/u/18693700/graph.png). How
can I achieve this? If I query for the bbox I should at least
I've read that Neo4j has data capacity limitations
(http://docs.neo4j.org/chunked/milestone/capabilities-capacity.html). I
would like to confirm my understandings that the node, properties, and
relationships limitations are for each type (e.g. AND condition), not an
either/or (e.g. OR
Daniel,
the OSM import is loaded into its own layer corresponding to the
dataset file name as a default I think (there should be a layer node
created fro it, much in the same way as for the 'geom' index. So, if
you load that layer the same way as an index provider as you did with
the 'geom' index,
Yes.
However, before that you will probably run into other limitations,
like file sizes, IO and RAM. That is why we are a bit careful about
just going to Longs or UUIDs.
Anything you are thinking of in particular?
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Correct,
is this an issue for your domain/data model?
If so could you something about your use-case / context?
Thanks a lot
Michael
Am 24.11.2011 um 13:55 schrieb bm3780:
I've read that Neo4j has data capacity limitations
I'm struggling to determine whether graph is a good fit for my domain. Most
of my application is structured data. However, there are some parts that
are of a social nature and a graph seems like a good match. I guess my fear
is having all of the data in a single store, such as a graph, would
Yes, this is true, with a few notes:
ID reuse complicates things a bit, meaning that if you delete nodes
and relationships some ids will remain unused until you restart the
database. Unclean shutdowns also may require scanning of the store
files to determine unused records - the
If your data exceeds those amounts, then polyglot persistence is probably the
way to go.
Is the other part of your data also interconnected and rich or is it just the
social part?
All that not only depends on the storage but also a lot on the use-cases and
scenarions how you are going to use
All of my data is interconnected and rich. This is why I like the idea of a
graph.
--
View this message in context:
http://neo4j-community-discussions.438527.n3.nabble.com/Neo4j-Data-Capacities-tp3533552p3533673.html
Sent from the Neo4j Community Discussions mailing list archive at Nabble.com.
No, we don't got that store, but we are developing new type of fraud
detection solution to CC vendor. We have one asset what they are looking,
but we like to add that real time correlation identify to solution. If we
manage to get deal, then that solution will process that amount of
transactions.
Hi Pekka,
There are already (prominent) folks using Neo4j in that kind of credit card
fraud detection. I hope some of them could volunteer their experiences (though
not necessarily their proprietary clever stuff) on this list.
Jim
___
Neo4j mailing
Great, as you see. We are small startup www.epygg.com and one major CC
company has contact us, because we have one method what is really wanted by
them, i dont want to just give license for then, so i like to build some
solution top of my technology. Key is that we can generate one field of
Ok, that previous answer was not representing my particular question thread.
My application is a new initiative, so there is no existing data store.
However, we do intent on ingesting other data sets to make our data more
interesting by our users. Some of these data sets we are interested in is
Hey Chris,
I'm happy to inform you that this is already the case :)
If you loop through the entire result, it automatically gets closed.
/jake
On Wed, Nov 23, 2011 at 8:42 PM, Chris Diehl cpdi...@gmail.com wrote:
Hi Jake,
As you know, with the current Neo4j Python bindings, one needs to
Hi guys,
I played around some more with alternative approach and it turns out the
results are not equivalent.
Since I cannot test it with the desirable max depth of 8 on my setup, I ran
a test with max depth of 4.
For a given test case, allSimplePaths returned 2 paths of length 2 and 3:
There are several optimizations that the shortest path algo does that
allSimplePaths doesn't, f.ex:
* Traversal is bidirectional (it starts from the start AND the end
simultaneously, although in the same thread) which means that the deeper
the traversal goes the more it gains compared to a single
Is ANY() supposed to work with array properties? e.g. I have the following
WHERE clause in my query:
WHERE pa.position AND ANY(pos in pa.positions : pos = QB)
However, I get a syntax error Probably missing quotes around a string
pointed at the = sign.
I can verify that pa.positions is an array
On Fri, Nov 25, 2011 at 1:40 AM, Stephen glur...@gmail.com wrote:
Is ANY() supposed to work with array properties? e.g. I have the following
WHERE clause in my query:
It is supposed to, but it doesn't yet.
Sorry about that...
Andrés
___
Neo4j
21 matches
Mail list logo
