thanks Adrien for the explanation, it's really much appreciated.
I have written a quick test to reproduce the slower sorting with numeric
DV. In this test case, it happens only when reverse sorting.
About the sorting by page i mentioned, it was due to a mistake in our
testcase, sorry about that.
On Wed, Jul 31, 2013 at 2:51 PM, Nicolas Guyot sfni...@gmail.com wrote:
I have written a quick test to reproduce the slower sorting with numeric DV.
In this test case, it happens only when reverse sorting.
Right - I bet your numeric field is relatively ordered in the index.
When this happens,
ok i see.
I tried the same test with randomized values on the numeric DV and now the
search speed is low and constant.
It's not gonna solve our issue since the values are relatively ordered in
our case but it's good to know.
On Wed, Jul 31, 2013 at 12:05 PM, Yonik Seeley yo...@lucidworks.com
Hi,
we are using some of the latest features of lucene for sorting which are
very cool but we are facing some issues with the numerical sort:
We need two kinds of sort: numerical and lexical.
For the lexical we are using SortedDocValuesField and for the numerical we
use NumericDocValuesField
Hi,
On Tue, Jul 30, 2013 at 8:19 PM, Nicolas Guyot sfni...@gmail.com wrote:
When sorting numerically, the search seems to take a bit of a while
compared to the lexically sorted search.
Also when sorting numerically the result is sorted within each page but no
globally as opposed to the
On Wed, 2010-08-25 at 07:16 +0200, Shelly_Singh wrote:
I have 1 bln documents to sort. So, that would mean ( 8 bln bytes == 8GB RAM)
bytes.
All I have is 8 GB on my machine, so I do not think approach would work.
This implies that your numeric value can be more than 2 billion. Are you
sure
It is also possible to sort by function. This allows you to avoid
storing an array of 1 int for all documents. It is slower than the raw
Lucene sort.
On Wed, Aug 25, 2010 at 1:46 AM, Toke Eskildsen t...@statsbiblioteket.dk
wrote:
On Wed, 2010-08-25 at 07:16 +0200, Shelly_Singh wrote:
I have 1
:18 PM
To: java-user@lucene.apache.org
Subject: Re: Sorting a Lucene index
You haven't yet told us how many documents you're talking about here, so
it's
hard to have a good idea of what solutions are. That said, I'd just try
sorting first.
The sorting cache size will be something like (sizeof(int
...@infosys.com
Phone: (M) 91 992 369 7200, (VoIP)2022978622
-Original Message-
From: Anshum [mailto:ansh...@gmail.com]
Sent: Wednesday, August 18, 2010 5:21 PM
To: java-user@lucene.apache.org
Subject: Re: Sorting a Lucene index
Hi Shelly,
The search results so returned are sorted either
To: java-user@lucene.apache.org
Subject: Re: Sorting a Lucene index
Hi Shelly,
The search results so returned are sorted either by relevance, index order,
stored field, or custom order.
As you are saying that you would not be able to maintain the index order,
you would have to do the sort
Hi,
I have a Lucene index that contains a numeric field along with certain other
fields. The order of incoming documents is random and un-predictable. As a
result, while creating an index, I end up adding docs in random order with
respect to the numeric field value.
For example, documents may
Hi Shelly,
The search results so returned are sorted either by relevance, index order,
stored field, or custom order.
As you are saying that you would not be able to maintain the index order,
you would have to do the sort at run time.
Sorting on a stored field is not costly and you may use it
: shelly_si...@infosys.com
Phone: (M) 91 992 369 7200, (VoIP)2022978622
-Original Message-
From: Anshum [mailto:ansh...@gmail.com]
Sent: Wednesday, August 18, 2010 5:21 PM
To: java-user@lucene.apache.org
Subject: Re: Sorting a Lucene index
Hi Shelly,
The search results so returned
15 sep 2008 kl. 14.08 skrev Dragan Jotanovic:
I made simple Similarity implementation:
public float tf(float arg0) {
return 1f;
}
Why do you touch the term frequency? Is that prehaps unrelated to
what's discussed in this thread?
karl
To: java-user@lucene.apache.org
Subject: Re: Sorting in lucene through Document boosting
15 sep 2008 kl. 14.08 skrev Dragan Jotanovic:
I made simple Similarity implementation:
public float tf(float arg0) {
return 1f;
}
Why do you touch the term frequency? Is that prehaps
/Sorting-using-Lucene-search-query-syntax-tf3023249.html#a8398063
Sent from the Lucene - Java Users mailing list archive at Nabble.com.
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
On Jan 16, 2007, at 3:22 PM, moraleslos wrote:
Is it possible to specify a sort on a field using standard Lucene
search
query syntax? I was not able to find it in the query doc so I
assume not
but I would like to make sure before going on to use the API.
Thanks in
advance!
No, the
I am curious why the character / sorts before the space.
For example,
Apple/banana is good for you.
Sorts before
Apple banana is good for you
Is there something I can do to make it sort correctly?
Regards,
Bob
-
To
On 3/13/06, Bob Cheung [EMAIL PROTECTED] wrote:
I am curious why the character / sorts before the space.
For example,
Apple/banana is good for you.
Sorts before
Apple banana is good for you
Are you sure that the field is untokenized, and that you are sorting
in the correct direction?
To: java-user@lucene.apache.org
Subject: Re: Sorting in Lucene
On 3/13/06, Bob Cheung [EMAIL PROTECTED] wrote:
I am curious why the character / sorts before the space.
For example,
Apple/banana is good for you.
Sorts before
Apple banana is good for you
Are you sure that the field is untokenized
->
RE: Sorting in lucene through Document boosting
java-user
-- Thread --
-- Date --
<!--
google_ad_client = "pub-7266757337600734";
google_alternate_ad_url = "http://www.mail-
->
Re: Sorting in lucene through Document boosting
java-user
-- Thread --
-- Date --
<!--
google_ad_client = "pub-7266757337600734";
google_alternate_ad_url = "http://www.mail-
->
RE: Sorting in lucene through Document boosting
java-user
-- Thread --
-- Date --
<!--
google_ad_client = "pub-7266757337600734";
google_alternate_ad_url = "http://www.mail-
23 matches
Mail list logo