incubator-couchdb-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Paul Davis" <>
Subject Re: Multiple search criteria with ranges
Date Mon, 15 Dec 2008 18:26:57 GMT
On Mon, Dec 15, 2008 at 4:28 AM, Adam Groves <> wrote:
> Hi Paul,
> I noticed you were working on various search solutions for CouchDB.
> Your EFTI project on github specifically caught my attention. Is it on
> ice at the moment?

More or less. I haven't pursued it much beyond discussing ideas for it
on IRC. Generally I'm waiting for a better picture on how the Erlang
plugin interface will pan out. The biggest questions for me are on how
to match the code with other aspects of CouchDB. Replication in
particular is a bit of a stumbling block in terms of how to pursue an
actual implementation.


> Kind regards
> Adam Groves
> 2008/12/14 Paul Davis <>:
>> Faceted search like this isn't best supported directly in CouchDB
>> itself. Its a feature that's been discussed for implementation but as
>> of yet there aren't any concrete plans on what that implementation
>> would look like.
>> That being said, there's nothing keeping you from using an external
>> indexer such as Solr that supports faceted searching like you're
>> describing.
>> Also, patches are welcome :D
>> Paul Davis
>> On Sun, Dec 14, 2008 at 12:06 PM, Dan Woolley <> wrote:
>>> I'm researching Couchdb for a project dealing with real estate listing data.
>>>  I'm very interested in Couchdb because the schema less nature, RESTful
>>> interface, and potential off-line usage with syncing fit my problem very
>>> well.  I've been able to do some prototyping and search on ranges for a
>>> single field very successfully.  I'm having trouble wrapping my mind around
>>> views for a popular use case in real estate, which is a query like:
>>> Price = 350000-400000
>>> Beds = 4-5
>>> Baths = 2-3
>>> Any single range above is trivial, but what is the best model for handling
>>> this AND scenario with views?  The only thing I've been able to come up with
>>> is three views returning doc id's - which should be very fast - with an
>>> array intersection calculation on the client side.  Although I haven't tried
>>> it yet, that client side calculation worries me with a potential document
>>> with 1M records - the client would potentially be dealing with calculating
>>> the intersection of multiple 100K element arrays.  Is that a realistic
>>> calculation?
>>> Please tell me there is a better model for dealing with this type of
>>> scenario - or that this use case is not well suited for Couchdb at this time
>>> and I should move along.
>>> Dan Woolley
>>> profile:
>>> company:
>>> product:
>>> blog:

View raw message