Skip to content

Testcase for Issue 72: LayerNodeIndex:add() performance #73

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jan 1, 2013

Conversation

jonathanwin
Copy link
Contributor

No description provided.

@peterneubauer
Copy link
Contributor

@jonathanwin great work Jonathan! In order to pull this in, could you please send in the CLA, http://docs.neo4j.org/chunked/snapshot/cla.html ?

@jonathanwin
Copy link
Contributor Author

---------- Forwarded message ----------
From: Jonathan Winterflood jonathan.winterflood@gmail.com
Date: Thu, Nov 15, 2012 at 3:15 PM
Subject: CLA
To: cla@neotechnology.com

Hi. My name is Jonathan Winterflood (jonathan.winterflood@gmail.com).
I agree to the terms in the attached Neo4j Contributor License Agreement.

Jonathan

@peterneubauer
Copy link
Contributor

Great, will try to merge today if I get the time!

@craigtaverner craigtaverner merged commit 33d65ea into neo4j-contrib:master Jan 1, 2013
@craigtaverner
Copy link
Contributor

I merged in the test case, and then disabled it until we can actually fix the performance bug. This should be done in issue 72, so we can consider issue 73 completed (pull request accepted).

@peterneubauer
Copy link
Contributor

Awesome.
Thanks Craig!

On Tue, Jan 1, 2013 at 11:22 PM, Craig Taverner notifications@github.comwrote:

I merged in the test case, and then disabled it until we can actually fix
the performance bug. This should be done in issue 72, so we can consider
issue 73 completed (pull request accepted).


Reply to this email directly or view it on GitHubhttps://github.com//pull/73#issuecomment-11794286.

@jonathanwin
Copy link
Contributor Author

Constant is most certainly impossible (finding the position of an element
in a set is surely dependent on the size of the set, barring massive memory
trade-offs)

I imagine an r-tree is something like o(log(n)) (ignoring node overflows).
And as far as I know, the spatial r-tree itself does not have a performance
problem.
The problem here is that in front of the r-tree there is a o(n) test, and a
o(n) insert into a plain linked list of all indexed node ids.

This could probably be replaced by a second tree on the indexed ids,
yielding an overall o(log(n)). Or maybe something else...

Jonathan

On Fri, Jan 4, 2013 at 2:23 PM, amorgner notifications@github.com wrote:

What is the expected curve of insert performance? Constant rate?


Reply to this email directly or view it on GitHubhttps://github.com//pull/73#issuecomment-11882589.

@amorgner
Copy link
Contributor

amorgner commented Jan 4, 2013

I'm currently working on a fix. Seems much, much easier, with some hints I got from Craig here:
https://groups.google.com/forum/#!topic/neo4j/o07iBeHI8TU

@amorgner
Copy link
Contributor

amorgner commented Jan 4, 2013

As this issue is closed, we should continue in #72

@ehx-v1
Copy link
Contributor

ehx-v1 commented May 9, 2016

you mean #82

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

5 participants