⊿ Point. {R} Glossary. ◢ Keyword: B. ▰ Sources. 〓 Books [B] ◥ University. {q} PhD. {tr} Training. {R} L' Review. [B] PhD. ⚫ USA. ↂ EndNote. ☝️ Machi (2016) Boolean Search. Boolean Logic. Boolean algebra was introduced by George Boole in his first book The Mathematical Analysis of Logic (1847), and set forth more fully in his An Investigation of the Laws of Thought (1854).[1] According to Huntington the term "Boolean algebra" was first suggested by Sheffer in 1913.[2] Boolean algebra has been fundamental in the development of digital electronics, and is provided for in all modern programming languages. It is also used in set theory and statistics.[3] History[edit] In the 1930s, while studying switching circuits, Claude Shannon observed that one could also apply the rules of Boole's algebra in this setting, and he introduced switching algebra as a way to analyze and design circuits by algebraic means in terms of logic gates.
Shannon already had at his disposal the abstract mathematical apparatus, thus he cast his switching algebra as the two-element Boolean algebra. Values[edit] Operations[edit] Basic operations[edit] The basic operations of Boolean algebra are as follows. J. Boolean search. Search using the full text of documents In text retrieval, full-text search refers to techniques for searching a single computer-stored document or a collection in a full-text database. Full-text search is distinguished from searches based on metadata or on parts of the original texts represented in databases (such as titles, abstracts, selected sections, or bibliographical references).
In a full-text search, a search engine examines all of the words in every stored document as it tries to match search criteria (for example, text specified by a user). Full-text-searching techniques appeared in the 1960s, for example IBM STAIRS from 1969, and became common in online bibliographic databases in the 1990s. [verification needed] Many websites and application programs (such as word processing software) provide full-text-search capabilities. The indexer will make an entry in the index for each term or word found in a document, and possibly note its relative position within the document. [edit]