On Wed, Feb 2, 2011 at 5:31 AM, Joshi Hemant - hjoshi <
hemant.jo...@acxiom.com> wrote:
> Oh.. yes..it is very well documented. I just needed to read through. :)
> I have got couple of questions related to plugins:
> 1) Instead of plugins being accessible through POST method to the URI, can
> they
you could use a webserver like apache with a virtual host config and
mod_rewrite for rewriting the path component using regexps
Michael
Sent from my iBrick4
Am 02.02.2011 um 05:32 schrieb darkrain2 :
>
> Hello, I've install Neo4J rest API and its working great, but i'm unsure
> about how to
I know that Neo4j can perform numeric range queries on its indexes,
but I would also like to do exact numeric queries, such as "find all
nodes where the 'foo' property has a value of 123". Currently I am
rephrasing these types of queries as "find all nodes where the 'foo'
property is between 123 a
Hello, I've install Neo4J rest API and its working great, but i'm unsure
about how to browse and update nodes under my domain...essentially my url
would be http://graph.mydomain.com/24 (node 24)
http://graph.mydomain.com/24/friends ( relationship friends).
I would like to use Curl make to Api ca
Oh.. yes..it is very well documented. I just needed to read through. :)
I have got couple of questions related to plugins:
1) Instead of plugins being accessible through POST method to the URI, can they
be declared accessible as a GET request?
2) The following function did not show up at http://l
Hi,
Looking at the docs, it already says that the conventional place for extensions
is $NEO4J_HOME/plugins. I've updated the docs to emphasise that more clearly.
Jim
On 1 Feb 2011, at 19:22, Joshi Hemant - hjoshi wrote:
> Thanks Michael. I don't think I can update documentation at
> http://do
Thanks Michael. I don't think I can update documentation at
http://docs.neo4j.org/chunked/snapshot/server-plugins.html
Is http://wiki.neo4j.org/content/Using_the_Neo4j_Server_with_Java a good place
to add section about plugins that are REST URI accessible?
-Hemant
-Original Message-
F
Tobias,I've done some further analysis on the code that's creating the
relationships and have printed out all the contents of each of the relationship
objects being created. From the outset it doesnt seem like there are any
duplicates, yet whenever i go to print out all the relationship object
FWIW this is quite a RESTful notion:
> Now you also know how to speed up your app, whenever the existing REST API is
> too chatty for a usecase. Just write a plugin that gets the data (nodes,
> relationships) that you want to get in one request (e.g. via a traversal)
> and return them.
That is,
Thanks Michael,
I was looking at predicates and thought I saw that they were deprecated
(replaced by evaluators?), but maybe it was just late and I misread it! I'll
try to get that working today. I'm loving Neo4j so far, there's nothing it
can't do! :P
For the shortest path stuff it is fairly
Hi Shae,
the shortesPath algo takes a RelationshipExpander which is implemented by a
Expander subclass.
For each Expander you can addNodeFilter and addRelationshipFilters using
Predicates.
That should do what you try to achieve.
If I got this wrong, please someone correct me.
What is your cu
Craig,
The interesting thing is - if you do this index in-graph you can directly
attach the
index-nodes to the real nodes and have them mimic the original node but instead
of having
the property value per property you have the mapped value.
And you can many of such indexes in graph attached vi
Hi Team,
I'm a bit of a Neo4j Newbie and am trying to use it for some shortest path
work. I have an embedded DB and am using Java to interact with it. At the
moment I have shortest path stuff working (using
GraphAlgoFactory.shortestPath as per the sample code), but i would like to
extend this to
Thanks so much for that explanation.
Put it in a blog post.
Michael
Am 02.02.2011 um 01:33 schrieb Craig Taverner:
> Hi Michael,
>
> I agree that _all_ is a strong work :-)
>
> What I do is provide a mapper interface for the domain modeler to implement
> based on their own understanding of wh
Hi Michael,
I agree that _all_ is a strong work :-)
What I do is provide a mapper interface for the domain modeler to implement
based on their own understanding of what 'order' and 'resolution' to provide
to the index. I have a set of pre-defined mappers for general cases, but do
not suppose they
Yes as you can see in the visualization there are 4 equal relationship between
the nodes, where only one would yield the same information.
Michael
Am 02.02.2011 um 01:19 schrieb Saikat Kanjilal:
>
> Hi Tobias,Thanks for the help, hugely appreciated, you can pick any two nodes
> on opposite en
Hi Tobias,Thanks for the help, hugely appreciated, you can pick any two nodes
on opposite ends of the graph to replicate this problem, for example RM1 and
RM99 would do the trick. As for the duplicate relationships can you elaborate
further, are you saying that there are relationship objects c
Craig,
how do you map _all_ properties to the integer (or rather numeric/long?) space.
Does the mapping then also rely on the alphabetic (or comparision) order of the
properties?
Interesting approach. Is your space then as n-dimensional as the numbers of
properties you have?
Cheers
Michael
A
Here is a crazy idea - how about taking the properties you care about and
dropping them into a combined lucene index? Then all results for nodes with
the same properties would be 'ambiguous'. Moving this forward to degrees of
ambiguity might be possible by creating the combined 'value' using a redu
Hemant,
Good work, perhaps you'd like to publish it somewhere in the wiki or in a blog
post.
Now you also know how to speed up your app, whenever the existing REST API is
too chatty for a usecase. Just write a plugin that gets the data (nodes,
relationships) that you want to get in one request
I solved it!! The jar file needed to be in the plugins folder.
-Hemant
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Joshi Hemant - hjoshi
Sent: Tuesday, February 01, 2011 4:50 PM
To: Neo4j user discussions
Subject: Re: [Neo4j] Ne
I could create OldIndex plugin to read index created using 0.8 snapshot of REST
server and made entry for the plugin in the
org.neo4j.server.plugins.ServerPlugin as follows:
org.neo4j.examples.server.plugins.OldIndex
The code for OldIndex is very straight forward :
@Name( "getNodes" )
@Descr
On Tue, Feb 1, 2011 at 11:13 PM, Tobias Ivarsson
wrote:
> I would of course put it the other way around, since ACID is a desired
> property. What you are "mitigating" is your need for concurrent insertion of
> elements that are potentially equal.
>
> What I am suggesting is exactly what I'm sayin
I don't like the sound of this. The thread you dug up is the only other case
(I know of) where there has been anything similar, so I would love to have a
look at any data you have.
If you could zip up the store files and send them to us in some way we will
investigate. It would of course had been b
On Tue, Feb 1, 2011 at 10:59 PM, Massimo Lusetti wrote:
> On Tue, Feb 1, 2011 at 10:50 PM, Tobias Ivarsson
> wrote:
>
> > That is correct, the Isolation of ACID says that data isn't visible to
> other
> > threads until after commit.
> >
> > The CHM should not replace the index check though, sinc
On Tue, Feb 1, 2011 at 10:50 PM, Tobias Ivarsson
wrote:
> That is correct, the Isolation of ACID says that data isn't visible to other
> threads until after commit.
>
> The CHM should not replace the index check though, since you want to limit
> the number of items in the CHM, you only want this
On Tue, Feb 1, 2011 at 10:25 PM, Michael Hunger
wrote:
> What about batch insertion of the nodes and indexing them after the fact?
The data to be entered will changes values in other nodes (statistics)
so I absolutely need to be sure to not insert data twice and as I said
between a "long" period
On Tue, Feb 1, 2011 at 10:19 PM, Tobias Ivarsson
wrote:
> No, it means that you have to synchronize the threads so that they don't
> insert the same data concurrently.
That would be a typical issue but I'm sure my are not duplicated since
the come from the (old) db which has constraints on that,
That is correct, the Isolation of ACID says that data isn't visible to other
threads until after commit.
The CHM should not replace the index check though, since you want to limit
the number of items in the CHM, you only want this to reflect the elements
currently being worked on, the index check
Correct, not using the batch-inserter, just a regular loop with transactions &
inserts + adding data to a lucene-index.
Each transaction contained ~500 nodes, and the total count was about ~3M when
it got corrupted..
I did unclean shutdowns a bunch of times without any corruption, so this isn't
What about batch insertion of the nodes and indexing them after the fact?
And I agree with Tobias that a CHM should be a better claim checking algorithm
than using
indexing for that. The index as well as the insertion of the nodes will only be
visible to other
threads after the commit (ACID, ple
No, it means that you have to synchronize the threads so that they don't
insert the same data concurrently.
Perhaps a ConcurrentHashMap where you would putIfAbsent(md5,new
Object()) when you start working on a new hash. If the token Object you get
back is not the same as you put in, you know that a
And this was not using the batchinsert either? Because batchinsert will most
likely leave the data corrupt if not shut down cleanly.
Just want to make sure, by covering the simplest things first.
-tobias
On Tue, Feb 1, 2011 at 7:12 PM, Lars Hvile wrote:
> This exact error has already been disc
I was working on a project that used matching algorithms a while back.
What you have is an n-dimensional matching problem. I can't remember
specifically what the last project were using, but this and the linked algos
may be what you're looking for:
http://en.wikipedia.org/wiki/Mahalanobis_distance
Tim,
I don't know enough about disambiguation algos to point you in any
special direction, but implementation-wise you could hook into the
event framework, http://wiki.neo4j.org/content/Event_framework, in
order to do e.g. graph matching queries upon any modifying transaction
changing database cont
Say I have two nodes,
{ "type": "person", "name": "Neo" }
{ "type": "person", "name": "Neo" }
Over time, I learn their locations. They both live in the same city. This
increases the chances that they're the same person. However, over time it turns
out that their ages differ, therefore it's f
On Tue, Feb 1, 2011 at 8:02 PM, Mattias Persson
wrote:
> Seems a little weird, the commit rate won't affect the end result,
> just performance (more operations per commit means faster
> performance). Your code seems correct for single threaded use btw.
Does it means that I cannot access the grap
On Tue, Feb 1, 2011 at 6:43 PM, Peter Neubauer
wrote:
> Also,
> have you been running this insert multiple times without cleaning up
> the database between runs?
Nope for the tests I wipe (rm -rf) the db dir every run.
Cheers
--
Massimo
http://meridio.blogspot.com
_
On Tue, Feb 1, 2011 at 6:36 PM, Tobias Ivarsson
wrote:
> Since you are checking for existence before inserting the conflict you are
> getting is strange. Are you running multiple insertion threads?
Yep, I got 20 concurrent threads doing the job. I've forgot about them, thanks!
Cheers
--
Massim
we'll have to benchmark it on windows. from what I've experienced windows file
caches are broken anyway
Michael
Sent from my iBrick4
Am 01.02.2011 um 19:04 schrieb "Max De Marzi Jr." :
> Not sure if this will work
>
> dd for windows:
> http://www.chrysocome.net/dd
>
> command (if = input fi
Seems a little weird, the commit rate won't affect the end result,
just performance (more operations per commit means faster
performance). Your code seems correct for single threaded use btw.
Den tisdag 1 februari 2011 skrev Michael
Hunger:
> Hmm MD5 is not a unique hashing function so it might be
I can not think of a scenario where #1 could happen, but it seems very likely
that #2 could happen. I'll add some safeguards that prevent that from
happening in the future.
Thanks a lot for the help.
-Paul
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@list
This exact error has already been discussed on the mailinglist back in 2009
(http://lists.neo4j.org/pipermail/user/2009-November/001906.html), but
without a conclusion?
During some inserts, I did an unclean shutdown. When I restarted neo, the
standard recovery stuff was logged,
and it said that
Not sure if this will work
dd for windows:
http://www.chrysocome.net/dd
command (if = input file, of = output file):
dd if=nodestore.id of=/dev/null
On Tue, Feb 1, 2011 at 11:52 AM, Dave Hesketh
wrote:
> Peter
> As you suggested, I rerun the searches without closing the db. On the 2nd
> iterat
Hmm MD5 is not a unique hashing function so it might be that you get the same
hash for different byte arrays.
Can you output the MD5 of the multiple logRow's that are returned by the index.
Michael
Am 01.02.2011 um 18:19 schrieb Massimo Lusetti:
> Hi everyone,
> I'm new to neo4j and I'm makin
Peter
As you suggested, I rerun the searches without closing the db. On the 2nd
iteration, the search times dropped by 66% and leveled-off after that.
Unfortunately I don't understand your suggestion: 'You can even warm up
the OS file caches by doing dd nodestore.id >> /dev/null for all store files
Also,
have you been running this insert multiple times without cleaning up
the database between runs?
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http://twitter.com/peterneuba
Since you are checking for existence before inserting the conflict you are
getting is strange. Are you running multiple insertion threads?
-Tobias
On Tue, Feb 1, 2011 at 6:19 PM, Massimo Lusetti wrote:
> Hi everyone,
> I'm new to neo4j and I'm making experience with it, I got a fairly
> big ta
Hi everyone,
I'm new to neo4j and I'm making experience with it, I got a fairly
big table (in my current db) which consists of something more then 220
million rows.
I want to put that in a graphdb, for instance neo4j, and graph it to
do some statistics on them. Every row will be a node in my vis
Oh, sorry, I missed that you were still using 1.1, messages.log was
introduced after 1.1 was released.
However, the exception you supplied does not say that the store is corrupt,
just that it cannot read it, because it has been closed.
There are only two scenarios I can think of where this can hap
This happens with a freshly started database. I don't see a file with the name
that you mention. All I have are the following files with the word log in them:
graph.WikiTalk\active_tx_log
graph.WikiTalk\nioneo_logical.log.1
graph.WikiTalk\nioneo_logical.log.active
graph.WikiTalk\tm_tx_log.1
gra
Are threads being interrupted anywhere in your application?
There is an issue in java.nio that it closes open channels if interrupted
during an operation.
This means that io-channels that are shared between multiple threads gets
closed if one of the threads using it gets interrupted.
Or does this
I've been doing some performance and scalability testing with large graphs
(2,000,000 nodes, 5,000,000 edges - actually, the WikiTalk data from the
Stanford Snap site). I must have shut down my server improperly because a
number of graphs needed to recover when I started it back up, but this lar
Tobias,Any updates on this? I think my zip file containing the spring config
stuff didnt come across correctly. Let me know if you still need this.Regards
> From: tobias.ivars...@neotechnology.com
> Date: Mon, 31 Jan 2011 16:44:28 +0100
> To: user@lists.neo4j.org
> Subject: Re: [Neo4j] Calcula
Vaibhav,
youi can use the new combined Evaluator to control what will be
included in the result set or not. See
https://github.com/neo4j/examples/blob/master/src/test/java/org/neo4j/examples/orderedpath/OrderedPathTest.java#L71
for an example. If you want to continue traversing, and include the
cur
Dave,
maybe you can get a www.dropbox.com account, put the files there and
get us the URL? Would be great to be able to help you and see where we
can improve things!
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.lin
Peter,
Sorry I am slow replying. I'm on an extended visit to South Africa and my
internet access is a very unreliable 2G (yes 2G, occasional 3G) mobile
access.
With my previous postings to the forum, I have tried to attach all the
information (including coding) of the test setup and results (pdf's,
I assume Pablo is running embedded.
Is that correct?
Michael
Am 01.02.2011 um 13:21 schrieb Peter Neubauer:
> Also,
> have you taken a look at the returned document? Transferring thousands
> of relationships and parsing them as JSON on both client and server
> might not be optimal.
>
> Cheers,
Hi,
I wish to traverse from node A to node B in the graph and find all
relationships having certain properties. If the relationship does not have
that property say propertyName != desired value, then this relationship
should be ignored and move to next relationships.
In the end desired output is
Also,
have you taken a look at the returned document? Transferring thousands
of relationships and parsing them as JSON on both client and server
might not be optimal.
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.li
It sounds as if you are looping through all of them? Have they all the same
relationshiptype and direction?
Otherwise perhaps use node.getRelationships(type, direction)
Perhaps you can also use a traverser for accessing the relationship?
Cheers
Michael
Am 01.02.2011 um 12:37 schrieb Mattias P
2011/2/1 Pablo Pareja
> Hi all,
>
> I'm working on a project with millions of nodes and relationships and I'm
> using Neo4j for it.
> I'm doing some tests and I'm surprised of how slow it gets when it comes to
> getting specific relationships
> from one node...
>
> How's it actually implemented?
Hi all,
I'm working on a project with millions of nodes and relationships and I'm
using Neo4j for it.
I'm doing some tests and I'm surprised of how slow it gets when it comes to
getting specific relationships
from one node...
How's it actually implemented?
The node I want to get the relationship
Hi folks,
I wonder if there is any interest in writing a Neo4j Server extension
that let's the server talk OData as a format,
http://www.odata.org/home ? It seems that, especially in .NET land,
OData is quite big?
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phon
Neo4j 1.1 can be downloaded here:
http://neo4j.org/get?file=neo4j-apoc-1.1.tar.gz
On Tue, Feb 1, 2011 at 3:59 AM, James Thornton wrote:
> Since the current python bindings only work with neo4j 1.1 (as per
> this bug report https://trac.neo4j.org/ticket/302 and
> http://wiki.neo4j.org/content/Gett
65 matches
Mail list logo
