Patent US6347312B1 successfully refreshed from Google Patents.
US6347312B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Lightweight directory access protocol (LDAP) directory server cache mechanism and method
Assignee: International Business Machines Corp
•
Filing: 1998-11-05
•
Granted: 2002-02-12
•
Expires: 2018-11-05
Abstract
Abstract A method of hierarchical LDAP searching in an LDAP directory service having a relational database management system (DBMS) as a backing store. The method begins in response to a search query to the relational database. Search results retrieved in response to the search query are cached, preferably in a pair of caches in the directory service. The first cache receives a set of identifiers indexed by a filter key of the search query. The search results, namely entries corresponding to the set of identifiers, are then stored in the second cache. In response to subsequent issuance of the search query, the cached search results are then used in lieu of accessing the relational database to increase search efficiency. To maintain the integrity of the cached information, routines are provided to invalidate the caches during given directory service operations.
Inventors
- 👤 Debora Jean Byrne
- 👤 Chetan Ram Murthy
- 👤 Shaw-Ben Shi
- 👤 Chin-Long Shu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 22:02
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/24; G06F16/245; G06F16/2453; G06F16/24534; G06F16/24539; H; H04; H04L; H04L61/00; H04L61/45; H04L61/4505; H04L61/4523; H04L61/4552; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
57 words
A method for searching a relational database using hierarchical, filter-based search queries, comprising the steps of: in response to a search query to the relational database, caching search results in a local storage area; and in response to a subsequent issuance of the search query, using the cached search results in lieu of accessing the relational database.
Claim 2
Independent Claim
57 words
A method for searching a relational database using hierarchical, filter-based search queries, comprising the steps of: in response to a search query to the relational database, caching search results in a local storage area; and in response to a subsequent issuance of the search query, using the cached search results in lieu of accessing the relational database.
Claim 3
Dependent Claim
21 words
The method as described in claim 1 wherein the filter-based query is a Lightweight Directory Access Protocol (LDAP) directory service query.
Claim 4
Dependent Claim
13 words
The method as described in claim 2 wherein the relational database is DB/2.
Claim 5
Dependent Claim
19 words
The method as described in claim 1 wherein the search results are cached according to a set of identifiers.
Claim 6
Dependent Claim
33 words
The method as described in claim 4 wherein the set of identifiers are cached in a first cache and indexed by a key and the search results are cached in a second cache.
Claim 7
Dependent Claim
19 words
The method as described in claim 5 wherein the search results include entries corresponding to the set of identifiers.
Claim 8
Dependent Claim
25 words
The method as described in claim 1 wherein the local storage area is associated with a directory service that generates the hierarchical, filter-based search queries.
Claim 9
Dependent Claim
23 words
The method as described in claim 7 further including the step of invalidating the cached search results during a given directory service operation.
Claim 10
Dependent Claim
30 words
The method as described in claim 8 wherein the given directory service operation is selected from the group of directory service operations consisting essentially of modify, delete and add operations.
Claim 11
Independent Claim
84 words
A method for searching a relational database from a Lightweight Directory Access Protocol (LDAP) directory service generating filter-based queries, comprising the steps of: in response to a search query to the relational database: storing in a first cache a set of identifiers indexed by a filter key; storing in a second cache directory entries corresponding to the set of identifiers; and in response to subsequent issuance of the search query, using the identifiers and the directory entries in lieu of accessing the relational database.
Claim 12
Independent Claim
84 words
A method for searching a relational database from a Lightweight Directory Access Protocol (LDAP) directory service generating filter-based queries, comprising the steps of: in response to a search query to the relational database: storing in a first cache a set of identifiers indexed by a filter key; storing in a second cache directory entries corresponding to the set of identifiers; and in response to subsequent issuance of the search query, using the identifiers and the directory entries in lieu of accessing the relational database.
Claim 13
Dependent Claim
20 words
The method as described in claim 10 wherein the first and second caches are associated with the LDAP directory service.
Claim 14
Dependent Claim
36 words
The method as described in claim 10 further including the step of selectively modifying information in the first and second caches as a result of an LDAP directory service operation prior to the new search query.
Claim 15
Dependent Claim
30 words
The method as described in claim 12 wherein the LDAP directory service operation is selected from the group of directory service operations consisting essentially of modify, delete and add operations.
Claim 16
Independent Claim
68 words
A method for caching search results retrieved from a relational database in response to a Lightweight Directory Access Protocol (LDAP) directory service generating filter-based queries, comprising the steps of: in response to an LDAP search query to the relational database: storing in a first cache a set of identifiers indexed by a filter key; and storing in a second cache directory entries corresponding to the set of identifiers.
Claim 17
Independent Claim
68 words
A method for caching search results retrieved from a relational database in response to a Lightweight Directory Access Protocol (LDAP) directory service generating filter-based queries, comprising the steps of: in response to an LDAP search query to the relational database: storing in a first cache a set of identifiers indexed by a filter key; and storing in a second cache directory entries corresponding to the set of identifiers.
Claim 18
Dependent Claim
20 words
The method as described in claim 14 wherein the first and second caches are associated with the LDAP directory service.
Claim 19
Dependent Claim
60 words
A computer program product in computer-readable media for searching a relational database using hierarchical, filter-based queries, comprising: means responsive to a search query to the relational database for caching search results in a local storage area; and means responsive to a subsequent issuance of the search query for using the cached search results in lieu of accessing the relational database.
Claim 20
Dependent Claim
60 words
A computer program product in computer-readable media for searching a relational database using hierarchical, filter-based queries, comprising: means responsive to a search query to the relational database for caching search results in a local storage area; and means responsive to a subsequent issuance of the search query for using the cached search results in lieu of accessing the relational database.
Claim 21
Dependent Claim
23 words
The computer program product as described in claim 16 wherein the filter-based query is a Lightweight Directory Access Protocol (LDAP) directory service query.
Claim 22
Dependent Claim
15 words
The computer program product as described in claim 16 wherein the relational database is DB/2.
Claim 23
Dependent Claim
30 words
The computer program product as described in claim 16 further including means for invalidating the cached search results during a given directory service operation prior to the new search query.
Claim 24
Dependent Claim
32 words
The computer program product as described in claim 17 wherein the given directory service operation is selected from the group of directory service operations consisting essentially of modify, delete and add operations.
Claim 25
Dependent Claim
79 words
A directory service, 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: a first cache; a second cache; means for storing in the first cache a set of identifiers indexed by a filter key; and means for storing in the second cache directory entries corresponding to the set of identifiers.
Claim 26
Dependent Claim
79 words
A directory service, 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: a first cache; a second cache; means for storing in the first cache a set of identifiers indexed by a filter key; and means for storing in the second cache directory entries corresponding to the set of identifiers.
Claim 27
Dependent Claim
20 words
The directory service as described in claim 21 wherein the directory is compliant with the Lightweight Directory Access Protocol (LDAP).
Claim 28
Dependent Claim
16 words
The directory service as described in claim 22 wherein the relational database management system is DB/2.
Claim 29
Dependent Claim
85 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: a first cache; a second cache; means for storing in the first cache a set of identifiers indexed by a filter key; and means for storing in the second cache directory entries corresponding to the set of identifiers.
Claim 30
Dependent Claim
85 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: a first cache; a second cache; means for storing in the first cache a set of identifiers indexed by a filter key; and means for storing in the second cache directory entries corresponding to the set of identifiers.
Claim 31
Dependent Claim
21 words
In the directory service as described in claim 24 wherein the directory is compliant with the Lightweight Directory Access Protocol (LDAP).
Claim 32
Dependent Claim
17 words
In the directory service as described in claim 25 wherein the relational database management system is DB/2.
References Cited (Backward Citations)
US4920478A
Cited
US5758146A
Cited
US5822749A
Cited
US5715443A
Cited
US6052681A
Cited
US5752264A
Cited
US6016499A
Cited
US6014667A
Cited
US6073129A
Cited
US6085188A
Cited
US6101541A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-02-11 | 2005-08-13 | 2006-02-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-02-11 | 2009-08-13 | 2010-02-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-02-11 | 2013-08-13 | 2014-02-12 | $7700.00 | Window Closed / Lapsed |