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
ubject: lucene as a graph store
Hello;
I like to use lucene as a graph store. The graph representation is a
list of
edges. Consider the code below:
final int commitCount = 16 * 1024;
final int numObj = 1024 * 1024;
Analyzer analyzer = new KeywordAnalyzer();
FSDir
- 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
does bring some terms, etc. into
> memory, and you may have a look at the FieldCache.
>
> -Grant
>
> On Jan 15, 2008, at 7:17 AM, Cam Bazz wrote:
>
> > Hello;
> >
> > I like to use lucene as a graph store. The graph representation is a
> > list of
> >
ing some terms, etc. into
memory, and you may have a look at the FieldCache.
-Grant
On Jan 15, 2008, at 7:17 AM, Cam Bazz wrote:
Hello;
I like to use lucene as a graph store. The graph representation is a
list of
edges. Consider the code below:
final int commitCount = 16 * 1024
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
Hello;
I like to use lucene as a graph store. The graph representation is a list of
edges. Consider the code below:
final int commitCount = 16 * 1024;
final int numObj = 1024 * 1024;
Analyzer analyzer = new KeywordAnalyzer();
FSDirectory directory
