Systems, apparatuses, methods, and computer program products for optimizing search latency

Inventors

Singh, Ankit • PAILA, Lakshminarayana

Assignees

Honeywell International Inc

Abstract

Systems, apparatuses, methods, and computer program products are provided. For example, a computer-implemented method may include receiving one or more datasets from a user. In some embodiments, computer-implemented method may include storing at least a portion of the one or more datasets in a first shard during a first time period. In some embodiments, the first shard comprises shard data. In some embodiments, the shard data is associated with a data size. In some embodiments, computer-implemented method may include determining that the data size of the shard data in the first shard is greater than a first data size threshold. In some embodiments, computer-implemented method may include in response to the determination that the data size of the shard data in the first shard is greater than the first data size threshold, transferring at least a portion of the shard data in the first shard to a second shard.

Core Innovation

The disclosed invention relates to systems, methods, and apparatus for optimizing search latency in sharded databases by monitoring shard data size and comparing it to a latency-relevant threshold. At least a portion of one or more datasets is stored in a first shard during a first time period, and a first latency involved in responding to a first query to access the first shard during a second time period is used to determine whether the data size is greater than a first data size threshold.

When the data size of the shard data in the first shard is greater than the first data size threshold, at least a portion of the shard data in the first shard is transferred to a second shard. The transfer is based at least on a location of the user identified as inactive, and the first data size threshold is adjusted based on analysis of historical activity data and query latency associated with the user.

The disclosure also describes a complementary consolidation rule in which, when another shard’s data size is below a second data size threshold, data may be transferred from that shard to a fourth shard. Shards may be associated with one or more databases, and the document describes use of processors and memory in an apparatus implementation.

Claims Coverage

The partial content provides three independent claims: clm-00001 (computer-implemented method), clm-00011 (apparatus), and clm-00020 (non-transitory computer-readable storage medium). Each independent claim includes three inventive features.

Across the independent claims, the coverage centers on transferring shard data when shard data size exceeds a latency-based data size threshold, selecting a target based on a user location identified as inactive, and adjusting that threshold using historical activity data and query latency.

Stated Advantages

Documented Applications

No documented applications found