Data identifier generation method and device, equipment, storage medium and program product

Abstract

The invention discloses a data identification generation method and device, equipment, a storage medium and a program product, and the method comprises the steps: determining timestamp information, data type information and security level information which are included in metadata information based on the metadata information in a data identification request; based on the timestamp information, the data category information, the security level information and a working node identifier corresponding to a target data service DSN node, filling bits in a data identifier format to obtain a target data identifier corresponding to the target DSN node; wherein the data identification format comprises N bits, the M1 bit in the N bits represents the timestamp information, the M2 bit represents the work node identification, the M3 bit represents the data category information, and the M4 bit represents the security level information; n is a positive integer, and M1, M2, M3 and M4 are positive integers smaller than N.

Description

Technical Field

[0001] This application relates to the fields of data services and computing networks, and in particular to a data identifier generation method, apparatus, device, storage medium, and program product. Background Technology

[0002] In data circulation, globally unique identifiers provide the foundation for data registration and ownership confirmation, causal tracing of data elements, etc. Constructing globally unique identifiers for data is crucial. In related technologies, data identifiers are mainly generated through random numbers, pre-allocated data identifier segments, and snowflake models. However, these methods still have limitations in generating data identifiers, including the inability to guarantee the globally uniqueness and global order of the identifiers, and the lack of data category and security level information. Summary of the Invention

[0003] To address the aforementioned technical problems, embodiments of the present invention provide a data identifier generation method, apparatus, device, storage medium, and program product.

[0004] The data identifier generation method provided in this application embodiment is applied to a data identifier management system, including:

[0005] Based on the metadata information in the data identification request, the metadata information includes timestamp information, data category information, and security level information.

[0006] Based on the timestamp information, the data category information, the security level information, and the working node identifier corresponding to the target data service DSN node, the bits in the data identifier format are filled to obtain the target data identifier corresponding to the target DSN node;

[0007] The data identifier format includes N bits, where M1 bits represent the timestamp information, M2 bits represent the working node identifier, M3 bits represent the data category information, and M4 bits represent the security level information; N is a positive integer, and M1, M2, M3, and M4 are positive integers less than N.

[0008] The data identifier generation apparatus provided in this application embodiment is applied to a data identifier management system and includes:

[0009] The determining unit is configured to determine, based on the metadata information in the data identification request, the timestamp information, data category information, and security level information included in the metadata information;

[0010] The processing unit is used to fill in the bits in the data identifier format based on the timestamp information, the data category information, the security level information, and the working node identifier corresponding to the target data service DSN node to obtain the target data identifier corresponding to the target DSN node.

[0011] The data identifier format includes N bits, where M1 bits represent the timestamp information, M2 bits represent the working node identifier, M3 bits represent the data category information, and M4 bits represent the security level information; N is a positive integer, and M1, M2, M3, and M4 are positive integers less than N.

[0012] The processing device provided in this application includes a processor and a memory. The memory is used to store computer programs, and the processor is used to call and run the computer programs stored in the memory to execute any of the above-described data identifier generation methods.

[0013] The computer-readable storage medium provided in this application embodiment is used to store a computer program that causes a computer to execute any of the above-described data identifier generation methods.

[0014] The computer program product provided in this application includes computer program instructions that cause a computer to execute any of the above-described data identifier generation methods.

[0015] In the technical solution of this application embodiment, the data identification management system determines the timestamp information, data category information, and security level information included in the metadata information in the data identification request; and fills the bits in the data identification format based on the timestamp information, data category information, security level information, and the working node identifier corresponding to the target data service DSN node to obtain the target data identifier corresponding to the target DSN node; wherein, the data identification format includes N bits, of which M1 bits represent timestamp information, M2 bits represent working node identifier, M3 bits represent data category information, and M4 bits represent security level information; N is a positive integer, and M1, M2, M3, and M4 are positive integers less than N. Thus, by providing a multi-level data identification format and data identification generation management process, the identifier carries timestamp, working node identifier, polymorphic data category, and security level information, which can achieve unique identification of cross-domain and intra-domain data, ensure the global uniqueness of the generated data identifier, ensure that the overall timeline of the identifier is incremental, and meet the identification requirements of polymorphic data category and security level. Attached Figure Description

[0016] Figure 1This is a flowchart illustrating a data identifier generation method applied to a data identifier management system, as provided in an embodiment of this application.

[0017] Figure 2 This is a schematic diagram illustrating the distribution of the domain data identifier format provided in the embodiments of this application;

[0018] Figure 3 This is a schematic diagram showing the distribution of modules included in the DSSN data identification system provided in this application across different network element nodes;

[0019] Figure 4 This is a schematic diagram of the process for obtaining the working node identifier provided in an embodiment of this application;

[0020] Figure 5 This is a flowchart illustrating the process of managing the validity period of the work node identifier provided in an embodiment of this application;

[0021] Figure 6 This is a flowchart illustrating the process of identifying the recycling work node in an embodiment of this application;

[0022] Figure 7 This is a schematic diagram of the process for generating data identifiers provided in an embodiment of this application;

[0023] Figure 8 This is a schematic diagram of the process for aggregating cross-domain data provided in an embodiment of this application;

[0024] Figure 9 This is a flowchart illustrating the process of discovering and locating cross-domain data provided in an embodiment of this application;

[0025] Figure 10 This is a schematic diagram of the structure of a data identifier generation device applied to a data identifier management system provided in an embodiment of this application;

[0026] Figure 11 This is a schematic diagram of the processing device provided in the embodiments of this application. Detailed Implementation

[0027] The technical solutions of the embodiments of this application will now be described with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of them. All other embodiments obtained by those skilled in the art based on the embodiments of this application without creative effort are within the scope of protection of this application.

[0028] In the description of the embodiments of this application, the term "correspondence" may indicate that there is a direct or indirect correspondence between two things, or that there is an association between two things, or that there is a relationship of instruction and being instructed, configuration and being configured, etc.

[0029] To facilitate understanding of the technical solutions of the embodiments of this application, the relevant technologies of the embodiments of this application are described below. The following relevant technologies are optional solutions and can be combined with the technical solutions of the embodiments of this application in any way, and they all fall within the protection scope of the embodiments of this application.

