Abstract

LDAP (Lightweight Directory Access Protocol) is a technology that can provide directory services to a range of applications. Directory service, a critical part of distributed computing, is the central point where network services, security services, and applications can form an integrated distributed computing environment. The simplicity of LDAP enables users to store and retrieve data easily from the directory. Nevertheless, as the use of directory services becomes more widespread, directories will need to scale to support millions of entries and millions of user requests with subsecond predictable performance. LDAP directories can be implemented using various storage mechanisms such as flat files, b-trees, or databases. This paper discusses an implementation of LDAP that uses the IBM DATABASE 2™ relational database as the data store and query engine to meet the directory service requirements. Performance analysis is provided to show that a relational database can be used to successfully meet the performance and scale needs of an LDAP directory while remaining secure and competitive with other vendor implementations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.