US6625615B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data processing system and method for multi-level directory searches
Assignee: Google LLC
•
Filing: 2000-12-19
•
Granted: 2003-09-23
•
Expires: 2020-12-19
Abstract
Abstract An apparatus and method for performing a multi-level directory search are implemented. The directory information may be stored in a backing store in accordance with a relational database. An ancestor table is generated which maps each node in the directory which is an ancestor of one or more descendant nodes to each of its ancestor nodes. Each node is associated with a unique identifier, which may be used to relate ancestor and descendant nodes. The table includes the identifier of each ancestor in association with all the corresponding descendants. Additionally, the table maps the distance between the ancestor and each descendant. For a search initiated at a given node the distance values may be used to delimit a search in accordance with a specified search scope. The search scope may be specified as a parameter in a Lightweight Directory Access Protocol (LDAP) search request.
Inventors
- 👤 Shepherd Shi
- 👤 Reginal R. Hill
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 20:23
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/24; G06F16/245; G06F16/2455; G06F16/24564; G06F16/24566; H; H04; H04L; H04L61/00; H04L61/45; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99941; Y10S707/99944
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
104 words
A search method comprising the steps of: retrieving one or more second node identifiers, and an associated distance value in response to a first node identifier; and for each node corresponding to one of said one or more second identifiers having a corresponding one of said associated distance value not greater than a preselected distance value, matching said node to a first parameter, wherein the first node identifier comprises a directory node distinguished name search parameter, and the associated distance value comprises a number of levels between the directory node having the first node identifier and a directory node having the second node identifier.
Claim 2
Dependent Claim
104 words
A search method comprising the steps of: retrieving one or more second node identifiers, and an associated distance value in response to a first node identifier; and for each node corresponding to one of said one or more second identifiers having a corresponding one of said associated distance value not greater than a preselected distance value, matching said node to a first parameter, wherein the first node identifier comprises a directory node distinguished name search parameter, and the associated distance value comprises a number of levels between the directory node having the first node identifier and a directory node having the second node identifier.
Claim 3
Dependent Claim
33 words
The method of claim 1 further comprising the step of returning a value of each of one or more selected members of each node having a match in response to said matching step.
Claim 4
Dependent Claim
56 words
The method of claim 1 wherein said one or more second node identifiers and said associated distance value are retrieved from a table, said table including an entry corresponding to each said second node identifier, each entry having a first portion for containing said second node identifier and a second portion for containing said associated distance.
Claim 5
Dependent Claim
13 words
The method of claim 3 further comprising the step of generating said table.
Claim 6
Dependent Claim
37 words
The method of claim 3 wherein each entry of said table includes a third portion for containing an identifier of an ancestor node of a node corresponding to the second node identifier contained in the second portion.
Claim 7
Dependent Claim
27 words
The method of claim 5 wherein said second node identifier is retrieved in response to said identifier of said ancestor node corresponding to said first node identifier.
Claim 8
Dependent Claim
18 words
The method of claim 1 wherein said preselected distance value is determined in response to a second parameter.
Claim 9
Dependent Claim
20 words
The method of claim 7 wherein said first, and second parameters each comprise Lightweight Directory Access Protocol (LDAP) search parameters.
Claim 10
Dependent Claim
30 words
The method of claim 1 further comprising the step of mapping a value of a second parameter to said first node identifier, wherein said second parameter comprises a search parameter.
Claim 11
Dependent Claim
121 words
A computer program product embodied in a tangible storage medium, the program product comprising a program of instructions for performing the method steps of: retrieving one or more second node identifiers, and an associated distance value in response to a first node identifier; and for each node corresponding to one of said one or more second identifiers having a corresponding one of said associated distance value not greater that a preselected distance value, matching said node to a second parameter, wherein the first node identifier comprises a directory node distinguished name search parameter, and the associated distance value comprises a number of levels between the directory node having the first node identifier and a directory node having the second node identifier.
Claim 12
Dependent Claim
121 words
A computer program product embodied in a tangible storage medium, the program product comprising a program of instructions for performing the method steps of: retrieving one or more second node identifiers, and an associated distance value in response to a first node identifier; and for each node corresponding to one of said one or more second identifiers having a corresponding one of said associated distance value not greater that a preselected distance value, matching said node to a second parameter, wherein the first node identifier comprises a directory node distinguished name search parameter, and the associated distance value comprises a number of levels between the directory node having the first node identifier and a directory node having the second node identifier.
Claim 13
Dependent Claim
37 words
The program product of claim 10 further comprising instructions for performing the step of returning a value of each of one or more selected members of each node having a match in response to said matching step.
Claim 14
Dependent Claim
57 words
The program product of claim 10 wherein said one or more second node identifiers and said associated distance value are retrieved from a table, said table including an entry corresponding to each said second node identifier, each entry having a first portion for containing said second node identifier and a second portion for containing said associated distance.
Claim 15
Dependent Claim
17 words
The program product of claim 12 further comprising instructions for performing the step of generating said table.
Claim 16
Dependent Claim
38 words
The program product of claim 12 wherein each entry of said table includes a third portion for containing an identifier of an ancestor node of a node corresponding to the second node identifier contained in the second portion.
Claim 17
Dependent Claim
28 words
The program product of claim 14 wherein said second node identifier is retrieved in response to said identifier of said ancestor node corresponding to said first node identifier.
Claim 18
Dependent Claim
19 words
The program product of claim 10 wherein said preselected distance value is determined in response to a second parameter.
Claim 19
Dependent Claim
21 words
The program product of claim 16 wherein said first and second parameters each comprise Lightweight Directory Access Protocol (LDAP) search parameters.
Claim 20
Dependent Claim
34 words
The program product of claim 10 further comprising instructions for performing the step of mapping a value of a second parameter to said first node identifier, wherein said second parameter comprises a search parameter.
Claim 21
Dependent Claim
107 words
A data processing system comprising: circuitry operable for retrieving one or more second node identifiers, and an associated distance value in response to a first node identifier; and circuitry operable for, for each node corresponding to one of said one or more second identifiers having coresponding one of said associated distance value not greater that a preselected distance value, matching said node to a first parameter, wherein the first node identifier comprises a directory node distinguished name search parameter, and the associated distance value comprises a number of levels between the directory node having the first node identifier and a directory node having the second node identifier.
Claim 22
Dependent Claim
107 words
A data processing system comprising: circuitry operable for retrieving one or more second node identifiers, and an associated distance value in response to a first node identifier; and circuitry operable for, for each node corresponding to one of said one or more second identifiers having coresponding one of said associated distance value not greater that a preselected distance value, matching said node to a first parameter, wherein the first node identifier comprises a directory node distinguished name search parameter, and the associated distance value comprises a number of levels between the directory node having the first node identifier and a directory node having the second node identifier.
Claim 23
Dependent Claim
33 words
The system of claim 19 further comprising circuitry operable for returning a value of each of one or more selected members of each node having a match in response to said matching step.
Claim 24
Dependent Claim
56 words
The system of claim 20 wherein said one or more second node identifiers and said associated distance value are retrieved from a table, said table including an entry corresponding to each said second node identifier, each entry having a first portion for containing said second node identifier and a second portion for containing said associated distance.
Claim 25
Dependent Claim
13 words
The system of claim 21 further comprising circuitry operable for generating said table.
Claim 26
Dependent Claim
37 words
The system of claim 21 wherein each entry of said table includes a third portion for containing an identifier of an ancestor node of a node corresponding to the second node identifier contained in the second portion.
Claim 27
Dependent Claim
27 words
The system of claim 23 wherein said second node identifier is retrieved in response to said identifier of said ancestor node corresponding to said first node identifier.
Claim 28
Dependent Claim
18 words
The system of claim 19 wherein said preselected distance value is determined in response to a second parameter.
Claim 29
Dependent Claim
20 words
The system of claim 25 wherein said first and second parameters each comprise Lightweight Directory Access Protocol (LDAP) search parameters.
Claim 30
Dependent Claim
30 words
The system of claim 19 further comprising circuitry operable for mapping a value of a second parameter to said first node identifier, wherein said second parameter comprises a search parameter.
References Cited (Backward Citations)
US5916299A
Cited
US6377957B1
Cited
US6427123B1
Cited
US6470332B1
Cited
US6470344B1
Cited
US6446059B1
Cited
US6480857B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2006-09-22 | 2007-03-24 | 2007-09-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2010-09-22 | 2011-03-24 | 2011-09-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2014-09-22 | 2015-03-24 | 2015-09-23 | $7700.00 | Window Closed / Lapsed |