number of edges (degrees?) between any 2
> nodes?
>
> Otis
> --
> Sematext -- http://sematext.com/ -- Lucene - Solr - Nutch
>
> - Original Message
> From: Cam Bazz <[EMAIL PROTECTED]>
> To: java-user@lucene.apache.org
> Sent: Tuesday, January 15, 2008 11:34:20
Re indexing performance, you are not making use of various IndexWriter
parameters. My suggestion: wait another week, Lucene 2.3 will be out then.
Check IndexWriter javadocs for various knobs for improving indexing
performance. Actually, check the Wiki, there is a page about just that there.
- Original Message
From: Cam Bazz <[EMAIL PROTECTED]>
To: java-user@lucene.apache.org
Sent: Tuesday, January 15, 2008 11:34:20 AM
Subject: Re: lucene as a graph store
well lets say I have a list representation of a graph like
src:1 dst:2
src:2 dst:3
src:1 dst 3
outgoingEdgesOf(1) ret
query.
Best.
On Jan 15, 2008 6:22 PM, Otis Gospodnetic <[EMAIL PROTECTED]>
wrote:
> Hi,
>
>
> - Original Message
> From: Cam Bazz <[EMAIL PROTECTED]>
> To: java-user@lucene.apache.org
> Sent: Tuesday, January 15, 2008 8:50:07 AM
> Subject: Re: luc
Hi,
- Original Message
From: Cam Bazz <[EMAIL PROTECTED]>
To: java-user@lucene.apache.org
Sent: Tuesday, January 15, 2008 8:50:07 AM
Subject: Re: lucene as a graph store
Usually for implementing things like page rank, or doing centrality
metric
calculations or maybe dij
Usually for implementing things like page rank, or doing centrality metric
calculations or maybe dijkstras shortest term, this kind of (list of edges)
graph is not best at performance.
I like to use lucene for simple operations like neighboors of this node, or
2 degree neighboors of this node.
is
I guess the question comes down to what kind of things are you going
to do w/ this graph? How often are you updating links, etc? I can't
say Lucene was designed for this kind of thing, but I am constantly
amazed at what people use Lucene for, so I won't say it can't be
done. I don't know
15 jan 2008 kl. 13.17 skrev Cam Bazz:
Typically, when number of objects in BTree based structure in an
oodbms for
example increase, the search and add times also increase.
Will lucene have the same problem and how can I overcome it if it
does.
There is a benchmark package in the contri
