Hi everyone,
There has been a lot of discussion regarding Lucene+NFS pitfalls. I'm
not sure how to proceed with a more distributed operation.
I'm trying to take the indexing load off of our search server. I can do
this either by building a new server which hosts the Indexer and the
Index, or a se
Hi Everyone,
I have some code that dynamically creates a Boolean query designed to
work as a filter. After the query runs I end up with this filter.
Filter: QueryWrapperFilter(+(-SourceID:100)
+spanNear([ArticleContent:nuclear, ArticleContent:proliferation], 30,
false))
My expectation is that
urse it, and do it this way in the end..
On Tue, Apr 21, 2009 at 12:56 PM, David Seltzer
wrote:
> That certainly seems like the simple way to solve the problem. I was
> just wondering if I was overlooking a simple way to do this via
web.xml
> servlet-mapping. I was trying to
f the hassle of dealing with jndi / contexts / spring or
SingleTons
On Tue, Apr 21, 2009 at 12:01 PM, David Seltzer
wrote:
> Hi All,
>
> Sorry for the slightly off-topic question, but I've just run into a
gap
> in my understanding of Servlet programming.
>
> The question: Is
bably unrealistic.
The stuff you want to achieve normally works by either placing objects
into the HTTP session (user-bound) or attaching them to your
application context (application-bound).
Regards,
Mindaugas
On Tue, Apr 21, 2009 at 5:01 PM, David Seltzer wrote:
> Hi All,
>
> Sorry fo
Hi All,
Sorry for the slightly off-topic question, but I've just run into a gap
in my understanding of Servlet programming.
The question: Is it possible for two servlets to share access to an
instance of IndexSearcher or an IndexReader? I'm thinking about setting
up a Search servlet to provide XM
ent/how many in average?
INDEXORDER means document number.
MultiSearcher works also fine:
If you have one index for each year and for each of this indices the
indexorder in order of date, also the MultiSearcher will have correct
INDEXORDER:
Take a look to the variable "int[] starts" in Mult
ost common sort
case.
hope this helps,
Robert
On Mon, Apr 20, 2009 at 10:12 AM, David Seltzer wrote:
> Hi Karsten,
>
> My index contains about 100M documents, and I'm trying to count results
> on around 300 facets. At the moment I'm keeping a set of cached facet
> bitsets
er document/how many in average?
Possible
http://www.nabble.com/Taxonomy-in-Lucene-td20929487.html
is also interesting for you.
Best regards
Karsten
David Seltzer wrote:
>
> I have a set of indexes, each index contains a month's worth of
> Articles. I need to be able to sear
itCollector and sort by a field?
2) Is using BitSets the wrong way to quickly generate facet counts? I've
read about DocIDSets, but I'm not sure how to use them in the same way.
(I'm basing my faceting technique on Sujit Pal's article
http://sujitpal.blogspot.com/2007/04/lucene-
have to mark the field as Field.Store.YES in order to see
that field when you retrieve the doc at search time.
You'll then be able to retrieve the string value.
Mike
On Thu, Apr 2, 2009 at 10:45 AM, David Seltzer wrote:
> Hi All,
> I have a document with a field called "Text
Hi All,
I have a document with a field called "TextTranscript". Its created
using the following command:
myDoc.add(new Field("TextTranscript", sTranscriptBody, Field.Store.NO,
Field.Index.TOKENIZED));
I'm then trying to retrieve the TokenStream by pulling the field.
Field fTextTranscript = lucDo
Hi all,
I'm trying to figure out how to use SpanNearQuery.getSpans(IndexReader)
when working with a result set from a query.
Maybe I have a fundamental misunderstanding of what an IndexReader is -
I'm under the impression that it's a mechanism for sequentially
accessing the documents in an
sage-
From: Erik Hatcher [mailto:[EMAIL PROTECTED]
Sent: Tuesday, March 20, 2007 4:03 PM
To: java-user@lucene.apache.org
Subject: Re: Sort Performance Question
Are you using a cached IndexSearcher such that successive sorts on
the same field will be more efficient?
Erik
On Mar 20, 200
Hi All,
I have a sort performance question:
I have a fairly large index consisting of chunks of full-text
transcriptions of television, radio and other media, and I'm trying to
make it searchable and sortable by date. The search front-end uses a
parallelmultisearcher to search up to three
15 matches
Mail list logo