Blockchain DID Relationship Graph for Description Generation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for generating description information of objects are inefficient and lack comprehensiveness, requiring extensive data collection and processing, and often fail to provide accurate and up-to-date information due to static data management.
Innovation Solution
A method and apparatus that utilize decentralized identifiers (DIDs) registered on a blockchain to generate description information by creating a relationship graph based on associated DIDs and dynamic service data, allowing for efficient and accurate information retrieval by establishing associations between DIDs and updating the graph dynamically.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional data collection and processing methods are used to generate description information, then comprehensive information can be obtained, but the process is inefficient and time-consuming
Solution Approach 1:
The patent applies preliminary action by pre-establishing the relationship graph structure and pre-registering DIDs on the blockchain before actual description information generation is needed. The system prepares the infrastructure in advance so that when description information is required, it can be quickly generated by querying the pre-built graph rather than collecting and processing raw data from scratch.
Solution Approach 2:
The patent uses copying by creating a graph-based representation (copy) of the relationships between objects and their attributes. Instead of processing the original complex data sets each time, the system maintains a simplified graph copy that captures essential relationships, enabling rapid querying and description generation without reprocessing the full data collection.
2Measurement precision
If static data management is used, then data storage is simple, but the information becomes outdated and inaccurate over time
Solution Approach 1:
The patent applies dynamics by implementing a dynamic relationship graph that can be updated and modified as new information becomes available. The graph structure allows for adding, removing, and modifying relationships between DIDs and their attributes over time, ensuring the description information remains current without requiring complete system redesign.
Solution Approach 2:
The patent implements feedback mechanisms where the system continuously queries the blockchain for updated DID information and relationship data, then updates the relationship graph accordingly. This feedback loop ensures the description information remains accurate and current by automatically incorporating new data while maintaining the overall system structure.
3Loss of information
If extensive data collection is performed to ensure comprehensiveness, then complete description information can be obtained, but the processing complexity and resource requirements increase
Solution Approach 1:
The patent applies extraction by selectively extracting only the essential relationships and attributes needed for description information from the full data set. The relationship graph captures key connections between DIDs and their relevant attributes without storing or processing every possible data point, reducing complexity while maintaining comprehensiveness.
Solution Approach 2:
The patent uses segmentation by dividing the overall data structure into modular components: individual DIDs, their attributes, and relationships between them. This segmentation allows the system to process and query specific portions of the data independently, reducing overall processing complexity while maintaining complete coverage of description information.
Data Source
AI summary
One or more implementations of the present specification provide a method and an apparatus for generating description information. The method for generating description information includes: determining local DIDs registered in a first blockchain, and generating a relationship graph of all local DIDs based on data that is related to individual local DIDs and that is maintained by a first blockchain node corresponding to the first blockchain; determining, from the relationship graph and based on a target local DID corresponding to a target object, an associated local DID related to the target local DID; and generating description information of the target object based on (a) an association relationship between the target local DID and the associated local DID and (b) data related to the associated local DID.