On 1/30/06, Leon Chaddock [EMAIL PROTECTED] wrote:
Hi,
Does anyone know if it is possible to show related searches with lucene, for
example if
someone searched for car insurance you could bring back the results and
related
searches like these
One possible way is to use the vector space
Hi All,
We have a lucene index of over 10 000 000 docs at this time.
When we try and run a search we get
java.lang.OutOfMemoryError: Java heap space
We have tried setting the xmx settings to 1gb but to no avail (the box has
4gb of memory available) . IS there any guidance on handling memory or
Hi, I got a question of doing the related search.
For instance, if I want to say Support Vector Machine == SVM. Then, How
can i use this information when retrieve documents. I dont think it can be
added in the Synonym Filter.
On 2/1/06, Dave Kor [EMAIL PROTECTED] wrote:
On 1/30/06, Leon
Hi Leon,
I had a similar problem when doing a test import which I believe was actually
down to object churn in parsing the data to create the Documents. I achieved a
quick fix by calling System.gc() every thousand documents.
Cheers,
Nick
From: Leon
Hi Nick,
we didnt get the error on importing it was actually when conducting a
search. Would this still help?
Thanks
Leon
- Original Message -
From: Nick Vincent [EMAIL PROTECTED]
To: java-user@lucene.apache.org
Sent: Wednesday, February 01, 2006 11:17 AM
Subject: RE: Memory problem
As long as you have many document in index there can many unique terms
in index.
Every 128th term(by default) is written to term info index for faster
term lookup.
This info is loaded entirely to memory when searching so this can
increase memory usage.
Note that this does not depends on number
My primary sort is by relevance score and my secondary sort is by date.
The Hits.getScore() method returns the score by 7 digits to the right of
the decimal point. Therefore, If I round to only 2 decimal points in the
display, the underlying 7 point score will be different in the sort.
Example:
You might find http://hellonline.com/blog/?p=55 helpful. It discusses
some issues with parallel distributed searches and may be helpful.
How many documents are you expecting to index? And how many unique
terms do you expect?
Chun Wei Ho wrote:
I am deploying a web application serving
I want to be able to store items and attachments such that they are treated
as a single document.
On the other hand I want to be able to store them separately; there is not
point in reindexing an attachment if I've simply changed the description.
Here's an example: A system used to track job
No virus found in this outgoing message.
Checked by AVG Free Edition.
Version: 7.1.375 / Virus Database: 267.14.25/247 - Release Date: 31/01/2006
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail:
it seems like there are a few common things that bite people over and over
again that you should check first and foremost...
1) don't use more searchers/readers then you need.
Every time you open an IndexSearcher/IndexReader resources are used which
take up memory. for an application pointed
Am I understanding your problem correctly?
If you have two hits:
Hit A score = .7876546 rounded score = .79date 2006Feb01
Hit B score = .7907536 rounded score = .79date 2006Jan01
You would like to have the hits sorted as A, B but you are getting the hits in
the order B, A
: I've not used the sorting code yet, but it looks like you have to
: provide some custom ScoreDocComparator by adding a SortField using the
: SortField(String field, SortComparatorSource comparator) constructor.
: I'm just not certain what you should specify for the field value since
: you
from your previous post about memory...Every time you sort on a field, a
FieldCache array is constructed for that field.
would that happen in this case for the field this comparator is not using?
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Chris
: from your previous post about memory...Every time you sort on a field,
: a FieldCache array is constructed for that field.
:
: would that happen in this case for the field this comparator is not using?
Ooohhh ... good question. As long as you write your own implimentation of
Does anyone have the file IndexWriter.java?
Azlan
This e-mail has been sent via JARING webmail at http://www.jaring.my
-
To unsubscribe, e-mail: [EMAIL
: Does anyone have the file IndexWriter.java?
your question is very perplexing. are you looking for the class that
comes with lucene? ...
http://svn.apache.org/viewcvs.cgi/lucene/java/trunk/src/java/org/apache/lucene/index/IndexWriter.java?rev=372350view=markup
...or are you looking for some
Hi
Friends...
I am doing
search application which has following scenario.
Architecture
==
1] Common
GUI
2] When user enter
one query then It should go to 4 searcher server (All servers are on remote
machines)
3] After searching
all 4 server should return results i.e. Hits ( All
You search all four servers by doing this (the QueryParser in this
example uses the Lucene 1.9 syntax):
Searchable[] searchables = new Searchable[]{(Searchable)
Naming.lookup(x1), (Searchable) Naming.lookup(x2), ...};
MultiSearcher multiSearcher = new MultiSearcher(searchables);
Hits hits =
One issue is that if you are splitting the index in half (for
example), getting some results from index A and some from index B,
then you need to merge the results somewhere. But the scores coming
from the two indexes are not related at all, for example, document 100
from index A has score 0.85,
Chris Lamprecht wrote:
One issue is that if you are splitting the index in half (for
example), getting some results from index A and some from index B,
then you need to merge the results somewhere. But the scores coming
from the two indexes are not related at all, for example, document 100
from
21 matches
Mail list logo