[0030] In data circulation, globally unique identifiers provide the foundation for data registration and ownership confirmation, causal tracing of data elements, etc. Constructing globally unique data identifiers is crucial. In related technologies, data identifier generation is mainly accomplished through random numbers, pre-allocated data identifier segments, and snowflake models, specifically including:

[0031] (1) Generate a data identifier by concatenating the node identifier (random number) of the data with the local identifier of the target data. If there is a data identifier method applicable to each node in a cascading scenario, the method may include: determining the node identifier of the node where the target data is located, the node identifier of each node is generated based on a random number generation algorithm, accumulating the maximum data sequence number in the node where the target data is located to generate the local identifier of the target data, and concatenating the node identifier of the node where the target data is located with the local identifier of the target data to obtain the data identifier of the target data.

[0032] (2) Obtain data identifier segments from the identifier generation server in advance, and then respond to data identifier requests to allocate identifiers. If there is a data identifier processing method, the method may include: obtaining at least one data identifier segment from the identifier generation server and storing the data identifier segments, each data identifier segment including multiple data identifiers; responding to the request to obtain data identifiers, sequentially calling data identifiers from the stored data identifier segments.

[0033] (3) Data identifiers are generated using the Snowflake algorithm. The Snowflake algorithm divides 64 bits into four parts to identify information such as the symbol bit, timestamp, machine identifier, and sequence number. If there exists a method for generating identifiers in a distributed system, and each subsystem of the distributed system runs a Snowflake identifier generation component and an application instance of the business application, and this method is applied to the Snowflake identifier generation component in any subsystem, then the method may include: responding to an identifier generation request from a target application instance in the subsystem, determining the target Snowflake identifier generator corresponding to the table name of the target data table in the subsystem based on the table name of the target data table included in the identifier generation request, and using the target Snowflake identifier generator to generate a unique identifier in the target data table.

[0034] However, the above methods still have some limitations, including:

[0035] (1) A data identifier is generated by concatenating the node identifier (random number) of the data with the local identifier of the target data. The data identifier generated by this method is unordered.

[0036] (2) The identifier server pre-allocates number segments to the nodes, and the nodes then allocate identifiers to the locally stored data. However, the identifiers are only ordered locally, and the global order is fixed when the number segments are allocated.

[0037] (3) Based on the allocation scheme of working nodes in the snowflake algorithm, the number of working node identifiers is limited and there is a lack of effective recovery and expiration mechanisms. At the same time, there is a lack of research on data categories and security levels.

[0038] As can be seen from the problems existing in the aforementioned related technologies, the Data Switching Service Network (DSSN), as a data circulation infrastructure, needs to support unified intra-domain and cross-domain identifiers for the circulation of polymorphic data at low, medium, and high security levels. To address these technical issues, this application proposes a data identifier generation method. This identifier carries a timestamp, working node identifier, polymorphic data category, and security level information, enabling unique identification of cross-domain and intra-domain data, ensuring the global uniqueness of the generated data identifier, and simultaneously ensuring that the overall timeline of the identifier is incremental.

[0039] To facilitate understanding of the technical solutions of the embodiments of this application, the technical solutions of this application are described in detail below through specific embodiments. The above-mentioned related technologies are optional solutions and can be arbitrarily combined with the technical solutions of the embodiments of this application, all of which fall within the protection scope of the embodiments of this application. The embodiments of this application include at least some of the following contents.

[0040] This application proposes a data identifier generation method for a data identifier management system. Figure 1 This is a flowchart illustrating the data identifier generation method provided in an embodiment of this application, such as... Figure 1 As shown, the method includes the following steps:

[0041] Step 101: Based on the metadata information in the data identification request, determine the timestamp information, data category information, and security level information included in the metadata information.

[0042] Here, the data identification management system includes a Data Sharing Platform-Management (DSP-M) node, a Data Sharing Platform (DSP) node, and a Data Service Node (DSN) node. Multiple DSP nodes are mounted under one DSP-M node, and multiple DSN nodes are mounted under one DSP node.

[0043] In this embodiment, the data identification request includes different categories of identification requests, such as identification requests triggered by data registration, identification requests for existing data, and identification requests for data generated through the transformation of parent data. The target DSN node in the data identification management system receives data identification requests sent by third parties and parses the metadata information in the data identification request to obtain the metadata information, including timestamp information, data category information, and security level information.

[0044] Specifically, the target DSN node includes a data identification request module and a data identification module. The data identification request module receives data identification requests sent by third parties and sends them to the data identification module. The data identification module receives data identification requests sent by the data identification request module and parses the data identification requests to obtain timestamp information, data category information, and security level information.

[0045] The timestamp is the current time of the data identification request minus the 2000-01-01 00:00:00UTC time difference (seconds), and the unit is seconds; the data category is a category identifier for polymorphic data, including eight categories such as text file (000), structured data (001), real-time data (010), video (011), and image set (100); the data security level includes three levels: low (000), medium (001), and high (010).

[0046] It should be noted that for identification requests triggered by data registration, the data category and security level are specified by the data registrant; for identification requests for existing data, the category and security level are generally specified by the data administrator; for identification requests for data generated through the transformation of parent data, the data category and security level are inherited from the parent data, and a change in security level can be triggered when certain conditions are met.

[0047] Step 102: Based on the timestamp information, data category information, security level information, and the working node identifier corresponding to the target DSN node, fill in the bits in the data identifier format to obtain the target data identifier corresponding to the target DSN node.

[0048] The data identifier format includes N bits, where M1 bits represent timestamp information, M2 bits represent worker node identifier, M3 bits represent data category information, and M4 bits represent security level information; N is a positive integer, and M1, M2, M3, and M4 are positive integers less than N.

[0049] In this embodiment, the target DSN node fills the N bits in the data identifier format based on timestamp information, data category information, security level information, and the working node identifier corresponding to the target DSN node. The timestamp information is filled into the M1 bit of the N bits, the working node identifier is filled into the M2 bit of the N bits, the data category information is filled into the M3 bit of the N bits, and the security level information is filled into the M4 bit of the N bits, thereby obtaining the target data identifier corresponding to the target DSN node.

[0050] Specifically, the data identification module in the target DSN node will fill in the N bits in the data identification format based on the timestamp information, data category information, security level information, and the working node identifier corresponding to the target DSN node to obtain the target data identifier corresponding to the target DSN node.

