Browse Prior Art Database

Method and System for Searching LDAP Distinguished Name Strings Disclosure Number: IPCOM000131167D
Original Publication Date: 2005-Nov-09
Included in the Prior Art Database: 2005-Nov-09
Document File: 1 page(s) / 21K

Publishing Venue



This article describes how to perform wildcarded Lightweight Directory Access Protocol (LDAP) Distinguished Name (DN) searches. Wildcards can be used in the attributevalue section of each Relative DN (RDN) allowing the DN itself to be searched. For example, "cn=*, o=ibm, c=us" or "cn=tom, o=*, c=us" can be searched.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 1

Method and System for Searching LDAP Distinguished Name Strings

The search algorithm follows the psuedocode below:

Map searchDN (inputWildcardDN, inputBaseDN) { if the inputWildcardDN has more elements { get the nextRDN from the right of the inputWildcardDN search a single LDAP level for the nextRDN as an (attributetype=attributevalue) pair from the inputBaseDN while there are more search results { get the nextSearchResult return Map.put(nextSearchresult, searchDN(inputWildcardDN, nextSearchResult + "," + inputBaseDN) } } }

Example invocation:

Map results = searchDN("cn=tom, o=*, c=us", "");

The returned Map from the algorithm will contain the DN tree of all the DNs that match the input wildcarded search string. The algorithm is greedy and will find all matches without having to crawl the entire Directory Information Tree (DIT).