Patent US6085188A successfully refreshed from Google Patents.
US6085188A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of hierarchical LDAP searching with relational tables
Assignee: International Business Machines Corp
•
Filing: 1998-03-30
•
Granted: 2000-07-04
•
Expires: 2018-03-30
Abstract
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.
Inventors
- 👤 David W. Bachmann
- 👤 Cynthia Fleming Corn
- 👤 Larry George Fichtner
- 👤 Rodolfo Augusto Mancisidor
- 👤 Shaw-Ben Shi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 20:14
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/28; G06F16/284; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99941; Y10S707/99942
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
86 words
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.
Claim 2
Independent Claim
86 words
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.
Claim 3
Dependent Claim
18 words
The method as described in claim 1 wherein the relational table summarizes parent-child relationships in the naming hierarchy.
Claim 4
Dependent Claim
72 words
The method as described in claim 2 wherein the relational table is generated by: for each entry that is a parent of a child entry in the naming hierarchy, associating the unique identifier of the parent entry with the unique identifier of each entry that is a child of that parent entry; and indexing each respective parent entry unique identifier together with "its respective" child entries unique identifiers in an ordered list.
Claim 5
Dependent Claim
16 words
The method as described in claim 3 wherein the search query is a one level search.
Claim 6
Dependent Claim
19 words
The method as described in claim 1 wherein the relational table summarizes ancestor-descendant relationships between the unique identifier pairs.
Claim 7
Dependent Claim
72 words
The method as described in claim 5 wherein the relational table is generated by: for each entry that is an ancestor of one or more descendent entries in the hierarchy, associating the unique identifier of the ancestor entry with the unique identifier of each entry that is a descendent of that ancestor entry; and indexing the ancestor entries' unique identifiers together with their associated descendent entry unique identifiers in an ordered list.
Claim 8
Dependent Claim
15 words
The method as described in claim 6 wherein the search query is a subtree search.
Claim 9
Dependent Claim
19 words
The method as described in claim 1 wherein the directory is a client/server directory service having a backing store.
Claim 10
Dependent Claim
17 words
The method as described in claim 8 wherein the backing store includes a relational database management system.
Claim 11
Independent Claim
105 words
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.
Claim 12
Independent Claim
105 words
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.
Claim 13
Dependent Claim
19 words
The method as described in claim 10 wherein the first relational table summarizes parent-child relationships in the naming hierarchy.
Claim 14
Dependent Claim
73 words
The method as described in claim 11 wherein the first relational table is generated by: for each entry that is a parent of a child entry in the naming hierarchy, associating the unique identifier of the parent entry with the unique identifier of each entry that is a child of that parent entry; and indexing each respective parent entry unique identifier together with its respective child entries unique identifiers in an ordered list.
Claim 15
Dependent Claim
16 words
The method as described in claim 12 wherein the search query is a one level search.
Claim 16
Dependent Claim
19 words
The method as described in claim 10 wherein the second relational table summarizes ancestor-descendant relationships in the naming hierarchy.
Claim 17
Dependent Claim
73 words
The method as described in claim 14 wherein the second relational table is generated by: for each entry that is an ancestor of one or more descendent entries in the hierarchy, associating the unique identifier of the ancestor entry with the unique identifier of each entry that is a descendent of that ancestor entry; and indexing the ancestor entries' unique identifiers together with their associated descendent entry unique identifiers in an ordered list.
Claim 18
Dependent Claim
15 words
The method as described in claim 15 wherein the search query is a subtree search.
Claim 19
Dependent Claim
19 words
The method as described in claim 10 wherein the directory is a client/server directory service having a backing store.
Claim 20
Dependent Claim
17 words
The method as described in claim 17 wherein the backing store includes a relational database management system.
Claim 21
Dependent Claim
122 words
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.
Claim 22
Dependent Claim
122 words
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.
Claim 23
Dependent Claim
43 words
The computer program product as described in claim 19 wherein the first relational table is a parent table generated by associating the unique identifier of each parent entry with the unique identifier of each entry that is a child of that parent entry.
Claim 24
Dependent Claim
43 words
The computer program product as described in claim 19 wherein the second relational table is a descendant table generated by associating the unique identifier of each ancestor entry with the unique identifier of each entry that is a descendant of that ancestor entry.
Claim 25
Dependent Claim
126 words
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.
Claim 26
Dependent Claim
126 words
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.
Claim 27
Dependent Claim
43 words
The directory service system as described in claim 22 wherein the first relational table is a parent table generated by associating the unique identifier of each parent entry with the unique identifier of each entry that is a child of that parent entry.
Claim 28
Dependent Claim
43 words
The directory service system as described in claim 22 wherein the second relational table is a descendant table generated by associating the unique identifier of each ancestor entry with the unique identifier of each entry that is a descendant of that ancestor entry.
Claim 29
Dependent Claim
15 words
The method as described in claim 22 wherein the directory is a client/server directory service.
Claim 30
Dependent Claim
17 words
The directory service system as described in claim 22 wherein the relational database management system is DB/2.
Claim 31
Dependent Claim
131 words
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.
Claim 32
Dependent Claim
131 words
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.
References Cited (Backward Citations)
US4945475A
Cited
US5594899A
Cited
US5295261A
Cited
US5379419A
Cited
US5291583A
Cited
US5581756A
Cited
US5448727A
Cited
US5708806A
Cited
US5404518A
Cited
US5386559A
Cited
US5600832A
Cited
US5504879A
Cited
US5592661A
Cited
US5530957A
Cited
US5511186A
Cited
US5644740A
Cited
US5467471A
Cited
JPH07271825A
Cited
WO1996005704A2
Cited
JPH08235194A
Cited
US5675784A
Cited
US5724577A
Cited
EP0802491A2
Cited
US5943668A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-07-04 | 2004-01-03 | 2004-07-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-07-04 | 2008-01-03 | 2008-07-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-07-04 | 2012-01-03 | 2012-07-04 | $7700.00 | Window Closed / Lapsed |