[0051] In some implementations, the target DSN node also includes a local data identifier management module. After the data identifier module obtains the target data identifier, it stores the target data identifier and related metadata information in the local data identifier management module, so that the DSP node can synchronize the data increments in the local data identifier management module to the domain-specific data identifier management module in the DSP node.

[0052] In some implementations, the data identifier format includes N bits arranged from left to right in order of high bit to low bit; wherein, bit M1 is to the left of bit M2; bit M2 is to the left of bit M3; bit M3 is to the left of bit M4; or, bit M1 is to the left of bit M2; bit M2 is to the left of bit M4; bit M4 is to the left of bit M3.

[0053] Here, in the data identifier format, the N bits are sorted from left to right in order of high digit to low digit. The data category and security level are placed in the low digit, which does not affect the overall timeline increment of the data identifier. Moreover, the two can be interchanged in the implementation. That is, the M3 bit used to fill the data category information can be located to the left of the M4 bit used to fill the security level information, or the M4 bit used to fill the security level information can be located to the left of the M3 bit used to fill the data category information. In other words, when the data identifier format is filled based on the timestamp information, data category information, security level information, and the working node identifier corresponding to the target DSN node, the sorting order of the N bits includes two cases: the first is to sort in the order of M1, M2, M3, M4, and the second is to sort in the order of M1, M2, M4, M3.

[0054] It should be noted that by recording the timestamp information of the data identifier request, it can be ensured that the overall timeline of the generated data identifiers increases. Furthermore, when the timestamp information is the same, the data identifier corresponding to the smaller worker node identifier has a smaller range within the domain, and when the worker node identifiers are the same, the data identifier corresponding to the smaller timestamp information is even smaller.

[0055] In some implementations, before padding the bits in the data identifier format based on timestamp information, data category information, security level information, and the worker node identifier corresponding to the target DSN node, the following may be specifically included:

[0056] Based on the worker node identifier request of the target DSN node, select an identifier in the allocatable state from the identifier information table as the worker node identifier, and set the status of the selected identifier to the allocatable state in the identifier information table.

[0057] Set an expiration time for the worker node identifier, and store the target DSN node, worker node identifier, and expiration time in the node identifier table.

[0058] Here, the target DSN node sends a worker node identifier request to the DSP node. Based on the worker node identifier request, the DSP node first checks whether there is an identifier in the identifier information table that is in an allocable state. If there is, it selects the identifier in the allocable state from the identifier information table as the worker node identifier and sets the identifier from the allocable state to the allocated state in the identifier information table. If there is no identifier, the target DSN node can continue to wait for an allocable identifier, or the DSP node can handle the worker node identifier request by reporting an exception.

[0059] After the DSP node assigns a worker node identifier to the target DSN node, the DSP node sets a validity period for the worker node identifier and stores the target DSN node, worker node identifier, and validity period in the node identifier table.

[0060] Specifically, the target DSN node also includes a DSN node management module, and the DSP node includes a worker node identifier management module. The DSN node management module requests a worker node identifier from the worker node identifier management module. The worker node identifier management module checks whether an allocable identifier exists in the identifier information table. If it does, the worker node identifier management module retrieves an allocable identifier from the identifier information table as the worker node identifier and sets the identifier from the allocable state to the allocated state in the identifier information table. If it does not exist, the DSN node management module continues to wait for an allocable identifier, or the worker node identifier management module handles the worker node identifier request by reporting an exception.

[0061] After the work node identifier management module assigns a work node identifier to the DSN node management module, the work node identifier management module will set an expiration time for the work node identifier and store the target DSN node, work node identifier, and expiration time in the node identifier table.

[0062] In some implementations, after obtaining the worker node identifier corresponding to the target DSN node, it is possible to check whether the worker node identifier is within the valid time period every first preset period. If it is, an extension application is made for the valid time, and the valid time is valid if the application is successful; otherwise, the target DSN node is notified to re-request the worker node identifier.

[0063] Here, the DSP node runs a scheduled task to check if the worker node identifier is within its valid time. The check cycle of this scheduled task is the first preset cycle. If the worker node identifier is within its valid time, the target DSN node can apply for an extension of the validity period of the worker node identifier. If the DSP node responds to the application request from the target DSN node, it means that the application is successful. At this time, the DSP node will update the validity period of the worker node identifier, the target DSN node will update its local validity period, and continue to provide data identifier services. If the worker node identifier is not within its valid time, it means that the worker node identifier has expired, and the target DSN node needs to request a new worker node identifier.

[0064] Specifically, the work node identifier management module runs a scheduled task with a first preset check cycle to check whether the work node identifier has expired. If the work node identifier has not expired, the DSN node management module can send an application to the work node identifier management module to extend the validity period of the work node identifier. If the application is successful (DSP responds to the DSN request), the work node identifier management module updates the validity period of the work node identifier, and the DSN node management module updates the local validity period and continues to provide data identifier services. If the work node identifier has expired, the work node identifier management module notifies the DSN node management module that it needs to re-request the work node identifier.

[0065] In some implementations, notifying the target DSN node to re-request the worker node identifier may specifically include:

[0066] Set the status of the work node identifier to locked in the identifier information table;

[0067] When the target DSN node releases the worker node identifier, it sets the status of the worker node identifier to an allocatable state in the identifier information table and notifies the target DSN node to re-request the worker node identifier.

[0068] Here, if the worker node identifier has expired, the DSP node can set the status of the worker node identifier to locked in the identifier information table. After the target DSN node releases the worker node identifier, the DSP node will set the status of the worker node identifier to allocable. At this time, the target DSN node can request the worker node identifier again.

[0069] Specifically, the worker node identifier management module sets the worker node identifier to a locked state in the identifier information table. After the target DSN node releases the worker node identifier, the worker node identifier is set to an allocatable state, and the DSN node management module is notified to request the worker node identifier again.

[0070] In some implementations, it can also be determined whether the worker node identifier of the target DSN node has been accessed within the valid time. If not, the worker node identifier of the target DSN node is reclaimed.

[0071] Here, after the DSP node assigns a worker node identifier to the target DSN node, it can also determine whether the worker node identifier has been accessed by the target DSN node within the valid time. If not, the DSP node will reclaim the worker node identifier.

[0072] Specifically, the worker node identifier management module checks whether the worker node identifier in the DSN node management module has been accessed by the target DSN node within the valid time. If not, the worker node identifier management module will reclaim the worker node identifier.

