CN116634017B - Identification analysis data caching method and device based on digital object - Google Patents

Abstract

The application relates to a digital object-based identification analysis data caching method and device. The method comprises the following steps: setting an identification analysis system of a tree hierarchy structure, wherein the identification analysis system comprises an end node, a domain node and a root node; according to the state information of the data resources uploaded by the provider, distributing unique identifiers of the whole network for the data resources in the end nodes; the state information is cached in the end node as analysis data corresponding to the identification; when the user sends the identified analysis request, the analysis data is returned to the user along the path of the analysis request from the node cached with the analysis data, and the analysis data is gradually cached in the node closer to the user along the returned path until the analysis data is cached in the end node closest to the user. The method does not need a large number of repeated analysis marks, shortens the routing length of the analysis request, thereby reducing the delay of user access, saving bandwidth resources and dispersing caches to avoid network congestion.

Description

A method and device for caching identification parsing data based on digital objects

Technical field

The present application relates to the field of data storage, and in particular to a digital object-based identification parsing data caching method and device.

Background technique

Digital Object Architecture (DOA) is a technology and standards system. The digital object architecture includes a basic data model, two standard protocols and three core subsystems: registry, warehouse and identification resolution system. In the digital object architecture, heterogeneous data from different systems in the existing Internet are modeled and abstracted into digital objects in a unified manner, which serves as the basic element in the digital object system. Digital objects are composed of three parts: identification, metadata, and data entities. The identification is the unique identity mark of the digital object; metadata represents the description information related to the digital object and application, classification, and business, and is used to retrieve the required digital objects according to application requirements. ;The digital object entity represents the actual content of the data resource.

In the digital object architecture, users cannot directly access the entity of the digital object. Instead, they need to obtain the status information of the digital object from the manager of the digital object through the unique identifier of the digital object, and then access the digital object through the status information. entity. In the absence of caching, when the identification of digital objects is repeatedly requested to be parsed in large numbers, it will cause serious waste of network resources and high user access delays.

Most of the current identity resolution systems set up special cache nodes to centrally manage identity resolution data in the network. However, when a large amount of parsing data needs to be cached, the cache node will receive a large number of data packets, and when a large number of users initiate identity resolution When requesting, the cache node will receive a large amount of request information. In this case, the network load of the parsing node is huge, and congestion or even downtime is easily caused. Therefore, it is necessary to find a caching method for identification parsing data that can avoid network congestion, reduce user access delays, and reduce waste of network resources.

Contents of the invention

In view of this, this application aims to propose a digital object-based identification parsing data caching method and device to solve the problems of network congestion, serious bandwidth waste, and high user access delays caused by a large number of users accessing digital objects.

In order to achieve the above objectives, the technical solutions of this application are as follows:

The first aspect of the embodiments of the present application provides a method for caching identification parsing data based on digital objects. The method includes:

Set up an identification parsing system with a tree-like hierarchical structure, including end nodes, domain nodes and root nodes; the root node communicates directly with its subordinate domain nodes; the domain node communicates directly with its superior root node and also with its subordinate end nodes Direct communication; the end node manages the identification of the digital object and communicates directly with the user;

According to the status information of the data resource uploaded by the provider, allocate a network-wide unique identifier to the data resource in the end node as the corresponding information for parsing the data;

The parsed data is the status information obtained by the user parsing the identification; the status information includes: the storage location, access method, owner, timestamp and access-related information of the ontology data of the digital object; The identification is a self-defined identification by the provider or a randomly generated identification;

Use the identifier as a field in the status information, bind it to the status information to generate a key-value pair, and store it persistently in the database;

The status information is cached in the end node as parsing data corresponding to the identification; when the user sends a parsing request for the identification for the first time, the parsing request is routed to the end node. Cache, obtain the parsed data from the cache of the node that hits the cache, and return it to the user according to the path of the parsing request; cache the parsed data on the next hop node of the node that currently hits the cache on the return path middle;

When the user sends the identified parsing request again, the parsing request is routed to the next hop node to hit the cache, the parsed data is returned to the user from the node that hits the cache, and the parsed data is Cache to the next hop node of the node currently hitting the cache on the return path;

According to each parsing request for the identifier sent by the user, the parsed data is sequentially cached in the nodes on the return path until the parsed data is cached in the end node closest to the user.

Optionally, the digital object-based identification parsing data caching method also includes:

When the parsed data is cached in the next hop node of the node that currently hits the cache, the parsed data in the cache of the node that currently hits the cache is deleted.

Optionally, the digital object-based identification parsing data caching method also includes:

When the existence time of the parsed data in the cache of any node exceeds the set survival time, the latest parsed data corresponding to the identifier is re-obtained from the end node, and the cache of the node is updated.

Optionally, the digital object-based identification parsing data caching method also includes:

In the cache of any node, all parsed data are sorted according to the timestamp in the parsed data; the timestamp represents the time when the parsed data was most recently accessed;

When the cache capacity of the node is full, the parsed data with the earliest time stamp in the current cache is replaced with the parsed data newly added to the cache.

Optionally, assign a network-wide unique identifier to the data resource in the end node as corresponding information for parsing the data, including:

Determine whether the status information contains a user-defined identification, if not, randomly generate an identification, and determine whether the identification has been used by other digital objects;

