Boolean search

Also found in: Dictionary, Thesaurus, Medical, Legal, Acronyms.

Boolean search

[′bü·lē·ən ′sərch]
(computer science)
A search for selected information, that is, information satisfying conditions that can be expressed by AND, OR, and NOT functions.

Boolean search

(information science)
(Or "Boolean query") A query using the Boolean operators, AND, OR, and NOT, and parentheses to construct a complex condition from simpler criteria. A typical example is searching for combinatons of keywords on a World-Wide Web search engine.


car or automobile

"New York" and not "New York state"

The term is sometimes stretched to include searches using other operators, e.g. "near".

Not to be confused with binary search.

See also: weighted search.

Boolean search

A search for data that meets several criteria by using the Boolean operators AND, OR and NOT (see Boolean logic). For example, the request: "Search for all Spanish and French speaking employees who have MBAs" would be written as follows if the query were expressed on a command line. Spanish and French are placed in parentheses in order to be treated as a single item.
list for degree="MBA" and(language="Spanish" or language="French")

In the following example, the parentheses are missing, and the query is incorrect. The AND ties MBA and Spanish together; therefore, people who speak Spanish and have an MBA would be selected, which is correct. However, the OR separates French from the rest of the query, and anyone speaking French, no matter which degree they held, would also be selected.
list for degree="MBA" andlanguage="Spanish" or language="French"

A Google "Advanced" (Boolean) Search
Searching text on Web pages is much less exact than querying records in a database, and this search actually produced 10 million results. However, the Boolean concept does still apply. In this Google "Advanced Search," the OR is stated clearly, but the AND and NOT operators are there nonetheless.
References in periodicals archive ?
Expanded Search Bar: Search tool supports full Boolean search expressions and allows recruiters to run searches by keyword, job title, region and company from anywhere in the site.
Through a development alliance with Dallas-based Pure Discovery, LexisNexis has become the first provider of legal information services to integrate the power of semantic search technology with familiar Boolean search technology, giving the user greater control over the patent research process via a simple, streamlined user interface that matches their typical daily workflow.
New Boolean Search Capabilities - Gives clients the ability to perform searches using conjunctions such as and, or and not.
Advanced Boolean Search - Customer can perform sophisticated queries with over 10 special query terms, including Boolean AND, OR, and NOT searches
The suite includes Boolean search engines to find appropriate ICD-9 and CPT(R) codes, and E/M Auditor reports for easy compliance verification.