Patent US3676184A successfully refreshed from Google Patents.
Patent US6356892B1 successfully refreshed from Google Patents.
US6356892B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Efficient implementation of lightweight directory access protocol (LDAP) search queries with structured query language (SQL)
Assignee: International Business Machines Corp
•
Filing: 1998-09-24
•
Granted: 2002-03-12
•
Expires: 2018-09-24
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 by parsing an LDAP filter-based query for elements and logical operators of the filter query. For each filter element, the method generates an SQL subquery according to a set of translation rules. For each SQL subquery, the method then generates a set of entry identifiers for the LDAP filter query. Then, the SQL subqueries are combined into a single SQL query according to a set of combination rules chosen corresponding to the logical operators of the LDAP filter query.
Inventors
- 👤 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-09 22:01
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/24; G06F16/245; G06F16/2453; G06F16/24534; G06F16/24535; H; H04; H04L; H04L61/00; H04L61/45; H04L61/4505; H04L61/4523; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99934; Y10S707/99941; Y10S707/99944
Claims Analysis
Total Claims: 34
Claim 1
Independent Claim
84 words
A method for searching a relational database using hierarchical, filter-based queries, comprising the steps of: parsing a filter-based query for elements and logical operators of the filter query; for each filter element, generating an SQL subquery according to a set of translation rules; for each SQL subquery, generating a set of entry ID's for the filter query; and combining the SQL subqueries into a single SQL query according to a set of combination rules chosen corresponding to the logical operators of the filter query.
Claim 2
Independent Claim
84 words
A method for searching a relational database using hierarchical, filter-based queries, comprising the steps of: parsing a filter-based query for elements and logical operators of the filter query; for each filter element, generating an SQL subquery according to a set of translation rules; for each SQL subquery, generating a set of entry ID's for the filter query; and combining the SQL subqueries into a single SQL query according to a set of combination rules chosen corresponding to the logical operators of the filter query.
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
21 words
The method as described in claim 2 wherein the logical operators of the LDAP filter-based query include AND, OR and NOT.
Claim 5
Dependent Claim
21 words
The method as described in claim 3 wherein the combination rules map the OR logical operator to an SQL UNION operator.
Claim 6
Dependent Claim
21 words
The method as described in claim 3 wherein the combination rules map the AND logical operator to an SQL INTERCEPT operator.
Claim 7
Dependent Claim
22 words
The method as described in claim 3 wherein the combination rules map the NOT logical operator to an SQL NOT IN operator.
Claim 8
Dependent Claim
13 words
The method as described in claim 2 wherein the relational database is DB/2.
Claim 9
Dependent Claim
21 words
The method as described in claim 1 further including the step of accessing the relational database using the single SQL query.
Claim 10
Dependent Claim
20 words
The method as described in claim 8 further including the step of returning a response to the single SQL query.
Claim 11
Dependent Claim
34 words
The method as described in claim 1 wherein the step of combining the SQL subqueries is carried out recursively until all filter elements of the filter query have been processed into the SQL query.
Claim 12
Independent Claim
97 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: parsing an LDAP filter-based query for elements and logical operators of the LDAP filter query; for each LDAP filter element, generating an SQL subquery according to a set of translation rules; for each SQL subquery, generating a set of entry ID's for the LDAP filter query; and combining the SQL subqueries into a single SQL query according to a set of combination rules chosen corresponding to the logical operators of the LDAP filter query.
Claim 13
Independent Claim
97 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: parsing an LDAP filter-based query for elements and logical operators of the LDAP filter query; for each LDAP filter element, generating an SQL subquery according to a set of translation rules; for each SQL subquery, generating a set of entry ID's for the LDAP filter query; and combining the SQL subqueries into a single SQL query according to a set of combination rules chosen corresponding to the logical operators of the LDAP filter query.
Claim 14
Dependent Claim
21 words
The method as described in claim 11 wherein the logical operators of the LDAP filter-based query include AND, OR and NOT.
Claim 15
Dependent Claim
21 words
The method as described in claim 12 wherein the combination rules map the OR logical operator to an SQL UNION operator.
Claim 16
Dependent Claim
21 words
The method as described in claim 12 wherein the combination rules map the AND logical operator to an SQL INTERCEPT operator.
Claim 17
Dependent Claim
22 words
The method as described in claim 12 wherein the combination rules map the NOT logical operator to an SQL NOT IN operator.
Claim 18
Dependent Claim
34 words
The method as described in claim 11 wherein the step of combining the SQL subqueries is carried out recursively until all filter elements of the filter query have been processed into the SQL query.
Claim 19
Dependent Claim
90 words
A computer program product in computer-readable media for searching a relational database using hierarchical, filter-based queries, comprising: means for parsing a filter-based query for elements and logical operators of the filter query; means for generating an SQL subquery for each filter element according to a set of translation rules; means for generating a set of entry ID's for each SQL subquery; and means for combining the SQL subqueries into a single SQL query according to a set of combination rules chosen corresponding to the logical operators of the filter query.
Claim 20
Dependent Claim
90 words
A computer program product in computer-readable media for searching a relational database using hierarchical, filter-based queries, comprising: means for parsing a filter-based query for elements and logical operators of the filter query; means for generating an SQL subquery for each filter element according to a set of translation rules; means for generating a set of entry ID's for each SQL subquery; and means for combining the SQL subqueries into a single SQL query according to a set of combination rules chosen corresponding to the logical operators of the filter query.
Claim 21
Dependent Claim
23 words
The computer program product as described in claim 17 wherein the filter-based query is a Lightweight Directory Access Protocol (LDAP) directory service query.
Claim 22
Dependent Claim
23 words
The computer program product as described in claim 18 wherein the logical operators of the LDAP filter-based query include AND, OR and NOT.
Claim 23
Dependent Claim
23 words
The computer program product as described in claim 19 wherein the combination rules map the OR logical operator to an SQL UNION operator.
Claim 24
Dependent Claim
23 words
The computer program product as described in claim 19 wherein the combination rules map the AND logical operator to an SQL INTERCEPT operator.
Claim 25
Dependent Claim
24 words
The computer program product as described in claim 19 wherein the combination rules map the NOT logical operator to an SQL NOT IN operator.
Claim 26
Dependent Claim
15 words
The computer program product as described in claim 18 wherein the relational database is DB/2.
Claim 27
Dependent Claim
119 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: means for parsing an hierarchical, filter-based query for elements and logical operators of the filter query; means for generating a relational database subquery for each filter element according to a set of translation rules; means for generating a set of unique identifiers for each relational database subquery; and means for combining the relational database subqueries into a single relational database query according to a set of combination rules chosen corresponding to the logical operators of the filter query.
Claim 28
Dependent Claim
119 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: means for parsing an hierarchical, filter-based query for elements and logical operators of the filter query; means for generating a relational database subquery for each filter element according to a set of translation rules; means for generating a set of unique identifiers for each relational database subquery; and means for combining the relational database subqueries into a single relational database query according to a set of combination rules chosen corresponding to the logical operators of the filter query.
Claim 29
Dependent Claim
20 words
The directory service as described in claim 24 wherein the directory is compliant with the Lightweight Directory Access Protocol (LDAP).
Claim 30
Dependent Claim
16 words
The directory service as described in claim 25 wherein the relational database management system is DB/2.
Claim 31
Dependent Claim
125 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 parsing an hierarchical, filter-based query for elements and logical operators of the filter query; means for generating a relational database subquery for each filter element according to a set of translation rules; means for generating a set of unique identifiers for each relational database subquery; and means for combining the relational database subqueries into a single relational database query according to a set of combination rules chosen corresponding to the logical operators of the filter query.
Claim 32
Dependent Claim
125 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 parsing an hierarchical, filter-based query for elements and logical operators of the filter query; means for generating a relational database subquery for each filter element according to a set of translation rules; means for generating a set of unique identifiers for each relational database subquery; and means for combining the relational database subqueries into a single relational database query according to a set of combination rules chosen corresponding to the logical operators of the filter query.
Claim 33
Dependent Claim
21 words
In the directory service as described in claim 27 wherein the directory is compliant with the Lightweight Directory Access Protocol (LDAP).
Claim 34
Dependent Claim
17 words
In the directory service as described in claim 28 wherein the relational database management system is DB/2.
References Cited (Backward Citations)
US5379419A
Cited
US5412804A
Cited
US5537590A
Cited
US5600831A
Cited
US5584024A
Cited
US6052681A
Cited
US5701400A
Cited
US5907837A
Cited
US5668987A
Cited
US5864842A
Cited
US5995961A
Cited
US6055562A
Cited
US5956706A
Cited
US5963933A
Cited
US6092062A
Cited
US6016499A
Cited
US6009428A
Cited
US6085188A
Cited
US6199062B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-03-11 | 2005-09-10 | 2006-03-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-03-11 | 2009-09-10 | 2010-03-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-03-11 | 2013-09-10 | 2014-03-12 | $7700.00 | Window Closed / Lapsed |