Unique Identifier Management via Pointer-Based Page Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large-scale database systems, the management of unique identifiers for objects becomes a performance bottleneck due to high throughput requirements, low response delay constraints, and complexity in distributed architectures, especially in travel reservation systems where record locators must be generated efficiently and reliably.
Innovation Solution
A system comprising an index unit, memory unit, and control pointer unit that organizes identifiers into pages, allowing for efficient allocation and management of unique identifiers through a pointer-based mechanism that updates availability status, ensuring low complexity and high performance while maintaining compatibility with existing databases.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If centralized mainframes are used to generate record locators, then identifier uniqueness and reliability are ensured, but system complexity and response time worsen
Solution Approach 1:
The patent segments the centralized identifier management system into distributed components. Each backend server maintains local identifier pools and generates record locators independently, eliminating the need for a centralized mainframe while ensuring uniqueness through coordinated allocation strategies across multiple nodes.
Solution Approach 2:
The patent introduces a mediator mechanism that coordinates identifier allocation across distributed backend servers. This mediator ensures that identifier pools are distributed and allocated in a way that maintains uniqueness without requiring direct centralized control, thus reducing system complexity while preserving reliability.
2Productivity
If more identifiers are allocated to handle high throughput, then productivity improves, but memory usage and communication bandwidth increase
Solution Approach 1:
The patent divides the identifier space into multiple pools distributed across different backend servers. Each server maintains a local pool of identifiers, allowing parallel allocation operations. This segmentation enables high throughput without requiring all identifiers to be stored in a single centralized memory location.
Solution Approach 2:
The patent pre-allocates identifier pools to backend servers before they are needed for actual record locator generation. This preliminary action allows servers to have ready-to-use identifier pools in local memory, enabling fast local allocation without real-time communication overhead, thus improving throughput while controlling memory usage at distributed locations.
3Loss of time
If identifier pools are distributed across multiple backends, then response time improves, but ensuring identifier uniqueness becomes more difficult
Solution Approach 1:
The patent implements feedback mechanisms where backend servers report their identifier pool status to a coordination system. This feedback allows the system to monitor and adjust identifier allocation across distributed servers, ensuring uniqueness is maintained while allowing fast local response times for identifier generation.
Solution Approach 2:
The patent uses a mediator to coordinate between distributed backend servers, ensuring that identifier allocation maintains uniqueness across the system. The mediator manages the distribution and tracking of identifier pools, allowing each backend to operate independently with fast response times while the mediator ensures global consistency and uniqueness.
Data Source
AI summary
Systems, methods, and computer program products for associating a unique identifier with an object. The system may include a database with a memory unit, an index unit, and a control pointer unit, at least one identifier management unit, and at least one update unit. A finite set of identifiers is organized in pages, and each page includes a bitmap representing the availability of the identifiers. The pointers to data in the index include a pointer to a last page loaded by an identifier management unit, and a pointer to a last page updated by an update unit.