Thank you Gora in advance!
However, I decided to create a bean for indexing something like that:
...
String[] vertices
String[] edges
int[] triple_inx_levels
...
So I can search in vertices text & edge text in "vertices & edges" array
fields, and I hope to find the relation from triple_inx_levels
On Thu, May 19, 2011 at 9:12 AM, Otis Gospodnetic
wrote:
> Maybe Gora was referring to Siren: http://search-lucene.com/?q=siren+-sami
[...]
That does look interesting, but is not what I was referring to.
I seem to remember a discussion on this list some
3-4 months about someone wanting to make a
Sent: Tue, May 17, 2011 2:44:55 AM
> Subject: Re: indexing directed graph
>
> Gora, thank you for your reply!
>
> Could you point me a link regarding "There was a discussion earlier on this
> topic...".
>
> --
> View this message in context:
>http://lu
Thank you for your reply!
My target is to make some kind of "relations" between the documents indexed
in to the index. So, for the performance reasons, I would like to index the
graph created from this relations. In this way I can query/search the
subgraph documents by vertices names/text and/or ed
Gora, thank you for your reply!
Could you point me a link regarding "There was a discussion earlier on this
topic...".
--
View this message in context:
http://lucene.472066.n3.nabble.com/indexing-directed-graph-tp2949556p2951418.html
Sent from the Solr - User mailing list archive at Nabble.com.
Thank you for your reply!
My target is to make some kind of "relation" between the document indexed it
to the index. So, for the performance reasons, I would like to index the
graph created from this relations.
--
View this message in context:
http://lucene.472066.n3.nabble.com/indexing-directed-
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 t
You can certainly index it, the problem will be being able to make the
kinds of queries you want to make on it once indexed. Indexing it in a
way that will let you do such queries.
The kind of typical queries I'd imagine you wanting to run on such a
graph -- I can't think of any way to index i
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
On Tue, May 17, 2011 at 1:55 AM, dani.b.angelov
wrote:
> Thank you Gora,
>
> 1. Could you confirm, that the context of IMHO is 'In My Humble Opinion'.
Yes, sorry. I must remember to be less lazy in typing.
> 2. Could you point example of graph database.
[...]
As Stefan points out above, I like
Thank you Gora,
1. Could you confirm, that the context of IMHO is 'In My Humble Opinion'.
2. Could you point example of graph database.
--
View this message in context:
http://lucene.472066.n3.nabble.com/indexing-directed-graph-tp2949556p2949734.html
Sent from the Solr - User mailing list arc
Dani,
i'm actually playing with Neo4j .. and the have a Lucene-Indexing and
plan to have Solr-Integration (no idea what the current state is).
http://lists.neo4j.org/pipermail/user/2010-January/002372.html
Regards
Stefan
Am 16.05.2011 21:50, schrieb dani.b.angelov:
Hello,
is it possible to
On Tue, May 17, 2011 at 1:20 AM, dani.b.angelov
wrote:
> Hello,
> is it possible to index graph - named vertices and named edges? My target
> is, with text search to find whether particular node is connected(direct or
> indirect) with another. Thank you.
[...]
There was a discussion earlier on th
13 matches
Mail list logo
