Notification Queue Management Using Binary Search

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Electronic notification systems face challenges in managing computer disk space due to insufficient memory to store complete records of notifications, especially in enterprise settings where a large number of notifications are generated rapidly.

Innovation Solution

The system employs a method to manage notification storage by dividing the storage into approximately equal segments, using reclamation and ingestion pointers to determine when to remove older notifications and make space for new ones, and utilizing a binary search algorithm to efficiently determine the number of notifications in each segment.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If notifications are stored in a data store without segmentation, then complete records of all notifications can be maintained, but the system will overflow when the number of notifications exceeds available memory

Engineering Contradiction:
Improvenotification storage completenessVSAvoidmemory capacity
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The data store is divided into approximately equal segments, allowing the system to manage storage in manageable units. This segmentation enables the system to track notifications within each segment using pointers, preventing overflow by knowing when to remove older notifications and make space for new ones.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system uses a binary search algorithm to efficiently determine the number of notifications in each segment, changing the parameter of search efficiency. This allows rapid assessment of segment fullness and triggers appropriate actions to maintain storage within memory constraints while preserving notification records.

Inventive Principle:
Principle #35Parameter changes

2Loss of information

If all notifications are retained in memory, then complete notification history is available, but system performance degrades due to memory constraints

Engineering Contradiction:
Improvenotification record retentionVSAvoidsystem performance
Core Design Contradiction:
Loss of informationVSProductivity

Solution Approach 1:

The system performs preliminary actions by dividing the data store into segments and establishing pointer mechanisms in advance. This preparation allows the system to efficiently manage notification storage by pre-determining when to remove older notifications, thus maintaining performance while preserving necessary notification history.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent replaces manual or linear search methods with a binary search algorithm, substituting an inefficient mechanical approach with a more sophisticated computational method. This substitution significantly improves search efficiency and system performance when managing notification records.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

3Reliability

If the data store is frequently expanded to accommodate more notifications, then notification overflow is prevented, but storage costs and system complexity increase

Engineering Contradiction:
Improvenotification storage capacityVSAvoidstorage management complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The system dynamically manages storage by using pointers to track the number of notifications in each segment. This dynamic approach allows the system to adapt to varying notification volumes without requiring frequent physical expansion of the data store, thereby preventing overflow while maintaining manageable complexity.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The segmented data store structure with pointer tracking enables the system to self-manage its storage capacity. By automatically determining when segments are full and triggering removal of older notifications, the system serves itself without requiring external intervention or complex expansion mechanisms.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS12298967B2Systems and methods for electronic notification queues
Publication Date: 2025.05.13 WALMART APOLLO LLC
  • US12298967B2 patent drawing
  • US12298967B2 patent drawing
  • US12298967B2 patent drawing

AI summary

A system can include one or more processors and one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform operations: receiving a new notification; determining, using a binary search algorithm, a number of one or more notifications, wherein an interval of the binary search algorithm comprises a time period between a reclamation pointer and an ingestion pointer; when the number of the one or more notifications is greater than a maximum number of notifications, removing, from a central data store, at least one notification of the one or more notifications; and storing the new notification in the central data store. Other embodiments are described.