Definition: Substring Search Filter
A substring search filter is a type of search filter that can be used to identify entries that contain a value for a given attribute that matches a specified substring. The server will use a substring matching rule to make the determination.
The substring search filter must contain a substring assertion, which will have at least one component from the following types:
- A subInitial component, whose value should be contained at the start of any matching value. There may be either zero or one subInitial component in a substring filter.
- A set of subAny components, whose values should be contained anywhere in the matching value. There may be zero or more subAny components in a substring filter, and they should be contained in the value in the order they appear in the substring filter, after any subInitial component and before any subFinal component.
- A subFinal component, whose value should be contained at the end of a matching value. There may be either zero or one subFinal component in a substring filter.
The string representation of an LDAP substring filter is comprised of an opening parenthesis followed by the attribute name, an equal sign, the substring assertion with the individual components separated by asterisks, and the closing parenthesis. For example, a substring filter of "(cn=ab*def*mno*stu*yz)" contains a subInitial component of "ab", subAny components of "def", "mno", and "stu", and a subFinal component of "yz".
Sign up or Log in to add a comment or watch this page.