Distributed directory replication

• US 20060089925A1
• Filed: 10/25/2004
• Published: 04/27/2006
• Est. Priority Date: 10/25/2004
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: International Business Machines Corporation
• Inventors: Kumar, Apurva
• Granted Patent: US 7,315,854 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24524 Access plan code generation and invalidation; Reuse of access plans
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: Y10S 707/956 Hierarchical
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

A replication model has replicas store selected entries from subtrees. Only entries satisfying a particular search criterion specified by a filter are stored. Query containment is used to determine whether the query can be answered locally, or a referral to a remote server is required.

Claims

1. A method for processing a directory search query at a replica server, said method comprising:

storing a filtered replica of one or more directory entries matching one or more predetermined search specifications;

determining whether or not a directory search query is semantically contained within the replicated directory entries;

responding to the directory search query based upon the replicated directory entries, if the determination is affirmative; and

responding to the directory search query with a referral, if the determination is negative.

2. The method as claimed in claim 1, further comprising determining whether or not a directory search query can be answered by the filtered replica based upon meta-information included in a parent of a base object of the filtered replica.

3. The method as claimed in claim 1, further comprising determining whether or not a directory search query can be referred to a peer replica based upon meta-information included in a parent of a base object of the filtered replica.

4. The method as claimed in claim 1, wherein in the storing process, the predetermined search specification comprises a directory search query scoped as one of a base search, a single-level search, or an entire subtree search.

5. A computer system for processing a search query comprising computer software recorded on a computer-readable medium for performing a method comprising:

storing a filtered replica of one or more directory entries selected as matching one or more predetermined search specifications;

determining whether or not a received search query is semantically contained within the replicated entries determined by the search specifications;

responding to the received search query based upon the replicated entries, if the determination is affirmative; and

responding to the received search query with a referral, if the determination is negative.

6. The computer system as claimed in claim 5, further comprising computer software adapted to determine whether or not a directory search query can be answered by the filtered replica based upon meta-information included in a parent of a base object of the filtered replica.

7. The computer system as claimed in claim 5, further comprising computer software adapted to determine whether or not a directory search query can be referred to a peer replica based upon meta-information included in a parent of a base object of the filtered replica.

8. The computer system as claimed in claim 5, wherein the predetermined search specification comprises a directory search query scoped as one of a base search, a single-level search, or an entire subtree search.

9. A computer program recorded on a computer-readable medium comprising computer software for performing a method comprising:

storing a filtered replica of one or more directory entries selected as matching one or more predetermined search specifications;

determining whether or not a received search query is semantically contained within the replicated entries determined by the search specifications;

responding to the received search query based upon the replicated entries, if the determination is affirmative; and

responding to the received search query with a referral, if the determination is negative.

10. The computer program as claimed in claim 9, further comprising computer software adapted to determine whether or not a directory search query can be answered by the filtered replica based upon meta-information included in a parent of a base object of the filtered replica.

11. The computer program as claimed in claim 9, further comprising computer software adapted to determine whether or not a directory search query can be referred to a peer replica based upon meta-information included in a parent of a base object of the filtered replica.

12. The computer program as claimed in claim 9, wherein in said method the predetermined search specification comprises a directory search query scoped as one of a base search, a single-level search, or an entire subtree search.