If the identification has been used by other digital objects, a new identification will be randomly generated;

If the identifier is not used by other digital objects, assign the identifier to the digital object;

If the status information contains a user-defined identifier, determine whether the user-defined identifier has been used by other digital objects, and if the user-defined identifier has been used by other digital objects, assign a randomly generated identifier to the user;

If the user-defined identifier is not used by other digital objects, the user-defined identifier is used as the identifier of the digital object.

Optionally, the digital object-based identification parsing data caching method also includes:

Generate hierarchical structure identifiers for the data resources to distinguish different hosting institutions and data resources to facilitate management; the identifiers include: identifier prefix, identifier suffix and separator;

Set a user-defined or randomly generated UTF-8 code as the encoding format of the logo prefix and the logo suffix to be compatible with different logo systems to achieve logo reuse;

Set user-defined or system default separators to be compatible with users' personalized needs.

According to a second aspect of the embodiment of the present application, a digital object-based identification parsing data caching device is provided, and the device includes:

The parsing routing building module is configured to set up an identity parsing system with a tree-like hierarchical structure, including end nodes, domain nodes and root nodes; the root node directly communicates with its subordinate domain nodes; the domain node directly communicates with its superior root node communication, and also directly communicates with its subordinate end nodes; the end nodes manage the identification of digital objects and communicate directly with users;

The identification allocation module is configured to allocate a network-wide unique identification to the data resource in the end node according to the status information of the data resource uploaded by the provider as the corresponding information for parsing the data;

The parsed data is the status information obtained by the user parsing the identification; the status information includes: the storage location, access method, owner, timestamp and access-related information of the ontology data of the digital object; The identification is a self-defined identification by the provider or a randomly generated identification;

A persistence module configured to use the identifier as a field in the state information, bind it to the state information to generate a key-value pair, and store it persistently in the database;

A cache module configured to cache the status information in the end node as parsed data corresponding to the identification;

When the user sends a parsing request for the identification for the first time, the parsing request is routed to the end node to hit the cache, the parsing data is obtained from the cache of the node that hits the cache, and the parsing is performed according to the The requested path is returned to the user; the parsed data is cached in the next hop node of the node currently hitting the cache on the return path;

When the user sends the identified parsing request again, the parsing request is routed to the next hop node to hit the cache, the parsed data is returned to the user from the node that hits the cache, and the parsed data is Cache to the next hop node of the node currently hitting the cache on the return path;

According to each parsing request for the identifier sent by the user, the parsed data is sequentially cached in the nodes on the return path until the parsed data is cached in the end node closest to the user.

Optionally, the caching module is further configured to delete the parsed data in the cache of the node that currently hits the cache when the parsed data is cached in a next-hop node of the node that currently hits the cache.

Optionally, the digital object-based identification parsing data caching device further includes:

The cache update module is configured to re-obtain the latest parsed data corresponding to the identifier from the end node when the existence time of the parsed data exceeds the set survival time in the cache of any node, and update all the parsed data. The cache of the above node.

Optionally, the digital object-based identification parsing data caching device further includes:

The cache replacement module is configured to sort all parsed data in the cache of any node according to the timestamp in the parsed data; the timestamp represents the time when the parsed data was recently accessed; when the cache capacity of the node After it is full, the parsed data with the earliest timestamp in the current cache is replaced with the parsed data newly added to the cache.

The identity parsing data caching method provided by this application, when the end node assigns an identity to a digital object, the assigned unique identity of the entire network is bound to its corresponding status information, and is persisted to the database as the original data, and the status information is As the parsed data is cached in the end node, it is convenient for users to directly extract the status information in the cache and return it to the user when requesting parsing of the identity of the digital object. There is no need to repeat the parsing of the identity of the digital object each time, saving bandwidth resources. Reduce user access latency. Furthermore, this method also caches the parsed data in the next hop node closer to the user in the return path after each return of parsed data, shortening the route length of the user's next request for identification parsing, further reducing user access delay and saving money. Bandwidth resources. At the same time, this method disperses and caches the parsed data of digital object identification in multiple nodes, avoiding the problem of increased node load, higher network delay, and even network congestion that may occur when setting up fixed cache nodes.

Description of drawings

In order to explain the technical solutions of the embodiments of the present application more clearly, the drawings needed to be used in the description of the embodiments of the present application will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application. , for those of ordinary skill in the art, other drawings can also be obtained based on these drawings without exerting creative labor.

Figure 1 is a flow chart of a digital object-based identification parsing data caching method proposed by an embodiment of the present application;

Figure 2 is a schematic diagram of a digital object-based identification parsing data caching device proposed by an embodiment of the present application;

Figure 3 is a schematic diagram of a caching method for identification parsing data proposed by an embodiment of the present application;

Figure 4 is a schematic diagram of another caching method for identification parsing data proposed by an embodiment of the present application;

Figure 5 is a schematic flowchart of cache replacement in a node proposed by an embodiment of the present application;

Figure 6 is a schematic diagram of the identification encoding structure proposed by an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the scope of protection of this application.

It will be understood that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure, or characteristic associated with the embodiment is included in at least one embodiment of the present application. Thus, the appearances of "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily referring to the same embodiment. Furthermore, the particular features, structures or characteristics may be combined in any suitable manner in one or more embodiments.

