Movatterモバイル変換


[0]ホーム

URL:


CN120455110B - Data resource positioning method and system based on identification analysis - Google Patents

Data resource positioning method and system based on identification analysis

Info

Publication number
CN120455110B
CN120455110BCN202510666215.5ACN202510666215ACN120455110BCN 120455110 BCN120455110 BCN 120455110BCN 202510666215 ACN202510666215 ACN 202510666215ACN 120455110 BCN120455110 BCN 120455110B
Authority
CN
China
Prior art keywords
resource
data resource
identification
analysis
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202510666215.5A
Other languages
Chinese (zh)
Other versions
CN120455110A (en
Inventor
廖金华
苏志千
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Zhongde Information Technology Co ltd
Original Assignee
Guangzhou Zhongde Information Technology Co ltd
Filing date
Publication date
Application filed by Guangzhou Zhongde Information Technology Co ltdfiledCriticalGuangzhou Zhongde Information Technology Co ltd
Priority to CN202510666215.5ApriorityCriticalpatent/CN120455110B/en
Publication of CN120455110ApublicationCriticalpatent/CN120455110A/en
Application grantedgrantedCritical
Publication of CN120455110BpublicationCriticalpatent/CN120455110B/en
Activelegal-statusCriticalCurrent
Anticipated expirationlegal-statusCritical

Links

Abstract

The application discloses a data resource positioning method and a system based on identification analysis, which relate to the technical field of data communication and resource management and comprise the steps of receiving a data resource positioning request, and separating a global unique identification in the data resource positioning request into a prefix part and a suffix part; the method comprises the steps of executing main domain analysis according to a prefix part, executing resource analysis according to a suffix part, transmitting the suffix part to a digital object warehouse gateway address by resource analysis, retrieving and returning target data resources from a corresponding digital object warehouse by a gateway corresponding to the digital object warehouse gateway address according to the suffix part, and verifying access rights. The application solves the technical problem of accurate positioning of massive heterogeneous data resources through a hierarchical processing mechanism of main domain analysis and resource analysis, and adopts the technical means of prefix level inquiry and suffix accurate matching, thereby realizing unified management and efficient access of data resources, improving data sharing and exchange efficiency and ensuring the safety of data access.

Description

Data resource positioning method and system based on identification analysis
Technical Field
The application relates to the technical field of data communication and resource management, in particular to a data resource positioning method and system based on identification analysis.
Background
The data resource identification and resolution system is a key component of the digital economic infrastructure. The identification resolution system originates from an internet domain name resolution system DNS, and then identification resolution technologies such as Handle systems, DOI (Digital Object Identifier) and the like are developed. These systems enable permanent identification and reliable access of digital resources by assigning a globally unique identifier to a digital object and providing a resolution service to map the identification to resource location information. In the field of industrial Internet, an identification resolution system is regarded as a core technology base for realizing global product tracing, supply chain collaboration and resource sharing. At present, a plurality of identification analysis technologies are simultaneously developed, and diversified technical ecologies represented by OID (Object Identifier), ecodes, handles and the like are formed. Particularly in the environment of the Internet of things and big data, the identification resolution technology is evolving from traditional domain name resolution to a more complex distributed identification resolution direction so as to adapt to the requirements of high-efficiency positioning and management of data resources across organizations and industries.
However, existing identification resolution techniques still have significant shortcomings in handling cross-domain sharing and exchange of heterogeneous data resources. First, conventional identifier parsing systems generally employ a single parsing structure, and lack hierarchical processing mechanisms for identifier prefixes and suffixes, resulting in low efficiency of cross-domain resource positioning. Secondly, in the prior art, when cross-industry and cross-organization data resource access is realized, the analysis path is fixed, and cannot be dynamically adjusted according to the network state, so that the system reliability is insufficient. Thirdly, the current identification analysis technology has limited interconnection support for data intercommunication among different industry fields, and the processing of the mapping relation among the fields is simple, so that the high-efficiency positioning requirement of the data resource under the complex scene is difficult to meet. Fourth, the existing solutions lack an effective caching mechanism and a load balancing strategy when processing large-scale data resource access, and the response speed and stability of the system are difficult to guarantee. In addition, the prior art often adopts a unified policy in terms of access control, cannot realize refined authority management aiming at cross-domain access, and has potential security risks.
Disclosure of Invention
The present application has been made in view of the above-described problems.
Therefore, the application provides a data resource positioning method and a system based on identification analysis, which can solve the problems in the background technology.
In order to solve the technical problems, the application provides the following technical scheme:
In a first aspect, the application provides a data resource positioning method based on identification analysis, which comprises the steps of receiving a data resource positioning request, separating a globally unique identification in the data resource positioning request into a prefix part and a suffix part, wherein the prefix part is used for determining a domain to which a data resource belongs, the suffix part is used for identifying a unique target data resource, executing main domain analysis according to the prefix part, determining a digital object warehouse gateway address corresponding to the data resource through step-by-step query in a digital object registry, the step-by-step query is downwards positioned from a root node along a hierarchical structure of the prefix part, executing resource analysis according to the suffix part, sending the suffix part to the digital object warehouse gateway address by the resource analysis, and retrieving and returning the target data resource from a corresponding digital object warehouse according to the suffix part by a gateway corresponding to the digital object warehouse, and simultaneously verifying access rights.
Preferably, the separating the globally unique identifier in the data resource location request into a prefix portion and a suffix portion comprises identifying a preset separator position in the globally unique identifier, extracting a portion before the preset separator as the prefix portion, and extracting a portion after the preset separator as the suffix portion.
Preferably, the prefix portion has a hierarchical structure, and each level in the hierarchical structure is connected by a level separator, and the level separator is different from a preset separator between the prefix portion and the suffix portion.
Preferably, the progressive query comprises the steps of acquiring an identification resolution server address of a second level in a root node identification resolution server according to a first level of the prefix part, acquiring an identification resolution server address of a third level in the identification resolution server of the second level according to the second level of the prefix part, acquiring an identification resolution server address of a next level in a corresponding identification resolution server according to each subsequent level of the prefix part, executing reachability verification on each identification resolution server accessed in the progressive query process, wherein the reachability verification comprises the steps of sending a detection data packet to a target identification resolution server and monitoring response time, judging that the target identification resolution server is not reachable when the response time exceeds a preset time threshold or no response data packet is received, selecting a standby path from a standby server table to continue executing the progressive query, and dynamically adjusting the query path according to the current network topology state.
Preferably, the step-by-step query in the main domain resolution adopts a multi-level caching mechanism, wherein the multi-level caching mechanism comprises the steps of storing the mapping relation between the levels of the prefix part and the corresponding identification resolution server addresses or the digital object warehouse gateway addresses into a local cache after the query is completed, checking whether cache data of the corresponding levels exist in the local cache when the query is executed, and using the cache data without executing actual query when the cache data of the corresponding levels exist in the local cache and are not expired.
Preferably, the prefix part comprises a cross-domain access identifier, wherein the cross-domain access identifier is used for indicating access relations among different industry domains or organization domains, in the main domain analysis, when the cross-domain access identifier is detected, a cross-domain access path is determined according to a pre-established inter-domain mapping relation, the inter-domain mapping relation comprises a direct mapping relation and a transfer mapping relation, the transfer mapping relation is used for realizing data resource access among domains without direct access permission, permission decremental conversion is executed according to the cross-domain access path, and after the cross-domain access is completed, an access log is recorded and the inter-domain mapping relation is updated.
Preferably, the resource analysis comprises the steps of analyzing the suffix part, extracting a resource type identifier and a resource instance identifier from the suffix part, determining a storage position and an access mode of the target data resource according to the resource type identifier, retrieving the target data resource from the digital object warehouse according to the resource instance identifier, and returning the retrieved target data resource after format conversion and security processing.
The application further provides a data resource positioning system based on identification analysis, which comprises an identification analysis module, a main domain analysis module, a resource analysis module and a resource analysis module, wherein the identification analysis module is used for receiving a data resource positioning request, separating a globally unique identification in the data resource positioning request into a prefix part and a suffix part, the main domain analysis module is used for executing main domain analysis according to the prefix part, the main domain analysis determines a digital object warehouse gateway address corresponding to a data resource through step-by-step inquiry in a digital object registry, the resource analysis module is used for executing resource analysis according to the suffix part, the resource analysis sends the suffix part to the digital object warehouse gateway address, and a gateway corresponding to the digital object warehouse gateway address searches and returns a target data resource from a corresponding digital object warehouse according to the suffix part, and meanwhile, the access authority is verified.
In a third aspect, the application also provides a computer device comprising a memory and a processor, wherein the memory stores a computer program, the processor executes the computer program to realize the steps of receiving a data resource positioning request, separating a globally unique identifier in the data resource positioning request into a prefix part and a suffix part, the prefix part is used for determining a domain to which a data resource belongs, the suffix part is used for identifying a unique target data resource, executing main domain analysis according to the prefix part, determining a digital object warehouse gateway address corresponding to the data resource by step-by-step inquiry in a digital object registry, the step-by-step inquiry is downwards located along a hierarchical structure of the prefix part from a root node, executing resource analysis according to the suffix part, and transmitting the suffix part to the digital object warehouse gateway address by the resource analysis, wherein a gateway corresponding to the digital object warehouse gateway address searches and returns the target data resource from a corresponding digital object warehouse according to the suffix part, and verifies access authority.
In a fourth aspect, the present application also provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of receiving a data resource location request, separating a globally unique identifier in the data resource location request into a prefix portion and a suffix portion, the prefix portion being used to determine a domain to which a data resource belongs, the suffix portion being used to identify a unique target data resource, performing a master domain resolution according to the prefix portion, the master domain resolution determining a digital object repository gateway address corresponding to the data resource by a progressive query in a digital object registry, the progressive query being located down from a root node along a hierarchy of the prefix portion, performing a resource resolution according to the suffix portion, the resource resolution sending the suffix portion to the digital object repository gateway address, the gateway corresponding to the digital object repository gateway address retrieving and returning the target data resource from a corresponding digital object repository according to the suffix portion, and simultaneously verifying access rights.
The method and the system for positioning the data resources based on the identification analysis have the advantages that the global unique identification is separated into the prefix part and the suffix part, and a secondary analysis framework combining main domain analysis and resource analysis is adopted, so that the technical problem of high-efficiency positioning of the cross-domain data resources is solved. The method and the system improve the efficiency of data resource positioning, realize millisecond-level resource positioning response, enhance the reliability of the system, ensure the stability of analysis service through reachability verification and dynamic path adjustment, realize cross-industry and cross-organization data resource seamless access, break data islands, promote the sharing and circulation of the data resources, and ensure the safety of cross-domain data access through a permission descending conversion mechanism.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the related art, the drawings that are needed in the description of the embodiments of the present application or the related technologies will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and other related drawings may be obtained according to these drawings without inventive effort to those of ordinary skill in the art.
FIG. 1 is an overall flow chart of a data resource positioning method based on identity resolution in accordance with the present application;
FIG. 2 is a schematic diagram of the overall structure of a data resource positioning system based on identification resolution according to the present application;
Fig. 3 is a diagram of a computer device for a method for locating a data resource based on identification resolution according to the present application.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
The application provides a data resource positioning method based on identification analysis, which comprises the following steps S100 to S300, as shown in FIG. 1:
Step S100, receiving a data resource positioning request, and separating a globally unique identifier in the data resource positioning request into a prefix part and a suffix part.
In this embodiment, the data resource location request may be initiated by the user terminal and transmitted to the identifier resolution system through the network. The data resource location request contains a globally unique identification of the data resource to be located, which is a code for uniquely identifying the data resource in the distributed environment.
The prefix portion is used to determine the domain to which the data resource belongs and the suffix portion is used to identify the unique target data resource. The prefix part is equivalent to a partition number in an identification system and is used for indicating an industry domain or an organization domain to which the data resource belongs, and the suffix part is equivalent to a unique resource identifier in a specific domain and is used for accurately positioning the specific data resource.
Specifically, the method for separating the global unique identifier in the data resource positioning request into a prefix part and a suffix part comprises the steps of identifying a preset separator position in the global unique identifier, extracting a part before the preset separator as the prefix part, and extracting a part after the preset separator as the suffix part.
For example, the globally unique identification of a data resource may be "88.123.456/resource.data", where "/" is a preset separator, "88.123.456" is extracted as a prefix portion and "resource.data" is extracted as a suffix portion. The separation mode enables the identification analysis system to determine the management domain to which the data resource belongs according to the prefix, and then determine the specific data resource according to the suffix.
The prefix portion has a hierarchical structure, and each level in the hierarchical structure is connected by a level separator, and the level separator is different from a preset separator between the prefix portion and the suffix portion.
In this embodiment, the prefix portion is in a hierarchical structure, the levels are connected by a level separator (e.g., ") and the prefix and the suffix are separated by a different predetermined separator (e.g.,"/"). This design allows the identification system to implement multi-level parsing, e.g., "88" in "88.123.456" might represent industry classification, "123" for organization category, and "456" for specific organization code. The distinction of the hierarchical separator from the preset separator enables the system to clearly discern the identified hierarchical structure and prefix-suffix boundaries.
Illustratively, in one particular application scenario, a user needs to access a piece of medical data stored in a distributed system. The user terminal sends a data resource location request containing a globally unique identifier "10.25.789/partner 0012.Record". After the identifier resolution system receives the request, it first identifies the position of the preset separator "/", then extracts "10.25.789" before the separator as the prefix part and "partial 0012.Record" as the suffix part. Wherein the hierarchy of prefix portion "10.25.789" is connected by a hierarchical separator "," 10 "represents the medical industry," 25 "represents the hospital class and" 789 "represents a specific hospital code.
By separating the global unique identifier into the prefix part and the suffix part, the application can realize hierarchical analysis and improve analysis efficiency. The prefix part is used for determining the domain of the data resource, which is equivalent to narrowing the searching range in a wide data resource space, and the suffix part is used for precisely positioning the target data resource in a specific domain, so that the layering mechanism greatly improves the positioning efficiency in a mass distributed data environment.
And S200, performing main domain analysis according to the prefix part, wherein the main domain analysis determines the digital object warehouse gateway address corresponding to the data resource through step-by-step inquiry in the digital object registry, and the step-by-step inquiry is downwards positioned from the root node along the hierarchical structure of the prefix part.
After separating the globally unique identifier into a prefix portion and a suffix portion in step S100, the main domain resolution phase is entered. The purpose of the primary domain resolution is to determine the gateway address of the target data resource storage location. This process is accomplished by means of a digital object registry that is responsible for storing and maintaining the mapping between identification prefixes and digital object repository gateway addresses.
In this embodiment, the primary domain analysis adopts a progressive query mechanism, and starts from the root node, and locates down layer by layer along the hierarchical structure of the prefix portion until the digital object repository gateway address where the target data resource is located is found.
The progressive query comprises the steps of obtaining an identification analysis server address of a second level in a root node identification analysis server according to a first level of a prefix part, obtaining an identification analysis server address of a third level in the identification analysis server of the second level according to the second level of the prefix part, and obtaining an identification analysis server address of a next level in a corresponding identification analysis server according to each subsequent level of the prefix part.
Taking the foregoing example "10.25.789" as an example, firstly, the address of the medical industry identification analysis server is obtained by inquiring in the root node identification analysis server according to the first level "10" (representing the medical industry), then the identification analysis server address of the type of hospital is obtained by inquiring in the medical industry identification analysis server according to the second level "25" (representing the hospital category), and finally the digital object warehouse gateway address of the type of hospital is obtained by inquiring in the identification analysis server of the type of hospital according to the third level "789" (representing the specific hospital code). The progressive query mechanism ensures that the gateway where the target resource is located can be rapidly located even in a mass data resource environment.
In order to improve reliability and stability of resolution, the embodiment performs reachability verification on each identification resolution server accessed in the progressive query process. The reachability verification comprises the steps of sending a detection data packet to a target identification analysis server, monitoring response time, judging that the target identification analysis server is not reachable when the response time exceeds a preset time threshold or the response data packet is not received, selecting a standby path from a standby server table to continue to execute step-by-step query, and dynamically adjusting the query path according to the current network topology state.
Reachability verification is an important mechanism for guaranteeing resolution stability. In an actual network environment, the identity resolution server may be temporarily unavailable due to network fluctuations, hardware failures, or system maintenance, etc. Reachability verification in this embodiment detects the state of the target server by sending a probe packet (e.g., ICMP request or specific application layer probe message). A response time threshold (e.g., 500 milliseconds) is preset, and when a response time exceeding the threshold or no response data packet is received at all is detected, the server is determined to be unreachable.
After determining that the server is not reachable, the resolution process is not interrupted, but an alternative path is selected from a pre-configured list of backup servers. The standby server table stores a plurality of standby resolution server addresses for each hierarchy, ordered by reliability. The highest ranking available standby server in the current tier is selected to continue executing queries. This mechanism ensures that the entire resolution process can be completed smoothly even if part of the resolution server is not available.
In addition, the present embodiment dynamically adjusts the query path according to the current network topology state. By periodically collecting network state information (e.g., delay between nodes, bandwidth utilization, connection status, etc.), a real-time network topology map is constructed. When performing the progressive query, referring to this topology, an optimal query path under the current network environment is selected, for example, a link with low delay and sufficient bandwidth is preferentially selected. The dynamic adjustment mechanism enables the analysis process to adapt to the continuously-changing network environment, and improves the analysis efficiency and success rate.
The step-by-step inquiry in the main domain analysis adopts a multi-level caching mechanism, wherein the multi-level caching mechanism comprises the steps of storing the mapping relation between the level of the prefix part and the corresponding identification analysis server address or digital object warehouse gateway address into a local cache after the inquiry is completed, checking whether cache data of the corresponding level exist in the local cache when the inquiry is executed, and using the cache data without executing actual inquiry when the cache data of the corresponding level exist in the local cache and are not expired.
The multi-level caching mechanism is an important means for improving the resolution efficiency. In practical applications, users often access different resources in the same domain multiple times in a short time, or multiple users access resources in the same domain. Through a caching mechanism, repeated inquiry can be obviously reduced, network load is reduced, and response speed is improved.
The multi-level cache adopted in the embodiment comprises a local cache and a distributed cache of each level of identification analysis servers. After completing a complete step-by-step query, the mapping relationship between each level of the prefix portion and the corresponding resolution server address (or final gateway address) is stored in the local cache. The cache entry contains data such as mapping information, cache time, and validity period. The expiration date may be dynamically set according to the type of resource, domain characteristics, and network environment, and is typically varied from several minutes to several hours.
When the query is executed subsequently, it is first checked whether the local cache has cached data of the corresponding hierarchy. If effective cache data is found (i.e. not expired), the cache data is directly used, so that actual network inquiry is avoided, and the analysis delay is greatly reduced. For example, if the mapping of the prefix "10.25" is already in the cache, queries to the root node and the healthcare industry identification resolution server may be skipped directly, starting queries directly from the resolution server of the hospital class.
In order to process some more complex cross-domain access scenes, the embodiment provides a cross-domain analysis mechanism, wherein a prefix part comprises a cross-domain access identifier, the cross-domain access identifier is used for indicating access relations among different industry domains or organization domains, in main domain analysis, when the cross-domain access identifier is detected, a cross-domain access path is determined according to a pre-established inter-domain mapping relation, the inter-domain mapping relation comprises a direct mapping relation and a transfer mapping relation, the transfer mapping relation is used for realizing data resource access among domains without direct access permission, permission decremental conversion is performed according to the cross-domain access path, and after the cross-domain access is completed, an access log is recorded and the inter-domain mapping relation is updated.
In practical applications, data resources often need to be shared between different industry or organization domains. The present embodiment supports such cross-domain access requirements by including a cross-domain access identification in the prefix portion. The cross-domain access identification may be a specific symbol or coding pattern, e.g. an identification using a "+" symbol in the prefix to connect different domains, e.g. "10+30.45" indicates that a specific organization (45) under the financial industry (30) is accessed from the medical industry (10).
And when the cross-domain access identifier is detected, inquiring a pre-established inter-domain mapping relation table. The table stores access rights and routing rules between different domains, and comprises two mapping relations, namely a direct mapping relation and a transfer mapping relation. The direct mapping relation refers to an access channel established directly between two domains without intermediate domain forwarding, and the transfer mapping relation refers to an indirect access channel established through one or more intermediate domains, and is suitable for data sharing between domains without direct access rights.
For example, if the medical industry (10) and the financial industry (30) do not have a direct mapping relationship, but they all have a direct mapping relationship with the government regulatory domain (20), then the transfer mapping relationship may be utilized to implement access to financial industry data by the medical industry through the government regulatory domain as an intermediary, i.e., an access path of "10→20→30.45".
After determining the cross-domain access path, a permission downconversion is performed. The method is a safety mechanism and ensures that the access authority of data in the cross-domain transmission process is reduced step by step. In particular, when data is transferred from a source domain to a target domain, the access rights are adjusted according to inter-domain protocols and security policies, typically taking the intersection of the source domain rights and the maximum rights allowed by the target domain. This prevents users of the high rights domain from gaining too high access rights in the low rights domain.
After the cross-domain access is completed, a detailed access log is recorded, including access time, source domain, target domain, resource identification, access path, user information, operation type, and the like. These logs are critical for security auditing, problem investigation, and performance optimization. Meanwhile, the mapping relation between the domains is updated according to the access condition, such as adjustment of access frequency statistics, updating of path weights, optimization of caching strategies and the like, so that more efficient service is provided for subsequent cross-domain access.
Through the mechanism, the main domain analysis process of the embodiment can efficiently and reliably determine the digital object warehouse gateway address where the data resource is located, and lays a foundation for subsequent resource analysis.
And S300, performing resource analysis according to the suffix part, wherein the resource analysis sends the suffix part to the digital object warehouse gateway address, and a gateway corresponding to the digital object warehouse gateway address retrieves and returns a target data resource from a corresponding digital object warehouse according to the suffix part and verifies the access right.
After the main domain analysis is completed and the digital object warehouse gateway address is acquired, a resource analysis stage is entered. The resource analysis is the final link of the identification analysis process and is responsible for accurately positioning and acquiring target data resources from a specific digital object warehouse according to the suffix part.
The resource resolution first requires that the suffix portion in the globally unique identifier be sent to the digital object repository gateway as determined by the primary domain resolution. The gateway is used as a bridge for connecting the external request and the internal data warehouse and is responsible for the functions of request forwarding, authority control, resource access and the like. After the gateway receives the suffix part, a specific operation flow is determined according to the internal mapping rule, including authority verification, resource positioning and data acquisition.
The resource analysis comprises the steps of analyzing the suffix part, extracting a resource type identifier and a resource instance identifier from the suffix part, determining a storage position and an access mode of a target data resource according to the resource type identifier, retrieving the target data resource from a digital object warehouse according to the resource instance identifier, and returning the retrieved target data resource after format conversion and security processing.
The first step is to parse the suffix portion. In this embodiment, the suffix portion contains two key pieces of information, a resource type identification and a resource instance identification. The two may be combined together in a specific format, for example in "patient0012.Record," record "indicates the type of resource (medical record), and" patient0012 "indicates the number of the specific patient (resource instance). The digital object warehouse gateway identifies and extracts the two parts of information according to a preset analysis rule.
The asset type identification is category information of the data asset, such as document, image, video, data set, etc. In large organizations, different types of data may be stored in different physical or logical locations, using different storage techniques and access manners. For example, structured data may be stored in a relational database, unstructured data may be stored in an object storage system, and streaming media content may be located on a dedicated media server.
Based on the extracted resource type identification, the digital object warehouse gateway determines the specific storage location and the appropriate access mode of the target data resource. This step involves querying an internal resource type mapping table that maintains the correspondence of resource types to information such as storage location, access protocol, data format, etc. For example, for a resource of the "record" type, the system may determine that it is stored in a medical records database, needs to be accessed using the SQL query language, and that the data is stored in encrypted XML format.
Next, a target data resource is retrieved from the determined storage location based on the resource instance identification. The resource instance identification is typically a unique identifier of the data resource in its storage system, such as a database record ID, file name, or object key value. The digital object repository constructs the appropriate query or access request based on this identifier and the previously determined storage locations, pinpoints and retrieves the target data resources.
And simultaneously carrying out access right verification in the retrieval process. Rights verification is a key link for ensuring data security, and comprises two parts of identity authentication and authorization check. The identity authentication can be realized by digital certificates, tokens or certificates, etc., and the authorization check can determine whether the requester has the right to access the target resource, usually based on Access Control List (ACL), role authority or policy rules, etc. Only the request passing the authority verification can acquire the target data resource, otherwise, a response of authority rejection is returned.
And finally, carrying out format conversion and security processing on the successfully retrieved target data resource, and returning the target data resource to the requester. Format conversion refers to converting data into an appropriate format according to the needs of a requestor or the compatibility requirements of a system. For example, database records are converted to JSON format, or proprietary format documents are converted to standard PDF files. The security processing includes the measures of data desensitization, encryption transmission, digital signature and the like, and ensures the integrity and confidentiality of the data in the transmission process.
Taking medical record query as an example, assuming that the digital object warehouse gateway address of the hospital is determined after the main domain analysis is completed, the suffix part "partial 0012.Record" is sent to the gateway in the resource analysis stage. The gateway first parses the suffix, identifying that this is the medical record for the query "patient 0012". It is then determined that such records are stored in the electronic medical record system and need to be accessed through a particular API. It is then verified whether the requesting party has access to the patient's records, e.g. the doctor can only access his own patient's records, whereas hospital administrators may have more extensive access. After passing the verification, the record of the patient is retrieved from the electronic medical record system, and is converted into a proper format (such as HL7 standard format or PDF document) according to the requirement of the request, and finally, the record is encrypted and returned to the requester.
Through the resource analysis flow, the embodiment realizes the accurate positioning and the safe access of the data resources in the distributed environment, and completes the complete analysis process from the global unique identification to the specific data resources.
The application solves the technical problem of accurate positioning of massive heterogeneous data resources through a hierarchical processing mechanism of main domain analysis and resource analysis, and adopts the technical means of prefix level inquiry and suffix accurate matching, thereby realizing unified management and efficient access of data resources, improving data sharing and exchange efficiency and ensuring the safety of data access.
It should be understood that, although the steps in the flowcharts related to the embodiments described above are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.
Based on the same inventive concept, the embodiment of the application also provides a data resource positioning system based on identification analysis. The implementation of the solution provided by the system is similar to the implementation described in the above method, so the specific limitation in one or more embodiments of the data resource positioning system based on identity resolution provided below may be referred to above for limitation of the data resource positioning method based on identity resolution, which is not repeated here.
In one exemplary embodiment, as shown in fig. 2, there is provided a data resource positioning system based on identity resolution, comprising:
the identification analysis module is used for receiving the data resource positioning request and separating the global unique identification in the data resource positioning request into a prefix part and a suffix part;
The main domain analysis module is used for executing main domain analysis according to the prefix part, and determining a digital object warehouse gateway address corresponding to the data resource through step-by-step inquiry in the digital object registry;
and the resource analysis module is used for executing resource analysis according to the suffix part, transmitting the suffix part to a digital object warehouse gateway address, and the gateway corresponding to the digital object warehouse gateway address retrieves and returns the target data resource from the corresponding digital object warehouse according to the suffix part and verifies the access authority.
The modules in the data resource positioning system based on identification resolution can be implemented in whole or in part by software, hardware and a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In an exemplary embodiment, a computer device, which may be a terminal, is provided, and an internal structure diagram thereof may be as shown in fig. 3. The computer device includes a processor, a memory, an input/output interface, a communication interface, a display unit, and an input means. The processor, the memory and the input/output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input/output interface. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The input/output interface of the computer device is used to exchange information between the processor and the external device. The Communication interface of the computer device is used for communicating with an external terminal in a wired or wireless manner, and the wireless manner may be implemented by Wi-Fi, mobile cellular network, near Field Communication (NFC) or other technologies. The computer program, when executed by a processor, implements a method for locating data resources based on identity resolution. The display unit of the computer device is used for forming a visual picture, and can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be a key, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by those skilled in the art that the structure shown in FIG. 3 is merely a block diagram of some of the structures associated with the present inventive arrangements and is not limiting of the computer device to which the present inventive arrangements may be applied, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.
In an embodiment, there is also provided a computer device comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps of the method embodiments described above when the computer program is executed.
In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when executed by a processor, carries out the steps of the method embodiments described above.
In an embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the steps of the method embodiments described above.
It should be noted that, the user information (including but not limited to user equipment information, user personal information, etc.) and the data (including but not limited to data for analysis, stored data, presented data, etc.) related to the present application are both information and data authorized by the user or sufficiently authorized by each party, and the collection, use and processing of the related data are required to meet the related regulations.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in embodiments provided herein may include at least one of non-volatile memory and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (RESISTIVE RANDOM ACCESS MEMORY, reRAM), magneto-resistive Memory (MagnetoresistiveRandomAccess Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (PHASE CHANGE Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in various forms such as static Random access memory (Static Random Access Memory, SRAM) or Dynamic Random access memory (Dynamic Random AccessMemory, DRAM), and the like. The databases referred to in the embodiments provided herein may include at least one of a relational database and a non-relational database. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processor referred to in the embodiments provided in the present application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computation, an artificial intelligence (ARTIFICIAL INTELLIGENCE, AI) processor, or the like, but is not limited thereto.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the present application.
The foregoing examples illustrate only a few embodiments of the application and are described in detail herein without thereby limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of the application should be assessed as that of the appended claims.

Claims (8)

4. A data resource positioning method based on identification resolution as set forth in claim 3, wherein the step-by-step query includes obtaining an identification resolution server address of a second level in a root node identification resolution server according to a first level of the prefix portion, obtaining an identification resolution server address of a third level in the identification resolution server of the second level according to the second level of the prefix portion, obtaining an identification resolution server address of a next level in a corresponding identification resolution server according to each subsequent level of the prefix portion, performing reachability verification for each identification resolution server accessed in the step-by-step query process, the reachability verification including transmitting a probe packet to a target identification resolution server and monitoring a response time, determining that the target identification resolution server is unreachable when the response time exceeds a preset time threshold or no response packet is received, selecting a standby path from a standby server table, continuing to perform the step-by-step query, and dynamically adjusting a query path according to a current network topology state.
CN202510666215.5A2025-05-22Data resource positioning method and system based on identification analysisActiveCN120455110B (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CN202510666215.5ACN120455110B (en)2025-05-22Data resource positioning method and system based on identification analysis

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CN202510666215.5ACN120455110B (en)2025-05-22Data resource positioning method and system based on identification analysis

Publications (2)

Publication NumberPublication Date
CN120455110A CN120455110A (en)2025-08-08
CN120455110Btrue CN120455110B (en)2025-10-17

Family

ID=

Citations (2)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN109246068A (en)*2018-06-082019-01-18浙江捷尚人工智能研究发展有限公司Data safety sharing method, electronic equipment, storage medium and system
CN112085417A (en)*2020-09-242020-12-15北京工业大学Industrial Internet identification distribution and data management method based on block chain

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN109246068A (en)*2018-06-082019-01-18浙江捷尚人工智能研究发展有限公司Data safety sharing method, electronic equipment, storage medium and system
CN112085417A (en)*2020-09-242020-12-15北京工业大学Industrial Internet identification distribution and data management method based on block chain

Similar Documents

PublicationPublication DateTitle
US11411897B2 (en)Communication method and communication apparatus for message queue telemetry transport
JP7222036B2 (en) Model training system and method and storage medium
US9251211B2 (en)Generation of a query plan for accessing a database
CN113972986A (en) Blockchain-based industrial Internet identification information analysis method and related devices
US8489548B2 (en)Method, system, and device for data synchronization
US11696110B2 (en)Distributed, crowdsourced internet of things (IoT) discovery and identification using Block Chain
US20250013642A1 (en)Method, Apparatus and System for Configurable Data Collection for Networked Data Analytics and Management
US20210158353A1 (en)Methods, systems, apparatuses, and devices for processing request in consortium blockchain
CN111427613B (en)Application program interface API management method and device
CN110674427B (en)Method, device, equipment and storage medium for responding to webpage access request
WO2022057525A1 (en)Method and device for data retrieval, electronic device, and storage medium
CN120455110B (en)Data resource positioning method and system based on identification analysis
CN111600929B (en)Transmission line detection method, routing strategy generation method and proxy server
EP3910880A1 (en)Blockchain based device monitoring
CN112528339A (en)Data desensitization method based on Cach é database and electronic equipment
CN117221325A (en)Custom load balancing device, method, equipment and storage medium based on gateway
CN120455110A (en)Data resource positioning method and system based on identification analysis
US20010051976A1 (en)Facilitator having a distributed configuration, a dual cell apparatus used for the same, and an integrated cell apparatus used for the same
Ma et al.DINNRS: A Distributed In-Network Name Resolution System for information-centric networks
Ashraf et al.Dynamic naming scheme and lookup method based on trie for vehicular named data network
US8782079B2 (en)Configuration information management device, distributed information management system and method
JPH1198162A (en) Continuous data access method
CN117914738B (en)Gateway management method and device, electronic equipment and storage medium
JP2020095434A (en)Communication device, communication method, and communication program
CN115883405B (en)Service detection system

Legal Events

DateCodeTitleDescription
PB01Publication
SE01Entry into force of request for substantive examination
GR01Patent grant

[8]ページ先頭

©2009-2025 Movatter.jp