hi all
where can i get info on how boosting terms at index time compares to
boosting terms at query time ?
case 1 : if i have a index with all terms with the default boost value
and i apply a boost value terms at query time
versus
case 2: i boost individual terms at index time with a boost
thanks what i was looking for was the fact if i can donot need to boost
docs then what will be the difference a) in query results and b) time
for indexing and c) time to run query and collect result ?
Daniel Naber wrote:
On Monday 23 October 2006 19:39, Rupinder Singh Mazara wrote
hi all
I need to be able to index and search for documents based on keywords
that are attached to a document.
Some of the keywords have white spaces in them like "red hat" or
"place of worship" ,
I need to able to search for FULLTEXT:"red hat" AND KEYWORD:"red hat"
For indexing pur
/1.4/docs/api/java/lang/String.html> f,
Analyzer
a) where the analyzer is a PerFieldAnalyzerWrapper. Then use the same
analyzer you used during the indexing process.
This is Lucene 2.0...
Best
Erick
On 8/21/06, Rupinder Singh Mazara <[EMAIL PROTECTED]> wrote:
hi all
I need t
Where can I find information which version / tag to checkout so as to
get the lazy loading verity of lucene
Grant Ingersoll wrote:
Large stored fields can affect performance when you are iterating over
your hits (assuming you are not interested in the value of the stored
field at that point
hi Xin
this is take a look at this you can add multiple fields with the name
mesh
for ( i=0; i< meshList.size() ; i++ ){
meshTerm = meshList.get(i)
document.addField( new Field( "mesh", meshTerm.semanticWebConceptId,
Field.Store.YES , Field.Index.NO_NORMS );
}
when querying this index
Message - From: "Rupinder Singh Mazara"
<[EMAIL PROTECTED]>
To:
Sent: Friday, August 25, 2006 10:49 AM
Subject: Re: controlled vocabulary
hi Xin
this is take a look at this you can add multiple fields with the
name mesh
for ( i=0; i< meshList.size() ; i++ ){
meshTe
hi all
the search implementation that i have requires not the top 1000
documents but the lowest 1000 documents to be returned
I donot want to store the entire result set in memory and go to
the last 1000 , is there any implementation / suggestions on how to
achieve this
thanks
