Distributed Query State Polling Under Coordinator Memory Limits
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed computer databases face memory issues due to nodal query states exceeding the coordinator node's memory capacity, leading to crashes and failures.
Innovation Solution
Implement a protective distributed database service that imposes a data size limit on nodal query states, ensuring they do not exceed the coordinator node's memory capacity, and conducts additional polling cycles if necessary to retrieve compliant query states.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If nodal query states are collected from all computer nodes, then complete query results are obtained, but memory capacity of the coordinator node is exceeded causing crashes
Solution Approach 1:
The patent segments the query processing into multiple polling cycles, each handling a subset of computer nodes. The coordinator node processes nodes in groups (e.g., first polling cycle handles nodes 1-N, second cycle handles nodes N+1-2N), ensuring that memory capacity is not exceeded in any single cycle while still collecting complete query results across all nodes.
Solution Approach 2:
The patent implements periodic polling cycles where the coordinator node systematically queries computer nodes in repeated rounds. Each polling cycle operates within defined time intervals and processes a specific batch of nodes, allowing the system to gradually collect all query states without overwhelming memory resources in any single period.
2Reliability
If data size limit is imposed on nodal query states, then memory capacity is protected, but query states that exceed the limit cannot be retrieved
Solution Approach 1:
The patent dynamically adjusts the data size limit for different polling cycles based on the coordinator node's available memory capacity and the characteristics of remaining unpolled nodes. The system can increase or decrease the limit adaptively, allowing larger query states to be retrieved in later cycles when memory is freed up, ensuring complete information retrieval while maintaining memory stability throughout the process.
3Reliability
If multiple polling cycles are conducted to retrieve compliant query states, then complete data is obtained, but processing time increases
Solution Approach 1:
The patent performs preliminary actions in each polling cycle by first checking which computer nodes have already provided compliant query states and identifying which nodes remain to be polled. This preliminary assessment allows the system to optimize subsequent polling operations, avoid redundant queries, and efficiently allocate memory resources before each cycle begins, reducing overall processing time while ensuring data completeness.
Data Source
AI summary
Computer nodes associated with a cluster store a distributed database. The computer nodes are polled to retrieve their individual nodal query states. A coordinator node then merges the individual nodal query states to determine an overall query state associated with the distributed database. The coordinator node, though, has a memory capacity that can be overcome by some nodal query states. The coordinator node thus imposes a data size limit on the nodal query states to prevent memory failures. The coordinator node specifies the data size limit during any polling cycle, and the coordinator node receives compliant nodal query states that satisfy the data size limit. The coordinator node may adjust or revise the data size limit for subsequent polling cycles, based on a count of the nodal query states yet to be retrieved. The data size limit thus ensures that the memory capacity is not overcome during any polling cycle.