Return-Path: Delivered-To: apmail-couchdb-user-archive@www.apache.org Received: (qmail 18800 invoked from network); 15 Dec 2008 09:28:54 -0000 Received: from hermes.apache.org (HELO mail.apache.org) (140.211.11.2) by minotaur.apache.org with SMTP; 15 Dec 2008 09:28:54 -0000 Received: (qmail 29310 invoked by uid 500); 15 Dec 2008 09:29:05 -0000 Delivered-To: apmail-couchdb-user-archive@couchdb.apache.org Received: (qmail 29268 invoked by uid 500); 15 Dec 2008 09:29:05 -0000 Mailing-List: contact user-help@couchdb.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: user@couchdb.apache.org Delivered-To: mailing list user@couchdb.apache.org Received: (qmail 29257 invoked by uid 99); 15 Dec 2008 09:29:05 -0000 Received: from nike.apache.org (HELO nike.apache.org) (192.87.106.230) by apache.org (qpsmtpd/0.29) with ESMTP; Mon, 15 Dec 2008 01:29:05 -0800 X-ASF-Spam-Status: No, hits=-0.0 required=10.0 tests=SPF_PASS X-Spam-Check-By: apache.org Received-SPF: pass (nike.apache.org: domain of adam.groves@gmail.com designates 209.85.132.243 as permitted sender) Received: from [209.85.132.243] (HELO an-out-0708.google.com) (209.85.132.243) by apache.org (qpsmtpd/0.29) with ESMTP; Mon, 15 Dec 2008 09:28:50 +0000 Received: by an-out-0708.google.com with SMTP id b2so1068938ana.5 for ; Mon, 15 Dec 2008 01:28:29 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:received:received:message-id:date:from:to :subject:in-reply-to:mime-version:content-type :content-transfer-encoding:content-disposition:references; bh=o9lakLt3RNJoQjxztCnHPn2mAaonaSZQg3jfb7CqhTE=; b=FAq2p1oHwoWTb9Yrnm3dIarFeFxy/s7EYjJUaewM1jYV5OfLfLdla6R6UXf8PPLXS6 iVCKJ+E0Nb3POQevgj/915w99uMz10Um3e9f+KF171TfetPu0M0pBi3Wn5RruPA6rFM7 SrRjZar1mIgcOALy1Lnx2PbgWEbbI4SwbwAPc= DomainKey-Signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:in-reply-to:mime-version :content-type:content-transfer-encoding:content-disposition :references; b=uXfelZ4zbiEFU7y0JhxtlT8FrsxplRZ8i30TkaaQS59A0XFDVVaC0+h/X9vstfYmHc is5LTHxD4COsauXzff9W/GIELBWrvYgBhGjIZibWj1bZELGGh9xDlWsjQKdGzHoEcHGX EYNtP1dWYkp+k3PXQHnTyM1XC3Yq7C8QiK9W8= Received: by 10.100.247.12 with SMTP id u12mr2678588anh.43.1229333309746; Mon, 15 Dec 2008 01:28:29 -0800 (PST) Received: by 10.101.71.8 with HTTP; Mon, 15 Dec 2008 01:28:29 -0800 (PST) Message-ID: Date: Mon, 15 Dec 2008 10:28:29 +0100 From: "Adam Groves" To: user@couchdb.apache.org Subject: Re: Multiple search criteria with ranges In-Reply-To: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 7bit Content-Disposition: inline References: <12C3EB1F-8F69-4998-BB83-F45564CC9F64@gmail.com> X-Virus-Checked: Checked by ClamAV on apache.org 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? 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: http://www.linkedin.com/in/danwoolley >> company: http://woolleyrobertson.com >> product: http://dwellicious.com >> blog: http://tzetzefly.com >> >> >> >> >