Faceted boolean query

Faceted boolean query

A faceted boolean query is a query of paranthetical OR statements linked together by AND boolean operators.

For example, the query (1 OR 2) AND (3 OR 4) would match any combination of either the numbers 1 or 2 and 3 or 4. The following sets of numbers would satisfy this: [1,3] , [1,4] , [2,3] and [2,4] .

Faceted boolean querys are especially helpful in information retrieval such as search engine querying. For example, the following query will return many documents on the subject of electronic voting in general: "(electronic OR computerized OR DRE) AND (voting OR elections OR election OR balloting OR electoral)"

External links

* [http://www.google.com/search?num=50&hl=en&lr=&ie=ISO-8859-1&oe=ISO-8859-1&c2coff=1&q=%28electronic+OR+computerized+OR+DRE%29+AND+%28voting+OR+elections+OR+election+OR+balloting+OR+electoral%29&btnG=Search This query on Google] .

Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Web search query — A web search query is a query that a user enters into web search engine to satisfy his or her information needs. Web search queries are distinctive in that they are unstructured and often ambiguous; they vary greatly from standard query languages …   Wikipedia

  • OpenSearchServer — Developer(s) Emmanuel Keller Initial release Jun 08, 2008 Written in Java, C/C++, PHP Operating system Cross platform …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”