[0073] In some implementations, the DSP node can also check the status of the target DSN node. If the target DSN node is offline, the DSP node will release the worker node identifier and set the status of the identifier to an allocatable state in the identifier information table. If the target DSN node is not offline, the target DSN node can send an identifier decommissioning request to the DSP node according to the actual situation (e.g., task completion, node abnormality). The DSP node will release the worker node identifier according to the identifier decommissioning request and set the status of the identifier to an allocatable state in the identifier information table.

[0074] Specifically, the worker node identifier management module checks the status of the target DSN node in the DSN node management module. If the target DSN node is offline, the worker node identifier management module will release the worker node identifier and set the identifier to an allocatable state. If the target DSN node is not offline, the DSN node management module can send an identifier decommissioning application to the worker node identifier management module. The worker node identifier management module will then release the worker node identifier according to the identifier decommissioning application and set the identifier's status to an allocatable state in the identifier information table.

[0075] In some implementations, after obtaining the target data identifier corresponding to the target DSN node, the process may further include:

[0076] Every second preset period, data identifiers and metadata information corresponding to multiple DSN nodes are obtained from multiple DSP nodes; wherein, each DSP node in the multiple DSP nodes includes a corresponding domain identifier, and each DSP node includes multiple DSN nodes;

[0077] Based on the domain identifier corresponding to each DSP node, and the data identifiers and metadata information corresponding to the multiple DSN nodes included in each DSP node, cross-domain data identifiers are assembled to obtain cross-domain data.

[0078] Here, the DSP-M node will run a timed task to pull data identifiers and metadata information corresponding to multiple DSN nodes from multiple DSP nodes. The pull period of this timed task is a second preset period. Each DSP node in the multiple DSP nodes includes a corresponding domain identifier, and each DSP node includes multiple DSN nodes.

[0079] The DSP-M node obtains the domain identifier corresponding to each DSP node based on the mapping between DSP nodes and domain identifiers. Then, based on the domain identifier of each DSP node, the data identifiers corresponding to the multiple DSN nodes included in each DSP node, and metadata information, it assembles cross-domain data identifiers to obtain cross-domain data. During the cross-domain data identifier assembly process, a mapping between data identifiers and DSP nodes is generated; that is, cross-domain data includes the mapping between data identifiers and DSP nodes.

[0080] Specifically, the DSP-M node includes a cross-domain data discovery and location module and a domain identifier management module. The cross-domain data discovery and location module runs a timed task with a second preset fetch cycle to retrieve data identifiers and related metadata information from each DSP node. Based on the correspondence between DSP nodes and domain identifiers in the domain identifier management module, the cross-domain data discovery and location module obtains the domain identifier of each DSP node, and assembles the cross-domain data identifier according to the format based on the domain identifier corresponding to each DSP node, the data identifiers corresponding to the multiple DSN nodes included in each DSP node, and the metadata information, to obtain the cross-domain data.

[0081] In some implementations, the data buyer purchases data products on a business platform, and the business platform sends the contract for the data product to the data identification management system. The operations of the data identification management system at this time may specifically include:

[0082] The system parses the contracts sent by the business platform to obtain work orders, and then sends the work orders to multiple DSP nodes; each DSP node also includes a DRN node.

[0083] The work order is parsed through the DRN node to obtain the data identifier corresponding to the work order;

[0084] If the data identifier is determined to be a cross-domain data identifier, then cross-domain data location is performed on the data identifier.

[0085] Here, each DSP node also includes a Data Request Node (DRN) node. After the business platform sends the contract for the data product purchased by the data buyer to the data identification management system, the DSP-M node (cross-domain data discovery and location module) in the data identification management system parses the contract sent by the business platform to obtain a work order, and sends the work order to multiple DSP nodes. After receiving the work order, each DSP node decomposes the work order and assigns it to its corresponding DRN node. Then, the DRN node parses the work order to obtain the data identifier corresponding to the work order. The DRN node determines whether the data identifier is intra-domain or cross-domain. If the data identifier is intra-domain, the DRN node sends the data identifier to the corresponding DSP node for further parsing. If the data identifier is cross-domain, the DRN node sends the data identifier to the DSP-M node to locate the cross-domain data.

[0086] In some implementations, cross-domain data location of data identifiers may specifically include:

[0087] Based on the correspondence, the data identifier is parsed to obtain the DSP node where the data identifier is located;

[0088] Based on the DSP node where the data identifier is located, determine the metadata information corresponding to the DSP node where the data identifier is located.

[0089] Based on the metadata information corresponding to the DSP node where the data identifier is located, cross-domain data location is performed on the data identifier.

[0090] Here, after the DSP-M node receives the data identifier (cross-domain data identifier) ​​sent by the DRN node, the DSP-M node will parse the data identifier according to the correspondence between the data identifier contained in the cross-domain data and the DSP node, obtain the DSP node where the data identifier is located, and send the data identifier and the DRN node to the DSP node where the data identifier is located. After receiving the data identifier, the DSP node where the data identifier is located will determine the metadata information corresponding to the data identifier, including the IP, location, access method, etc. of the node where the data is located, and return the metadata information corresponding to the data identifier to the DRN node. After receiving the metadata information corresponding to the data identifier, the DRN node completes the cross-domain location.

[0091] Specifically, the DSP node also includes an intra-domain data identifier management module. The cross-domain data discovery and location module parses the data identifier based on the correspondence between the data identifier contained in the cross-domain data and the DSP node, obtains the DSP node where the data identifier is located, and sends the data identifier and DRN node to the DSP node where the data identifier is located. Then, the intra-domain data identifier management module in the DSP node queries the metadata information corresponding to the data identifier and returns the metadata information corresponding to the data identifier to the DRN node. After receiving the metadata information corresponding to the data identifier, the DRN node completes the cross-domain location.

