Jan,
I would suggest to use the Tinkerpop RDF wrapper, then examine the
resulting graph in neo4j, and se if raw traversals can find the
relationships for you, After all, you can always drop down to the raw
graph even while using the RDF implementation. That is one of the
points of Neo4j dealing with raw graphs.
Cheers,
/peter neubauer
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 - 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 17, 2011 at 8:20 PM, Jan Bezget wrote:
> Hello!
> I'm new to Neo4j and need some advice regarding my project and how I should
> proceed.
> The purpose of the project is to find the shortest path between two things
> (similar to RelFinder) as quickly as possible.
>
> So far I've loaded a few million dbpedia triples using NxParser and
> neo4j-rdf component as well as tried neo4j's pathfinding capabilities.
> Everything works fine!
> However, I have noticed that neo4j-rdf's DenseTripleStore stores object
> literals and their predicates within the subject node as a set of
> properties.
>
> Since, above all, I'm after fast traversals I'm wondering, whether this
> incurs any performance penalties to pathfinding algorithms? If I were to
> store those literals as separate nodes, would _that_ incur penalties?
> Is neo4j-rdf still in development or should I try out TinkerPop's Blueprints
> (seems very popular lately!)?
> Whilst I like the features these high-level wrappers provide, I'm really
> only using pathfinding and indexing. Should I write my own lightweight
> wrapper? But in the end is it really worth it, or should I just use existing
> wrappers?
>
> Thank you!
> ___
> Neo4j mailing list
> User@lists.neo4j.org
> https://lists.neo4j.org/mailman/listinfo/user
>
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
