t; people's input too. As it stands now, it is very much a one-man's work and
> while I am confident it contains plenty of good ideas, it can only grow with
> the input of other developers, just like IndexedRelationships has become
> much better thanks to the work Bryce p
orlds, releasing read locks (and even write
locks) when I am sure within the library code that they aren't needed
anymore, but then having dangling locks auto cleaned up at the end of a
transaction.
Cheers
Bryce
On Tue, Sep 27, 2011 at 10:28 AM, McKinley wrote:
> Bryce,
>
>
It wont make any difference if the memory mapping settings are just larger
than the file sizes, or a lot larger therefore fiddling with those
settings wont make any difference from your original test.
Generally when people see very high performance it is because a lot of the
data they are trav
One initial suggestion would be that your memory mapped settings are
probably not very near optimal. If you have a look at the file sizes in
your graph data directory then the closer you can get to covering each db
files entire size the better. I would assume that some of the files will be
bigger
I do similar processing a lot, i.e. changes across the entire graph database
(either relationships or nodes). Code along the lines of:
public void process() {
int count = 0;
Transaction tx = null;
for (Node node : graphDb.getAllNodes()) {
if ((count % 1
ut this but something like this might work:
Lock lock = node.acquireReadLock(); // or node.aquireWriteLock()
tx.addLock(lock); // now lock is tied to transaction
tx.removeLock(lock); // no longer tied to transaction
Cheers
Bryce
On Tue, Sep 27, 2011 at 12:12 AM, Tobias Ivarsson <
tobias.ivars.
un.com/developer/technicalArticles/Programming/Performance/
>
> On Fri, Sep 23, 2011 at 9:09 PM, Bryce wrote:
>
> > As long as all access to these nodes is through the ULL class then the
> lock
> > at the base node for writes, giving a datastructure wide lock, should
> ma
GraphDatabaseService that is
what I have to work with.
On Mon, Sep 26, 2011 at 2:44 PM, McKinley wrote:
> Bryce,
>
> The situation you are facing seems to only be a problem with choosing the
> type of the interface for your variable instead of the type that implements
> the getCon
server and HA)? Are their
any issues to look out for? And does the above code look workable?
Cheers
Bryce
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Here you go:
https://github.com/neo4j/graph-collections/wiki/HyperRelationship-example
Though that page just has a link to:
https://github.com/neo4j/graph-collections/wiki/Enhanced-API
Bryce
On Sat, Sep 24, 2011 at 5:00 PM, loldrup wrote:
>
> Niels Hoogeveen wrote:
> >
> >
cases for this,
> maybe
> > > even
> > > > harder than making it work properly! Hoping that some utility code I
> am
> > > > going to produce will help with testing concurrency of other data
> > > > structures.
> > > >
> > > > By
en instantiation of the class, e.g. what happens when one thread
> gets
> > an instance of ULL based off a given node and is iterating over it, then
> > another thread gets an instance of a ULL and writes into it.
> >
> > Cheers
> > Bryce
> >
> > On Fri,
iterating over it, then
another thread gets an instance of a ULL and writes into it.
Cheers
Bryce
On Fri, Sep 23, 2011 at 4:57 AM, Niels Hoogeveen
wrote:
>
> It looks really cool.
> I always find it fun to create something and later find out it is an
> already known construction (som
the upper bound it will be split in half.
I am about to do some tests with this based on my use case and will report
back on the performance impacts.
Cheers
Bryce
P.S. still thinking about how to make this thread safe, any suggestions
would be appreciated (presently only one thread will be able
Hi Niels,
Probably is a good idea. I will try to get something done around that soon,
flat out with work issues/features at present (including a "nice"
concurrency bug, argh).
Cheers
Bryce
On Wed, Sep 21, 2011 at 2:01 AM, Niels Hoogeveen
wrote:
>
> Hi Bryce,
> Sorry for the
y think of a good way of adding a set of arbitrary
relationships into a collection stored in a graph data structure.
Thoughts?
Cheers
Bryce
P.S. Peter, I had thought to remove the passing in of the graph database and
instead just getting it from the node, or only passing in the graph database
and creat
these methods.
Cheers
Bryce
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
-central
25
Instead of the current:
org.neo4j
parent-pom
6
It still wont work quite as is though. The build will fail on a license
check, so do compile like:
mvn -Dlicense.failIfMissing=false compile
Should work.
Cheers
Bryce
On Fri, Sep 9, 2011 at 2:12 PM, espeed wrote
, 2011 at 3:41 PM, Bryce wrote:
> Another thought if there is going to be a larger refactor of the code is
> whether the indexing mechanism should be broken out as a strategy for the
> IndexedRelationship. At present it is tied to SortedTree, but if an
> interface was extracted
; > relationships and matching the UUID stored at the root end of the IR
> with
> > > > one of the KEY_VALUE relationships (which is why using a unique id is
> > > > necessary rather than the relationship type). Note: there will
> actually
> > > > still b
an storing it as a
> string?
> > Curious about this since in my current model I have all the domain
> objects
> > with UUID's, and these are all stored as strings. If it was going to
> help
> > with either memory or performance then I would be keen to migrate this
icker than storing it as a string?
Curious about this since in my current model I have all the domain objects
with UUID's, and these are all stored as strings. If it was going to help
with either memory or performance then I would be keen to migrate this to
two longs.
Cheers
Bryce
On Thu, Se
pdated code. This could be managed via a check for
the ID when accessing the tree and if it isn't there doing a walk over the
tree to populate all the places where it is required.
In general in developing against this code where do we sit on data
compatibil
ly
since it causes a database consistency check to occur and stops all database
related work for the time that takes.
When I was getting this I was running on 1.2 though and decided to upgrade
(1.4.1) and see if I still get the issue before raising it. Haven't seen it
since, but have only been running
I am assuming that this is still the standard? I will setup my IDE for when
working on this code as per this standard and next time I do some changes
will first do a reformat code + commit.
On Tue, Sep 6, 2011 at 9:31 AM, Bryce wrote:
> Hi Niels,
>
> Thanks for your feedback below.
>
hould be
relatively easy to have IndexedRelationshipExpander support following
relationships from the leaf nodes through to the root (as well as what it
presently does: root -> leaf & direct relationships). I might have a look
at doing that later on today.
Cheers
Bryce
On Tue, Sep 6, 201
implementation?
Cheers
Bryce
On Fri, Sep 2, 2011 at 6:55 PM, Peter Neubauer <
peter.neuba...@neotechnology.com> wrote:
> Bryce,
>
> On Fri, Sep 2, 2011 at 1:44 AM, Bryce wrote:
>
> > Hi,
> >
> > I have been looking at performance options for Neo4j as presently I hav
note in the configuration settings
page:
http://wiki.neo4j.org/content/Configuration_Settings#Optimizing_for_traversals_example
that -XX:+UseNUMA
only works when using the Parallel Scavenger garbage collector (default
or -XX:+UseParallelGC) not the concurrent mark and sweep one. Based on
Cheers
Bryce
LinkedIn
bryce hendrix requested to add you as a connection on LinkedIn:
--
Craig,
I'd like to add you to my professional network on LinkedIn.
- bryce
Accept invitation from bryce hendrix
http://www.linkedin.com/e/5gyj7a-gr0
LinkedIn
bryce hendrix requested to add you as a connection on LinkedIn:
--
Craig,
I'd like to add you to my professional network on LinkedIn.
- bryce
Accept invitation from bryce hendrix
http://www.linkedin.com/e/5gyj7a-gqz
Peter, Craig,
Thanks for the info. I definitely would like to get this working & can spend
a few hours on it over the next couple of weeks. I'll probably follow up
with some more questions later in the week.
Bryce
On Tue, May 31, 2011 at 3:44 AM, Peter Neubauer <
I am finally getting back to experimenting with Neo4j. Because it has been a
while since I last looked at it, I've forgotten just about everything. I
want to start with something simple, is there any sample code which does A*
path finding over OSM ways?
Thanks,
ot any of
the suburbs) and send it to you. Austin takes about 30 secs to import and
index.
Bryce
On Fri, Feb 18, 2011 at 2:41 PM, Nolan Darilek wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> On 02/18/2011 11:23 AM, Craig Taverner wrote:
> >
> > I will answer i
Thanks Craig! I'll not only play around with it tonight, but you nudged me
towards finally installing uDig.
Bryce
On Tue, Jan 18, 2011 at 6:45 PM, Craig Taverner wrote:
> Hi Bryce,
>
> While I had this on my mind, I decided to look into the code and I went
> ahead developed t
Peter,
I think my problem is more of understanding how the graph is built from OSM
data. The method of find the closest edge gives me the way geometry, but
(please correct me if I am wrong) I need to find the closest OSM node (Node
with "lat" and "lon" properties) in the geom
have to do, other than
setting up the estimate and cost evaluators?
If I can figure this out, I'll submit my example back to you guys. I'm
excited about this stuff, but I seem to be discovering the limits of the
docs.
Bryce
On Sun, Jan 16, 2011 at 7:11 PM, Craig Taverner wrote:
> G
help.
Bryce
On Sun, Jan 16, 2011 at 3:16 PM, Craig Taverner wrote:
> The SearchPointsWithinOrthodromicDistance basically does a search on a
> rectangular bounding box, and then inside the result set filters by
> distance
> from the center. The filter probably works only on points
a API, but I'm not really sure how to do that. I've tried using
SearchPointsWithinOrthodromicDistance, but the results of the query are
always empty. Can someone give me some tips, or provide a simple example?
Thanks in advance,
Bryce
___
Neo
38 matches
Mail list logo