In the various embodiments of this application, it should be understood that the size of the sequence numbers of the following processes does not mean the order of execution. The execution order of each process should be determined by its functions and internal logic, and should not be implemented in this application. The implementation of the examples does not constitute any limitations.

Exemplary embodiments will be described in detail herein, examples of which are illustrated in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings refer to the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with this application. Rather, they are merely examples of apparatus and methods consistent with aspects of the application as detailed in the appended claims.

It should be noted that, as long as there is no conflict, the embodiments and features in the embodiments of this application can be combined with each other.

The present application will be described in detail below with reference to the accompanying drawings and embodiments.

Figure 1 is a flow chart of a digital object-based identification parsing data caching method proposed by an embodiment of the present application. As shown in Figure 1, the method includes:

S11: Set up an identity resolution system with a tree-like hierarchical structure, including end nodes, domain nodes, and root nodes; the root node communicates directly with its subordinate domain nodes; the domain node communicates directly with its superior root node, and also communicates directly with its subordinate domain nodes. The end nodes communicate directly; the end nodes manage the identification of digital objects and communicate directly with users.

In this embodiment, the identity resolution process is performed in an identity resolution system with a tree-like hierarchical structure. The system includes multiple root nodes, multiple domain nodes, and multiple end nodes.

Among them, the root node is located at the top level of the tree-like hierarchical structure and manages its subordinate domain nodes, such as: adding, accessing, deleting domain nodes, etc. At the same time, each root node is also responsible for maintaining the node information of its subordinate domain nodes. For example: the prefix identifier of the node, the IP address of the node, the service address of the node, the tcp port of the node, the http port of the node, the identifier of the node, the resolution of the node, the number of users of the node, etc.

The domain node is located in the middle of the tree-like hierarchical structure and is a subordinate node of the root node. There are multi-level domain nodes in the identity resolution system, and the lower-level domain nodes are managed by the upper-level domain nodes. For example, a first-level domain node manages its subordinate second-level domain nodes, and a second-level domain node manager subordinates a third-level domain node... The prefix identification format assigned to a domain node is "root node identification.First-level domain" Node identification. Second-level domain node identification...n-level domain node identification." For example, "university.pku" is the prefix ID of the first-level domain node of the root node with the prefix ID "university", and "university.pku.s1" is the second-level domain of the first-level domain node with the prefix ID "university.pku" Node prefix identifier. The lowest-level domain node is responsible for managing its subordinate end nodes, including: adding end nodes, accessing end nodes, deleting end nodes, etc.; at the same time, the lowest-level domain node is also responsible for maintaining the information of its subordinate end nodes. Including: the prefix identifier of the end node, the IP address of the end node, the service address of the end node, the tcp port of the end node, the http port of the end node, the identification amount of the end node, the resolution amount of the end node, the number of users of the end node, etc. data.

The end node is located at the bottom of the tree-like hierarchical structure, and is assigned a prefix identification by the superior domain node to which it belongs. Its identification format is "root node identification. First-level domain node identification. Second-level domain node identification...n Level domain node identification. End node identification". The end node directly manages the identification of digital objects and is responsible for the allocation, deletion, parsing, and updating of digital object identifications. The end node needs to synchronize the relevant data of the digital object identifier it manages, such as the registration volume and resolution volume of the digital object identifier, to its superior domain node.

It is worth noting that the first-level domain nodes are managed by their superior root nodes. The root nodes synchronize with each other the IP addresses and node prefix identifiers of their subordinate first-level domain nodes. That is, all root nodes have all the identifiers in the resolution system. The IP address and node prefix identification information of the first-level domain node. In this tree-like hierarchical structure, each domain node is managed by only one root node or superior domain node, and each end node is managed by only one domain node.

In this embodiment, the data resources of different information systems are unified and abstractly modeled as digital objects through the digital object architecture. For example, video files, audio files, and text files in different formats are abstractly modeled into digital objects in a unified format. The converted digital objects are composed of identification, status information, and data entities. When a user accesses the data entity of a digital object, he or she must first parse the digital object's identifier to obtain the parsing result of the digital object (that is, the status information corresponding to the identifier). The status information includes: the storage location, access method, Owner, timestamp, and access related information. After the user obtains the parsed data, he or she can access the physical data of the digital object based on the storage location and access method of the digital object.

S12: According to the status information of the data resource uploaded by the provider, allocate a network-wide unique identifier to the data resource in the end node as the corresponding information for parsing the data;

The parsed data is the status information obtained by the user parsing the identification; the status information includes: the storage location, access method, owner, timestamp and access-related information of the ontology data of the digital object; The identification is a self-defined identification by the provider or a randomly generated identification;

S121: Determine whether the status information contains a user-defined identifier. If not, randomly generate an identifier, and determine whether the identifier has been used by other digital objects;

S122: If the identification has been used by other digital objects, regenerate an identification randomly;

S123: If the identifier is not used by other digital objects, assign the identifier to the digital object;

S124: If the status information contains a user-defined identifier, determine whether the user-defined identifier has been used by other digital objects. If the user-defined identifier has been used by other digital objects, allocate a randomly generated ID to the user. logo;

S125: If the user-defined identifier is not used by other digital objects, use the user-defined identifier as the identifier of the digital object.

