How LDAP Searches Work
The search string can be matched against complete words or parts of words. If more than one search string is entered in any particular category, the search is performed for any entry containing all the specified strings (in any order) and is case-insensitive.
For example, searching for the name 'smith' in the department 'computer' will list all the Smith's in the Computer Centre and also in the Department of Computer Science, Department of Computer Technology and the Department of Electrical & Computer Systems. Results are sorted alphabetically.
It is possible to use wildcard characters when the precise spelling of the name is not known. The character * will match one or more unknown characters, and the character ? will match any single character. For example, searching for ba*ey will match any name starting with 'Ba' and ending in 'ey', including Bailey, Bearey, Beaudrey, etc. Searching for M?nn will match Mann and Menn.
The search information you enter is converted into an LDAP search string which is passed to the server. The syntax of the search string is rather complicated and is set out in RFC 1558, which contains a great deal of information on the topic.
Glossary Terms
Related Technical Information
- RFC 1558 (A String Representation of LDAP Search Filters)
|
