Changes between Version 7 and Version 8 of Public/Docs/CinnamonUsingAdvancedSearch

Timestamp:

Mar 24, 2020, 6:20:16 PM (5 years ago)

Author:

Administrator

Comment:

—

Public/Docs/CinnamonUsingAdvancedSearch

@@ -67 +67 @@
 You can combine multiple fields using [https://en.wikipedia.org/wiki/Boolean_algebra Boolean] operators ({{{AND}}}, {{{OR}}}). Such operators can also be nested within operators as deeply as you require.
 
+The following search finds [https://en.wikipedia.org/wiki/Darwin_Information_Typing_Architecture DITA] topics that are not referenced by any parent manual:
 
+ [[Image(wiki:Public/Docs/CinnamonUsingAdvancedSearch:SearchUnusedTopics.png)]]
 
+This search exposes some of the advanced capabilities of search editor:
+* Multiple search terms are combined in a Boolean operator.
+* Negation of a search (the objects must **NOT** have the defined field content).
+* **ANY** flag (the search matches, if the field exists on the object, with any value).
 
+In this case, we defined a search that does the following:
+* It searches for objects that are the latest versions of their version tree. Branches and older versions are ignored.
+* Both of the following criteria must be fulfilled because of the //AND// operator:
+ * The object must have the object type //DITA topic//.
+ * The object must NOT have ANY value of //parent.relations.child_content//. This means, that there may be no objects that refer to the content of the objects returned by the search.
+
+By combining the structures and functions described in this article, you can create searches of significant complexity.
+
+> **NOTE:** A very complex search is not slower than a very simple search. The index performance scales with the number of results, not with the number of terms it evaluates. One exception is that you should avoid the //contains// comparison operator if possible. Compared with other operators like //equals// or //starts with// it is significantly slower due to the index concept.
+