Directory Server Entry Name Modification via Asynchronous Batching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional directory servers experience significantly higher latency and lower throughput for modifying entry names compared to search operations, negatively impacting overall performance due to inefficient design and implementation of ModRDN operations in LDAP/X.500 specifications.
Innovation Solution
Implementing a method where modifying operations for entry names are processed asynchronously, using entry mapping information to record pre- and post-modification details, and performing these operations in batches during low workload periods, thereby decoupling them from real-time search operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If modifying operations are processed synchronously in real-time, then entry name modifications are immediately reflected, but search operation performance deteriorates due to high latency and low throughput of modifying operations
Solution Approach 1:
The patent applies preliminary action by pre-processing modifying operations during low-workload periods and marking them in advance. The system collects modify requests and processes them in batches before they affect search operations, thereby preparing changes ahead of time without blocking real-time search performance.
Solution Approach 2:
The patent implements periodic action by scheduling modifying operations to be processed at specific intervals during low-workload periods. Instead of continuous synchronous processing, the system periodically batches and applies modifications when search workload is low, thus maintaining search performance while eventually applying all changes.
2Productivity
If modifying operations are processed asynchronously in batches, then search operation performance is maintained, but entry name consistency may be delayed
Solution Approach 1:
The system applies preliminary action by collecting modify requests and processing them in advance during low-workload periods. This ensures that modifications are applied before they would impact search operations, minimizing time delay while maintaining search performance.
Solution Approach 2:
The patent implements feedback mechanisms to track the status of modifying operations and ensure they are applied promptly. The system monitors workload conditions and triggers batch processing when appropriate, providing feedback loops that balance consistency requirements with performance goals.
3Productivity
If multiple modifying operations are processed simultaneously, then modification throughput increases, but system complexity and resource consumption increase
Solution Approach 1:
The patent applies segmentation by dividing modifying operations into separate batches that are processed at different times. Instead of handling all modifications simultaneously, the system segments them into manageable batches during low-workload periods, reducing system complexity while maintaining throughput.
Solution Approach 2:
The patent merges multiple modifying operations into batches that are processed together during low-workload periods. This combining approach increases effective throughput by processing multiple operations in parallel batches while managing complexity through controlled timing and workload awareness.
Data Source
AI summary
The present invention provides a system and a computer-implemented method for modifying an entry name in a directory database. The method comprises the steps of: modifying, in response to a request for modifying operation of entry names, entry mapping information in accordance with the modification that is requested for modifying operation of entry names, wherein each piece of entry mapping information is used for indicating the correspondence relation between pre-modification entry name information and post-modification entry name information; asynchronously performing modifying operation of a corresponding entry name in accordance with respective pieces of entry mapping information when a predetermined condition for updating the directory database is met.


