Skip to main content

Posts

Showing posts from April, 2009

SIMPLE BOOLEAN SEARCH FOR TECHNICAL RECRUITERS

This Boolean search strategies is being offered for free to enable technical recruiters to more effectively mine the Monster resume databases. CAUTION: The concepts below also apply to other databases, but NOT all Boolean search engines were created equally. Some require that AND/OR be in all caps (Monster do not). Some don’t even use ‘and/or’, but use ‘+/-’ instead. I need to really stress this point, I. THE ROLE OF PARENTHESES IN BOOLEAN SEARCHES It makes a difference how you group the numbers below by putting in parentheses: 1+2x2=$5 million? $6 million? 1+(2x2)=5 Here we did the “multiply” first, and then the “add”…..Multiply is similar to “and” (1+2)x2=6 Here we did the “add” first, and then the multiply. ”Addition” is similar to “or” Parentheses will help us group search terms for effective searches II. EXAMPLES OF WRITING A BOOLEAN EQUATION JavaScript or C++ and SQL ?????, without parentheses or a ‘rule’ that says do “and” first & then “or”, or vice versa JavaScri