In this embodiment, the digital object provider can upload status information of different types of data resources through the client. After the system authenticates the user, it generates and assigns a network-wide unique identifier to the data resource, thereby obtaining a complete digital object. . After the identifier is assigned, the identifier is corresponding to the status information and cached as parsed data in the end node that manages the identifier. This facilitates users to request parsing of the digital object identifier without re-parsing the identifier every time, reducing user access delays and saving bandwidth. resource.

Specifically, the steps for end nodes to assign identifiers to the status information of digital objects are as follows:

First, the end node will authenticate the user, and only after the authentication is passed, subsequent steps will be performed;

When the identity authentication is successful, the user enters the status information of the data resource to be assigned an identity on the client and submits it to the identity resolution system;

The identity management module determines whether the status information submitted by the user contains a user-defined identity. In this embodiment, the identifier of the digital object may be a user-defined identifier or an identifier randomly generated by the system.

When the status information contains a user-defined identifier, it is further determined whether the user-defined identifier has been used by other digital objects. If the identifier has been used by other digital objects, the identifier management module will randomly generate a unique identifier for the entire network and assign it to the data. resource;

If the status information does not contain a user-defined identity, the identity management module will randomly generate a network-wide unique identity and assign it to the data resource. Similarly, the identity randomly generated by the identity management module also needs to be judged whether it has been used by other digital objects. If it has been used by other digital objects, the identity that has not been used by other digital objects needs to be regenerated, thereby ensuring that the identity assigned to the data resource is The identifier is unique across the entire network.

S13: Use the identifier as a field in the status information, bind it to the status information to generate a key-value pair, and store it persistently in the database.

In this embodiment, after generating a unique identifier for the entire network, the identifier is used as a field in the status information of the data resource uploaded by the user, and is bound to the status information to form a key-value pair, which is used as the original data for identification parsing and persisted in the form. Store in database. When a subsequent user requests parsing of the identity, or caches the parsing data of the identity, the key-value pair data stored in the database will serve as the basis for caching the parsing data.

S14: Use the status information as parsing data corresponding to the identification and cache it in the end node; when the user sends a parsing request for the identification for the first time, route the parsing request to the end node. Process the cache, obtain the parsed data from the cache of the node that hits the cache, and return it to the user according to the path of the parsing request; cache the parsed data on the return path next to the node that currently hits the cache. in the hop node;

S15: When the user sends the identified parsing request again, the parsing request is routed to the next hop node to hit the cache, the parsing data is returned to the user from the node that hits the cache, and the parsing data is returned to the user. The parsed data is cached in the next hop node of the node currently hitting the cache on the return path;

S16: According to each parsing request for the identifier sent by the user, cache the parsed data sequentially in the nodes on the return path until the parsed data is cached in the end node closest to the user.

In this embodiment, when the user initiates an identification parsing request for the digital object again, the system routes the parsing request to the node that has cached its corresponding parsing data, and directly searches for the corresponding status information from the cache of the node. And return it to the user according to the path of the parsing request, without parsing the identifier again, so as to reduce the user's access delay and save bandwidth resources. Furthermore, based on the number of times the user requests parsing of the identifier, the parsed data can be gradually cached in nodes closer to the user in the path, further shortening the routing length of parsing requests and parsed data, and reducing user access delays.

Figure 3 is a schematic diagram of a caching method for identification parsing data proposed by an embodiment of the present application. As shown in Figure 3, when there is parsing data cached in the end node with the prefix identification "pku.s2.d2", the user sends an identification parsing request for the digital object with the prefix "pku.s2.d2", and the system The caching process of parsing data is as follows:

(1) The user sends an identifier resolution request with the prefix "pku.s2.d2" through the client to the end node with the prefix identifier "pku.s1.d1";

(2) The end node with the prefix identification "pku.s1.d1" does not store the identification information with the prefix "pku.s2.d2" and the cache cannot be hit. The request is forwarded to the superior with the prefix identification "pku.s1" domain node;

(3) The domain node with the prefix identification "pku.s1" does not store the identification information with the prefix "pku.s2.d2" and the cache cannot be hit. The request is forwarded to the superior root node with the prefix identification "pku";

(4) The root node with the prefix identifier "pku" does not store the identification information with the prefix "pku.s2.d2" and the cache cannot be hit. The request is forwarded to the lower-level domain node whose prefix identifier is "pku.s2";

(5) The domain node with the prefix identification "pku.s2" does not store the identification information with the prefix "pku.s2.d2" and the cache cannot be hit. The request is forwarded to its lower-level end with the prefix "pku.s2.d2" node;

(6) The end node cache with the prefix identification "pku.s2.d2" hits, and the parsed data is returned to the domain node with the prefix identification "pku.s2";

(7) According to the LCD cache placement strategy, the domain node with the prefix identification "pku.s2" will cache the parsed data, and then return the parsed data to the root node "pku";

(8) The root node "pku" returns the parsed data to the domain node with the prefix identifier "pku.s1";

(9) The domain node with the prefix identifier "pku.s1" returns the parsed data to the end node with the prefix identifier "pku.s1.d1";

(10) The end node with the prefix identification "pku.s1.d1" returns the parsed data to the client;

