Andy, you can do in a raw graph things similar to OWL in RDF with the Neo-meta package, see http://components.neo4j.org/neo-meta/ for details. Basically, you are stating what types of constraints, required properties etc you want to have.
This is not enforced in the graph itself, but via this package. Neo4j itself does not know these constructs. HTH Cheers, /peter neubauer COO and Sales, Neo Technology GTalk: neubauer.peter Skype peter.neubauer Phone +46 704 106975 LinkedIn http://www.linkedin.com/in/neubauer Twitter http://twitter.com/peterneubauer http://www.neo4j.org - Relationships count. http://gremlin.tinkerpop.com - PageRank in 2 lines of code. http://www.linkedprocess.org - Computing at LinkedData scale. On Tue, Dec 29, 2009 at 9:31 AM, <[email protected]> wrote: > What possibilities are there for implementing relationship constraints in a > node space. If in addition to relationship types nodes could also have types > (either as a core value or property), I'm thinking of a scenario like this. > > Nodes of type A, B or C can relate to nodes D, E and F with relationship types > X and Y. > > A, B and C can relate to one another with types U, V ... > > etc. > > Is there something currently available or planned for doing this or must these > types of constraints be programmed into the domain logic? > > Thanks > > Andy Potter > _______________________________________________ > Neo mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ Neo mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
