Monthly Archives: December 2011

LDAP: size limit and time limit in search

Posted on December 19, 2011 by Terry Gardner

Some important LDAP result codes that could result from issuing a search to the directory server. The non-zero result codes except for 10 refer to either an error, or some limit being exceeded. The result codes that are not errors … Continue reading →

Posted in computing, LDAP | Tagged , , , , , , | Leave a comment

LDAP: An index with a LIMIT-EXCEEDED condition causing an unindexed search

Posted on December 18, 2011 by Terry Gardner

In order to complete requests more quickly, the directory server can maintain indexes for values of attributes. The value of the attribute is used as the key, and a list of entry IDs are the data. The entry IDs can … Continue reading →

Posted in LDAP, UnboundID | Tagged , , , , , , , | Leave a comment

LDAP: Matched Values Request Control

Posted on December 7, 2011 by Terry Gardner

The matched values request control described in RFC 3876 provides LDAP clients with a way to filter values that would be returned in a search request. This capability is very useful when the LDAP client must process entries with large … Continue reading →

Posted in computing, Java, LDAP, UnboundID LDAP SDK | Tagged , , , , , , , | Leave a comment

LDAP: Virtual List View

Posted on December 5, 2011 by Terry Gardner

The Simple Paged Results Request Control provides LDAP clients with a means to view sequential data at a rate controlled by the client, but it’s limited by the fact that clients can only scroll through pages in order. The Virtual … Continue reading →

Posted in computing, Java, LDAP, UnboundID, UnboundID LDAP SDK | Tagged , , , , , | 1 Comment