(11) When the client sends the same parsing request again to the end node with the prefix identifier "pku.s1.d1", the cache will be hit at the domain node with the prefix identifier "pku.s2", and the domain node will directly The parsed data is returned to the client via the original path, and the next hop node on the return path (i.e., the root node "pku") caches the corresponding data. As the number of parsing requests increases, all nodes on the path to parse the request will cache the same data. The data.

In this embodiment, the parsed data starts from the end node that manages the digital object identification, and is cached at the next hop node that returns the parsed data each time the cache hits it, until the parsed data is cached in the end node that the client directly communicates with. In this way, the cache hit node is closer to the client, reducing the routing length of the data and further reducing the delay of user access.

In this embodiment, as shown in Figure 3, when the user initiates an identification resolution request for the digital object again, in addition to searching for the corresponding status information from the node that manages the identification and returning it, the solution to the identification of the digital object must also be returned. The system information is cached in the next hop node of the return path.

Optionally, the digital object-based identification parsing data caching method also includes:

S17: When the parsed data is cached in the next-hop node of the node that currently hits the cache, delete the parsed data in the cache of the node that currently hits the cache.

In this embodiment, when gradually caching the parsed data in the return path, you can also delete the parsed data cached in the previous node each time the parsed data is cached in a node closer to the user. This solution only Reserve a node closest to the user in the system to cache the parsed data, further reducing redundant data in the node and saving bandwidth resources.

Figure 4 is a schematic diagram of another caching method of identification parsing data proposed by an embodiment of the present application. As shown in Figure 4, when there is parsing data cached in the end node with the prefix identification "pku.s2.d2", the user sends an identification parsing request for the digital object with the prefix "pku.s2.d2", and the system The caching process of parsing data is as follows:

(1) The client sends an identifier resolution request with the prefix "pku.s2.d2" to the end node with the prefix identifier "pku.s1.d1";

(2) The end node with the prefix identification "pku.s1.d1" does not store the identification information with the prefix "pku.s2.d2" and the cache cannot be hit. The request is forwarded to the superior with the prefix identification "pku.s1" domain node;

(3) The domain node with the prefix identification "pku.s1" does not store the identification information with the prefix "pku.s2.d2" and the cache cannot be hit. The request is forwarded to the superior root node with the prefix identification "pku";

(4) The root node with the prefix identifier "pku" does not store the identification information with the prefix "pku.s2.d2" and the cache cannot be hit. The request is forwarded to the lower-level domain node whose prefix identifier is "pku.s2";

(5) The domain node with the prefix identification "pku.s2" does not store the identification information with the prefix "pku.s2.d2" and the cache cannot be hit. The request is forwarded to its lower-level end with the prefix "pku.s2.d2" node;

(6) The end node cache with the prefix identification "pku.s2.d2" hits the cache, returns the parsed data to the domain node with the prefix identification "pku.s2" and deletes the cache content of this node according to the MCD cache placement policy;

(7) According to the MCD cache placement strategy, the domain node with the prefix identification "pku.s2" will cache the parsed data, and then return the parsed data to the root node "pku";

(8) The root node "pku" returns the parsed data to the domain node with the prefix identifier "pku.s1";

(9) The domain node with the prefix identifier "pku.s1" returns the parsed data to the end node with the prefix identifier "pku.s1.d1";

(10) The end node with the prefix identification "pku.s1.d1" returns the parsed data to the client;

When the client sends the same parsing request again to the end node with the prefix identified as "pku.s1.d1", the cache will be hit at the domain node with the prefix identified as "pku.s2", and the domain node will directly transfer the original parsed data. The path is returned to the client. At the same time, the next hop node on the return path (i.e., the root node "pku") will cache the parsing data, and the domain node will delete the locally cached parsing data. As the number of parsing requests increases, only the first end node (the end node with the prefix identifier "pku.s1.d1") on the path of the parsing request will cache the parsed data.

Optionally, the digital object-based identification parsing data caching method also includes:

S18: When the existence time of the parsed data in the cache of any node exceeds the set survival time, re-obtain the latest parsed data corresponding to the identifier from the end node, and update the cache of the node.

In this embodiment, the parsing data cached in each node has a survival time. When the parsing data cache time exceeds the survival time, the parsing request needs to be routed along the path of the parsing request to the end node that manages the identity. From the end node Get the latest parsed data for updates.

Optionally, the digital object-based identification parsing data caching method also includes:

S19: In the cache of any node, sort all parsed data according to the timestamp in the parsed data; the timestamp represents the time when the parsed data was recently accessed;

When the cache capacity of the node is full, the parsed data with the earliest time stamp in the current cache is replaced with the parsed data newly added to the cache.

Figure 5 is a schematic flowchart of cache replacement in a node proposed by an embodiment of the present application. As shown in Figure 5, optionally, in this embodiment, the least recently used (LRU) cache replacement strategy is used to determine the replacement of data cached within a single node. The specific execution process is as follows:

(1) In the initial case, the buffer is empty. At this time, you only need to enter the queue one by one, that is, add element 1, element 2, element 3, element 4, and element 5 to the queue at a time according to the first-in, first-out principle;

(2) When element 5 is added to the queue, the capacity of the buffer reaches the maximum value;

(3) When element 1 is accessed from the cache, element 1 becomes the most recently accessed element, so the timestamp of element 1 is updated and moved to the head of the queue;

