IoT Device Management via Hierarchical Graph and Time-Series Database Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Managing Internet of Things (IoT) devices across various physical environments is challenging due to difficulties in intuitively organizing devices, controlling user access, and efficiently accessing and processing the vast amounts of data they generate, as existing approaches fail to efficiently represent physical spaces and IoT devices while providing efficient access to sensor data and user access management.
Innovation Solution
A multi-database environment is introduced, featuring a hierarchical graph for storing static information about the physical environment and dynamic data structures for sensor data, allowing for quick queries and flexible management of IoT devices and user access, with the ability to modify properties and attributes of nodes within the graph, enabling efficient organization and control of devices and data access.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single database structure is used to store both static physical environment information and dynamic sensor data, then system simplicity is maintained, but query efficiency for sensor data and flexibility in managing different physical environments deteriorate
Solution Approach 1:
The patent divides the database into two separate structures: a graph database for static physical environment information and a time-series database for dynamic sensor data. This segmentation allows each database to be optimized for its specific data type, with the graph database enabling efficient spatial queries and the time-series database providing fast sensor data access, thereby resolving the contradiction between system simplicity and query efficiency.
2Adaptability or versatility
If a hierarchical graph structure is used to represent physical spaces and devices, then intuitive organization and flexible management are improved, but system complexity increases
Solution Approach 1:
The patent combines a hierarchical graph structure with a time-series database, where the graph database represents physical spaces, devices, and their relationships, while the time-series database stores sensor data. The system merges these two structures through device identifiers, allowing flexible management of IoT devices across different physical environments while maintaining manageable system complexity through specialized database components.
3Loss of information
If extensive data structures are used to store detailed physical environment topology, then comprehensive device organization is achieved, but access speed to sensor data deteriorates
Solution Approach 1:
The patent extracts sensor data from the graph database structure and stores it separately in a time-series database. This extraction allows the graph database to maintain comprehensive physical environment topology information while the time-series database provides fast access to sensor data, eliminating the trade-off between information completeness and access speed.
4Ease of manufacture
If traditional database structures are used for IoT device management, then ease of implementation is maintained, but user access control granularity and device organization deteriorate
Solution Approach 1:
The patent introduces a property key mechanism as an intermediary between the graph database and time-series database. Property keys enable fine-grained access control by allowing different permission levels to be assigned to different nodes in the hierarchical graph, while maintaining ease of implementation through a standardized interface that abstracts the underlying database complexity.
Data Source
AI summary
Generating property keys associated with nodes of a hierarchical graph that defines a topology of a physical space and that is configured to provide user data and sensor data from devices within a physical space. A first property key associated with a first node of the plurality of nodes within the hierarchical graph is received and stored in a property store in association with a first path of the first node. In response to receiving a request associated with determining each property key available to a second node that is a child node of the first node, the first property key is identified as being available to the second node by virtue of the second node being a child node of the first node. The first property key is updated in the property store to also be associated with the second path of the second node.