HP StorageWorks Reference Information Storage System V1.1 User Guide (February 2005)

Query expression syntax and matching Chapter 6: Query syntax and matching
HP StorageWorks Reference Information Storage System User Guide, February 2005 6-9
matches a proximity word sequence if all the words occur in the document in
the same order, with at most N intervening words, where N is the proximity
value.
For example, the sequence
“bird garden stone”~3 will match any document that
has these three words in this order, with
bird and garden separated by no more
than three words, and
garden and stone separated likewise. It will match a
document with the text “a
bird in the rose garden is near a stone ” because
there are at most three words between successive sequence words. It will also
match “a
bird garden with a stone ” for the same reason.
Simple word sequences are a special case of proximate word sequences:
"..."
=
"..."~0 . Note also that any documents found by "..."~ N will also be found by
"..."~ M, whenever M > N.
See Also
• Query expression examples , on page 6-12, for examples of query expres-
sions with word sequences.
Boolean query expressions
Boolean operator syntax
You can combine words, fuzzy words, and word sequences using the Boolean
(logical) operators
AND , OR , and NOT (these must be uppercase). The following
table describes the Boolean operators, where each of
exp , exp1 , and exp2
represents a word, fuzzy word, word sequence, or another Boolean query
expression (nested in parentheses – see
Nested Boolean query expressions , on
page 6-11).
Table 6-1: Boolean Query Expressions
Syntax Matches
NOT
exp
alternative syntax: - exp
alternative syntax: ! exp
all documents that do not match exp
exp1
OR exp2
all documents that match either exp1 or
exp2