similar to: goodbye QuartzBufferedTable

Quartz has a QuartzDiskTable class which is a thin wrapper for a pair of Btree objects (or just one if the table is opened readonly): http://www.xapian.org/docs/sourcedoc/html/classQuartzDiskTable.html There's also a QuartzBufferedTable class which adds memory buffering of changes to this: http://www.xapian.org/docs/sourcedoc/html/classQuartzBufferedTable.html However, as of 0.8.0 we now

I've uploaded Xapian 1.0.7, which as usual you can download from: http://xapian.org/download This release fixes an assortment of bugs, and improves efficiency in a few cases. It's intended to be a relatively safe incremental update over 1.0.6. For a more detailed overview see: http://trac.xapian.org/wiki/ReleaseOverview/1.0.7 The full lists of user-visible changes are linked to from

Olly Betts <olly at survex.com> wrote: > On Fri, Feb 07, 2020 at 09:33:08PM +0000, Eric Wong wrote: > > 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. > >

On Thu, 25 Feb 2016 02:24:51 +0000, Olly Betts <olly at survex.com> wrote: > On Wed, Feb 24, 2016 at 04:30:55PM +0100, Eric J wrote: >> On Wed, 24 Feb 2016 03:17:35 +0000, Olly Betts <olly at survex.com> wrote: >>>On Mon, Feb 22, 2016 at 12:26:27PM +0100, Eric wrote: >>>> % package require xapian 1.0.0 >>>> 1.2.18 >>> >>>

On Sun, Mar 03, 2019 at 05:13:09PM +0000, James Aylett wrote: > On 3 Mar 2019, at 17:01, Olly Betts <olly at survex.com> wrote: > > > I suspect what's going on here is that bootstrap will by default > > download, build and install (into a subdirectory of the build tree) any > > of the autotools for which suitable versions aren't already installed. > >

Hi, I configured XAPIAN 1.0.1 and OMEGA 1.0.1. on my development machine (first removed the old ones). I recreated my databases (both quartz and flint) and tried to run original queries against the databases created by the new versions. I'm getting empty result sets from OMEGA. If I use the delve tool I actually see that the records are created fine. No log files are written as far as I

As Olly has already pointed out the 2012 branch is not merged. I think there are some compilation errors in the branch. The code in branch is better refactored. The Ranker and FeatureManager classes are well defined and implemented. Parth. On Wed, Sep 25, 2013 at 9:02 AM, Olly Betts <olly at survex.com> wrote: > On Tue, Sep 24, 2013 at 08:34:10PM +0800, jiangwen jiang wrote: >

Olly Betts <olly at survex.com> writes: > A better option for this is probably a FieldProcessor - you set one for > a prefix and the it gets passed the value and returns a Query object > for it. E.g. in lua (where you can just pass an anon function for the > FieldProcessor - we ought to support C++11 lambdas for such things): [snip] > To achieve this with synonyms in a

Incidentally, if you're actually aiming to match different forms of a name (Peter vs Pete, Ann vs Anne vs Annette) then you might find the synonym feature a better option than wildcarding. You'd need to give it a list of names to treat as synonyms, but it should have many fewer false positives, and can also handle cases which aren't just a substring - e.g. Robert vs Rob vs Bob vs

Olly, the process size does stay constant with the results from one query set, but running other queries will cause it to grow (once). Is it possible that this is a bug with the SWIG python bindings? On Fri, Jul 5, 2013 at 6:18 AM, Olly Betts <olly at survex.com> wrote: > On Wed, Jul 03, 2013 at 03:59:21PM -0400, Jeff Rand wrote: > > Run the following code and monitor the

Olly Betts <olly at survex.com> wrote: > On Fri, Mar 30, 2018 at 05:21:43PM +0000, Eric Wong wrote: > > Hello, is there a way to optimize sorting by certain values > > for queries which return a huge amount of results? > [...] > > $enquire->set_sort_by_value_then_relevance(0, 1); > > If you're just wanting the 200 newest, it'll be faster not to

Okay thanks, how do I make a patch and submit one? Do you have a link for the same? Thanks&Regards, Hemant Kumar Singh On Apr 10 2019, at 4:13 am, Olly Betts <olly at survex.com> wrote: > On Tue, Apr 09, 2019 at 04:07:58PM +0530, Hemant Kumar Singh wrote: > > The GSoC guide section recommends reading of the hacking. > > > I don't actually see a reference to

I seem to be seeing cases where I call db.delete_document(somedocid) with no error, then flush() and delete the database object, but the document is still there after process exit. The write lock is normally deleted, so it appears that the database close finished normally. If I then then call delete_document(somedocid) from another command/process, this time it goes away. I've been seeing

On Wed, 24 Feb 2016 03:17:35 +0000, Olly Betts <olly at survex.com> wrote: >On Mon, Feb 22, 2016 at 12:26:27PM +0100, Eric wrote: >> On Sun, 21 Feb 2016 22:33:22 +0000, Olly Betts <olly at survex.com> wrote: >>> On Sun, Feb 21, 2016 at 02:15:25PM +0100, Eric J wrote: >>>> I discovered, while trying to set up Tcl bindings for Notmuch >>>>

On Sun, Mar 03, 2019 at 04:20:21PM +0000, James Aylett wrote: > On the documentation build, I'm not sure what's going on. I'm on > Debian stable here, and I don't have texinfo installed. ./bootstrap > completes successfully for me. My understanding of makeinfo is that > it's not actually needed for Xapian, and the build system shouldn't > complain about its

Olly Betts <olly at survex.com> wrote: > The report you show seems to be just the time take by each function > directly rather than including functions it calls. It looks like a lot > of the time is spent in cursor movement, as totalling up things that > seem like they'd be due to that I quickly get to 40+% but it's hard > to tell if that's about the actual total

This might be a little late but I was engaged in my university examinations. Moreover, I have an exam even today so apologies for the delay. Also, I had to change my project from weighting schemes to improve to improve estimated total number of results as weighting schemes was demanding a lot of time going through it. I would really appreciate if you could review my proposal asap.

On Mon, Mar 27, 2023 at 11:22:09AM +0000, Eric Wong wrote: > Olly Betts <olly at survex.com> wrote: > > 10 seems too long. You want the mean word length weighted by frequency > > of occurrence. For English that's typically around 5 characters, which > > is 5 bytes. If we go for +1 that's: > > Actually, 10 may be too short in my case since there's a

On Wed, Mar 16, 2016 at 12:09:01AM +0530, Amanda Jayanetti wrote: > Seems like it takes a lot of time for 'proof of enrollment' document to get > processed. Will upload the proposal as soon as it gets accepted. You should be able to upload a proposal while the proof of enrollment is still awaiting review. Cheers, Olly

Hi Olly I will try to work on : http://trac.xapian.org/wiki/GSoCProjectIdeas#Project:LearningtoRank I will be taking a Machine Learning class the next semester and I hope that this project will help me supplement my learning in Machine Learning and also gain a bit of knowledge in IR. If you can give me ideas on how to get around with the code for LTR project, it will be awesome. I can look at