err, lol, actually I failed here, it was actually two primary databases,
I only used primary+secondary databases when storing String-longID 1-to1
mapping
that is, when emulating a HashMap by using berkeleydb where each side(key or
value) can be connected to only one other thing (value or key)
but
Hi all,
I've been doing preliminary evaluations on some Neo4j operations. One of which
rises from a specific need in my application:
My method will get a List of node ids (stored in the nodes' properties) and
need to retrieve exactly these nodes from the GraphDB. This should happen as
fast as
The PagingIterator caches the results lazily going forward with the ability
to go back through the pages. Going forward again will return cached values
as far as possible and then go down to the real iterator again when the end
of the cache is reached. So it will not cache the entire result up
Hi
I was testing GraphAlgoFactory functions. I am getting duplicate
results from this function.
I have 2 user nodes A and B and they follow something I1 and I2.
A--I1, A--I2
B--I1 , B--I2
Now I want to find shortest paths between A and B using relationship
type
It returns unique paths considering both nodes and relationships, so maybe
you're only looking at the nodes in the paths and sees that the paths aren't
unique in that aspect?
2011/7/29 Manav Goel goyal.ma...@gmail.com
Hi
I was testing GraphAlgoFactory functions. I am getting duplicate
I think you are right. Paths are unique but nodes in that path are not. But
I need only unique path with unique nodes so that path is not repeated
again.
Any ideas on how to achieve that?
On Fri, Jul 29, 2011 at 1:25 PM, Mattias Persson
matt...@neotechnology.comwrote:
It returns unique paths
Hi Aseem,
Jim, thanks for the explanation. I understand your constraints, but thinking
about it more, I'm actually even more baffled -- how can we actually make
use of this paged traversal API in a web scenario?
Neo4j's traversers (which is what the REST paging API really is) knows nothing
All of this works, without JS. That means the client (your browser) isn't
the party doing the paging or keeping track of all results. It's something
on the server side.
That something on the server side is called Google. That is, there is an
organisation which has set up databases,
Or if you want the jar files, they are in the lib/ directory of the
download package from: http://neo4j.org/download/
/anders
On 07/29/2011 01:18 AM, Tobias Ivarsson wrote:
They should be in the neo4j-cypher-1.4.jar.
That jar-file should be among your dependencies if you simply depend on (in
Hi Guys,
I have dates in Neo4j stored as JSON Dates.
e.g.
DateCreated: /Date(1310360656147+)/
LastLogin: /Date(1311927251851+)/
I use the iterator and lambda way of query data
e.g.
g.v(0).outE[[label:'HOSTS']].inV{it.'Name'.compareTo('Agency1') == 0}.Name
However I want to compare
Hi Guys,
Is it possible to update the neo4j.bat file for future releases to have a
global variable for java
Currently it is located in two places in the file neo4j.bat. We using Neo4j in
the cloud and currently we have to do string replacements at two locations:
e.g. - these are my configs
Hi,
that is a valid complaint. The main idea was to use the java
executable that is on the Path - however that can be still the case
and allow for custom executable locations with just one string
substitution.
Consider this added into the backlog.
cheers,
CG
On Fri, Jul 29, 2011 at 2:04 PM,
Hi!
For example, we have social graph: http://www.donskov.net/graph.jpg
Nodes is humans. If the nodes have a relation - so they are friends.
I need to get all friends friends and all friends friends friends etc. on
node 4 (see example).
I post this:
{
order: breadth_first,
Hi!
For example, we have social graph: http://www.donskov.net/graph.jpg
Nodes is humans. If the nodes have a relation - so they are friends.
I need to get all friends friends and all friends friends friends etc. on
node 4 (see example).
I post this:
{
order: breadth_first,
Thank You.
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Chris Gioran
Sent: Friday, 29 July 2011 9:18 PM
To: Neo4j user discussions
Cc: Jamal Abreu (jab...@barnardos.org.au); Tatham Oddie
Subject: Re: [Neo4j] neo4j.bat - java
I can probably add a parameter to the algo so that it only visits unique
nodes, as opposed to unique relationships and expose that as a
GraphAlgoFactory#nodeUniqueShortestPath or something.
Den fredagen den 29:e juli 2011 skrev Manav Goelgoyal.ma...@gmail.com:
I think you are right. Paths are
If that can be done it would be great :)
On 29-Jul-2011 6:03 PM, Mattias Persson matt...@neotechnology.com wrote:
I can probably add a parameter to the algo so that it only visits unique
nodes, as opposed to unique relationships and expose that as a
GraphAlgoFactory#nodeUniqueShortestPath or
This thread is very interesting for me because I have similar scenario. I’m
using neo4j in embedded mode in web application. Web application doesn’t
have an application session – it’s stateless (no way to store pointers to
iterators). And I need to find nodes and make paging for results (too many
Now that is interesting - I hadn't considered this when writing the REST paging
stuff.
When you say that the PagingIterator caches, what's the memory overhead
involved, particularly when I want to page backwards through a potentially
large result set?
Jim
Hey,
Retrieving popular nodes not directly possible with the REST API.
Even in Java, you'd have to sort your result set manually since you don't know
ahead of time how the search is going to traverse your graph.
It is only once you have your result set (which may be large) that you can
sort,
Hi!
Neoclipse 1.4 can now be downloaded from the usual location:
http://neo4j.org/download/
Major changes:
* loop support
* changes in the view menu so that filtering of properties and
showing/hiding keys (previously expanded mode) are separate concerns
/anders
Hello,
I started working with neo4j-spatial a while ago. i found it very
useful and the first thing i would like to say is Thanks for your
wonderful work.
While working on a project that require large amount of insert/delete
operation I think i found two bugs.
The first one is in
Ben,
The first bug is fixed in Andreas Wilhelms fork, thanks for pointing it out!
Can't comment on the second from my mobile :) could you fork, add the test
and see if you can fix it?
/peter
Sent from my phone.
On Jul 29, 2011 7:29 AM, Ben Galon bga...@gmail.com wrote:
Hello,
I started
I am going to stick as closely to the current implementation of traversers and
where possible use code of the current implementation.
As far as I can see, the current UniquenessFilter works well, so I am going to
keep that setup for the new implementation.
Indeed it should be:
Node --FRIEND--
Hi John,
Thanks for looking into this.
I am still seeing the same error I had before. When running the mvn install,
both tests are ran after another. For some reason the transaction log sees an
unclean shutdown and tries to commit pending transactions.
During that process the index names of
Hi,
I have dates in Neo4j stored as JSON Dates.
e.g.
DateCreated: /Date(1310360656147+)/
LastLogin: /Date(1311927251851+)/
I use the iterator and lambda way of query data
e.g.
g.v(0).outE[[label:'HOSTS']].inV{it.'Name'.compareTo('Agency1') == 0}.Name
SIDENOTE:
What I need to store in an index depends on the type of element that needs to
be reified.
Relatationship:
To associated Node: RelId - NodeIdFrom associated Node: NodeId - RelId
RelationshipType:
To associated Node: RelationhipType.name - NodeIdFrom associated Node: NodeId
-
Yes. If you have performed a search and now have SpatialDatabaseRecord
results, then that is the best method to use.
On Thu, Jul 28, 2011 at 6:03 AM, Christopher Schmidt
fakod...@googlemail.com wrote:
So best is to use SpatialDatabaseRecord.getGeometry()?
Christopher
On Wed, Jul 27, 2011
Hi Peter
I don't have git installed on my computer. so I opened a fork and
commit my solution from the web UI. I could not find a way to upload
the Test file, sorry for that.
Best regards
Ben
On Fri, Jul 29, 2011 at 5:37 PM, Peter Neubauer
neubauer.pe...@gmail.com wrote:
Ben,
The first bug is
There have been thoughts a long while to make something like this with the
traversal framework, but time has never been allocated to evolve it. I'm
adding stuff to the framework in a side track and will surely add some
aspect of composable traversers also.
2011/7/29 Niels Hoogeveen
Great, I would much rather see this become part of the core API than have this
as part of the Enhanced API.
To make things work correctly, one important change to core is needed: The Node
interface needs to extends Traverser (the interface in
org.neo4j.graphdb.traversal, not the one in
Thanks Marko,
Indeed, thanks for the tips, I now have a an idea how to do the conversion from
c# to java. Indeed, I use the iterator most of the time, will refrain from the
index notation in the future :)
If you interested, I have written a short blog post about the c# client that
we have
Is there any example of using PagingIterator? Thanks
--
View this message in context:
http://neo4j-community-discussions.438527.n3.nabble.com/Neo4j-Pagination-in-Embedded-tp3202018p3210956.html
Sent from the Neo4j Community Discussions mailing list archive at Nabble.com.
I hate to be a post bumper but... I'm still awaiting a solution for this.
Help please!
--
View this message in context:
http://neo4j-community-discussions.438527.n3.nabble.com/neo4j-py-install-problems-tp3191386p3211257.html
Sent from the Neo4j Community Discussions mailing list archive at
Does any one know how to cascade delete all connected nodes from neo4j shell?
We are in the process of refining bulk loading large number of nodes/edges
process. It doesn't appear that in neo4j shell rmrel rmnode have the
options to do that, does it?
--
View this message in context:
35 matches
Mail list logo
