zer is the exact same analyzer I'm using during
indexing. It's a PerFieldAnalyzerWrapper. The specific analyzer for the
numeric fields is the one I mentioned above (StandardAnalyzer).
The query used is:
indexSearcher.search( query, 10 );
Thank you,
Tony Schwartz
ing indexing. It's a PerFieldAnalyzerWrapper. The
> specific analyzer for the numeric fields is the one I mentioned above
> (StandardAnalyzer).
>
>
>
> The query used is:
>
> indexSearcher.search( query, 10 );
>
>
>
> Thank you,
>
>
>
> Ton
Hello,
Is there a definitive (or at least very good) documentation or video on
Lucene faceting? I find the existing docs and samples out-dated and
inaccurate. As such, I'm having trouble getting my mind around how it works
to ensure I index my documents in such a way as to allow faceting. I'
Hello,
I would like to store a field for a document in the index without any
compression. The field is already a compressed byte[]. The application
already uses ZStd and it’s very well optimized for this data. It doesn’t seem
Lucene will allow me to store the field without compressing it
org/apache/lucene/index/SortingStoredFieldsConsumer.java#L78
On Tue, Nov 14, 2023 at 10:11 PM Tony Schwartz
wrote:
> Hello,
>
>
>
> I would like to store a field for a document in the index without any
> compression. The field is already a compressed byte[]. The
> applica
m/apache/lucene/blob/main/lucene/demo/src/java/org/apache/lucene/demo/facet/SimpleSortedSetFacetsExample.java
On Tue, 14 Nov 2023 at 18:51, Tony Schwartz wrote:
> Hello,
>
>
>
> Is there a definitive (or at least very good) documentation or video
> on Lucene faceting? I find the existing docs and sa
ts with respect to
> each of the labels in the path (e.g. counts per year or counts per
> month of given year).
>
>
> Stefan
>
>
> [1] https://github.com/apache/lucene/pull/12817
>
> On Wed, 15 Nov 2023 at 01:01, Tony Schwartz wrote:
>
> > I have a lot of q
"LhStoredFields",
NO_COMPRESSION,
128 * 1024,
1,
10
);
@Override
public StoredFieldsFormat storedFieldsFormat() {
return storedFieldsFormat;
}
}
Tony Schwartz
On Tue,
you insert a new date, update the min/max if
needed. This
data would reside outside the index of course.
Tony Schwartz
[EMAIL PROTECTED]
"What we need is more cowbell."
> I have an index with a date field. I want to quickly find the minimum
> and maximum values in the index
It appears you have answered your own question. The problem seems to be in
your code.
Without seeing it though, how can we help?
Tony Schwartz
[EMAIL PROTECTED]
"What we need is more cowbell."
> Hi,
> I'm currently using Lucene on a java web site; I've a class c
I don't see a way to do this today. How many different hosts are there? If
it's small, you could execute the query that many times only grabbing the
top 3 results from each. Otherwise, you'll have to use brute force with a
HitCollector and read the field for each doc. Good luck!
th:/people/tony and text:property
b. now when someone wants to search for property in /people/tony,
you use the terms: text:property and path:/people/tony
Tony Schwartz
[EMAIL PROTECTED]
"We're going to need a lot more cowbell."
-Original Message-
From: kambiz
uld
remove the huge segment to free disk space. I'm concerned the segment will
never be
deleted.
Tony Schwartz
[EMAIL PROTECTED]
There are 10 types of people in this world. Ones that understand binary and
ones that
don't.
Yes, you need to use a single searcher instead of creating one each time.
Tony Schwartz
[EMAIL PROTECTED]
"We're going to need a lot more cowbell."
-Original Message-
From: MariLuz Elola [mailto:[EMAIL PROTECTED]
Sent: Wednesday, July 06, 2005 1:26 PM
To: java-user@lu
Don't do that. Don't use a filter for paging. Just use the Hits object and
get from it only the records applicable for that page.
Tony Schwartz
[EMAIL PROTECTED]
"We're going to need a lot more cowbell."
-Original Message-
From: Harini Raghavan [mailt
ory
friendly" way. Since you only have 2 million records, I think lucene, out
of the box, is exactly what you're looking for. It will perform extremely
well.
Tony Schwartz
[EMAIL PROTECTED]
"We're going to need a lot more cowbell."
-Original Message-
From:
to work to index the data, you will want
to give
lucene plenty of memory to work with.
Tony Schwartz
[EMAIL PROTECTED]
> Hello! I am using Lucene 1.4.3
>
> I'm building a Lucene index, that will have about 25 million documents
> when it is done.
> I'm adding 250,000 at a
ring on every search.
Again, these features will only be useful for indexes that have relative date
to docid
correlation (which I believe happens to be very common).
Tony Schwartz
[EMAIL PROTECTED]
"What we need is more cowbell."
> Hi all,
> I am new user of lucene. This query is p
urned me in the past. I am going to start
working on and
testing a solution to this, but was wondering if anyone had already messed with
it or
had any ideas up front?
Thanks,
Tony Schwartz
[EMAIL PROTECTED]
From: John Wang <[EMAIL PROTECTED]>
Subject: Re: OutOfMemoryError on
Is this a viable solution?
Doesn't this make sorting and filtering much more complex and much more
expensive as well?
Tony Schwartz
[EMAIL PROTECTED]
> On Wednesday 17 August 2005 22:49, Paul Elschot wrote:
>> > the index could potentially be huge.
>> >
>> >
cial" (i.e. dates)
or some
such thing.
Tony Schwartz
[EMAIL PROTECTED]
"What we need is more cowbell."
> You can still have the complete date as a separate field, and sort or
> filter by it, just don't use this field in your query.
>
> Aviran
> http://w
Aha, it's not initially clear, but after looking at it more closely, I see how
it works
now. This is very good to know.
Tony Schwartz
[EMAIL PROTECTED]
> Tony Schwartz wrote:
>> What about the TermInfosReader class? It appears to read the entire term
>> set for t
22 matches
Mail list logo