(4) When it is necessary to continue adding element 6 to the buffer, it is found that the buffer has reached the maximum capacity. At this time, according to the LRU algorithm, element 2 at the end of the queue has been used least recently, so element 2 needs to be eliminated, and element 6 needs to be eliminated. Join the team leader position;

(5) When element 4 is accessed from the cache, element 4 becomes the most recently accessed element, so the timestamp of element 4 is updated and element 4 is moved to the head of the queue.

Optionally, the digital object-based identification parsing data caching method also includes:

S110: Generate hierarchical structure identifiers for the data resources to distinguish different hosting institutions and data resources to facilitate management; the identifiers include: identifier prefix, identifier suffix and separator;

S111: Set the user-defined or randomly generated UTF-8 encoding as the encoding format of the identification prefix and the identification suffix to be compatible with different identification systems and realize identification reuse;

S112: Set user-defined or system default separators to be compatible with user personalized needs.

In this embodiment, the digital object identifier adopts a hierarchical structure encoding method, and its structure consists of an identifier prefix, an identifier suffix, and an identifier prefix and suffix separator. Among them, the identification prefix is used to uniquely identify the institutional subject hosting the identification service, the identification suffix is used to uniquely identify any data under the prefix, and the delimiter is used to separate the identification prefix and identification suffix.

The identity prefix defines the namespace of the identity encoding to ensure the global uniqueness of the data identity. The identity prefix can be freely defined using UTF-8 encoding without any restrictions on the structure and semantics of the identity prefix on the premise of ensuring uniqueness in the entire network;

Similarly, the identification suffix can be freely defined using UTF-8 encoding on the premise of ensuring uniqueness across the entire network;

The default identifier separator is "/". You can also customize other separators according to your needs, but you need to ensure that the same symbols do not appear in the identifier prefix and identifier suffix.

Figure 6 is a schematic diagram of the identification encoding structure proposed by an embodiment of the present application. As shown in Figure 6, according to the encoding method of the above identification, the identification prefix can be defined as "SLW.OS.DOA.dev", the identification suffix can be defined as "do.a67920dd-0c25-4dbc-b164-a45711e7ef78", and the default delimiter can be used "/" serves as the identifier separator.

In this embodiment, the encoding method of the digital object identifier is compatible with a variety of encoding rules. The identifier assigned by the existing identifier system can be directly reused as the identifier suffix of this system, or the identifier assigned by this system can be mapped through the identifier encoding mapping table. To the identifiers assigned by multiple other identification systems, achieving one-to-many multi-identity compatibility.

FIG. 2 is a schematic diagram of a digital object-based identification parsing data caching device 200 proposed by an embodiment of the present application. As shown in Figure 2, the device includes:

The parsing routing building module 201 is configured to set up an identity parsing system with a tree-like hierarchical structure, including end nodes, domain nodes, and root nodes; the root node communicates directly with its subordinate domain nodes; the domain node communicates with its superior root node Direct communication, and also direct communication with its subordinate end nodes; the end nodes manage the identification of digital objects and communicate directly with users;

The identification allocation module 202 is configured to allocate a network-wide unique identification to the data resource in the end node according to the status information of the data resource uploaded by the provider, as the corresponding information for parsing the data;

The parsed data is the status information obtained by the user parsing the identification; the status information includes: the storage location, access method, owner, timestamp and access-related information of the ontology data of the digital object; The identification is a self-defined identification by the provider or a randomly generated identification;

The persistence module 203 is configured to use the identifier as a field in the state information, bind it to the state information to generate a key-value pair, and store it persistently in the database;

The caching module 204 is configured to cache the status information in the end node as parsed data corresponding to the identification;

When the user sends a parsing request for the identification for the first time, the parsing request is routed to the end node to hit the cache, the parsing data is obtained from the cache of the node that hits the cache, and the parsing is performed according to the The requested path is returned to the user; the parsed data is cached in the next hop node of the node currently hitting the cache on the return path;

When the user sends the identified parsing request again, the parsing request is routed to the next hop node to hit the cache, the parsed data is returned to the user from the node that hits the cache, and the parsed data is Cache to the next hop node of the node currently hitting the cache on the return path;

According to each parsing request for the identifier sent by the user, the parsed data is sequentially cached in the nodes on the return path until the parsed data is cached in the end node closest to the user.

Optionally, the cache module 204 is also configured to delete the parsed data in the cache of the node that currently hits the cache when the parsed data is cached in the next hop node of the node that currently hits the cache. .

Optionally, the digital object-based identification parsing data caching device 200 also includes:

The cache update module is configured to re-obtain the latest parsed data corresponding to the identifier from the end node when the existence time of the parsed data exceeds the set survival time in the cache of any node, and update all the parsed data. The cache of the above node.

Optionally, the digital object-based identification parsing data caching device 200 also includes:

The cache replacement module is configured to sort all parsed data in the cache of any node according to the timestamp in the parsed data; the timestamp represents the time when the parsed data was recently accessed; when the cache capacity of the node After it is full, the parsed data with the earliest timestamp in the current cache is replaced with the parsed data newly added to the cache.

Optionally, the identification allocation module 202 is also configured to determine whether the status information contains a user-defined identification, and if not, randomly generate an identification, and determine whether the identification has been used by other digital objects. ;

If the identification has been used by other digital objects, a new identification will be randomly generated;