[0092] In the technical solution of this application embodiment, the data identification management system determines the timestamp information, data category information, and security level information included in the metadata information in the data identification request; and fills the bits in the data identification format based on the timestamp information, data category information, security level information, and the working node identifier corresponding to the target data service DSN node to obtain the target data identifier corresponding to the target DSN node; wherein, the data identification format includes N bits, of which M1 bits represent timestamp information, M2 bits represent working node identifier, M3 bits represent data category information, and M4 bits represent security level information; N is a positive integer, and M1, M2, M3, and M4 are positive integers less than N. Thus, by providing a multi-level data identification format and data identification generation management process, the identifier carries timestamp, working node identifier, polymorphic data category, and security level information, which can achieve unique identification of cross-domain and intra-domain data, ensure the global uniqueness of the generated data identifier, ensure that the overall timeline of the identifier is incremental, and meet the identification requirements of polymorphic data category and security level.

[0093] This application also proposes a multi-level data identifier format and data identifier generation and management process in a cross-domain distributed environment. The DSSN data identifier design follows the principles of cross-domain uniqueness and incremental time-series ordering within the domain. Its specific structure is as follows:

[0094] <Domain Identifier>.<Industry Identifier>.<Domain Data Identifier>

[0095] Domain identifiers can be strings or integers, and are mainly used to identify which domain the data belongs to, such as the Shanghai Data Exchange and the Beijing International Big Data Exchange. Domain identifiers are managed uniformly by the domain identifier management module.

[0096] The industry identifier is mainly identified by four digits from 0001 to 9999, and the meaning of each digit corresponds to the industry code in the "GB / T4754—2017 National Economic Industry Classification".

[0097] The data identifier within the domain divides the 64 bits into 7 parts, such as Figure 2 The diagram shown illustrates the distribution of the domain data identifier format provided in this application embodiment. This format specifically includes:

[0098] (1) The first bit: the flag bit, which occupies 1 bit and its value is always 0: that is, the generated UID is a positive number.

[0099] (2) The 35 bits starting from the 2nd bit: Time increment (current time, the increment value relative to 2020-01-01 00:00:00 UTC time), which can represent 2 35 The number of units, measured in seconds, is enough for over 1000 years.

[0100] (3) 10 bits starting from the 37th bit: worker node identifier, supporting 1024 IDs and providing a reuse strategy.

[0101] (4) 10 bits starting from the 47th bit: Concurrent sequence, indicating the maximum number of data identifiers supported per second, with a default of 1024 concurrent IDs.

[0102] (5) The 2-bit reserved starting from the 57th bit is currently unused. It can be expanded according to the actual data volume requirements within the field.

[0103] (6) 3 bits starting from the 59th bit: data category, a category identifier for polymorphic data, including eight categories such as text file (000), structured data (001), real-time data (010), video (011), and image set (100).

[0104] (7) The last 3 bits: data security level, including three levels: low (000), medium (001), and high (010).

[0105] Based on the aforementioned intra-domain data identifier format, the intra-domain data identifier can generate 1024 serial numbers per second for each security level on each working node. By recording the current timestamp, it can be ensured that the generated data identifiers increase sequentially over time. Combined with the working node identifier, when timestamps are the same, the data identifier with a smaller working node identifier has a smaller intra-domain range; and when working node identifiers are the same, the data identifier with a smaller timestamp is even smaller.

[0106] The lowest 6 bits of the data identifier within a domain can be used to identify polymorphic data categories and security levels. Placing the data category and security level in the lowest bits does not affect the overall timeline increment of the data identifier. Furthermore, these two parts can be swapped during implementation, with the number of bits expanded according to actual needs.

[0107] Identification based on <domain identifier>, <industry identifier>, and <data identifier within the domain> in cross-domain situations can ensure the uniqueness of the global identifier. Without the need for additional information, the data category, timestamp, and security level can be obtained through this identifier, which can meet the data identification requirements for low, medium, and high-level DSSN circulation.

[0108] Based on the aforementioned characteristics of data identification, and considering the DSSN architecture, this application proposes the distribution of the main modules of the DSSN data identification system across different network element nodes. Figure 3 This is a schematic diagram showing the distribution of modules included in the DSSN data identification system on different network element nodes provided in the embodiments of this application. The DSSN data identification system has been functionally extended on the original architecture, and its functional description in each network element node specifically includes:

[0109] (1) DSP-M Node: This adds new network element functionality, receiving contracts from the service platform and breaking them down into work orders, which are then distributed to different DSPs. It also handles cross-domain global unified management. The DSP-M node includes a domain identifier management module and a cross-domain data discovery and location module.

[0110] 1) Domain Identifier Management Module: This module has domain identifier allocation and resolution functions. A DSP and its subordinate DSNs constitute a domain; it identifies each domain and manages each domain uniformly in the database.

[0111] 2) Cross-domain data discovery and location module: Parses the contract and sends the work order to different DSPs. It also receives cross-domain data location requests and completes data location by parsing the data identifier.

[0112] (2) DSP Node: Includes a worker node identification management module and a domain data identification management module.

[0113] 1) Work Node Identifier Management Module: Manages the allocation and recycling of identifiers for DSN nodes under the DSP node; and assigns an independent work node identifier to each DSN node under the DSP node, which is an integer.

[0114] Here, the worker node identifier management module uses a database to store the identifier information table and the node identifier table:

[0115] Identification Information Table: Identifier, whether the identifier is in use; the corresponding identifier status includes three states: assignable, assigned, and locked;

[0116] Node Identifier Table: Work node, identifier, and identifier validity period information;

[0117] Each identifier assigned to a worker node has a validity period, and worker nodes periodically update their validity period with the worker node identifier management module. If an identifier assigned to a worker node is not accessed by the worker node within its validity period, the identifier will be reclaimed by the DSP node identifier service.

[0118] 2) Intra-domain data identification management module: Incrementally synchronizes the data identification and metadata information temporarily stored in the data identification management module of each DSN node under each DSP, and provides intra-domain data query and cross-domain data query.

[0119] (3) DSN Node: Includes DSN Node Management Module, Data Identification Request Module, Data Identification Module, and Data Identification Management Module.

[0120] 1) DSN Node Management Module: Requests working node identifiers from DSP nodes; periodically interacts with DSP nodes to request the extension of the validity period of working node identifiers; periodically checks whether the local node identifier (data identifier) ​​is within the valid time and decides whether the data identifier module should continue to provide data identifier services.

[0121] 2) Data Identification Request Module: Accepts interface calls from third parties, such as data registration identification requests, identification requests after data generation, and identification requests for existing data, and provides the data identification module with timestamps, polymorphic data categories, data security levels, and other metadata.

