Database Server Search Subrange Calculation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing parallel database systems face challenges in efficiently managing search operations across multiple servers, particularly in terms of load distribution and fault tolerance, as they require reconfiguration of partitions when the number of servers changes, leading to increased processing load and potential access conflicts.
Innovation Solution
A database system where each server is synchronized with a separate database and calculates its own search subrange independently, allowing it to perform data searches within that range without overlapping, thus eliminating the need for data transport between databases and enabling scalable throughput and fault tolerance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the database is divided into partitions for multiple servers (SN architecture), then load distribution and throughput enhancement are improved, but reconfiguration time and resources increase when the number of servers changes
Solution Approach 1:
The patent implements dynamic partition assignment where servers can access any partition without fixed assignment. When servers are added or removed, the system automatically redistributes partitions among available servers without requiring manual reconfiguration. This dynamic approach eliminates the time-consuming reconfiguration process while maintaining load distribution benefits.
Solution Approach 2:
Each server is designed to be universal and can access any database partition rather than being dedicated to a specific partition. This multi-functionality allows servers to dynamically assume different roles and access different partitions based on current system conditions, enabling seamless scaling without reconfiguration overhead.
2Speed
If multiple servers access a shared database (SE architecture), then responsiveness to search requests is improved, but access conflicts and load distribution problems occur
Solution Approach 1:
The database is segmented into multiple partitions that can be independently accessed by different servers. This segmentation eliminates access conflicts by providing dedicated storage segments for each partition while allowing multiple servers to operate in parallel without interfering with each other's access patterns.
Solution Approach 2:
The patent introduces a coordination mechanism that acts as an intermediary between servers and partitions. This mediator manages partition assignment and server-to-partition mapping, simplifying access conflict management while maintaining the benefits of parallel server operation.
3Ease of operation
If partitions are reestablished when server count changes, then load distribution is maintained, but extra time and resources are consumed
Solution Approach 1:
The system implements self-service partition redistribution where servers automatically adjust their partition assignments when the server count changes. Rather than requiring external reconfiguration, servers autonomously negotiate and redistribute partitions among themselves, maintaining load distribution while consuming minimal additional resources.
Data Source
AI summary
A plurality of servers are each coupled to a different one of a plurality of databases that are synchronized with each other. A search request specifying a search range is sent from a search-requesting device to the servers. Each server calculates a search subrange from the search range specified in the search request received from the search-requesting device, performs a data search operation only within the calculated search subrange of the database coupled thereto, and sends a search result back to the search-requesting device.