Pointer Table for IoT Subscription Data Store Selection

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Maintaining a large number of IoT device subscriptions in an in-memory data store requires significant computational and storage resources, leading to operational burdens and scalability issues.

Innovation Solution

Implementing a pointer table for data store selection and routing, which allows for efficient storage of subscription information by determining the appropriate target data store based on the type of subscription (concrete or wildcard) and criteria, thereby optimizing resource usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If all subscription information is stored in an in-memory data store, then message routing efficiency is improved, but resource consumption increases

Engineering Contradiction:
Improvemessage routing efficiencyVSAvoidcomputational and storage resources
Core Design Contradiction:
SpeedVSUse of energy by moving object

Solution Approach 1:

The patent segments the in-memory data store into multiple data stores organized in a tree structure, where each node can be an independent data store. This allows the system to maintain the efficiency of in-memory storage for frequently accessed subscription information while reducing overall resource consumption by distributing data across multiple stores and allowing selective caching of only necessary portions in memory.

Inventive Principle:
Principle #1Segmentation

2Speed

If a trie structure is used to store wildcard topic subscriptions, then subscription lookup efficiency is improved, but device complexity increases

Engineering Contradiction:
Improvesubscription lookup efficiencyVSAvoiddata structure complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The patent divides the trie structure into multiple smaller data stores distributed across the tree structure. Each data store manages a portion of the subscription information, reducing the complexity of individual data structures while maintaining the efficient lookup capabilities of the trie through the hierarchical organization and indexing mechanisms.

Inventive Principle:
Principle #1Segmentation

3Use of energy by moving object

If subscription information is distributed across multiple data stores, then resource consumption is reduced, but routing complexity increases

Engineering Contradiction:
Improvestorage resourcesVSAvoidrouting logic complexity
Core Design Contradiction:
Use of energy by moving objectVSDevice complexity

Solution Approach 1:

The patent introduces a routing mechanism that acts as an intermediary between the distributed data stores and the message routing process. This routing layer manages the distribution of subscription information across multiple data stores, handling the complexity of data location and retrieval while presenting a simplified interface to the rest of the system. The routing mechanism uses the tree structure to efficiently determine which data stores contain relevant subscription information.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS12222920B1Data store selection and consistent routing using a pointer table
Publication Date: 2025.02.11 AMAZON TECH INC
  • US12222920B1 patent drawing
  • US12222920B1 patent drawing
  • US12222920B1 patent drawing

AI summary

A subscription storage service of a provider network may be used to select a particular datastore to store a topic subscription record for an IoT device (e.g., after the IoT device subscribes to an MQTT topic). The service may select the particular datastore based on the type of the subscription (e.g., non-wildcard vs. wildcard subscription) and one or more criteria associated with the topic (e.g., subscribe operation TPS for the topic). This may allow the service to store wildcard subscriptions to a different structure and/or datastore (e.g., a “trie” structure of an in-memory data store), while offloading the storage of non-wildcard subscriptions to another type of datastore (e.g., a key-value store) that has lower performance and/or operational cost to store data.