[0122] The timestamp is the current time of the data identification request minus the time difference (seconds) of 2000-01-01 00:00:00UTC. The data category needs to be defined in advance and assigned a data category value according to different situations, such as text file (000), structured data (001), real-time data (010), video (011), image set (100), etc. The data security level includes three levels: low (000), medium (001), and high (010).

[0123] In addition, the rules for generating data categories and security levels include:

[0124] For identification requests triggered by data registration, the data category and security level are specified by the data registrant; for identification requests for existing data, the category and security level are generally specified by the data administrator; for identification requests for data generated through the transformation of parent data, the data category and security level are inherited from the parent data, and a change in security level can be triggered if certain conditions are met.

[0125] 3) Data Identification Module: Receives requests from the Data Identification Request Module, obtains relevant values, fills in each bit according to the domain data identification format, and generates a data identifier.

[0126] 4) Local Data Identifier Management Module: Includes temporarily stored data identifiers and metadata.

[0127] like Figure 4 The diagram shown is a flowchart illustrating the process of obtaining the working node identifier according to an embodiment of this application, specifically including the following steps:

[0128] Step 401: The DSN node management module requests a work node identifier from the work node identifier management module.

[0129] Step 402: The work node identifier management module determines whether there is an assignable identifier in the identifier information table. If there is, proceed to step 403; otherwise, proceed to step 405.

[0130] Step 403: The work node identifier management module retrieves an identifier that is in an assignable state from the identifier information table as the work node identifier.

[0131] Step 404: The work node identifier management module sets the identifier from the assignable state to the assigned state in the identifier information table.

[0132] Step 405: The DSN node management module continues to wait for an assignable identifier, or the worker node identifier management module handles the worker node identifier request through an exception error.

[0133] like Figure 5 The diagram shown is a flowchart illustrating the validity period of the management work node identifier provided in this application embodiment, specifically including the following steps:

[0134] Step 501: The work node identifier management module sets the validity period for the work node identifier and stores the work node, work node identifier, and validity period in the node identifier table.

[0135] Step 502: The work node identifier management module periodically runs a scheduled task to check whether the work node identifier has expired. If it has not expired, proceed to step 503; otherwise, proceed to step 506.

[0136] Step 503: The DSN node management module periodically sends an application to the working node identifier management module to extend the validity period of the working node identifier. If the application is successful (DSP responds to the DSN request), proceed to step 504.

[0137] Step 504: The work node identifier management module updates the validity period of the work node identifier.

[0138] Step 505: The DSN node management module updates the local validity period and continues to provide data identification services.

[0139] Step 506: The work node identifier management module sets the work node identifier to a locked state. After the corresponding node completes the identifier release, the identifier is then set to an assignable state.

[0140] like Figure 6 The diagram shown is a flowchart illustrating the process of identifying the recycling work node according to an embodiment of this application, specifically including the following steps:

[0141] Step 601: The worker node identification management module checks the status of the worker nodes in the DSN node management module. If the worker nodes are offline, proceed to step 602; otherwise, proceed to step 603.

[0142] Step 602: The work node identifier management module releases the work node identifier and sets the identifier to an assignable state.

[0143] Step 603: The DSN node management module sends an identifier retirement application to the worker node identifier management module.

[0144] Step 604: The work node identifier management module releases the work node identifier.

[0145] like Figure 7 The diagram shown is a flowchart illustrating the process of generating data identifiers according to an embodiment of this application, specifically including the following steps:

[0146] Step 701: The data identification request module receives a third-party request interface call.

[0147] Step 702: The data identification request module sends information such as timestamp, industry category, data category, and security level to the data identification module.

[0148] Step 703: The data identification module generates the latest sequence number based on the timestamp, data category, security level, and other information, by adding 1 to the maximum data sequence number under the current timestamp (default is 0), and fills in 64 bits in the data identification format to generate a long integer data identifier.

[0149] Step 704: The data identification module stores the generated data identification and metadata (industry category is placed in the metadata) in the local data identification management module.

[0150] Step 705: The DSP node periodically pulls the program to synchronize the incremental data in the local data identification management module to the domain data identification management module in the DSP node.

[0151] like Figure 8 The diagram shown is a flowchart illustrating the process of aggregating cross-domain data according to an embodiment of this application, specifically including the following steps:

[0152] Step 801: The cross-domain data discovery and location module periodically pulls data identifiers and related metadata information from each DSP node.

[0153] Step 802: The cross-domain data discovery and location module obtains the domain identifier of the corresponding DSP node according to the correspondence between DSP nodes and domain identifiers in the domain identifier management module, and assembles the cross-domain data identifier according to the format.

[0154] Step 803: The cross-domain data discovery and location module generates the correspondence between data identifiers and DSP nodes, completing the cross-domain data aggregation.

[0155] like Figure 9 The flowchart for discovering and locating cross-domain data provided in this application embodiment specifically includes the following steps:

[0156] Step 901: The data buyer purchases data products on the business platform, the business platform generates a contract, and sends the contract to the cross-domain data discovery and location module.

[0157] Step 902: The cross-domain data discovery and location module parses the contract to generate a work order and sends the work order to different DSP nodes.

[0158] Step 903: The DSP node distributes the work order to different DRN / DSN nodes.

[0159] Step 904: The DRN node obtains the data identifier through the work order.

[0160] Step 905: The DRN node determines whether the data identifier is within the domain or across domains. If it is across domains, proceed to step 906; if it is within the domain, proceed to step 909.

[0161] Step 906: The cross-domain data discovery and location module parses the data identifier, obtains the DSP node where the data identifier is located, and sends the data identifier and the cross-domain DRN node to the DSP node.

[0162] Step 907: The domain data identification management module in the DSP node finds the corresponding metadata (including the IP address, location, access method, etc. of the node where the data is located) based on the data identification, thereby locating the specific information of the data, and returning the metadata corresponding to the data identification to the cross-domain DRN node.

[0163] Step 908: After receiving information such as the IP address, location, and access method of the node where the data is located, the cross-domain DRN node completes the cross-domain data location.

[0164] Step 909: Send the data identifier to the corresponding DSP node for further parsing.

