Method of hierarchical LDAP searching with relational tables
First Claim
1. A method of searching a directory organized as a naming hierarchy having a plurality of entries each represented by a unique identifier, comprising the steps of:
- generating a relational table associating unique identifier pairs in the naming hierarchy having a given hierarchical relationship;
in response to a search query having a given filter criteria and search scope, returning a list of entries that satisfy the given filter criteria; and
using the relational table to filter out entries in the list according to the given search scope.
1 Assignment
0 Petitions
Accused Products
Abstract
A method of hierarchical LDAP searching in an LDAP directory service having a relational database management system (DBMS) as a backing store. According to the invention, entries in a naming hierarchy are mapped into first and second relational tables: a parent table, and a descendant table. These tables are used to "filter" lists of entries returned from a search to ensure that only entries within a given search scope are retained for evaluation. Thus, for example, the parent table is used during an LDAP one level search, and the descendant table is used during an LDAP subtree search. In either case, use of the parent or descendant table obviates recursive queries through the naming directory.
-
Citations
27 Claims
-
1. A method of searching a directory organized as a naming hierarchy having a plurality of entries each represented by a unique identifier, comprising the steps of:
-
generating a relational table associating unique identifier pairs in the naming hierarchy having a given hierarchical relationship; in response to a search query having a given filter criteria and search scope, returning a list of entries that satisfy the given filter criteria; and using the relational table to filter out entries in the list according to the given search scope. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method of searching a directory organized as a naming hierarchy having a plurality of entries each represented by a unique identifier, comprising the steps of:
-
generating first and second relational tables associating unique identifier pairs in the naming hierarchy having first and second given relationships; in response to a search query having a given filter criteria and search scope, returning a list of entries that satisfy the given filter criteria; and using at least one of the first and second relational tables to filter out entries in the list according to the given search scope to avoid recursive queries through the list of entries. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A computer program product in a computer-readable media for use in a computer to search a directory organized as a naming hierarchy having a plurality of entries each represented by a unique identifier, the computer program product comprising:
-
means for generating first and second relational tables associating unique identifier pairs in the naming hierarchy having first and second given relationships; means responsive to a search query having a given filter criteria and search scope for returning a list of entries that satisfy the given filter criteria; and means for using at least one of the first and second relational tables to filter out entries in the list according to the given search scope to avoid recursive queries through the list of entries. - View Dependent Claims (20, 21)
-
-
22. A directory service system, comprising:
-
a directory organized as a naming hierarchy having a plurality of entries each represented by a unique identifier; a relational database management system having a backing store for storing directory data; means for searching the directory, comprising; means for generating first and second relational tables associating unique identifier pairs in the naming hierarchy having first and second given relationships; means responsive to a search query having a given filter criteria and search scope for returning a list of entries that satisfy the given filter criteria; and means for using at least one of the first and second relational tables to filter out entries in the list according to the given search scope to avoid recursive queries through the list of entries. - View Dependent Claims (23, 24, 25, 26)
-
-
27. In a directory service having a directory organized as a naming hierarchy, the hierarchy including a plurality of entries each represented by a unique identifier, the improvement comprising:
-
a relational database management system having a backing store for storing directory data; means for searching the directory, comprising; means for generating first and second relational tables associating unique identifier pairs in the naming hierarchy having first and second given relationships; means responsive to a search query having a given filter criteria and search scope for returning a list of entries that satisfy the given filter criteria; and means for using at least one of the first and second relational tables to filter out entries in the list according to the given search scope to avoid recursive queries through the list of entries.
-
Specification