I think my explanation was not clear as it should be.
I wasn't suggesting to replace the relationships with a node, but to shadow the
relationshiptypes with a node.
Let's say we have two relationshiptypes, KNOWS and FRIEND, where we want to
state that friends form a subset of the people a
It cannot directly be done through the standard API, but of course it can be
implemented.
I do this myself in an application I am building. For every RelationshipType, i
create a Node and between those Nodes there can have subtyping relationships.
To make lookup fast, I use the node-id of the
Good decision. Immediately signed up.
From: peter.neuba...@neotechnology.com
Date: Wed, 30 Nov 2011 13:55:44 +0100
To: user@lists.neo4j.org
Subject: [Neo4j] Moving to u...@neo4j.org
Hi all,
we are going to move from mailman to google groups,
In order to have proper sort order for Strings with diacritical characters, I
started using Lucene's ICUCollationKeyAnalyzer. This indeed gives the proper
sort order for queries, but for some reason wild card queries no longer seem to
work. This applies for both the normal CollationKeyAnalyzer
I noticed work on supernodes being committed to GitHub. Looking forward seeing
this and in 1.6-SNAPSHOT. I would like to test this sooner rather than later.
The node#getDegree methods are a great addition.
Niels
From: peter.neuba...@neotechnology.com
Date: Tue, 22 Nov 2011 15:51:15 +0100
anyone?
From: pd_aficion...@hotmail.com
To: user@lists.neo4j.org
Date: Thu, 10 Nov 2011 20:20:46 +0100
Subject: [Neo4j] Lucene sort with diacritic characters
When retrieving items from a Lucene index, using the sort method, it seems
the order doesn't abide proper rules for sorting
...@lists.neo4j.org [user-boun...@lists.neo4j.org] On Behalf
Of Niels Hoogeveen [pd_aficion...@hotmail.com]
Sent: Friday, November 11, 2011 9:27 AM
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Lucene sort with diacritic characters
anyone?
From: pd_aficion...@hotmail.com
To: user
From: user-boun...@lists.neo4j.org [user-boun...@lists.neo4j.org] On Behalf
Of Niels Hoogeveen [pd_aficion...@hotmail.com]
Sent: Friday, November 11, 2011 9:27 AM
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Lucene sort with diacritic characters
anyone?
From
There is one caveat to this method, you'd have to know which node is most
densely connected.
Suppose one of the nodes has 100,000 relationships (incoming and outgoing) and
the other node has only a few relationships, then you'd want to iterate over
the relationships of the second node.
A
I see I made a bit of a mistake with this one. The gist of the solution
remains, but I made a mistake dealing with the directions of relationship.
It should be something like this.
public boolean areConnected(Node n1,Node n2, RelationshipType relType,Direction
dir) {
Direction dir2 = null;
:-\
On Oct 27, 2011 7:26 PM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
I see I made a bit of a mistake with this one. The gist of the solution
remains, but I made a mistake dealing with the directions of relationship.
It should be something like this.
public boolean
Hijack alert (going completely off topic)
I noticed the following statement: all reasoning is best with a linked list
data structure.
When looking at the underlying store we see that the RelationshipRecord indeed
forms two linked lists, one for the incoming side of the relationship and one
for
I concur. In my opinion Neo4j is more a storage engine with certain storage
features than a database management system. This is already exemplified by the
absence of a query language as primary interface.
The author is therefore wrong in his assessment that there is no separation of
logical
...@gmail.com wrote:
Niels Hoogeveen wrote:
I just posted an example on how to use HyperRelationships:
https://github.com/peterneubauer/graph-collections/wiki/HyperRelationship-example
This link now gives 404. Does it have a new address? If so, what is it?
Jon
You raise interesting questions, most of them very much related to the work I
did on Enhanced API.
Let me start with the distinction between Node and Relationship, which in my
opinion too is a bit artificial. I understand when creating a graph database,
it is helpful to have something like
From: user-boun...@lists.neo4j.org [user-boun...@lists.neo4j.org] On Behalf
Of Niels Hoogeveen [pd_aficion...@hotmail.com]
Sent: Saturday, September 24, 2011 9:14 AM
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Modelling with neo4j
You raise interesting questions, most of them very
...@lists.neo4j.org] On Behalf
Of Niels Hoogeveen [pd_aficion...@hotmail.com]
Sent: Saturday, September 24, 2011 9:14 AM
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Modelling with neo4j
You raise interesting questions, most of them very much related to the work I
did on Enhanced API.
Let me
).
For now I don't think my problem requires interfaces before it can be be
solved, but I only just started so who knows :)
Jon
On Sep 24, 2011 3:15 PM, Niels Hoogeveen [via Neo4j Community Discussions]
ml-node+s438527n3364304...@n3.nabble.com wrote:
You raise interesting questions
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, Sep 23, 2011 at 4:57 AM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
It looks
is changed.
On Sat, Sep 24, 2011 at 6:00 AM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
A quick skim of the code shows me you have a baseNode which is an
entrypoint for the ULL. This is a logical candidate node to use for the
purpose of locking.
What are the pros and cons
It looks really cool.
I always find it fun to create something and later find out it is an already
known construction (something worth inventing).
Anyway, I pulled your code and will removed the dependencies to the Enhanced
API stuff this week. After that we can start adding some
and creating the node internally.
On Sat, Sep 17, 2011 at 2:19 AM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
Hi Bryce,
I really like what you are trying to achieve here.
One question:
Instead of having NodeCollection, why not have GraphCollectionT extends
PropertyContainer. That way
://twitter.com/peterneubauer
http://www.neo4j.org - Your high performance graph database.
http://startupbootcamp.org/- Öresund - Innovation happens HERE.
http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
On Thu, Sep 15, 2011 at 1:48 PM, Niels Hoogeveen
Bryce's point makes perfect sense. The argument graphDb().createNode() gives
the constructor an instance of Node, which contains a reference to the
database, so there is no real need to additionally supply the database instance.
Of course his example would have been less confusing if he'd
Hi Bryce,
I really like what you are trying to achieve here.
One question:
Instead of having NodeCollection, why not have GraphCollectionT extends
PropertyContainer. That way we can have collections of both Relationships and
Nodes.
Niels
Date: Fri, 16 Sep 2011 17:37:29 +1200
From:
Thanks to the good work of Davide, graph-collections now contains an
implementation of Radix-tree. See: http://en.wikipedia.org/wiki/Radix_tree
This particular datastructure can be used to store nodes sorted by a String
value, very handy when you want to create associative arrays in Neo4j.
Peter,
I'd gladly put out a piece of code demonstrating the use of IndexRelationships,
using this LIVES_IN example. Though I get the impression the question here
relates to the normal relationship index. However when supernodes (still
don't like that term for densely connected nodes) come
being pulled
into the core, so is that overkill for now if there is going to be another
core offering later?
On Thu, Sep 8, 2011 at 2:38 PM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
I think we don't have to worry about backwards compatibility much yet.
There has not been
a while ago
about some functionality along the lines of IndexedRelationship being pulled
into the core, so is that overkill for now if there is going to be another
core offering later?
On Thu, Sep 8, 2011 at 2:38 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
I think we don't have
Great work Bryce,
I do have a question though.
What is the rationale for the restriction mentioned under 1). Do you need
this for the general case (to make IndexedRelationshipExpander work correctly),
or do you need it for your own application to throw that exception? If the
latter is the
longs.
Cheers
Bryce
On Thu, Sep 8, 2011 at 11:07 AM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
Great work Bryce,
I do have a question though.
What is the rationale for the restriction mentioned under 1). Do you need
this for the general case (to make
available a key_value
relationship iterator, and a node iterator. Having a quick look at it now
it seems that it could work ok that way without introducing much code
duplication.
On Thu, Sep 8, 2011 at 12:46 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
Two longs is certainly
Hi Bryce,
Sorry for my belated response. I have been away for a couple of days and wasn't
able to check my emails.
I am glad you took the time to look into the IndexRelationship module. It
certainly could use some scrutiny.
Remarks:
1) Good catch... Something the unit test didn't catch because
Correct, turing completeness is not the lower bound for non-guaranteed
termination.
It is however possible to have some forms of recursion without sacrificing
guaranteed termination. Neo4j traversals, memorizing visited paths,
relationships or nodes are an example (Note, it would be nice to
happening in the graph to illustrate :)
/Peter
On Monday, August 29, 2011, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
In the last week I have been working on a Neo4j API in Scala, taking
navigation in the graph as primary.
Just like the Enhanced API written in Java, the Scala
In the last week I have been working on a Neo4j API in Scala, taking navigation
in the graph as primary.
Just like the Enhanced API written in Java, the Scala API generalizes each
element (Node, Relationship, RelationshipType, property name and property
value) of the Neo4j database as being a
Jim,
Can you tell me how to add my suggestions for a solution to this problem to
your issue tracker?
Niels
From: pd_aficion...@hotmail.com
To: user@lists.neo4j.org
Date: Tue, 16 Aug 2011 16:33:04 +0200
Subject: Re: [Neo4j] partitioning the relationship store
The partitioning is a
Yesterday, I added subtyping to Enhanced API.
Suppose an application has UserGroups, Users and Roles, where both UserGroups
and Users are Vertices and Roles are BinaryEdges. There can be different
predefined Roles, such as ADMINISTRATOR, EDITOR, MEMBER, GUEST.
With subtyping it is possible
At the risk of coming off as an utter bore, I would like once more to raise
awareness for the fact that the relationships of a node are currently stored as
one linked list. The downside of this has been discussed in many posts, so I
shan't rehash the points.
It's just that whatever I try to
1:52 PM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
Yesterday, I added subtyping to Enhanced API.
Suppose an application has UserGroups, Users and Roles, where both
UserGroups and Users are Vertices and Roles are BinaryEdges. There can be
different predefined Roles
The partitioning is a solution to the densely-connected node problem, but would
also allow for the iteration over RelationshipTypes/Directions, another feature
I would very much like to see.
I have posted suggestions on how to approach this problem and would like to add
those suggestions to
Hi Emerson,
Over the last couple of weeks, I have been working on an implementation of
n-ary relationships on top of Neo4j. I also detailed how n-ary relationships
could in principle be implemented in the database kernel (see:
http://lists.neo4j.org/pipermail/user/2011-August/011191.html).
All your existing relationships will remain the same, unless you remove them
yourself.
If you make your hypothetical changes, all Persons will keep a relationship to
Address through the RESIDES_AT relationship, even though you now create a new
ContactInfo entity that connects to Address too.
to the relationships, does the graph service
automatically allow me to navigate from Person to ContactInfo to Address?
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Niels Hoogeveen
Sent: Monday, August 15, 2011 10:08 PM
To: user
://startupbootcamp.org/- Öresund - Innovation happens HERE.
http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
On Wed, Aug 10, 2011 at 1:19 AM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
Today I updated the wiki page for Enhanced API. Since the last edit many
changes have
high performance graph database.
http://startupbootcamp.org/- Öresund - Innovation happens HERE.
http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
On Wed, Aug 10, 2011 at 1:19 AM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
Today I updated the wiki page
I find myself using some pretty long property names, like
org.neo4j.collections.graphdb.node_id and wonder if this has an impact on
performance.
Niels
From: pd_aficion...@hotmail.com
To: user@lists.neo4j.org
Subject: length of property names
Date: Mon, 8 Aug 2011 15:44:20 +0200
Quick
ID (integer)
used in Neo4j).
2011/8/10 Niels Hoogeveen pd_aficion...@hotmail.com
I find myself using some pretty long property names, like
org.neo4j.collections.graphdb.node_id and wonder if this has an impact on
performance.
Niels
From: pd_aficion...@hotmail.com
To: user
Today I updated the wiki page for Enhanced API. Since the last edit many
changes have taken place, so it was to to reflect those changes on the wiki
page.
See: https://github.com/peterneubauer/graph-collections/wiki/Enhanced-API
I also changed what was previously called an EdgeRole into a
I should of course market this work better.
So hereby the statement: NOW with nice and handy images, free of charge!!!
Niels
From: pd_aficion...@hotmail.com
To: user@lists.neo4j.org
Date: Wed, 10 Aug 2011 01:19:42 +0200
Subject: [Neo4j] Enhanced API wiki page
Today I updated the wiki
/- Öresund - Innovation happens HERE.
http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
On Sun, Aug 7, 2011 at 4:30 PM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
Hi Peter,
Thanks for showing an interest.
A Property is indeed a unary edge
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Enhanced API rewrite
I ready to jump in too ;-)
On Mon, Aug 8, 2011 at 3:37 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
I can probably find the time for that. It would be fun working on these
ideas in collaboration. I don't mind
.
http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
On Sat, Aug 6, 2011 at 2:51 AM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
Today I pushed a major rewrite of the Enhanced API. See:
https://github.com/peterneubauer/graph-collections/tree/master/src/main/java
@lists.neo4j.org
Subject: Re: [Neo4j] Node#getRelationshipTypes
2011/8/6 Niels Hoogeveen pd_aficion...@hotmail.com
This is the thread about store layer changes for type/direction, and in my
opinion this is still quite low hanging fruit. Sure, the impact needs to be
tested rigorously, which
While I am at it, let's post another brain dump.
A couple of weeks ago, I worked on SortedTree/IndexRelationships in an attempt
to solve the densely-connected-node-problem.
SortedTree is a Btree layed-out in the graph, sorted by some function on a node
(eg. the nodeId, or a property value).
What you describe here is a ternary edge, something I try to cover in the
Enhanced API.
Your film example can be modeled as follows:
There is an Edge STARS with the EdgeRoles: Actor, Film, Role.
We can now state:
STARS
-- Actor -- Brad Pitt
-- Film -- Fight club
-- Role -- Tyler Durden
would be.
Niels
Date: Wed, 3 Aug 2011 16:31:04 +0200
From: matt...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Node#getRelationshipTypes
A golden helicopter might do the trick :)
2011/8/3 Niels Hoogeveen pd_aficion...@hotmail.com
How does one persuade
Today I added fluency to the API design.
It is now possible to write:
Db().createVertex()
.setProperty(Name, John)
.setProperty(Age, 29)
.addEdgeTo(june, WIFE)
I also added support for VertexTypes, which is nothing more and nothing less
than a Vertex with a unique name and a class name to
Today I pushed a major rewrite of the Enhanced API. See:
https://github.com/peterneubauer/graph-collections/tree/master/src/main/java/org/neo4j/collections/graphdb
Originally the Enhanced API was a drop-in replacement of the standard Neo4j
API. This resulted in lots of wrapper classes that
The batch insert is intended to push data into the database with having to do
any look ups.
You could preprocess your input data, such that it can be loaded in one go. You
could for example read you input file against an existing database, fetch the
ID's of nodes and relationships that contain
That should be without having to do any lookups
From: pd_aficion...@hotmail.com
To: user@lists.neo4j.org
Date: Wed, 3 Aug 2011 13:37:44 +0200
Subject: Re: [Neo4j] Batch find
The batch insert is intended to push data into the database with having to do
any look ups.
You could
of means to solve my issues,
but none as rewarding as a solution in core would be.
Niels
Date: Wed, 3 Aug 2011 16:31:04 +0200
From: matt...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Node#getRelationshipTypes
A golden helicopter might do the trick :)
2011/8/3 Niels Hoogeveen
Is it possible for you to use the batch inserter, or does the data you are
loading require a lot of lookups?
Niels
From: jvcole...@gmail.com
Date: Wed, 3 Aug 2011 17:57:20 -0300
To: user@lists.neo4j.org
Subject: [Neo4j] Memory overflow while creating big graph
Hi,
I'm trying to create
Hi Boris,
What will be your decision procedure to determine what edges will be marked as
heavy and which will be marked as light? Even if you establish a fixed ratio,
you will still need to decide what relationships belong in one category and
which belong in the other?
Could you elaborate a
);
TraversalDescription#traverse( IterablePath startPaths );
that would be rather similar, wouldn't it?
2011/7/30 Niels Hoogeveen pd_aficion...@hotmail.com
I would be all for it if this could become part of 1.5.
I am willing to put time into this.
Date: Sat, 30 Jul 2011 11:33:01 +0200
From
.
2011/8/1 Niels Hoogeveen pd_aficion...@hotmail.com
I have two specific use cases for these methods:
I'd like to present a node with the property types (names) it has content
for and with the relationship types it has relationships for, while
loading
those properties
Last couple of days I have worked improving upon the Enhanced API and made some
progress unifying Properties and Relationships.
For some time, I have wanted to have a traverser which I can set up so that it
returns a collection of properties. After all what we want to present in an
Hi John,
I think when approaching a project there are two distinct issues at play, one
is the tooling level,
another is the actual solution you are trying to create for an actual problem.
When looking at the tooling level it is great to have as much covered as
possible.
Neo4j offers a graph
Good point.
It could for all practical purposes even be IterableRelationshipType so they
can be lazily fetched, as long as the underlying implementation makes certain
that any iteration of the RelationshipTypes forms a set (no duplicates).
There is no need to have RelationshipTypes in any
Interesting thought, and it is certainly true that indexing is much less of a
concern in a graph database than in a normal RDBMS where generally every table
needs to have a primary key and where you need to have an index on the primary
key to be able to do joins (at least to do them somewhat
: [Neo4j] Brainstorming on my project: neo4john
Hey Niels, thanks for the concise reply.
On Sun, Jul 31, 2011 at 5:10 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
Hi John,
I think when approaching a project there are two distinct issues at play,
one is the tooling level
Niels Hoogeveen:
Good point.
It could for all practical purposes even be IterableRelationshipType so
they can be lazily fetched, as long as the underlying implementation makes
certain that any iteration of the RelationshipTypes forms a set (no
duplicates).
There is no need
...
I'll skip trying to make maven to work for me for now, don't feel like it :)
*I'm not qualified to fix this with maven, sorry*
John
On Fri, Jul 29, 2011 at 5:16 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
Hi John,
Thanks for looking into this.
I am still seeing the same
,
On Sat, Jul 30, 2011 at 3:28 PM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
I use the download option on Github expand the zip in a directory and
run mvn install in that directory without any problems.
Niels
Date: Sat, 30 Jul 2011 13:39:15 +0200
From: cyuczie
While working on Enhanced API, I realize two crucial method are missing on the
Node interface of the standard API:
RelationshipType[] getRelationshipTypes();
RelationshipType[] getRelationshipTypes(Direction);
For Enhanced API, I'd like to be able to plug in different Relationship
, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
The problem is indeed related to not properly closing the bdb database, and
that is triggers another problem. In BerkeleyDbCommand data is being stored
into the transaction log and been read from the transaction log later on.
Something
that messages.log being unable to delete when I allow the
test testFindCreatedIndex() to run, I cannot yet figure out who creates
that
file and to make sure it's being closed
correction testInsertionSpeed()
John.
On Sat, Jul 30, 2011 at 11:09 PM, Niels Hoogeveen
pd_aficion
]
[INFO] Total time: 2 seconds
[INFO] Finished at: Sun Jul 31 00:37:19 CEST 2011
[INFO] Final Memory: 38M/359M
[INFO]
e:\down\13th-floor-bdb-index-f9a3155
On Sun, Jul 31, 2011 at 12:26 AM, Niels Hoogeveen
useful.
John.
On Sun, Jul 31, 2011 at 12:57 AM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
Could you check if the neo4j kernel jar file maven adds to class path is
correct and complete. You can find it in your user directory in the .m2
subdirectory.
Date: Sun, 31 Jul
at 12:57 AM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
Could you check if the neo4j kernel jar file maven adds to class path is
correct and complete. You can find it in your user directory in the .m2
subdirectory.
Date: Sun, 31 Jul 2011 00:40:51 +0200
From: cyuczie
, Jul 29, 2011 at 1:30 AM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
I'd like to take a stab at implementing traversals in the Enhanced API. One
of the things I'd like to do, is to make traversals composable.
Right now a Traverser is created by either calling the traverse method
John.
On Thu, Jul 28, 2011 at 7:36 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
Trying to find something useful to hide the implementation book keeping of
Enhanced API, I tried out dbd-index as can be found here:
https://github.com/peterneubauer/bdb-index
It looks
are inserted atomically. Parsing A then X of B- in
dbBackward for example can only be done with a cursor...
Either way, I'm taking a look on that bdb-index thingy; will report back if
I have any ideas heh
John.
On Thu, Jul 28, 2011 at 9:42 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote
in a side track and will surely add some
aspect of composable traversers also.
2011/7/29 Niels Hoogeveen pd_aficion...@hotmail.com
I'd like to take a stab at implementing traversals in the Enhanced API. One
of the things I'd like to do, is to make traversals composable.
Right now
some time reading this,
Greeting and salutations,
John
On Wed, Jul 27, 2011 at 8:48 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
I just posted an example on how to use HyperRelationships:
https://github.com/peterneubauer/graph-collections/wiki/HyperRelationship-example
When iterating over all nodes, you also pull the reference node (with id = 0),
which probably doesn't have the requested property.
If you want to list all properties of a node, it's better to use a construct
like:
for(String key: node.getPropertyKeys()){
()
3)
org.neo4j.collections.graphdb.impl.NodeLikeImpl.getRelationships(RelationshipType...)
The return type is incompatible with
RelationshipContainer.getRelationships(RelationshipType[])
John.
On Thu, Jul 28, 2011 at 12:52 PM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote
in SortedTree ?
is removeProperty causing neo4j to acquire a lock on the Node? or its
properties?
also does that property need to exist? seems like not
interesting :)
On Wed, Jul 27, 2011 at 8:48 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
I just posted an example on how to use
()
3)
org.neo4j.collections.graphdb.impl.NodeLikeImpl.getRelationships(RelationshipType...)
The return type is incompatible with
RelationshipContainer.getRelationships(RelationshipType[])
John.
On Thu, Jul 28, 2011 at 12:52 PM, Niels Hoogeveen
pd_aficion
Trying to find something useful to hide the implementation book keeping of
Enhanced API, I tried out dbd-index as can be found
here:https://github.com/peterneubauer/bdb-index
It looks interesting, but fails its tests. When recovering it performs
BerkeleyDbCommand#readCommand from the log. The
Should read: The retrieved indexName is actually garbage.
From: pd_aficion...@hotmail.com
To: user@lists.neo4j.org
Date: Thu, 28 Jul 2011 19:36:21 +0200
Subject: [Neo4j] bdb-index
Trying to find something useful to hide the implementation book keeping of
Enhanced API, I tried out
.
On Thu, Jul 28, 2011 at 10:36 AM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
Trying to find something useful to hide the implementation book keeping of
Enhanced API, I tried out dbd-index as can be found
here:https://github.com/peterneubauer/bdb-index
It looks interesting, but fails
I'd like to take a stab at implementing traversals in the Enhanced API. One of
the things I'd like to do, is to make traversals composable.
Right now a Traverser is created by either calling the traverse method on Node,
or to call the traverse(Node) method on TraversalDescription.
This
Bring-a-Thing party.
On Tue, Jul 26, 2011 at 2:44 PM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
I just ported my own application 12kloc of Scala code to use the Enhance
API and got it working. Of course more thorough testing needs to be done,
but it proves that at least
I just posted an example on how to use HyperRelationships:
https://github.com/peterneubauer/graph-collections/wiki/HyperRelationship-example
There is now a proper test for HyperRelationships, so I hereby push the
software to Beta status.
Please try out the Enhanced API and HyperRelationships
Hi Sambodhi,
One of the means to organize complexity is by adding meta information to your
database. This first of all helps you organize what relationships and
properties belong to what sort of node, it may also help answer questions such
as: what nodes belong to what type/class.
Niels
Integrated IndexedRelationships functionality into the Enhanced API, so
relationships of a certain type are maintained in a Btree, while they can be
manipulated through the API just like any other relationship.
Still need to test this one.
As mentioned earlier today, HyperRelationships and
A first stab at implementing the Enhanced API and HyperRelationships is
finished. It still needs thorough testing, so this is PRE-ALPHA quality.It also
still lacks proper documentation (java docs).The source code can be found
I just ported my own application 12kloc of Scala code to use the Enhance API
and got it working. Of course more thorough testing needs to be done, but it
proves that at least in the case of my own application the Enhanced API can
work as a drop-in replacement.
Niels
From:
and HyperRelationships
Hi Niels --
Very interesting stuff you're doing. Any chance that Scala app of your
is open source? Would love to see the impact of using your enhanced
API vs not using it.
Cheers,
-EE
On Tue, Jul 26, 2011 at 21:44, Niels Hoogeveen
pd_aficion...@hotmail.com wrote
1 - 100 of 232 matches
Mail list logo
