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.
