Graph Database Service Status Analysis for Telecommunication Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network management systems using relational databases face challenges with scattered data storage, repeated data storage, and low query efficiency, making it difficult to quickly perceive and analyze service status in real-time, which fails to meet the requirements of engineering operation and maintenance in complex telecommunication networks.
Innovation Solution
A method utilizing a graph database generated from a service description table, where each vertex represents a service, and attribute data is used to determine service status levels based on propagation relationships, allowing for real-time analysis of service status and efficient data storage and retrieval.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If relational databases are used to store service-related information data, then data storage and management is achieved, but data storage becomes scattered and query efficiency decreases
Solution Approach 1:
The patent merges service-related information data from multiple scattered sources into a unified graph database structure. The graph database integrates service description tables, alarm information, and performance data into a single cohesive model where services are represented as vertices and relationships as edges, eliminating data scattering and improving query efficiency through unified data access.
Solution Approach 2:
The patent segments service data into distinct logical components (services as vertices, relationships as edges) while maintaining unified management. This segmentation allows for modular data organization where each service can be independently queried and analyzed, yet all data remains centrally managed in the graph database structure.
2Loss of time
If relational databases are used to manage service data, then data storage is achieved, but real-time service status perception and analysis becomes difficult
Solution Approach 1:
The patent performs preliminary actions by pre-establishing the graph database structure and pre-loading service description tables, alarm information, and performance data before actual analysis is needed. This preliminary preparation ensures that when service status analysis is required, the data is already organized and ready for immediate querying, eliminating time delays in real-time perception and analysis.
Solution Approach 2:
The patent replaces the traditional relational database mechanical query system with a graph database system that uses traversal and navigation mechanisms. This substitution allows for more efficient real-time analysis by directly navigating service relationships through graph edges rather than performing complex joins and filters across multiple tables, significantly improving service status analysis speed.
3Reliability
If relational databases are used, then data storage is achieved, but data scattering and repeated storage occur
Solution Approach 1:
The patent creates a universal graph database structure that serves multiple functions simultaneously: storing service description data, alarm information, and performance data; establishing service relationships; and enabling various types of queries and analyses. This multi-functional approach eliminates data scattering by providing a single unified storage system that handles all service-related information without requiring separate data structures for each function.
Data Source
AI summary
Provided are a method for service status analysis, a server, and a storage medium. The method includes: for each vertex of multiple vertices in a graph database: reading out attribute data of the vertex, where the graph database is generated in advance according to a service description table, the vertex represents a service, and the attribute data of the vertex includes at least one service attribute of the service represented by the vertex; and according to the attribute data of the vertex and attribute data of each of multiple related vertices, determining a service status level of the service represented by the vertex, where each of the multiple related vertices has a propagation relationship with the vertex; and according to the service status level of each of the services represented by the vertices, analyzing a service propagation network.