Displaying 9 results from an estimated 9 matches for "set_docid_order".
2005 Jun 29
2
Sort by docid
...39;m building a search engine for a mailing list
and I would like to return matches sorted by date; ordering by docid (since
the messages are indexed in chronological order) seems to be the simplest
way to do so, but because I'm running a probabilistic query I don't think I
can use Enquire::set_docid_order, since that will first sort by relevance
and then by docid.
I thought about adding the date as a value and then use set_sort_by_value,
but I wonder about performance (the database contains about one million
records).
Any thoughts?
Thanks,
Marco
2011 Aug 10
0
xapian enquire.set_docid_order(Xapian::Enquire::DESCENDING so slow!
i have 300 millions records and my search file like this , i want the newest 10 results that match my query , so i use boolean search and "enquire.set_docid_order(enquire.DESCENDING)" , but this method seems a little slow . when i remove "enquire.set_docid_order(enquire.DESCENDING)" it run much faster .
how can i fetch the newest 10 results as fast as possible?
search.py
#-*- coding: utf-8 -*-
import xapian
import sys,time
t1 = time.time...
2011 Aug 11
3
Fwd: Re: what is the fastest way to fetch results which are sorted by timestamp ?
...6:36 +0800
From: ??? <panjunyong at gmail.com>
To: Tim Brody <tdb2 at ecs.soton.ac.uk>
On Wed, Aug 10, 2011 at 6:39 PM, Tim Brody <tdb2 at ecs.soton.ac.uk> wrote:
> Hi,
>
> In terms of the enquiry, do you mean this?:
> set_weighting_scheme(Xapian::BoolWeight());
> set_docid_order(Xapian::Enquire::DESCENDING);
>
>
In my test, it is more than 10 times slower than :
set_weighting_scheme(Xapian::BoolWeight());
set_docid_order(Xapian::Enquire::ASCENDING);
Why?
What's the most efficient process to build multiple Xapian indexes? Can
> the "relevance" inde...
2007 Apr 11
1
Deprecation Policy
When going through the xapian bindings yesterday, I noticed that several
of the methods were not wrapped for Ruby because they were deprecated at
the time the ruby bindings were created. I filed a bug (#126) saying
that they should be removed entirely, which led to the suggestion from
Olly that it would be good to make a semi-formal policy about
deprecating features. I've written such a
2018 Mar 30
2
sorting large msets
Hello, is there a way to optimize sorting by certain values
for queries which return a huge amount of results?
For example, I just want a simple query that gives me the 200
most recent emails out of millions. The elapsed time for
get_mset increases as the number of documents ($n * 2000)
increases.
I suppose I could store a pre-sorted set using SQLite or
similar. Thanks in advance for any
2018 Mar 31
2
sorting large msets
...000 makes it roughly 0.750s.
> If you do want faster, the simplest solution is to arrange that the
> document id order matches the document age order, and then you can
> specify to just sort by that:
>
> $enquire->set_weighting_scheme(new Xapian::BoolWeight());
> $enquire->set_docid_order(Search::Xapian::ENQ_DESCENDING);
That would be tricky with emails being delivered out-of-order;
not to mention old archives being imported + indexed.
> That's more like 0.053 seconds for 1.4.5 and 0.021 seconds for git
> master with glass.
>
> The reverse order (ENQ_ASCENDING) is...
2018 Mar 30
0
sorting large msets
...e sure you're at least
using the latest 1.4.x release.
If you do want faster, the simplest solution is to arrange that the
document id order matches the document age order, and then you can
specify to just sort by that:
$enquire->set_weighting_scheme(new Xapian::BoolWeight());
$enquire->set_docid_order(Search::Xapian::ENQ_DESCENDING);
That's more like 0.053 seconds for 1.4.5 and 0.021 seconds for git
master with glass.
The reverse order (ENQ_ASCENDING) is really fast - about 0.0001 seconds.
This is because in that case we can just stop once we've found 200
matches.
Cheers,
Olly
2018 Apr 03
0
sorting large msets
...> > If you do want faster, the simplest solution is to arrange that the
> > document id order matches the document age order, and then you can
> > specify to just sort by that:
> >
> > $enquire->set_weighting_scheme(new Xapian::BoolWeight());
> > $enquire->set_docid_order(Search::Xapian::ENQ_DESCENDING);
>
> That would be tricky with emails being delivered out-of-order;
> not to mention old archives being imported + indexed.
This was the trick we used with search.gmane.org. We mostly ignored
the archive import issue there, which wasn't ideal but a pe...
2011 Aug 09
3
what is the fastest way to fetch results which are sorted by timestamp ?
what is the fastest way to fetch results which are sorted by timestamp ?
i want to use xapian as my search engine , use add_boolean_term(something) and add_value(0,sortable_serialise(get_timestamp())) to a doc.
search through enquire.set_weighting_scheme(xapian.BoolWeight()) and enquire.set_sort_by_value(0,True) to ensure that the results are sorted by the timestamp.
This method is ok , but