- Your high performance graph database.
http://startupbootcamp.org/- Öresund - Innovation happens HERE.
http://www.thoughtmade.com - Scandinavia's coolest 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
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 Sun, Jul 24, 2011 at 5:03 PM, Niels Hoogeveen
pd_aficion...@hotmail.com
RelationshipType is not really a type in the conventional sense of the word.
RelationshipType is for all practical purposes a label assigned to a
Relationship for the purpose of navigation.
You could also say that nodes are typed through the relationships attached to
them. So from the
The implementation of HyperRelationships needs another day of work, though the
hard parts are finished now.
Time to explain the inner workings of HyperRelationships.
HyperRelationships are a generalization of the binary relationships found in
Neo4j.
Instead of creating a relationship from a
Are you sure this is true, Mattias?The response time of a getRelationship call
depends on the total number of relationships on the node. So it makes a
difference which side of the relationship makes the call. It is always faster
to ask it from the side that has the lowest total number of
Today I wrote a piece about the Enhanced API and about HyperRelationships, I
have been working on over the last couple of days.
See: https://github.com/peterneubauer/graph-collections/wiki/Enhanced-API
The API as presented in the graph-collections repo on Git is not feature
complete yet with
...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Hyperedges and Objects
Niels,
sounds like fun. Looking forward to get a look at this
2011/7/21 Niels Hoogeveen pd_aficion...@hotmail.com
i made a start on this. It's not all too difficult to enhance relationships
only working on n-ary relationships?
Btw. you can replace those unholy if clauses with polymorphism in the enum.
Are there some tests and/or examples that uses this API ?
Cheers
Michael
Am 23.07.2011 um 21:02 schrieb Niels Hoogeveen:
Traverser and Index are wrapped too now
are imho a really different approach to the
current API, so mixing things just makes it confusing. Especially keeping the
old names around when the things are actually unified carries too much
wrong semantics.
Michael
Am 23.07.2011 um 22:02 schrieb Niels Hoogeveen:
I had to wrap
Last night while working on some enhancements on the Neo4J API, I set up a
method to lookup the name of a relationship, to facilitate the creation of
associated nodes.
The method I use, is to create a node (which can be found through the reference
node) and on this node create a property for
case for a super trivial Lucene index, no? Would seem
to be a much easier solution with much faster lookup...and built into Neo4J.
From: user-boun...@lists.neo4j.org [user-boun...@lists.neo4j.org] On Behalf
Of Niels Hoogeveen [pd_aficion
,
traversal). The position semantics based approach sounds interesting.
Would love to see that as community contribution.
Cheers
Michael
Am 16.07.2011 um 23:08 schrieb Niels Hoogeveen:
The question is how much easier a traverser can become when there were
23:08 schrieb Niels Hoogeveen:
The question is how much easier a traverser can become when there were
dedicated hyper edges. In a binary relation it is fairly easy to define one
end of the relation as the source and the other as the target (start and
end node),
but in n-ary
for creating stuff in a readable language
* getRelationshipCount()
* some more that I forgot :)
Michael, pulling his wishlist
Am 21.07.2011 um 20:32 schrieb Niels Hoogeveen:
i made a start on this. It's not all too difficult to enhance relationships
such that relationships can
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, Jul 21, 2011 at 8:32 PM, Niels Hoogeveen
pd_aficion...@hotmail.com
forward to get a look at this
2011/7/21 Niels Hoogeveen pd_aficion...@hotmail.com
i made a start on this. It's not all too difficult to enhance relationships
such that relationships can be created upon them, which is a first step
towards supporting hypergraphs. In fact hypergraphs are more
To simplify the use of IndexedRelationships, I added support for the use case
where relationships are placed in an index based on the value of a property of
the node added.
Hereto, I added wrappers for property types for all data types supported.
There is also a specialized version of
graph database.
http://startupbootcamp.org/- Öresund - Innovation happens HERE.
http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
On Wed, Jul 20, 2011 at 10:04 PM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
To simplify the use of IndexedRelationships, I
Rick,
I think adding a node type to neo4j is not a good idea. Different
applications have different typing needs.
My own application for example, supports multiple node types per node, while
node types can be subtyped as well.
This creates a forest of types for each node, that needs to be
In another thread today, I defended the schemaless nature of Neo4J, however I
believe there is one area where Neo4J has some sense of schema, which could use
some improvement in my opinion, the RelationshipType.
Whenever creating a typing layer on top of Neo4J, some duplication of
, easy-to-implement and easy-to-maintain patterns for the
stuff that 95% of applications need, and API-based approaches for the other
5%.
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Niels Hoogeveen
Sent: Monday, July 18
In fact, this feature request wouldn't have to be more than a setNodeId(long
id) and getNodeId() method on RelationshipType. This would eliminate the need
to look up additional relationship type information through the Lucene Index.
Niels
From: pd_aficion...@hotmail.com
To:
contribution.
Cheers
Michael
Am 16.07.2011 um 23:08 schrieb Niels Hoogeveen:
The question is how much easier a traverser can become when there were
dedicated hyper edges. In a binary relation it is fairly easy to define one
end of the relation as the source and the other
It makes perfect sense to be able to create multiple relatationships between
two nodes, once you consider that relationships have properties.
For example:
Elizabeth Taylor --MARRIED_TO [from: 1964, to: 1974]-- Richard BurtonElizabeth
Taylor --MARRIED_TO [from: 1975, to: 1976]-- Richard Burton
Hi,You basically have two options. If your result set is not too big, you can
sort it in memory, though that approach may consume too much memory if the
result set is very large. In that case you can use SortedTree (see:
Hyper edges can be emulated.
Suppose you want to store the fact John gives Pete a book.
This is indeed a ternary relationship, which would call for an hyper edge.
This fact can be stored as follows:
Some act of giving --Giver--JohnSome act of giving --Recipient-- PeteSome act
of giving
There will indeed be a performance impact in your scenario. The relationship
store doesn't order the relationships, so all relationships attached to Node
(A) will be read.
Maybe indexed relationships is an option for you, see:
Does anyone know the proper mathematical name for a relationship with the
following properties:
For all x in X and y in Y it holds that if xRy and xR'y then R = R'.
Example:
There can be only one IS_PARENT relation from one person to another. Someone
cannot be twice parent to the same person.
relationships are that there is a unique x in (xRy), for
every y.
See ya,
Marko.
http://markorodriguez.com
On Jul 12, 2011, at 9:39 AM, Niels Hoogeveen wrote:
Does anyone know the proper mathematical name for a relationship with the
following properties:
For all x in X and y
suppose I would say that (xRy) is both functional and inverse functional. :)
Marko.
http://markorodriguez.com
On Jul 12, 2011, at 12:36 PM, Niels Hoogeveen wrote:
Thanks Marko,
That's not exactly what I am looking for. I'd like to know what the name is
of a relationship where
The shortest path is calculated by means of traversals. During traversal,
visited nodes are read into the cache (unless those nodes are already in the
cache). It is not necessarily so that the entire graph needs to be traversed to
calculate the shortest path. If a path is found, other
, 2011 at 11:56 AM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
I think the best solution to use the batch inserter in conjunction with
indexed relationships is to first run the batch inserter and temporarily
store the relationships to be indexed on specifically designated nodes
API for
many cases, and we have also moved our OSM importer to the normal API. I'm
guessing the same might happen everywhere.
On Fri, Jul 8, 2011 at 11:56 AM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
I think the best solution to use the batch inserter in conjunction with
indexed
, 2011 11:39 PM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
Made some more changes to the SortedTree implementation. Previously
SortedTree would throw an exception if a duplicate entry was being added.
I changed SortedTree to allow a key to point to more than one node, unless
work Nils!
/peter
Sent from my phone.
On Jul 4, 2011 11:39 PM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
Made some more changes to the SortedTree implementation. Previously
SortedTree would throw an exception if a duplicate entry was being added.
I changed SortedTree
) or
HeavilyConnectedNode(Wrapper) ?)
Cheers
Michael
Am 07.07.2011 um 12:51 schrieb Niels Hoogeveen:
Finished the implementation of indexed relationships. The graph
collections component now contains the package
https://github.com/peterneubauer/graph-collections
Marko's solution works, because you roll back the transaction once you find a
duplicate entry.
Another solution to this problem is to use the SortedTree index in
graph-collections https://github.com/peterneubauer/graph-collections, which has
a setting that makes an index unique. This component
The interface of org.neo4j.graphdb.Expander contains a typo.
The method addRelationsipFilter(Predicate? super Relationship) should be
called addRelationshipFilter(Predicate? super Relationship).
Niels
___
Neo4j
), etc).
Perhaps that IndexedRelationship should rather be just a wrapper around a
SuperNode ? So probably rename it to SuperNode(Wrapper) or
HeavilyConnectedNode(Wrapper) ?)
Cheers
Michael
Am 07.07.2011 um 12:51 schrieb Niels Hoogeveen:
Finished
I am glad to see a solution will be provided at the core level.
Today, I pushed IndexedRelationships and IndexedRelationshipExpander to Git,
see:
https://github.com/peterneubauer/graph-collections/tree/master/src/main/java/org/neo4j/collections/indexedrelationship
This provides a solution to
Could you put these code examples into the Readme for the project or on a
wiki page?
Am 07.07.2011 um 22:11 schrieb Niels Hoogeveen:
IndexedRelationship and IndexedRelationshipExpander are now in Git. See:
https://github.com/peterneubauer/graph-collections/tree/master/src/main
would compare to the naive supernodes
with just millions of relationships.
Also I'd like to see a performance comparision of both approaches.
Thanks so much for your work
Michael
Am 07.07.2011 um 22:24 schrieb Niels Hoogeveen:
I am glad to see a solution will be provided
Date: Tue, 5 Jul 2011 08:27:57 +0200
From: neubauer.pe...@gmail.com
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Indexed relationships
Great work Nils!
/peter
Sent from my phone.
On Jul 4, 2011 11:39 PM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
Made some more changes
I forgot to add another recurrent issue that can be solved with indexed
relationships: guaranteed unicity constraints.
From: pd_aficion...@hotmail.com
To: user@lists.neo4j.org
Date: Mon, 4 Jul 2011 01:55:08 +0200
Subject: [Neo4j] Indexed relationships
In the thread [Neo4j] traversing
Made some more changes to the SortedTree implementation. Previously SortedTree
would throw an exception if a duplicate entry was being added.
I changed SortedTree to allow a key to point to more than one node, unless the
SortedTree is created as a unique index, in which case an exception is
In the thread [Neo4j] traversing densely populated nodes we discussed the
problems arising when large numbers of relationships are added to the same node.
Over the weekend, I have worked on a solution for the dense-relationship-nodes
using SortedTree in the neo-graph-collections component.
based on the BTree's consistent hash.
On Thu, Jun 30, 2011 at 11:36 PM, Niels Hoogeveen
pd_aficion...@hotmail.com
wrote:
In theory the approach I described earlier could work, though there are
some pitfalls to the current implementation that need ironing out before
, Jun 30, 2011 at 11:36 PM, Niels Hoogeveen
pd_aficion...@hotmail.com
wrote:
In theory the approach I described earlier could work, though there
are
some pitfalls to the current implementation that need ironing out
before
this can become a recommended
/ direction that
is used by traversing frameworks,
but I ain't no graphdb-engine expert :-(
A'
Message: 5
Date: Wed, 29 Jun 2011 18:19:10 +0200
From: Niels Hoogeveen pd_aficion...@hotmail.com
Subject: Re: [Neo4j] traversing densely populated nodes
To: user@lists.neo4j.org
Today I added a List class to the graph-collections repo:
https://github.com/peterneubauer/graph-collections/tree/master/src/main/java/org/neo4j/collections/list
The List class implements the java.util.ListNode interface.
Niels
-a-Thing party.
On Thu, Jun 30, 2011 at 5:28 PM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
Today I added a List class to the graph-collections repo:
https://github.com/peterneubauer/graph-collections/tree/master/src/main/java/org/neo4j/collections/list
The List class implements
. There are f.ex. queues (with workers picking items from
them), linked lists, limited-sized lists and more.
2011/6/30 Niels Hoogeveen pd_aficion...@hotmail.com
For neo4j.graph-collections.list.List I suggest the following.
The graph collections List class is an implementation
: Wed, 29 Jun 2011 18:19:10 +0200
From: Niels Hoogeveen pd_aficion...@hotmail.com
Subject: Re: [Neo4j] traversing densely populated nodes
To: user@lists.neo4j.org
Message-ID: col110-w326b152552b8f7fbe1312d8b...@phx.gbl
Content-Type: text/plain; charset=iso-8859-1
Michael
for type and direction is the first
obvious case, but we could be even more explicit than that, if we pass
constraints based on the BTree's consistent hash.
On Thu, Jun 30, 2011 at 11:36 PM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
In theory the approach I described earlier could
that, if we pass
constraints based on the BTree's consistent hash.
On Thu, Jun 30, 2011 at 11:36 PM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
In theory the approach I described earlier could work, though there are
some pitfalls to the current implementation that need
.
On Tue, Jun 28, 2011 at 11:14 PM, Saikat Kanjilal
sxk1...@hotmail.comwrote:
I would be interested in helping out with this, let me know next steps.
Sent from my iPhone
On Jun 28, 2011, at 8:49 AM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote
Recently I have worked on loading the content of DbPedia into my database and
run into a performance issue.
My application has a meta-layer; inspired by the meta model component, but
rewritten in Scala.
All DbPedia resources are said to be an instance of topic,
creating a relationship from
front, and then only
call index.add(node) to index a node. This will fit in well with the new
auto-indexing ideas in neo4j.
On Wed, Jun 29, 2011 at 2:25 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
At this moment Btree only supports the primitive datatype long, while Rtree
relationships to other nodes.
Although this helps, it is a very ugly solution.
Best regards
Norbert Tausch
Am 29.06.2011 16:07, schrieb Niels Hoogeveen:
Recently I have worked on loading the content of DbPedia into my database
and run into a performance issue.
My application has a meta
at once.
Cheers
Michael
Am 29.06.2011 um 17:13 schrieb Niels Hoogeveen:
I achieve more or less the same result placing the relationships in the
Timeline index, which distributes the relationships over many nodes.
There are workarounds for this issue, but I would really like to see
- Innovation happens HERE.
http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
On Wed, Jun 29, 2011 at 4:19 PM, Niels Hoogeveen
pd_aficion...@hotmail.com wrote:
Craig,
Would it be possible to merge your work on Amanzi with the work the Neo
team has done
project?
On Wed, Jun 29, 2011 at 4:19 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
Craig,
Would it be possible to merge your work on Amanzi with the work the Neo
team has done on the Btree component that is now in neo4j-graph-collections,
so we can eventually have one
on what I think could be
done to make this port.
On Wed, Jun 29, 2011 at 9:52 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
Peter, I totally agree. Having the Rtree index removed of spatial
dependencies in graph-collections should be our first priority. Once
A couple of weeks ago Peter Neubauer set up a repository for in-graph
datastructures: https://github.com/peterneubauer/graph-collections.
At this time of writing only the Btree/Timeline index is part of this
component.
In my opinion it would be interesting to move the Rtree parts of
@lists.neo4j.org
Subject: Re: [Neo4j] neo4j-graph-collections
I would be interested in helping out with this, let me know next steps.
Sent from my iPhone
On Jun 28, 2011, at 8:49 AM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
A couple of weeks ago Peter Neubauer set up
with this, let me know next steps.
Sent from my iPhone
On Jun 28, 2011, at 8:49 AM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
A couple of weeks ago Peter Neubauer set up a repository for in-graph
datastructures: https://github.com/peterneubauer/graph-collections
with this, let me know next steps.
Sent from my iPhone
On Jun 28, 2011, at 8:49 AM, Niels Hoogeveen pd_aficion...@hotmail.com
wrote:
A couple of weeks ago Peter Neubauer set up a repository for in-graph
datastructures: https://github.com/peterneubauer/graph-collections
In 1973, Charles W. Bachman received The Turing Award for his work on
navigational databases, conceptually a cousin of the graph database model.
Here is a link to his Turing Award Lecture:
Hunger wrote:
Damn, do we have tests for storing values and retrieving them.
Anfang der weitergeleiteten E-Mail:
Von: Niels Hoogeveen pd_aficion...@hotmail.com
Datum: 16. Juni 2011 23:52:50 MESZ
An: user@lists.neo4j.org
Betreff: Re: [Neo4j] storing long values overflow
pair. Is this possible? If not with the
current setup, would it be possible to add such functionality? Kind re
gards,Niels Hoogeveen
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman
, f.ex. integers where the string is
a weird encoding of such a value.
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Niels Hoogeveen
Sent: Friday, June 17, 2011 8:30 AM
To: user@lists.neo4j.org
Subject: [Neo4j] all values
You can create a node type community-role with two outgoing relations
in_community and with_role, which respectively point to a community and
to a role. The user node can then have a relationship has_community-role
pointing to a community-role node. Every hypergraph structure can in
to add an intermediate node and then graph becomes
to be like the 4th normal form in SQL. An artifact to adapt real life
scenarios to pure and simple technologies. Again an impedance mismatch
between real life and implementing technology.
Aniceto
On Fri 17/06/11 8:19 PM , Niels Hoogeveen
));
tx.success(); }finally{ tx.finish();
} }}Result:-134217728134217727Kind regards,Niels Hoogeveen
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org
is returned.
Kind regards,Niels Hoogeveen
From: pd_aficion...@hotmail.com
To: user@lists.neo4j.org
Date: Thu, 16 Jun 2011 22:40:24 +0200
Subject: [Neo4j] storing long values overflow
Using neo4j 1.4-SNAPSHOT it seems the storage or retrieval of long values no
longer works
formatted code snippets.
Marko.
http://markorodriguez.com
On Jun 16, 2011, at 2:48 PM, Niels Hoogeveen wrote:
Don't know how to send a properly formatted email.
Anyway, when storing a long value -134217728l in a node property,
retrieving the value of the property is again -134217728
To: user@lists.neo4j.org
Subject: Re: [Neo4j] storing long values overflow
Hi,
Try using:
http://paste.pocoo.org/
Great for sending color formatted code snippets.
Marko.
http://markorodriguez.com
On Jun 16, 2011, at 2:48 PM, Niels Hoogeveen wrote
: http://lists.neo4j.org/pipermail/user/2011-May/008461.html)
I hope my suggestion will somehow lead to a solution where the in-graph
Timeline index can become part of the standard Neo4J infrastructure.
Kind regards,
Niels Hoogeveen
did some work on the Meta Model
component. Please let me know if I have to renew that CLA, or if the old one is
still valid.
Kind regards,Niels Hoogeveen
From: peter.neuba...@neotechnology.com
Date: Mon, 13 Jun 2011 14:27:32 +0200
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Neo4J-collections
and then issue pull-requests to Peter.
Cheers
Michael
Am 13.06.2011 um 22:09 schrieb Niels Hoogeveen:
Hi Peter,
I don't know how we are going to deal with SCM, so I am using email to
send you a bug fix to the org.neo4h.collections.timeline.Timeline class.
Description: Added
related classes (including Timeline) to a new
component Neo4j-collections, while keeping the old Lucene index stuff in
Neo4j-index, so it can eventually become deprecated.
I hope my suggestion will be taken into consideration.
Kind regards,Niels Hoogeveen
Of Niels Hoogeveen
Sent: Friday, June 03, 2011 2:44 PM
To: user@lists.neo4j.org
Subject: [Neo4j] In-graph Timeline index and Neo4j 1.4
Today, I tried to migrate my application from Neo4j 1.3 to 1.4M03 and ran
into problems with respect to the in-graph Timeline index in the legacy
component
Subject: [Neo4j] Timeline index
To: Neo4j user discussions user@lists.neo4j.org
2011/4/12 Niels Hoogeveen pd_aficion...@hotmail.com
Hi Mattias,
Thank you for your response. I am currently working with the version you
pointed out. My bigger concern is the possible deprecation
to this, but assume that if it did really
help, it would have been done already ;-)
On Thu, May 5, 2011 at 3:52 PM, Niels Hoogeveen
pd_aficion...@hotmail.comwrote:
The meta model component (though in need of some attention), already allows
the typing of a node. An important difference
...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Niels Hoogeveen
Sent: Thursday, May 05, 2011 1:22 PM
To: user@lists.neo4j.org
Subject: Re: [Neo4j] First-class type property on relationships but not
nodes; why?
I think the basic confusion surrounding this issue
Hunger
michael.hun...@neotechnology.com:
Nils that sounds interesting do you share the type mapping code for scala
somewhere?
Michael
Sent from my iBrick4
Am 05.05.2011 um 22:22 schrieb Niels Hoogeveen pd_aficion...@hotmail.com:
I agree it can be valuable to assign
become synchronization bottlenecks for updates.
Rick
From: user-boun...@lists.neo4j.org [user-boun...@lists.neo4j.org] On Behalf
Of Niels Hoogeveen [pd_aficion...@hotmail.com]
Sent: Sunday, May 01, 2011 9:41 AM
To: user@lists.neo4j.org
One option would be to create a unique value node for each distinct color and
create a relationship from car to that value node. The value nodes can be
grouped together with relationships to some reference node.
This gives the opportunity of finding all distinct colors, and it allows you to
.
Kind regards,Niels Hoogeveen
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
have done on the Lucene component, which is much more
flexible and usable than previous incarnations.
Kind regards,Niels Hoogeveen
Date: Tue, 12 Apr 2011 22:37:42 +0200
From: matt...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Timeline index
Hi Niels,
I think you're
The metamodel component only allows you to store meta information about the
entities in the database and offers no further functionality, except for
importing rdfs data. To use the metamodel component in an application to do
constraint verification, you will have to write the logic yourself,
Is it possible to encode the absence of a relationship with a relationship in
your application?
Date: Tue, 27 Jul 2010 18:52:10 +0100
From: alberto.perd...@gmail.com
To: user@lists.neo4j.org
Subject: [Neo4j] Querying for nodes that have no relationhip to a specfic
node
Hi,
I'm
you very much for the quick action :-)
Cheers,
Jörg
On Jul 6, 2010, at 2:43, Niels Hoogeveen wrote:
The modifications have been applied to trunk.
Niels
Date: Mon, 5 Jul 2010 20:27:49 +0200
From: matt...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Meta
MetaModelClasses are cached in a map, so while the property may be renamed and
reindexed, the map still holds the original name value. After a restart of the
application the new value should be applied. To make renaming possible a method
needs to be added to MetaModelNamespace.
Niels
Date:
Very nice. This allows in the meta model to directly implement singleton
classes.
From: tobias.ivars...@neotechnology.com
Date: Fri, 18 Jun 2010 13:23:40 +0200
To: user@lists.neo4j.org
Subject: [Neo4j] Self-referencing relationships anyone?
Hi all!
I was playing around with adding
haven't thought about that add data to the graph according to fixed patterns.
Date: Fri, 21 May 2010 11:44:00 +0200
From: matt...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo] Lookup property range, was Lookup property name
2010/5/20 Niels Hoogeveen pd_aficion...@hotmail.com
org.neo4j.rdf.store.representation.standard.InstanceOfCollection. I checked but
couldn't see any references to it anywhere in the Neo4J repo.
Date: Fri, 21 May 2010 14:32:36 +0200
From: matt...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo] Lookup property range, was Lookup property name
2010/5/21 Niels Hoogeveen
The title should of course be Lookup property range.
From: pd_aficion...@hotmail.com
To: user@lists.neo4j.org
Date: Thu, 20 May 2010 21:17:05 +0200
Subject: [Neo] Lookup property name
When trying to add a statement with the RDF model, using the latest version
of meta model (the one I
I realize I had to compile the RDF component against the current Meta Model
component. There are some breaking changes in Meta Model that require
modification in the RDF component. Validator.java needs to be looked into,
since MetaModelRelationships have been split off of MetaModelProperties.
that the string must match a certain
regex. pattern or something similar.
2010/5/3 Niels Hoogeveen pd_aficion...@hotmail.com
Yes the length attribute could be used to limit the length of a String,
just like it does in most other databases.
Use cases are mostly in the area of serial
101 - 200 of 232 matches
Mail list logo