[0165] The technical solution provided in this application defines a multi-level data identifier format based on a combination of domain identifier, industry identifier, and intra-domain data identifier. The intra-domain data identifier is a long integer that divides 64 bits into 7 parts: the high bits store the timestamp to ensure that the intra-domain data identifier increases sequentially over the entire timeline; the middle bits store the working node number and sequence number to ensure the global uniqueness of the data identifier at the same point in time and that the identifier of the same working node increases in an orderly manner; and the low bits store the data category and security level information to meet the requirements of polymorphic data category and security level identifiers.

[0166] Furthermore, the DSSN network architecture adds DSP-M, DSP, and DSN node modules to achieve multi-level data representation generation, unified data identifier management within the domain, and cross-domain data discovery and location in a global cross-domain environment. It also establishes a multi-morphic data identifier and management process for both intra-domain and cross-domain applications: the domain identifier management module identifies and resolves the domain; the DSP worker node management module identifies the DSN nodes; the DSN nodes obtain the worker node identifiers, generate data identifiers based on the identifier algorithm, and store the data identifiers in the node's local data identifier management module; finally, the data identifiers are incrementally synchronized to the DSP intra-domain data identifier management module.

[0167] This application also proposes a data identifier generation device for use in a data identifier management system. Figure 10 This is a schematic diagram of the data identifier generation device provided in the embodiments of this application, as shown below. Figure 10 As shown, the device includes:

[0168] The determining unit 1001 is used to determine, based on the metadata information in the data identification request, the timestamp information, data category information, and security level information included in the metadata information.

[0169] The processing unit 1002 is used to fill in the bits in the data identifier format based on timestamp information, data category information, security level information and the working node identifier corresponding to the target data service DSN node to obtain the target data identifier corresponding to the target DSN node.

[0170] The data identifier format includes N bits, where M1 bits represent timestamp information, M2 bits represent worker node identifier, M3 bits represent data category information, and M4 bits represent security level information; N is a positive integer, and M1, M2, M3, and M4 are positive integers less than N.

[0171] In some implementations, the N bits are ordered from left to right in order of most significant bit to least significant bit; wherein,

[0172] Bit M1 is to the left of bit M2; bit M2 is to the left of bit M3; bit M3 is to the left of bit M4; or bit M1 is to the left of bit M2; bit M2 is to the left of bit M4; bit M4 is to the left of bit M3.

[0173] In some implementations, the processing unit 1002 is further configured to, based on the worker node identifier request of the target DSN node, select an identifier in an allocatable state from the identifier information table as a worker node identifier, and set the state of the selected identifier to an allocatable state in the identifier information table; set a validity period for the worker node identifier, and store the target DSN node, the worker node identifier, and the validity period in the node identifier table.

[0174] In some implementations, the processing unit 1002 is further configured to check whether the working node identifier is within the valid time period every first preset cycle. If so, it applies for an extension of the valid time and updates the valid time if the application is successful. If not, it notifies the target DSN node to re-request the working node identifier.

[0175] In some implementations, the processing unit 1002 is specifically used to set the status of the worker node identifier to a locked state in the identifier information table; when the target DSN node releases the worker node identifier, it sets the status of the worker node identifier to an allocatable state in the identifier information table and notifies the target DSN node to re-request the worker node identifier.

[0176] In some implementations, the processing unit 1002 is further configured to determine whether the working node identifier of the target DSN node has been accessed within the valid time period; if not, the working node identifier of the target DSN node is reclaimed.

[0177] In some embodiments, the processing unit 1002 is further configured to obtain data identifiers and metadata information corresponding to multiple DSN nodes from multiple data sharing platform DSP nodes every second preset period; wherein, each DSP node in the multiple DSP nodes includes a corresponding domain identifier, and each DSP node includes multiple DSN nodes; based on the domain identifier corresponding to each DSP node, and the data identifiers and metadata information corresponding to the multiple DSN nodes included in each DSP node, cross-domain data identifiers are assembled to obtain cross-domain data.

[0178] In some implementations, the processing unit 1002 is further configured to parse the contract sent by the business platform to obtain a work order, and send the work order to multiple DSP nodes; wherein, each DSP node also includes a data requirement DRN node; the work order is parsed by the DRN node to obtain the data identifier corresponding to the work order; if it is determined that the data identifier is a cross-domain data identifier, then the cross-domain data location of the data identifier is performed.

[0179] In some implementations, cross-domain data includes the correspondence between data identifiers and DSP nodes; wherein, the processing unit 1002 is specifically used to parse the data identifier based on the correspondence to obtain the DSP node where the data identifier is located; based on the DSP node where the data identifier is located, determine the metadata information corresponding to the DSP node where the data identifier is located; and based on the metadata information corresponding to the DSP node where the data identifier is located, perform cross-domain data location for the data identifier.

[0180] In the technical solution of this application embodiment, the data identification management system determines the timestamp information, data category information, and security level information included in the metadata information in the data identification request; and fills the bits in the data identification format based on the timestamp information, data category information, security level information, and the working node identifier corresponding to the target data service DSN node to obtain the target data identifier corresponding to the target DSN node; wherein, the data identification format includes N bits, of which M1 bits represent timestamp information, M2 bits represent working node identifier, M3 bits represent data category information, and M4 bits represent security level information; N is a positive integer, and M1, M2, M3, and M4 are positive integers less than N. Thus, by providing a multi-level data identification format and data identification generation management process, the identifier carries timestamp, working node identifier, polymorphic data category, and security level information, which can achieve unique identification of cross-domain and intra-domain data, ensure the global uniqueness of the generated data identifier, ensure that the overall timeline of the identifier is incremental, and meet the identification requirements of polymorphic data category and security level.

[0181] Those skilled in the art should understand that Figure 10 The functions of each unit in the data identifier generation device shown can be understood by referring to the relevant description of the aforementioned method. Figure 10 The functions of each unit in the data identifier generation device shown can be implemented by a program running on a processor or by specific logic circuits.

[0182] Figure 11 This is a schematic diagram of the processing device provided in an embodiment of this application. The processing device may be a terminal device or a network device. Figure 11The processing device shown includes a processor 1101, which can call and run computer programs from memory to implement the methods in the embodiments of this application.

[0183] Optionally, such as Figure 11 As shown, the processing device may further include a memory 1102. The processor 1101 can retrieve and run computer programs from the memory 1102 to implement the methods described in the embodiments of this application.

[0184] The memory 1102 can be a separate device independent of the processor 1101, or it can be integrated into the processor 1101.