If the identifier is not used by other digital objects, assign the identifier to the digital object;

If the status information contains a user-defined identifier, determine whether the user-defined identifier has been used by other digital objects, and if the user-defined identifier has been used by other digital objects, assign a randomly generated identifier to the user;

If the user-defined identifier is not used by other digital objects, the user-defined identifier is used as the identifier of the digital object.

Optionally, the identification allocation module 202 is also configured to generate an identification of a hierarchical structure for the data resource to distinguish different hosting institutions and data resources to facilitate management; the identification includes: an identification prefix and an identification suffix. and delimiter;

Set a user-defined or randomly generated UTF-8 code as the encoding format of the logo prefix and the logo suffix to be compatible with different logo systems to achieve logo reuse;

Set user-defined or system default separators to be compatible with users' personalized needs.

The above are only preferred embodiments of the present application and are not intended to limit the present application. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application shall be included in the present application. within the scope of protection.

For the method embodiments, for the sake of simple description, they are all expressed as a series of action combinations. However, those skilled in the art should know that this application is not limited by the described action sequence, because according to this application, some steps Other orders or simultaneous steps are possible. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions and components involved are not necessarily necessary for this application.

Those skilled in the art should understand that embodiments of the present application may be provided as methods, devices, or computer program products. Therefore, embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment that combines software and hardware aspects. Furthermore, embodiments of the present application may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

Embodiments of the present application are described with reference to flowcharts and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the present application. It will be understood that each process and/or block in the flowchart illustrations and/or block diagrams, and combinations of processes and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine such that the instructions are executed by the processor of the computer or other programmable data processing terminal device. Means are generated for implementing the functions specified in the process or processes of the flowchart diagrams and/or the block or blocks of the block diagrams.

These computer program instructions may also be stored in a computer-readable memory that causes a computer or other programmable data processing terminal equipment to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction means, the The instruction means implements the functions specified in a process or processes of the flowchart and/or a block or blocks of the block diagram.

These computer program instructions can also be loaded onto a computer or other programmable data processing terminal equipment, so that a series of operating steps are performed on the computer or other programmable terminal equipment to produce computer-implemented processing, thereby causing the computer or other programmable terminal equipment to perform a computer-implemented process. The instructions executed on provide steps for implementing the functions specified in a process or processes of the flow diagrams and/or a block or blocks of the block diagrams.

Although preferred embodiments of the embodiments of the present application have been described, those skilled in the art may make additional changes and modifications to these embodiments once the basic inventive concepts are understood. Therefore, the appended claims are intended to be construed to include the preferred embodiments and all changes and modifications that fall within the scope of the embodiments of the present application.

Finally, it should be noted that in this article, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply that these entities or any such actual relationship or sequence between operations. Furthermore, the terms "comprises," "comprises," or any other variation thereof are intended to cover a non-exclusive inclusion such that a process, method, article, or end device that includes a list of elements includes not only those elements, but also elements not expressly listed or other elements inherent to such process, method, article or terminal equipment. Without further limitation, an element defined by the statement "comprises a..." does not exclude the presence of additional identical elements in a process, method, article or terminal device including the stated element.

The above is a detailed introduction to the identification parsing data caching method and device based on digital objects provided by this application. Specific examples are used in this article to illustrate the principles and implementation methods of this application. The description of the above embodiments is only used to help understanding. The method of this application and its core idea; at the same time, for those of ordinary skill in the field, there will be changes in the specific implementation and application scope based on the idea of this application. In summary, the contents of this specification should not understood as a limitation on this application.

Claims (10)

