Binary Operators| Operator | Semantic |
|---|
| OR | Union, the set of all elements in either of two sets |
| AND | Intersection, the set of all elements in both sets |
| AND:field | Elements in the same node instance of field |
| JOIN | Similar to AND but applicable across different indexes. Returns those elements in both sets which have common primary keys. |
| JOINr | Join to the right: return a set consisting of those elements in the set to the right that has common primar keys to both |
| JOINl | Join to the left: as above but from the set to the left. |
| ANDNOT | Elements in the one set but NOT in the other |
| NOTAND | A NOTAND B is equivalent to B ANDNOT A |
| NAND | A B NAND := A B AND NOT |
| XOR | Exclusive Union, elements in either but not both |
| XNOR | A B XNOR := A B XOR NOT |
| ADJ | Matching terms are adjacent to one another (as stored on the file system) |
| NEAR | Matching terms are "near" one another. In fielded indexes this is interpreted as "in same container" (e.g. PEER) but when there are no fields (plain fulltext) it is a (preset) minimal byte offset (as stored on the file system) of one another. |
| NEAR:num | The matching terms in the sets are within "num" elements as stored on the file system (file offsets). If the value num is an integer its interpreted as bytes (octets). It its a fraction of 1 its % of the length of record |
| PEER | Elements in the same (unnamed) final tree leaf node (container). Its like doing an AND:<Anonymous field what I don't know the name or path of>. |
| PEERa | PEER After |
| PEERb | PEER Before |
| XPEER | Hits are elements in the intersection (both sets) but not in the same container. |
| BEFORE, AFTER | In fielded records its like an ordered PEER (PERRb, resp., PEERa). |
| BEFORE:field, AFTER:field | With a named field its like an ordered AND:field. |
| PROX[:NN] | A special case of proximity. PROX -> NEAR but PROX:0 -> PROX:0 -> ADJ. NN may also be specified as %, example 50%. |
| BEFORE:num, AFTER:num | like NEAR:num but ordered |
| FOLLOWS, PRECEDES | Within some ordered elements of one another |
| ONEAR is as above but uses the query order |
| FAR | Elements a "good distance" away from each other. In fielded indexes its the same as XPEER. In non-fielded indexes (plain fulltext) its a (preset) minimal byte offset (as stored on the file system) from each another. |