[0185] Optionally, such as Figure 11 As shown, the processing device may also include a transceiver 1103, which the processor 1101 can control to communicate with other devices. Specifically, it can send information or data to other devices or receive information or data sent by other devices.

[0186] The transceiver 1103 may include a transmitter and a receiver. The transceiver 1103 may further include an antenna, and the number of antennas may be one or more.

[0187] The processing device may specifically be the data identifier generation device of the embodiments of this application, and the processing device may implement the corresponding processes of the various methods of the embodiments of this application. For the sake of brevity, it will not be described in detail here.

[0188] It should be understood that the processor in the embodiments of this application may be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The processor described above can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly embodied in the execution of a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. The storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method.

[0189] It is understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced Synchronous DRAM (ESDRAM), Synchlink DRAM (SLDRAM), and Direct Rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0190] It should be understood that the above-described memory is exemplary and not a limiting description. For example, the memory in the embodiments of this application may also be static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct memory bus RAM (DR RAM), etc. That is to say, the memory in the embodiments of this application is intended to include, but is not limited to, these and any other suitable types of memory.

[0191] This application also provides a computer-readable storage medium for storing a computer program. This computer-readable storage medium can be applied to the processing device in this application embodiment, and the computer program causes the computer to execute the corresponding processes implemented by the various methods in this application embodiment; for brevity, further details are omitted here.

[0192] This application also provides a computer program product, including computer program instructions. This computer program product can be applied to the processing device in this application embodiment, and the computer program instructions cause the computer to execute the corresponding processes implemented by the various methods in this application embodiment; for brevity, further details are omitted here.

[0193] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0194] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0195] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0196] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0197] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0198] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0199] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A data identifier generation method, characterized in that, Applied to a data identification management system, the method includes: Based on the metadata information in the data identification request, the metadata information includes timestamp information, data category information, and security level information. Based on the timestamp information, the data category information, the security level information, and the working node identifier corresponding to the target data service DSN node, the bits in the data identifier format are filled to obtain the target data identifier corresponding to the target DSN node; The data identifier format includes N bits, where M1 bits represent the timestamp information, M2 bits represent the working node identifier, M3 bits represent the data category information, and M4 bits represent the security level information; N is a positive integer, and M1, M2, M3, and M4 are positive integers less than N.

2. The method according to claim 1, characterized in that, The N bits are sorted from left to right in order of most significant bit to least significant bit; where, The M1 bit is located to the left of the M2 bit; the M2 bit is located to the left of the M3 bit; the M3 bit is located to the left of the M4 bit; or, The M1 bit is located to the left of the M2 bit; the M2 bit is located to the left of the M4 bit; the M4 bit is located to the left of the M3 bit.

3. The method according to claim 1, characterized in that, The method further includes: Based on the worker node identifier request of the target DSN node, select an identifier in the allocatable state from the identifier information table as the worker node identifier, and set the state of the selected identifier in the identifier information table to the allocatable state. Set a validity period for the working node identifier, and store the target DSN node, the working node identifier, and the validity period in the node identifier table.

4. The method according to claim 3, characterized in that, The method further includes: Every first preset period, check whether the working node identifier is within the valid time. If it is, apply for an extension of the valid time and update the valid time if the application is successful. If not, notify the target DSN node to re-request the working node identifier.

5. The method according to claim 4, characterized in that, The notification to the target DSN node to re-request the worker node identifier includes: In the identification information table, the status of the work node identifier is set to locked. When the target DSN node releases the worker node identifier, it sets the status of the worker node identifier to an allocatable state in the identifier information table and notifies the target DSN node to re-request the worker node identifier.

6. The method according to claim 4, characterized in that, The method further includes: Determine whether the worker node identifier of the target DSN node has been accessed within the valid time period. If not, reclaim the worker node identifier of the target DSN node.

7. The method according to any one of claims 1 to 6, characterized in that, The method further includes: Every second preset period, data identifiers and metadata information corresponding to multiple DSN nodes are obtained from multiple data sharing platform DSP nodes; wherein, each of the multiple DSP nodes includes a corresponding domain identifier, and each DSP node includes multiple DSN nodes; Based on the domain identifier corresponding to each DSP node, and the data identifier and metadata information corresponding to the multiple DSN nodes included in each DSP node, cross-domain data identifiers are assembled to obtain cross-domain data.

8. The method according to claim 7, characterized in that, The method further includes: The contract sent by the business platform is parsed to obtain a work order, and the work order is sent to the multiple DSP nodes; wherein, each DSP node also includes a data requirement DRN node; The work order is parsed through the DRN node to obtain the data identifier corresponding to the work order; If the data identifier is determined to be the cross-domain data identifier, then cross-domain data location is performed on the data identifier.

9. The method according to claim 8, characterized in that, The cross-domain data includes the correspondence between data identifiers and DSP nodes; The cross-domain data location of the data identifier includes: Based on the correspondence, the data identifier is parsed to obtain the DSP node where the data identifier is located; Based on the DSP node where the data identifier is located, determine the metadata information corresponding to the DSP node where the data identifier is located; Based on the metadata information corresponding to the DSP node where the data identifier is located, cross-domain data positioning is performed on the data identifier.

10. A data identifier generation device, characterized in that, The device, used in a data identification management system, includes: The determining unit is configured to determine, based on the metadata information in the data identification request, the timestamp information, data category information, and security level information included in the metadata information; The processing unit is used to fill in the bits in the data identifier format based on the timestamp information, the data category information, the security level information, and the working node identifier corresponding to the target data service DSN node to obtain the target data identifier corresponding to the target DSN node. The data identifier format includes N bits, where M1 bits represent the timestamp information, M2 bits represent the working node identifier, M3 bits represent the data category information, and M4 bits represent the security level information; N is a positive integer, and M1, M2, M3, and M4 are positive integers less than N.

11. A processing apparatus, characterized in that, include: A processor and a memory for storing a computer program, the processor for calling and running the computer program stored in the memory to perform the method as described in any one of claims 1 to 9.

12. A computer-readable storage medium, characterized in that, Used to store a computer program that causes a computer to perform the method as described in any one of claims 1 to 9.

13. A computer program product, characterized in that, It includes computer program instructions that cause a computer to perform the method as described in any one of claims 1 to 9.

Images