similar to: mu-0.2, maildir indexer/searcher with xapian support

>A possible workaround (and perhaps a better approach) would be to >set BoolWeight as the weighting scheme, then feed in your score as >a weight using a PostingSource. Then it's available via get_weight() >on the MSetIterator object: > >https://getting-started-with-xapian.readthedocs.io/en/latest/advanced/postingsource.html > >You may find that's faster because

Hey all, I've been using ->add_database for a few years to tie sharded DBs together and it works great. Now, I want to be able to search across several DBs which aren't sharded, say: linux-DB, glibc-DB, freebsd-DB. I want to search for something across all of them, but prioritize results to favor one or some of those DBs over others. Is there a way to do that without reindexing? Or

Hi, I am unable to use the Searcher''s explain method. Anytime I call it, I get Segmentation Faults and it kills the process I have running my Rails site. Has anyone else had this problem? Here is some code I am trying to use it in... search = Search.create(:query => query) @quotations = [] searcher = Ferret::Search::Searcher.new("index") # FerretConfig::INDEX bq =

I''m using ferret 0.10.14 in Linux Fedora 3. When I do highlight with Index::Index#highlight, it works well. But, doing the same test with Searcher#highlight, [BUG] Segmentation fault occurred. Here''s my test code. require ''rubygems'' require ''ferret'' include Ferret::Search #searcher = Ferret::Index::Index.new(:path =>

My linux Ruby application is using Ferret 0.11.4. I created my own class IndexSearcher to contain the Searcher of multiple directories. If I do not have the searcher.close called, the end of runner/console or runner/server will pop out with system error: *** glibc detected *** irb: double free or corruption (fasttop): 0x0a51d6c0 *** ======= Backtrace: ========= /lib/libc.so.6[0x638ac1]

HI, all, I am a user of Xapian, and now I have a problem in using it. After using boolean terms to get some candidates of documents (still too much), we want sorted them by self-defined function which is used in Xapian::KeyMaker->operator(). But how can I get the serialise score in Xapian::MSetIterator object. c++ code likes this: class SortKeyMaker : public Xapian::KeyMaker { std::string

Hi. I want to learn more about ferret. So I downloaded ferret-0.10.14 and write a simple test script Only query = TermQuery.new(:content, ''program'') gives result. If I change ''program'' with ''Good'' or ''Extra'' -> no result and searching on (:title, ''Ruby'') -> no result Strange, Strange Here is the

I did some digging and found a thread from 2011 talking about how to subclass Xapian::PostingSource in order to incorporate the date or recency of a document in its weighting: http://thread.gmane.org/gmane.comp.search.xapian.general/8849/focus=8856 As in that thread, I want to be clear that I don't want to sort by date, but rather incorporate date information into the score by which I

I just started using Ferret and I successfully indexed some documents. I can search this index using the following code: index = Index::Index.new(:path => path) index.search_each("something") do |doc, score| print "##{doc} #{index[doc][''url'']} - #{score}" print "\n" end However, when I try to use Search::Searcher and QueryParser

Hi, I have a largish index [700MB] which is updated from time to time, requiring me to close and recreate the Ferret::Search::Searcher to use the latest index. My problem is that the first few searches on the new index are slow [by comparison to before the close/recreate], I''m guessing because the new index is being loaded into RAM by my OS and into Ferret as needed. I''m

On 5/2/2016 9:03 PM, Olly Betts wrote: > On Fri, Apr 22, 2016 at 12:23:15PM -0400, Alex Aminoff wrote: >> I did some digging and found a thread from 2011 talking about how to >> subclass Xapian::PostingSource in order to incorporate the date or >> recency of a document in its weighting: >> >> http://thread.gmane.org/gmane.comp.search.xapian.general/8849/focus=8856

Good afternoon I would like to ask if is possible somehow give more relevance to the recent documents in search results. I dont want to sort results according to the date, I still prefer relevance, but I would like to see recent documents with better scoring. I was trying to add search query using AND_MAYBE, which should use relevance from both subqueries, but it didnt add any benefit to the

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

Hi all, I am trying to implement a scheme where documents in an MSet will be sorted based on relevance as well as geographical distance from a given (non-fixed) point. I understand that this can be accomplished by using PostingSource in order to implement a custom weighting scheme that would combine BM25 weighting and distance. The problem is that I am using perl and PostingSource is not

Hello guys, I have an weight value which is calculated by some factor and i need to add the weight with the relevancy value of a result and sort it with that value is that possible in xapian. Thanks, VishnuKumar -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.xapian.org/pipermail/xapian-devel/attachments/20130302/9831e287/attachment-0001.html>

Newbie-alert: I'm just getting started on a new project involving a full text search requirement, and my initial investigation points to xapian being the way to go. Two questions: - eventually I'll most likely be indexing towards 50 million documents - is this reasonable to expect or attempt with xapian? - each of my documents come with a set of attributes. These are easily stored

We're using the Perl binding to access Xapian in a simple search of image metadata (title and keywords). Due to the specification for the search engine, by default we have to sort the results using a function of the search rank, age (well, newness) and popularity (rated by sales of the image). As a result, we have to fetch the complete result set and then calculate a new ranking based on

On Sat, Dec 16, 2017 at 10:11:40PM +0000, Olly Betts wrote: > Unfortunately the sort key isn't currently exposed via the public API. > It's available internally and it seems like it ought to be accessible > but there's no accessor method for it - I can add one but that won't > help for existing releases. I've added MSetIterator::get_sort_key() to master in

Hi everyone, I'm Akshay, an Information Science undergrad from Bangalore. I'm interested in Information Retrieval and I'd like to contribute to Xapian as a part of GSoC and later to feed my interests. I liked the idea of adding more weighting schemes (Project #2). I did a project last semester on Document Retrieval on Hadoop using TF-IDF and Cosine Similarity (the query had to be a

Olly, We currently use Sphinx for our website search function, but we're planning on using Xapian instead for a few of the extra features it has. Our website is written in Ruby on Rails, so of course we're using Xapian with Ruby bindings. I don't know if you're familiar with Sphinx but Sphinx allows you to pass a sort expression when you execute the search that will be evaluated