Index Interface |
Top Previous Next |
Indexed searching works by searching a pre-built index to locate files, its main advantage is that a search on an index is normally very fast, e.g. sub-second times. So, before you can perform a search you need to create an index. Once the index has been created you can search it by typing information into the search field. Multiple indexes can be created and shared over network drives with other people.
Index based searches can be performed using the Index Search interface, opened by selecting the option Index Search from the criteria drop-down or by using the menu option Search -> Criteria -> Index Search.
This will change the criteria interface to look like this:
The Index Interface has three main sections:
Performing a Search
The search terms can be specified using standard Boolean Expressions logic, such as AND, OR, NEAR, NOT, and LIKE. There is, however, one important difference. Whereas a classic Boolean search will match mid-word an index search assumes that the term matches the start of the word. Index searches have an implicit '<' at the start and classic searches have an implicit '*' at the front.
This table illustrates how search terms will be matched:
Searching Attributes
By default searches will search the file name and the file content (if indexed), however you can specify other attributes of the files using search prefixes.
Prefixes can be combined so to search for all .pdf files created since the 1 Jan 2020 for the word "excellent"
Excellent name:*.pdf createdt:"> 1 Jan 2020"
Limitations of Indexed Search
Although indexed searching is very fast there is one very important fact to keep in mind, the term being searched for must be in the index for it to be found. Common issues to be aware of:
Performance Impact of Indexes
The indexing feature is not constantly running in the background and indexes are not loaded unless you try and search them, so there is no performance impact to people who never need to use the indexing functionality. If you don’t use the feature then you won’t notice it because it’s effectively disabled by default.
This method of operation has the advantage that the program is not secretly consuming CPU cycles or eating away at disk space but it has the disadvantage that the index isn’t updated unless you specifically update it. This is fine for large repositories of fairly static data but can cause problems when files are changing frequently. You can schedule index updates using the Index Scheduling feature.
|