1. A method of caching identification parsing data based on digital objects, which is characterized by including: Set up an identity resolution system for a tree-like hierarchical structure, including end nodes, domain nodes, and root nodes; the root node is located at the top of the tree-like hierarchical structure, manages its subordinate domain nodes, and is responsible for maintaining the node information of its subordinate domain nodes; domain nodes Located in the middle of the tree-like hierarchical structure, it is a subordinate node of the root node. There are multi-level domain nodes in the identification resolution system. The subordinate domain nodes are managed by the superior domain nodes. The lowest domain node is responsible for managing its subordinate end nodes. Responsible for maintaining the information of its subordinate end nodes; the end nodes are located at the bottom of the tree-like hierarchical structure; the root node communicates directly with its subordinate domain nodes; the domain node communicates directly with its superior root node and also with its subordinate end nodes Direct communication; the end node manages the identification of the digital object and communicates directly with the user; According to the status information of the data resource uploaded by the provider, allocate a network-wide unique identifier to the data resource in the end node as the corresponding information for parsing the data; The parsed data is the status information obtained by the user parsing the identification; the status information includes: the storage location, access method, owner, timestamp and access-related information of the ontology data of the digital object; The identification is a self-defined identification by the provider or a randomly generated identification; Use the identifier as a field in the status information, bind it to the status information to generate a key-value pair, and store it persistently in the database; The status information is cached in the end node as parsing data corresponding to the identification; when the user sends a parsing request for the identification for the first time, the parsing request is routed to the end node. Cache, obtain the parsed data from the cache of the node that hits the cache, and return it to the user according to the path of the parsing request; cache the parsed data on the next hop node of the node that currently hits the cache on the return path middle; When the user sends the identified parsing request again, the parsing request is routed to the next hop node to hit the cache, the parsed data is returned to the user from the node that hits the cache, and the parsed data is Cache to the next hop node of the node currently hitting the cache on the return path; According to each parsing request for the identifier sent by the user, the parsed data is sequentially cached in the nodes on the return path until the parsed data is cached in the end node closest to the user. 2. The identification parsing data caching method based on digital objects according to claim 1, characterized in that, further comprising: When the parsed data is cached in the next hop node of the node that currently hits the cache, the parsed data in the cache of the node that currently hits the cache is deleted. 3. The identification parsing data caching method based on digital objects according to claim 2, characterized in that, further comprising: When the existence time of the parsed data in the cache of any node exceeds the set survival time, the latest parsed data corresponding to the identifier is re-obtained from the end node, and the cache of the node is updated. 4. The identification parsing data caching method based on digital objects according to claim 2, characterized in that, further comprising: In the cache of any node, all parsed data are sorted according to the timestamp in the parsed data; the timestamp represents the time when the parsed data was most recently accessed; When the cache capacity of the node is full, the parsed data with the earliest time stamp in the current cache is replaced with the parsed data newly added to the cache. 5. The identification parsing data caching method based on digital objects according to claim 1, characterized in that, in the end node, the data resource is assigned a unique identification of the entire network, as the corresponding information of the parsed data, including: Determine whether the status information contains a user-defined identification, if not, randomly generate an identification, and determine whether the identification has been used by other digital objects; If the identification has been used by other digital objects, a new identification will be randomly generated; If the identifier is not used by other digital objects, assign the identifier to the digital object; If the status information contains a user-defined identifier, determine whether the user-defined identifier has been used by other digital objects, and if the user-defined identifier has been used by other digital objects, assign a randomly generated identifier to the user; If the user-defined identifier is not used by other digital objects, the user-defined identifier is used as the identifier of the digital object. 6. The identification parsing data caching method based on digital objects according to claim 5, characterized in that it further includes: Generate hierarchical structure identifiers for the data resources to distinguish different hosting institutions and data resources to facilitate management; the identifiers include: identifier prefix, identifier suffix and separator; Set a user-defined or randomly generated UTF-8 code as the encoding format of the logo prefix and the logo suffix to be compatible with different logo systems to achieve logo reuse; Set user-defined or system default separators to be compatible with users' personalized needs. 7. A digital object-based identification parsing data caching device, characterized in that it includes: The parsing routing building module is configured to set up an identity parsing system with a tree-like hierarchical structure, including end nodes, domain nodes, and root nodes; the root node is located at the top level of the tree-like hierarchical structure, manages its subordinate domain nodes, and is responsible for maintaining its subordinates. The node information of the domain node; the domain node is located in the middle of the tree hierarchy and is a subordinate node of the root node. There are multi-level domain nodes in the identification resolution system. The subordinate domain nodes are managed by the superior domain nodes. The lowest domain node Responsible for managing its subordinate end nodes and maintaining the information of its subordinate end nodes; the end nodes are located at the bottom of the tree-like hierarchical structure; the root node communicates directly with its subordinate domain nodes; the domain node directly communicates with its superior root node communication, and also directly communicates with its subordinate end nodes; the end nodes manage the identification of digital objects and communicate directly with users; The identification allocation module is configured to allocate a network-wide unique identification to the data resource in the end node according to the status information of the data resource uploaded by the provider as the corresponding information for parsing the data; The parsed data is the status information obtained by the user parsing the identification; the status information includes: the storage location, access method, owner, timestamp and access-related information of the ontology data of the digital object; The identification is a self-defined identification by the provider or a randomly generated identification; A persistence module configured to use the identifier as a field in the state information, bind it to the state information to generate a key-value pair, and store it persistently in the database; A cache module configured to cache the status information in the end node as parsed data corresponding to the identification; When the user sends a parsing request for the identification for the first time, the parsing request is routed to the end node to hit the cache, the parsing data is obtained from the cache of the node that hits the cache, and the parsing is performed according to the The requested path is returned to the user; the parsed data is cached in the next hop node of the node currently hitting the cache on the return path; When the user sends the identified parsing request again, the parsing request is routed to the next hop node to hit the cache, the parsed data is returned to the user from the node that hits the cache, and the parsed data is Cache to the next hop node of the node currently hitting the cache on the return path; According to each parsing request for the identifier sent by the user, the parsed data is sequentially cached in the nodes on the return path until the parsed data is cached in the end node closest to the user. 8. The identification parsing data caching device based on digital objects according to claim 7, characterized in that the caching module is further configured to cache the parsing data into the next hop node of the node that currently hits the cache. When , delete the parsed data in the cache of the node that currently hits the cache. 9. The digital object-based identification parsing data caching device according to claim 8, further comprising: The cache update module is configured to re-obtain the latest parsed data corresponding to the identifier from the end node when the existence time of the parsed data exceeds the set survival time in the cache of any node, and update all the parsed data. The cache of the above node. 10. The digital object-based identification parsing data caching device according to claim 8, further comprising: The cache replacement module is configured to sort all parsed data in the cache of any node according to the timestamp in the parsed data; the timestamp represents the time when the parsed data was recently accessed; When the cache capacity of the node is full, the parsed data with the earliest time stamp in the current cache is replaced with the parsed data newly added to the cache.