Yes, I think you got it almost completely correct.
As you say node records (and all other records) are fixed length and
they have a pointer to the first property and first relationship. We
don't store property or relationship count, they are just
lists/chains.
Regarding the PropertyIndexStore it
Wow, thanks a lot for the quick and kind reply!
I did browse the package that you suggested and hope that the following
notes reflect the underlying data/storage model accurately (in case anybody
else is interested):
Neo maintains 6 files (excluding indexes):
- Node Storage
- Node Recor
On Wed, May 6, 2009 at 10:11 AM, Mattias Persson
wrote:
> Looks nice and simple and it's probably completely alright to have the
> store fail on non-clean shutdowns and stuff like that.
>
> I'm wondering about this method though.
>
> void createNode( long id, Map properties );
>
> What do we ne
On Wed, May 6, 2009 at 5:50 PM, Lyudmila L. Balakireva wrote:
> I need some clarifications on API.
> Let say we are loading some adjacency list. How do we handle in this
> scheme that node already exists? Do we index the nodes after the
> insertion ( using for example getAllNodes operation?) .
I need some clarifications on API.
Let say we are loading some adjacency list. How do we handle in this
scheme that node already exists? Do we index the nodes after the
insertion ( using for example getAllNodes operation?) .
Thanks, Luda
> Hi,
>
> As you may or may not know, the Neo4j kernel i
Looks nice and simple and it's probably completely alright to have the
store fail on non-clean shutdowns and stuff like that.
I'm wondering about this method though.
void createNode( long id, Map properties );
What do we need that for? Couldn't that encourage an erroneous
behavior where you
6 matches
Mail list logo
