Search strategy with boolean method

Embed Size (px)

Text of Search strategy with boolean method

Search Strategy with Boolean Method

Babasaheb Bhimrao Ambedkar University, Lucknow (A Central University)

The search strategy and its prerequisites

Submitted By Sanjay Kumar BLISC_2nd SEMDept. of Library and information science

The search strategy and its prerequisites

The search strategy encompasses several steps and levels of work in information retrieval meadow Cochrane mention that the search strategy includes at least threeDecision points that a searcher has to reach three are many issues that need to be considered while formulating an appropriate search statements these are-The concepts or facets to searched and their order The feature (s) of the retrieval system concerned.

Search Strategy with Boolean MethodThe Boolean method ofsearching began with George Boole (18151864).A mathematician who created the method for symbolic logic.

Using the Boolean method, searches for research information can be simple or complex depending on the type of information and the detail desired. Boolean techniques include using the words AND, OR, and NOT in combination and with a variety of other techniques to achieve and find results.

ANDUse when searching for documents containing both words that AND separates.

ORUse when searching for documents that contain one of the terms that OR separates.

NOTUse to exclude a term from the search.

Boolean Techniques

Using AND-When using AND, a search is narrowed.AND can be used more than once in a search string; forexample: FISH AND CHIPSWill retrieve all record with the search terms Fish and CHIPS occurring in the same record.

Using ORThe Boolean OR lets a search be conducted for either or both of the keywords used in asearch. For example FISH OR CHIPS Will retrieve a;; those records where either of the search terms occur

Using NOT-The NOT operator narrows a search by excluding the keyword that is directly after the NOT. For example-FISH NOT CHIPS Will retrieve all those records where the search term FISH occurs and the same time the term CHIPS does not occurNOT should be used carefully in the search process because it may inadvertently exclude articles that may be of interest.

Limiting Searches The database in a text retrieval system comprises different fields containing different items of information. The user in his or her query formulation should be able to limit the search in one or more fields, and text retrieval software usually provides this facility. This is also known as field searching, whereby the user can specify that the search terms are to be looked for in one or more fields .

For Examples-BIRD.PET will retrieve all records where the search term BIRD occurs in the paragraph (field) named PET, and from Micro- CDS/ISIS

TruncationTruncation allows a search to be conducted for all the different forms of a word having the same common root. As an example, the truncated term COMPUT* will retrieve items on COMPUTER,COMPUTING,COMPUTATION,COMPUTE, etc.

For Example-FISHS-Will retrieve all records with words beginning with FISH ,e . g . FISH,FISHES,FISHY, FISHING , etc.