Absolutely you can index each point or line of the graph with it's own
document in Solr, perhaps as a triple. (Sounds like you are specifically
talking about RDF-type data, huh? Asking about that specifically might
get you more useful ideas than asking graphs in general).
But if you want to then figure out if two points are connected, or get
the list of all points within X distance from a known point, or do other
things you are likely to want to do it with it... Solr's not going to
give you the tools to do that, indexed like that.
On 5/16/2011 4:52 PM, dani.b.angelov wrote:
I am wandering, whether the following idea is worth.
We can describe the graph with series of triples. So can we create some bean
with fields, for example:
...
@Field
String[] sybjects;
@Field
String[] predicates;
@Field
String[] objects;
@Field
int[] level;
...
or other combination of metadata.
We can index/search this bean. Based on the content of the found bean, we
can conclude for interconnections between graph participants.
What do you thing?
--
View this message in context:
http://lucene.472066.n3.nabble.com/indexing-directed-graph-tp2949556p2949845.html
Sent from the Solr - User mailing list archive at Nabble.com.
