Google's search Hoffman codes for the most common case: ANDing. Every search term you type in a box is automatically ANDed together. Only ORs are explicit and bind tightly like a binary operator. Consider that your search capabilities need not be expressively complete due to the potential lack of need. That is, what are the odds 1) your users need that type of query 2) they're capable of learning, retaining, and using that vocabulary.
On Tue, Nov 25, 2008 at 4:16 PM, Vishal Iyer <[EMAIL PROTECTED]> wrote: > This is a part Computer Science question, part Design question (apologies > if > some of the logic doesn't make sense) > So, I need to design a search interface that would eventually spit out a > boolean query without typing it out. > For Eg: > D= Data Field > > D1 AND D2 OR D3 AND D4 > (D1 OR D2) AND (D3 OR D4) > D1 AND (D2 OR D3) AND D4 > > To put it in context, assume its a library search and the user wants to > search books by Author A OR Author B that have Keywords A AND Keywords B > and > are published between a certain date range. Is anyone aware of design > patterns for such an interface. > > -Vishal > ________________________________________________________________ > Welcome to the Interaction Design Association (IxDA)! > To post to this list ....... [EMAIL PROTECTED] > Unsubscribe ................ http://www.ixda.org/unsubscribe > List Guidelines ............ http://www.ixda.org/guidelines > List Help .................. http://www.ixda.org/help > ________________________________________________________________ Welcome to the Interaction Design Association (IxDA)! To post to this list ....... [EMAIL PROTECTED] Unsubscribe ................ http://www.ixda.org/unsubscribe List Guidelines ............ http://www.ixda.org/guidelines List Help .................. http://www.ixda.org/help
