HP StorageWorks Reference Information Storage System V1.4 User Guide (T3559-96028, December 2005)

Simple word sequ
ences
To search for an ordered sequence of words, use a simple word sequence, which is a list of literal
query words (no
wildcards) separated by spaces (or other separators) and enclosed in quotes ("). A
document matches a simple word sequence if all words occur in the document in the same order, with
no intervening words.
For example, th
esequence"like a rolling stone" does not match a document with the text like a
large rolling stone because of the inter vening word large.
Proximity word sequences
You can use simple word sequences to search for words separated by separators but not by other
words. To search for d ocument words that are in an ordered sequence, but might be separated by other
words, use a proximity word sequence.
To write a proximity word sequence, use the same syntax as a simple word sequence, but append a tilde
(~) character to the second quote, and follow that with a numeric p roximity value. The proximit y value
represents the maximum numb er of other document words that can occur between any two successive
words of the sequence. A document matches a proximity word sequence if all words o ccur in the
document in the same order, with at most N intervening words, where N is the proximit y value.
For example, the sequence "bird garden stone"~3 matches any document that has these three
wordsinthisorder,withbird and garden separated by no more than three words, and garden and stone
separated by no more than three words. This sequence matches a document with the text abirdinthe
rose garden is near a stone because there are at most three words between successive sequence words.
This sequence also matches abirdgardenwithastonefor the same reason.
Simple word sequences are a special case of proximity word sequences: "..."isthesameas".
. ."~0.Anydocumentsfoundby". . ."~N are also found by ". . ."~M,whenM>N.
Boolean query expressions
You can combine words, fuzzy words, and word sequences using Boolean (logical) operators AND, OR,
and NOT (these must be uppercase). The following table describes Boolean operators, where exp, exp1,
and exp2 represents a word, fuzzy word, word sequence, o r other Boolean query expression.
Table 23 B oolean query expressions
Syntax
Matches
NOT exp
alternat
ive syntax: - exp
alternat
ive syntax: ! exp
all documents that do not match exp
exp1 OR exp2
all documents that match either exp1 or exp2
exp1 AND exp2
alternative syntax: exp1
&& exp2
alternative syntax:
exp1exp2
all documents that match both exp1 and exp2
NOTE:
ThesecondalternativesyntaxforANDindicatesthatANDisthedefaultconnectiveinqueryexpressions.
You do not need to supply AND explicitly. It is assumed if neither AND nor OR is used explicitly. For
example, the query peace quiet is equivalent to the query peace AND quiet.
Reference Information Storage System User Guide
75