Contractual constraint data transmission method and system driven by data space double planes in cooperation

Abstract

This application discloses a contract-constrained data transmission method and system driven by a dual-plane collaborative approach in the data space, belonging to the field of data transmission technology. This application achieves decoupling of control logic and data transmission execution through the collaborative division of labor between the control plane and the data plane. This allows the control plane to focus on the strategy management of contract constraints and the generation of transmission identifiers, while the data plane generates data access credentials with embedded strategies based on the contract constraint information. Data transmission is only executed after verifying the contract constraint information in the credentials. This technically extends contract constraints from the negotiation phase to the transmission execution phase, avoiding security risks such as credential abuse or unauthorized access. Simultaneously, by adaptively fragmenting the transmitted data according to the data source type and recording the fragmentation status during data transmission, the application enables the continuation of transmission of incomplete fragments from the point of interruption based on the recorded status information after transmission interruption.

Description

Technical Field

[0001] This application relates to the field of data transmission technology, and in particular to a contract-constrained data transmission method and system driven by dual-plane collaborative data space. Background Technology

[0002] In existing data space connector technical solutions, a microservice architecture that separates the control plane and the data plane is typically adopted. In pull mode, the data provider's data plane generates a time-sensitive access token and sends the token along with the data access endpoint address to the data requester. The data requester carries the token when requesting data, and the data provider's data plane executes data transmission after verifying the token's validity. The data transmission process adopts a "data source-data sink" pipeline model. However, the existing solutions mentioned above have the following drawbacks: First, the access tokens are not bound to contractual constraints. The tokens only contain basic time-validity statements and do not carry contract-related constraint information such as contract protocol identifiers, asset identifiers, and participant identifiers. This means that once the token is issued, it is no longer under the control of contractual constraints, and it is impossible to prevent the token from being abused or accessed without authorization by non-contractual parties at the technical level. Second, the data transmission adopts a "data source-data sink" pipeline model. The data source and data sink process data as a whole. If a network interruption or service failure occurs during transmission, the system cannot record the precise boundaries of the transmitted data. After the transmission is restored, all data can only be retransmitted from the starting position of the data source, resulting in a serious waste of network bandwidth and computing resources. Third, the proxy request processing lacks a complete asynchronous streaming transmission mechanism. It usually adopts a synchronous blocking method to read all data from the data source and then return it to the data requesting end. For large datasets, not only is the response waiting time long, but the complete transmitted data also needs to be cached in memory, which consumes a lot of memory resources and is difficult to meet the needs of efficient transmission of large-scale data. Summary of the Invention

[0003] To address the issues of existing data space connectors, such as the lack of binding between access tokens and contract constraints, the lack of recovery capabilities after transmission interruption, and the lack of asynchronous streaming mechanisms for proxy request processing, this paper presents a contract-constrained data transmission method and system that aims to achieve data space dual-plane collaborative driving through the collaboration of the control plane and data plane, drive the generation and verification of data access credentials with contract constraint information, and realize adaptive fragmented transmission and fragmented state persistence records during data transmission.

[0004] This application provides a contract-constrained data transmission method driven by dual-plane data space collaboration, including:

[0005] In response to a data transmission request, the control plane generates a transmission identifier and sends an execution instruction carrying the transmission identifier and contract constraint information to the data plane.

[0006] The data plane generates a data access credential containing the contract constraint information based on the execution instruction;

[0007] In response to receiving an access request carrying the data access credential, the data plane performs data transmission from the data source to the data sink after verifying the contract constraint information in the data access credential.

[0008] During the data transmission process, the data plane segments the transmitted data according to the type of the data source and records the status information of the segmentation process.

[0009] Optional, also includes:

[0010] The data plane creates a data transmission entity for the data transmission and uses the transmission identifier as the identifier of the data transmission entity.

[0011] Optional, also includes:

[0012] In response to the completion or failure of the data transmission, the data plane sends a status notification carrying the identifier of the data transmission entity to the control plane.

[0013] The control plane updates the status of the corresponding transmission process based on the status notification.

[0014] Optionally, the contract constraint information includes at least one of the following: contract identifier, data asset identifier, and participant identifier;

[0015] Verifying the contract constraint information in the data access credential includes verifying whether the contract constraint information is consistent with the context information of the access request.

[0016] Optionally, the control plane sends execution instructions to the data plane, including:

[0017] The control plane determines the target data plane from multiple candidate data planes based on the transmission type and data source type associated with the data transmission request;

[0018] The execution command is sent to the target data plane.

[0019] Optionally, the process of fragmenting the transmitted data according to the type of data source includes at least one of the following:

[0020] When the data source is a database, sharding is performed based on data offset.

[0021] When the data source is a file, file fragmentation is performed based on file size.

[0022] When the data source is a time series type, it is sharded using a time interval-based method.

[0023] Optionally, the status information of the record fragmentation process includes:

[0024] The fragmentation identifier and processing status are associated with the transmission identifier and stored accordingly;

[0025] In response to a data transmission interruption and subsequent recovery, the unfinished fragments are processed again based on the recorded status information.

[0026] Optionally, the execution data transmission includes:

[0027] The data from the data source is transmitted in real time to the response channel corresponding to the access request using a streaming transmission method.

[0028] Optionally, the execution data transmission includes:

[0029] Match data source instances based on the type of the data source, and match data sink instances based on the type of the data sink;

[0030] The data transfer is performed using the matched data source instance and data sink instance.

[0031] This application also provides a data transmission system, including a control plane and a data plane:

[0032] The control plane is configured to generate a transmission identifier in response to a data transmission request, and send an execution instruction carrying the transmission identifier and contract constraint information to the data plane.

[0033] The data plane is configured to generate a data access credential containing the contract constraint information based on the execution instruction; in response to receiving an access request carrying the data access credential, after verifying the contract constraint information in the data access credential, perform data transmission from the data source to the data sink; and during the data transmission process, perform data fragmentation processing according to the type of the data source, and record the status information of the fragmentation processing.

[0034] The beneficial effects of the above technical solution are as follows:

[0035] In this technical solution, the application achieves decoupling of control logic and data transmission execution through the collaborative division of labor between the control plane and the data plane. This allows the control plane to focus on the policy management of contract constraints and the generation of transmission identifiers, while the data plane generates data access credentials with embedded policies based on the contract constraint information. Data transmission is only executed after the contract constraint information in the credentials is verified. This technically extends contract constraints from the negotiation stage to the transmission execution stage, avoiding the security risks of credential abuse or unauthorized access. At the same time, by adaptively fragmenting the transmitted data according to the data source type and recording the fragmentation status during data transmission, the incomplete fragments can be resumed from the breakpoint based on the recorded status information after transmission interruption, without having to retransmit all data from the beginning. This significantly improves the reliability and efficiency of large-scale data transmission. Attached Figure Description

[0036] One or more embodiments are illustrated by way of example with reference numerals in the accompanying drawings. These illustrations do not constitute a limitation on the embodiments. Elements with the same reference numerals in the drawings are denoted as similar elements. Unless otherwise stated, the figures in the drawings are not to be limited by scale.

[0037] Figure 1 This is a flowchart of an embodiment of the contract-constrained data transmission method driven by dual-plane data space collaboration as described in this application.

[0038] Figure 2 This is a flowchart illustrating another embodiment of the contract-constrained data transmission method driven by dual-plane collaborative data space described in this application.

[0039] Figure 3 This is an exemplary structural diagram of the electronic device of this application. Detailed Implementation

[0040] The advantages of this application are further illustrated below with reference to the accompanying drawings and specific embodiments.

[0041] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.

[0042] The terminology used in this application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The singular forms “a,” “the,” and “the” used in this application and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used herein refers to and includes any or all possible combinations of one or more of the associated listed items.

[0043] It should be understood that although the terms first, second, third, etc., may be used in this application to describe various information, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from one another. For example, without departing from the scope of this application, first information may also be referred to as second information, and similarly, second information may also be referred to as first information. Depending on the context, the word "if" as used herein may be interpreted as "when," "when," or "in response to determination."

[0044] In the description of this application, it should be understood that the numerical labels before the steps do not indicate the order of the steps, but are only used to facilitate the description of this application and to distinguish each step, and therefore should not be construed as a limitation of this application.

[0045] The following terms are used in this application:

[0046] DSP (Dataspace Protocol): A specification developed by the International Dataspace Association that defines three types of interaction protocols between connectors: directory discovery, contract negotiation, and transport procedures.

[0047] Data Flow: The entity in the data plane that corresponds to an actual transmission execution.

[0048] EDR (Endpoint Data Reference): A structure containing the data access endpoint address and access token, which is passed by the provider to the consumer to retrieve data.

[0049] UUID (Universally Unique Identifier): An identifier used to uniquely identify entities in a transmission process and data stream.

[0050] JWT (JSON Web Token): A signed token carrying a contract constraint statement, used for access control in the data plane.

[0051] Pull mode: A data transmission scenario in which the data consumer actively requests data from the data provider's data plane.

[0052] Push mode: A data transmission scenario in which the data provider actively pushes data to the data consumer.

[0053] Semaphores: A concurrency control mechanism used to control the upper limit of the number of concurrent fragments.

[0054] The data space dual-plane collaborative driven contract-constrained data transmission method provided in this application embodiment can be applied to a data space connector, which is deployed on the server of the data provider and / or data requester as a software platform for end-to-end data transmission. The system includes two independently deployed service components: a control plane and a data plane, which work collaboratively through a standardized signaling interface. The control plane is responsible for control logic such as contract negotiation and transmission process state management; the data plane is responsible for the actual data transmission execution and supports multiple transmission channels. At the data provider end, the control plane and data plane jointly complete the entire process from receiving a data transmission request to executing the data transmission.

[0055] This application provides a contract-constrained data transmission method driven by dual-plane collaborative processing in data space, such as... Figure 1 As shown, it includes the following steps:

[0056] S1. In response to a data transmission request, the control plane generates a transmission identifier and sends an execution instruction carrying the transmission identifier and contract constraint information to the data plane;

[0057] S2. The data plane generates a data access credential containing the contract constraint information based on the execution instruction;

[0058] S3. Upon receiving an access request carrying the data access credential, the data plane, after verifying the contract constraint information in the data access credential, executes data transmission from the data source to the data sink;

[0059] During the data transmission process, the data plane segments the transmitted data according to the type of the data source and records the status information of the segmentation process. The control plane is a service component responsible for control logic such as contract negotiation and transmission process status management. The data plane is a service component responsible for the actual data transmission execution and supports multiple transmission channels. The transmission process is an entity in the control plane that manages the entire lifecycle of a data transmission, and it has a unique identifier and a state machine.

[0060] In this embodiment, when a data transmission request is triggered, the control plane first generates a globally unique transmission identifier to identify the current transmission process. This transmission identifier can be a globally unique identifier (UUID). The control plane then encapsulates this transmission identifier along with contract constraint information extracted from the data usage contract (such as contract protocol identifier, data asset identifier, and participant identifier) ​​into an execution instruction. This execution instruction is a standardized initiation signaling message. Its message body includes a process identifier, source data address (including data source type and connection parameters), target data address, contract protocol identifier, asset identifier, participant identifier, transmission type, and callback address, and sends it to the data plane. Upon receiving the execution instruction, the data plane generates a data access credential based on the contract constraint information. Specifically, the data plane authorization service generates an endpoint data reference (EDR). This EDR contains a data access endpoint address and an access token. The data access credential embeds the aforementioned contract constraint information, for example, by writing the contract protocol identifier, data asset identifier, and participant identifier into the access token's declaration. When the requesting party sends a data access request to the data plane with the data access credential, the data plane extracts the credential from the request and verifies the contract constraint information in the credential. Only when the contract constraint information in the credential matches the context information of this access request (such as the requested data asset, the identity of the requesting party, and the associated contract) is the verification considered successful, and then the data transmission execution process from the data source to the data sink is initiated.

[0061] During data transmission, the data plane automatically matches the appropriate sharding strategy based on the data source type: if the data source is a database, sharding based on data offset is used, calculating the number of shards according to the preset number of rows per shard, and generating sharding parameters for each shard that include the starting offset and data limit; if the data source is a file, sharding based on file size is used, splitting files exceeding a preset threshold by byte range; if the data source is a time series, sharding based on time interval is used, generating continuous time interval shards according to the start time and time interval. The sharding strategy can be automatically matched by the sharding transmission service based on the source data address type, or it can be explicitly specified through the sharding type in the source data address attribute. Each shard contains fields such as shard identifier, data stream identifier, shard sequence number, shard type, shard parameters, and status. The execution status of each shard is persistently recorded, so that if an interruption occurs during transmission, completed shards can be skipped during recovery based on the recorded status information, and only incomplete shards can be processed, without retransmitting all data from the beginning of the data source. Meanwhile, during fragmented transmission, a semaphore mechanism is used to control the maximum number of concurrent fragments allowed to execute simultaneously. A semaphore is requested before each fragment execution and released upon completion to prevent excessive concurrent fragments from exhausting system resources. Each fragment failure is automatically retried, with a configurable maximum number of retries. After exceeding the maximum number of retries, the status is updated to "failed" and error information is recorded. Thus, this method, through the coordinated operation of the control plane and data plane, extends contract constraints from the strategy negotiation phase to the data transmission execution phase, achieving technically enforceable control over data access behavior. Furthermore, through adaptive fragmented transmission and state persistence mechanisms, it significantly improves the reliability and efficiency of large-scale data transmission.

[0062] In an optional embodiment, it further includes:

[0063] The data plane creates a data transmission entity for the data transmission and uses the transmission identifier as the identifier of the data transmission entity.

[0064] In this embodiment, when the control plane sends an execution instruction carrying a transmission identifier to the data plane, the data plane, upon receiving the instruction, creates a corresponding data transmission entity for this data transmission and directly uses the transmission identifier carried in the instruction as the identifier for this data transmission entity for storage and retrieval. This data transmission entity is the data flow entity, corresponding to an actual transmission execution in the data plane. Therefore, the transmission identifier used by the control plane to identify the transmission process and the identifier used by the data plane to identify the data transmission entity are the same identifier, eliminating the need for the control plane and data plane to maintain an additional mapping table between transmission process identifiers and data flow identifiers. During cross-plane association queries, the control plane or data plane can directly locate the corresponding transmission process entity or data transmission entity in constant time complexity using this shared identifier. The query time does not increase with the number of transmission tasks in the system, effectively reducing the storage and computational overhead caused by maintaining cross-plane mapping relationships, and fundamentally avoiding state tracking deviations caused by inconsistent mapping relationships or update delays.

[0065] In an alternative embodiment, such as Figure 2 As shown, the contract-constrained data transmission method driven by dual-plane data space collaboration may further include the following steps:

[0066] S4. In response to the completion or failure of the data transmission, the data plane sends a status notification carrying the identifier of the data transmission entity to the control plane;

[0067] S5. The control plane updates the status of the corresponding transmission process based on the status notification.

[0068] In this embodiment, when the data plane completes data transmission from the data source to the data sink, or when an anomaly occurs during transmission causing transmission failure, the data plane proactively sends a status notification to the control plane. Specifically, it sends a completion notification or failure notification to the callback address of the control plane through the transmission process API client. This status notification carries the aforementioned data transmission entity identifier, identified by the transmission identifier. Upon receiving the status notification, the control plane directly locates the corresponding transmission process entity based on the data transmission entity identifier carried in the notification. Without performing any intermediate mapping query operations, it can update the status of the transmission process according to the status type in the notification, for example, advancing the transmission process from the in-transmission state to the completed or terminated state, and triggering the resource release process after resource cleanup is complete. Thus, the control plane can perceive the actual transmission execution result of the data plane in real time, realizing end-to-end closed-loop status management between the control plane and the data plane. This effectively avoids the problem of inconsistency between the control plane status and the actual data plane status due to status synchronization delays or mapping errors, ensuring the accuracy and traceability of status tracking throughout the entire data transmission process.

[0069] In an optional embodiment, the contract constraint information includes at least one of the following: contract identifier, data asset identifier, and participant identifier;

[0070] Verifying the contract constraint information in the data access credential includes verifying whether the contract constraint information is consistent with the context information of the access request.

[0071] In this embodiment, after receiving the execution instruction from the control plane, the data plane authorization service generates an endpoint data reference, which includes an access token containing contract constraint information extracted from the execution instruction, such as contract identifier, data asset identifier, and participant identifier. Specifically, the access token issuance service generates an access token (e.g., in JWT format). The token declaration embeds information such as contract protocol identifier, asset identifier, transmission process identifier, flow type, participant identifier (requesting end), issuer (provider), audience (requesting end), issuance time, and unique identifier. The access token is used for access control in the data plane. When the requesting end sends a data access request to the data plane of the provider end with this access token, the data plane proxy service extracts the access token from the request authorization header, parses the contract constraint information embedded in the token, and verifies the consistency of the contract constraint information with the context information of the current access request. The context information includes the contract protocol associated with the request, the data asset being accessed, and the participant identity of the requesting end. The verification is only successful if the contract identifier in the token matches the current contract agreement, the data asset identifier matches the requested data asset, and the participant identifier matches the requester's identity. Then, the contract agreement identifier, asset identifier, and process identifier are extracted from the token data to construct a data flow initiation message, allowing subsequent data transmission operations to proceed via the data pipeline service. Thus, contractual constraint information is technically embedded from the control plane's policy negotiation phase into the data plane's access credentials, and is forcibly verified with each data access request. This achieves end-to-end enforcement of contractual constraints during the data transmission execution phase, effectively preventing the access token from being abused by non-contract parties or from unauthorized access to unauthorized data assets, ensuring that data access behavior is strictly consistent with the signed contract terms.

[0072] In an optional embodiment, the control plane sends execution instructions to the data plane, including:

[0073] The control plane determines the target data plane from multiple candidate data planes based on the transmission type and data source type associated with the data transmission request;

[0074] The execution command is sent to the target data plane.

[0075] In this embodiment, before sending execution instructions to the data plane, the control plane first determines the target data plane from a set of pre-registered candidate data plane instances based on the transmission type and data source type associated with the current data transmission request. Specifically, the data plane selection service within the control plane maintains registration information for each candidate data plane, including the transmission types supported by each data plane (e.g., pull mode or push mode) and the data source address types it can handle (e.g., database type, file storage type, or object storage type). The transmission type can be defined using the format "target type-flow direction". When a data transmission request is triggered, the control plane uses the transmission type and data source address type as matching conditions to query and match within the set of registered candidate data plane instances, selecting a data plane instance that supports the transmission type and data source address type as the target data plane, and then sending the execution instructions carrying transmission identifiers and contract constraint information to the target data plane. In this way, the control plane can dynamically allocate execution instructions to data plane instances with corresponding processing capabilities based on the characteristics of the actual transmission task. This allows the data plane resources to be scheduled and utilized on demand when the system faces multiple types of data sources and diverse transmission scenarios. It avoids the problem of limited processing capacity or idle resources caused by fixed binding to a single data plane, thereby improving the flexibility and scalability of the entire data transmission system in a multi-instance deployment environment.

[0076] In an optional embodiment, the fragmentation of the transmitted data according to the type of data source includes at least one of the following:

[0077] When the data source is a database, sharding is performed based on data offset.

[0078] When the data source is a file, file fragmentation is performed based on file size.

[0079] When the data source is a time series type, it is sharded using a time interval-based method.

[0080] In this embodiment, when the data plane performs data transmission from the data source to the data sink, it automatically matches the corresponding sharding strategy according to the data source type indicated by the source data address to shard the transmitted data. Specifically, when the data source is a database, sharding is performed based on data offset. The sharding transmission service performs a total row count query on the target data table without providing the total number of rows, calculates the total number of shards according to the preset maximum number of rows per shard, and the number of shards is the total number of rows divided by the number of rows per shard and rounded up. A sharding parameter containing the starting offset and data limit is generated for each shard. When the data source instance performs this sharding, it converts the sharding parameter into pagination conditions for the database query, thereby enabling the database data to be read in segments by offset. When the data source is a file, sharding is performed based on file size. The sharding transmission service traverses the source data... Based on the storage path specified by the address, files exceeding a preset byte count threshold are split into segments by byte range. Each segment generates segmentation parameters including file path, byte start offset, and byte length. Files smaller than the threshold are each assigned a separate segment. When the data source is a time series type, segmentation is performed based on time intervals. The segmentation transmission service obtains the time column name, start timestamp (millisecond timestamp), end timestamp, and time interval parameters from the source data address. Within the start and end time range, continuous time intervals are generated by time intervals. Each time interval corresponds to a segment, and the segmentation parameters include the time column name and the start and end timestamps of that time interval.

[0081] Through the aforementioned sharding processing method, the data plane can automatically adapt the optimal sharding strategy to the structural characteristics of different data sources, achieving unified sharding transmission of heterogeneous data sources without manual intervention. Simultaneously, the execution status of each shard is persistently recorded. When an interruption occurs and is resumed during transmission, the data plane can identify completed and incomplete shards based on the recorded sharding processing status information, continuing transmission processing only for incomplete shards, without needing to retransmit all data from the beginning of the data source. Therefore, this method effectively avoids the waste of network bandwidth and computing resources caused by retransmission due to transmission interruptions, significantly improving transmission efficiency and system robustness in large-scale data transmission scenarios.

[0082] Furthermore, the sharding strategy can include three types: database offset sharding, file size sharding, and time range sharding. Within the same sharding transmission framework, other data source types can be supported by implementing new sharding strategy interfaces, such as message queue offset sharding and object storage key-value range sharding, without modifying the core logic of the sharding transmission service. Additionally, the standardized signaling interface of this application is implemented based on the HTTP protocol. Under the same signaling-driven architecture, the signaling transmission protocol can be replaced with asynchronous message mechanisms such as message queues (e.g., Kafka, RabbitMQ) to adapt to deployment scenarios with higher requirements for signaling reliability and decoupling, without affecting the signaling message structure and state machine logic.

[0083] In an optional embodiment, the recording of the status information for the fragmentation process includes:

[0084] The fragmentation identifier and processing status are associated with the transmission identifier and stored accordingly;

[0085] In response to a data transmission interruption and subsequent recovery, the unfinished fragments are processed again based on the recorded status information.

[0086] In this embodiment, during the fragmented transmission process, the data plane generates a unique fragment identifier for each fragment divided by the fragmentation strategy. This fragment identifier, the fragment's current transmission processing status (e.g., pending, processing, completed, or failed), and the transmission identifier of this data transmission are associated and stored persistently in the fragmented status database table. When data transmission is interrupted due to network fluctuations, service restarts, or other abnormal reasons and subsequently resumes, the data plane first queries the fragmented status storage for the recorded fragment list and the corresponding processing status of each fragment based on the transmission identifier. For fragments with a processing status of "completed," the data plane skips them directly and does not repeat the transmission. For fragments with processing statuses of "pending," "processing," or "failed," the data plane adds them to the execution queue and continues data transmission processing from the starting position defined by their respective fragmentation parameters. Therefore, this method achieves fine-grained breakpoint resumption capability for data transmission. After the transmission interruption is recovered, only the fragmented parts that have not yet been successfully completed need to be processed, without having to retransmit all the data from the starting position of the data source. This effectively reduces the amount of duplicate data transmission caused by transmission interruption, saves network bandwidth and computing resources, and significantly improves the transmission efficiency and overall reliability of large-scale data in complex network environments.

[0087] In an optional embodiment, the execution data transmission includes:

[0088] The data from the data source is transmitted in real time to the response channel corresponding to the access request using a streaming transmission method.

[0089] In this embodiment, when the data plane performs data transmission from the data source to the data sink, it uses a streaming transmission method to deliver data from the data source to the response channel corresponding to the access request in real time. Specifically, in the proxy request scenario of pull mode, when the requesting end sends a data access request to the providing end data plane with data access credentials and the credentials are verified, the pipeline service of the data plane matches the corresponding data source instance according to the source data address type, and at the same time matches the corresponding data sink instance according to the target data address type. The matched data sink instance is an asynchronous streaming data sink. After receiving the transmission instruction from the data pipeline service, the asynchronous streaming data sink pulls the data stream from the data source instance and writes the pulled data stream into the HTTP response stream in real time through the pipeline input stream. The data is delivered to the requesting end block by block while being read from the data source, without waiting for all the data to be read before responding.

[0090] By adopting the aforementioned streaming transmission method, the data plane does not need to cache the complete transmission data in memory or local storage when processing large datasets. It only needs to maintain a data buffer of a limited size to complete the data stream forwarding from the data source to the response channel, significantly reducing the memory resource consumption during data transmission. At the same time, since the data is delivered in streaming chunks, the requesting end can receive the first batch of data in a short time after the data reading begins, reducing end-to-end response waiting time and improving transmission efficiency and user experience in large-scale data retrieval scenarios.

[0091] In an optional embodiment, the execution data transmission includes:

[0092] Match data source instances based on the type of the data source, and match data sink instances based on the type of the data sink;

[0093] The data transfer is performed using the matched data source instance and data sink instance.

[0094] In this embodiment, when the data plane performs data transmission from the data source to the data sink, it uses an asynchronous streaming transmission method to deliver data from the data source to the response channel corresponding to the access request in real time. Specifically, the data source factory and the data sink factory are registered with the pipeline service when the system starts, and each factory declares the data types it supports (such as HTTP data, database data source, object storage data source, etc.). When the requesting end sends a data access request to the data plane of the providing end with data access credentials and the credentials are verified, the pipeline service of the data plane accurately matches the corresponding data source factory according to the source data address type and creates the corresponding data source instance. At the same time, it accurately matches the corresponding data sink factory according to the target data address type and creates the corresponding data sink instance. In the proxy request scenario of pull mode, the matched data sink instance is an asynchronous streaming data sink. After receiving the transmission instruction from the data pipeline service, the asynchronous streaming data sink calls the data sink's transmission method. The data sink pulls the data stream from the data source instance and writes the pulled data stream into the HTTP response stream in real time through the pipeline input stream. The data is delivered to the requesting end block by block while being read from the data source, without waiting for all the data to be read before responding and returning the asynchronous transmission result.

[0095] By adopting the aforementioned streaming transmission method, the data plane does not need to cache the complete transmission data in memory or local storage when processing large datasets. It only needs to maintain a data buffer of a limited size to complete the data stream forwarding from the data source to the response channel, significantly reducing the memory resource consumption during data transmission. At the same time, since the data is delivered in streaming chunks, the requesting end can receive the first batch of data in a short time after the data reading begins, reducing end-to-end response waiting time and improving transmission efficiency and user experience in large-scale data retrieval scenarios.

[0096] In an optional embodiment, it further includes:

[0097] The control plane performs state management on the transmission process, and the state includes at least one of the following: initial state, ready state, ready state, transmission state, paused state, resumed state, completed state, terminated state, and released state.

[0098] In this embodiment, the control plane is equipped with a transmission process state machine management module, which is used to manage the state of the entire lifecycle of each data transmission process. The control plane uses a complete state machine to manage the entire lifecycle of the transmission process, which includes twenty-three states: Initial → Configuration Waiting → Resource Preparation → Resource Preparation Request → Resource Prepared → Requesting → Requested → Starting → Started → Pausing → Pausing Request → Paused → Resuming → Resuming → Completing → Completion Request → Completed → Termination → Termination Request → Terminated → Resource Release → Resource Release Request → Resource Released. Specifically, after the control plane responds to a data transmission request and generates a transmission identifier, the transmission process entity enters the initial state. During the contract negotiation and resource preparation phases, the state sequentially transitions through the ready and prepared states. When the control plane sends an execution command to the data plane, the transmission process enters the transmission state. If a pause command is received or an exception occurs during transmission, the state machine can drive the transmission process into the paused state, and return to the transmission state via the recovery state after the recovery conditions are met. When the data plane callback notifies that transmission is complete, the state machine drives the transmission process to the completed state. If an unrecoverable error occurs or a termination command is received during transmission, the state machine drives the transmission process into the terminated state, and finally transitions to the release state after resource cleanup. The state machine manager of the control plane adopts an asynchronous polling mechanism, periodically scanning the transmission process entities in each intermediate state, executing the processing logic corresponding to the current state in batches, updating the state after processing, and sending protocol messages corresponding to the state transitions to the peer connector, such as transmission request messages, transmission start messages, transmission complete messages, transmission pause messages, or transmission termination messages. Through the aforementioned state management approach, the control plane can perform refined and automated tracking and driving of the entire lifecycle of data transmission. The transition boundaries between states are clear and traceable, ensuring the consistency and reliability of process control in complex data transmission scenarios. At the same time, it provides a structured state foundation for auditing, monitoring, and fault recovery of the transmission process in the data space.

[0099] To facilitate understanding of the complete application scenario of the technical solution of this application, the following section provides an overall description of the contract-constrained data transmission method driven by dual-plane collaboration in the data space, in conjunction with the end-to-end interaction process between the data provider and the data consumer:

[0100] I. Parameter Configuration

[0101] Before the process is executed, the system can be configured with the following transmission parameters: the maximum value of the parameter value is 100, and the minimum value is 0; the minimum value of each node or status point (1 to 94) in the system is set to 0. The above parameters can be preset in the system configuration file and dynamically adjusted through the management interface to control transmission behaviors such as fragment size, concurrency, and retries.

[0102] II. Contract Negotiation Stage

[0103] Step 1: Contract Signing: The control planes of the data provider and the data requester interact through the Data Space Protocol (DSP) to reach an agreement on data usage control strategies (such as usage environment, purpose, frequency limits, validity period, etc.), thus completing the signing of the data usage contract. This stage is part of the existing standard process.

[0104] Step 2: Resource preparation: After the contract is signed, the control plane of the provider drives the transmission process state machine in sequence through the initial state, configuration waiting state, resource preparation state, resource preparation request state, and finally enters the resource prepared state, indicating that the transmission resources are ready.

[0105] III. Transmission Execution Phase

[0106] Step 3: Generate Transmission Identifier: The control plane of the providing end responds to the data transmission request and generates a transmission identifier (UUID) to uniquely identify this transmission process globally.

[0107] Step 4: Dynamically select the data plane: The data plane selection service of the control plane at the providing end selects the target data plane instance from multiple registered candidate data plane instances based on the transmission type (such as pull mode) and the source data address type (such as database type, file type).

[0108] Step 5: Send Start Signaling: The control plane of the provider sends a standardized start signaling to the selected target data plane. The signaling message body carries the process identifier (i.e., the transmission identifier UUID), the source data address (including the data source type and connection parameters), the target data address, the contract protocol identifier, the asset identifier, the participant identifier, the transmission type, and the callback address.

[0109] Step 6: Create a data flow entity: After receiving the start signaling, the data plane of the providing end creates a data flow entity and uses the transmission identifier carried in the signaling as the unique identifier of the data flow entity to realize identifier sharing between the control plane and the data plane.

[0110] Step 7: Generate Data Access Credentials: The authorization service of the data plane at the provider end generates an Endpoint Data Reference (EDR). Specifically, the public endpoint generation service generates a data access endpoint address based on the transmission type; the access token issuance service generates an access token (JWT format), embedding information such as contract protocol identifier, asset identifier, transmission process identifier, flow type, participant identifier, issuer, audience, and issuance time in the token statement; finally, the endpoint address and access token are packaged into an EDR.

[0111] Step 8: Transmit Credentials: The provider control plane transmits the EDR to the requesting control plane via a transmission initiation protocol message, and the requesting control plane then transmits it to the requesting data plane.

[0112] Step 9: Initiate a data access request: The requesting data plane carries the access token in the EDR and initiates a data access request to the proxy endpoint of the providing data plane.

[0113] Step 10: Verify Access Credentials: The proxy service of the provider's data plane extracts the access token from the request authorization header, calls the access token parsing service to verify the token's validity, and calls the access control service to verify the consistency of the contract constraint information in the token declaration with the request context. The verification includes: whether the contract identifier in the token matches the current contract protocol, whether the data asset identifier in the token matches the data asset requested for access, and whether the participant identifier in the token matches the identity of the requesting party.

[0114] Step 11: Execute Data Transmission: After successful verification, the pipeline service of the end data plane executes data transmission from the data source to the data sink. The pipeline service matches the data source factory and creates a data source instance based on the source data address type, and matches the data sink factory and creates a data sink instance based on the target data address type. For pull mode, the data sink adopts an asynchronous streaming data sink, writing the data source output to the HTTP response stream in real time through the pipeline input stream. In push mode, the data source instance responds to the start signal sent by the data plane, actively establishes a data connection with the data sink instance, and pushes the data to be transmitted in fragments to the data sink instance based on a preset fragmentation strategy.

[0115] Step 12: Adaptive Fragmented Transmission: During data transmission, the fragmented transmission service automatically matches a fragmentation strategy based on the data source type. When the data source is a database, a fragmentation method based on data offset is used, calculating the number of fragments based on the maximum number of rows per fragment. Each fragment includes a starting offset and a data limit. When the data source is a file, a fragmentation method based on file size is used, splitting files exceeding the threshold by byte range. Each fragment includes the file path, byte starting offset, and byte length. When the data source is a time series, a fragmentation method based on time interval is used, generating continuous time-segment fragments based on the start time and time interval.

[0116] Step 13: Fragment Status Recording and Resume Transmission: The execution status of each fragment (including fragment identifier, data stream identifier, fragment sequence number, fragment type, fragment parameters, status, etc.) is persistently stored. If transmission is interrupted and then resumes, the system skips completed fragments based on the recorded status information and continues transmission only for incomplete fragments.

[0117] Step 14: Concurrency Control and Retry: During fragmented transmission, the maximum number of concurrent fragments allowed to execute simultaneously is controlled through a semaphore mechanism. Each fragment automatically retryes upon failure, with a configurable maximum number of retries. Once the maximum number of retries is exceeded, the fragment's status is marked as failed.

[0118] Step 15: Status Callback: After a transmission is completed or fails, the data plane sends a status notification to the control plane via a callback address. The notification carries the data stream identifier (i.e., the transmission identifier) ​​and error details (if any).

[0119] Step 16: State Update: After receiving the state notification, the control plane uses the identifier sharing mechanism to directly locate the corresponding transmission process entity by the data stream identifier and advances the state machine according to the notification type. Upon receiving a completion notification, it advances to the "Completing" state, eventually transitioning to the "Completed" state and triggering the resource release process; upon receiving a failure notification, it advances to the "Terminating" state and executes the abnormal termination process.

[0120] Step 17: Resource Release: After the transmission process is completed, the state machine sequentially goes through the resource release in progress state, the resource release request state, and finally reaches the resource released state, completing the full lifecycle management of this transmission.

[0121] This application also provides an implementation of an internal transmission fast path, which is applicable to data flow scenarios within the same organization that do not require cross-organizational contract negotiation. Under this fast path, the core mechanisms such as data plane service selection, initiation signaling generation, and fragmented transmission are consistent with the standard process, bypassing the complete flow of the contract negotiation state machine and directly initiating data transmission through the internal transmission interface. It is also applicable to internal data integration scenarios, improving the processing efficiency of internal data flow.

[0122] This application provides a data transmission system, including a control plane and a data plane:

[0123] The control plane is configured to generate a transmission identifier in response to a data transmission request, and send an execution instruction carrying the transmission identifier and contract constraint information to the data plane.

[0124] The data plane is configured to generate a data access credential containing the contract constraint information based on the execution instruction; in response to receiving an access request carrying the data access credential, after verifying the contract constraint information in the data access credential, perform data transmission from the data source to the data sink; and during the data transmission process, perform data fragmentation processing according to the type of the data source, and record the status information of the fragmentation processing.

[0125] In this embodiment, the control plane and data plane are two independently deployed service components that work collaboratively through a standardized signaling interface. The control plane specifically includes a transmission process management module, a data plane selection service module, and a signaling-driven flow controller; the data plane specifically includes a data plane authorization service module, a data plane proxy service module, an access control service module, a data pipeline service module, and a fragmented transmission service module. When a data transmission request is triggered, the control plane first generates a globally unique transmission identifier to identify this transmission process. This transmission identifier, along with contract constraint information extracted from the data usage contract (such as contract protocol identifier, data asset identifier, and participant identifier), is encapsulated into an execution instruction and sent to the data plane. Upon receiving the execution instruction, the data plane authorization service generates a data access credential based on the contract constraint information in the execution instruction. This data access credential embeds the aforementioned contract constraint information, for example, by writing the contract protocol identifier, data asset identifier, and participant identifier into the access token declaration. When the requesting party sends a data access request to the data plane with the data access credential, the data plane's proxy service extracts the credential from the request, and the access control service verifies the contract constraint information in the credential. Only when the contract constraint information in the credential matches the context information of this access request (such as the requested data asset, the requesting party's identity, and associated contracts) is the verification considered successful, and then the data pipeline service initiates the data transmission execution process from the data source to the data sink.

[0126] During data transmission, the data plane's fragmented transmission service automatically matches the appropriate fragmentation strategy based on the data source type: if the data source is a database, a data offset-based fragmentation method is used, calculating the number of fragments according to the preset number of rows per fragment, and generating fragmentation parameters for each fragment that include the starting offset and data limit; if the data source is a file, a file size-based fragmentation method is used, splitting files exceeding a preset threshold by byte range; if the data source is a time series, a time interval-based fragmentation method is used, generating continuous time interval fragments according to the start time and time interval. The execution status of each fragment (including fragment identifier, transmission identifier, fragment sequence number, and processing status) is persistently recorded in the fragmented database table, so that if an interruption occurs during transmission, completed fragments can be skipped during recovery based on the recorded status information, and only incomplete fragments can be processed, without having to retransmit all data from the starting position of the data source. Through the collaborative operation of the control plane and data plane, this system technically extends contract constraints from the strategy negotiation stage to the data transmission execution stage, realizing end-to-end mandatory control over data access behavior. At the same time, through adaptive fragmented transmission and state persistence mechanisms, it significantly improves the reliability and processing efficiency of large-scale data transmission.

[0127] It is not difficult to see that this embodiment is a system embodiment corresponding to the data space dual-plane collaborative driving contract constraint data transmission method. This embodiment can be implemented in conjunction with the data space dual-plane collaborative driving contract constraint data transmission method. The relevant technical details mentioned in the data space dual-plane collaborative driving contract constraint data transmission method are still valid in this embodiment, and will not be repeated here to reduce repetition. Accordingly, the relevant technical details mentioned in this embodiment can also be applied to the data space dual-plane collaborative driving contract constraint data transmission method.

[0128] It is worth mentioning that all modules involved in this embodiment are logical modules. In practical applications, a logical unit can be a physical unit, a part of a physical unit, or a combination of multiple physical units. Furthermore, to highlight the innovative aspects of this application, this embodiment does not introduce units that are not closely related to solving the technical problems proposed in this application; however, this does not mean that other units are absent in this embodiment.

[0129] Furthermore, some embodiments of this application also provide an electronic device. The electronic device can be various forms of digital computer, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, etc. The electronic device can also be various forms of mobile devices, such as cellular phones, smartphones, wearable devices, and other similar computing devices.

[0130] The electronic device includes: one or more processors; and a memory storing computer program instructions that, when executed, cause the processor to perform the steps of the methods provided in any one or more of the above embodiments. Figure 3 An exemplary structural diagram of the electronic device is disclosed. The electronic device includes one or more processors 1101, a memory 1102, and interfaces for connecting the components, including high-speed interfaces and low-speed interfaces. The components are interconnected via different buses and can be mounted on a common motherboard or otherwise installed as needed. The processors can process instructions executed within the electronic device, including instructions stored in or on memory to display graphical information of a GUI on an external input / output device (such as a display device coupled to the interface). In some other embodiments, multiple processors and / or multiple buses can be used with multiple memories and multiple memory modules, if desired. Similarly, multiple electronic devices can be connected, each providing some of the necessary operations. The components, their connections and relationships, and their functions shown herein are merely examples and are not intended to limit the implementation of the present application described and / or claimed herein.

[0131] The electronic device may further include an input device 1103 and an output device 1104. The processor 1101, memory 1102, input device 1103 and output device 1104 may be connected by a bus or other means, as shown in the figure, which is connected by a bus.

[0132] Input device 1103 can receive input numerical or character information, and generate key signal inputs related to user settings and function control of the electronic device, such as a touch screen, keypad, mouse, trackpad, touchpad, joystick, one or more mouse buttons, trackball, joystick, etc. Output device 1104 may include a display device, auxiliary lighting device (e.g., LED), and haptic feedback device (e.g., vibration motor). The display device may include, but is not limited to, a liquid crystal display, a light-emitting diode display, and a plasma display. In some embodiments, the display device may be a touch screen.

[0133] To provide interaction with the user, the electronic device can be a computer. The computer has: a display device (e.g., a cathode ray tube or LCD monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse) through which the user provides input to the computer. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback); and input from the user can be received in any form (e.g., voice input or tactile input).

[0134] In this embodiment, a computer-readable medium stores a computer program / instructions that, when executed by a processor, implement the steps of the methods provided in any one or more of the above embodiments. This computer-readable medium may be included in the electronic device described in the above embodiments; or it may exist independently and not assembled into that device. The aforementioned computer-readable medium carries one or more computer-readable instructions.

[0135] The memory 1102 can serve as a non-transitory computer-readable storage medium, used to store non-transitory software programs, non-transitory computer-executable programs, and modules. The processor 1101 executes various functional applications and data processing of the server by running the non-transitory software programs, instructions, and modules stored in the memory 1102, thereby implementing the program instructions / modules corresponding to the methods provided in any one or more of the embodiments described above in this application.

[0136] The memory 1102 may include a program storage area and a data storage area. The program storage area may store the operating system and applications required for at least one function; the data storage area may store data created based on the use of the electronic device. Furthermore, the memory 1102 may include high-speed random access memory and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, the memory 1102 may optionally include memory remotely located relative to the processor 1101, and these remote memories can be connected to the electronic device via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0137] It should be noted that the computer-readable medium described in this application can be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. Computer-readable media can be, for example, but not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatuses, or devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to, electrical connections having one or more wires, portable computer disks, hard disks, random access memory, read-only memory, erasable programmable read-only memory, optical fibers, portable compact disk read-only memory, optical storage devices, magnetic storage devices, or any suitable combination thereof. In this application, a computer-readable medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0138] Computer-readable media include permanent and non-permanent, removable and non-removable media, which can store information by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory, static random access memory, dynamic random access memory, other types of random access memory, read-only memory, electrically erasable programmable read-only memory, flash memory or other memory technologies, read-only optical discs, digital versatile optical discs or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0139] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including local area networks (LANs) or wide area networks (WANs), or it can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0140] In the above embodiments, all or part of the implementation can be achieved through software, hardware, firmware, or any combination thereof. For example, it can be implemented using an application-specific integrated circuit (ASIC), a general-purpose computer, or any other similar hardware device. In some embodiments, the software program of this application can be executed by a processor to implement the above steps or functions. Similarly, the software program of this application (including related data structures) can be stored in a computer-readable recording medium, such as RAM memory, magnetic or optical drives, floppy disks, and similar devices. In addition, some steps or functions of this application can be implemented in hardware, for example, as circuitry that cooperates with a processor to perform the various steps or functions.

[0141] The computer program product provided in this application includes one or more computer programs / instructions. When executed by a processor, these computer programs / instructions generate, in whole or in part, the processes or functions described in this application. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid-state drive), etc.

[0142] The flowcharts or block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of devices, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, may be implemented using a dedicated hardware-specific system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0143] The scope of this application is defined by the appended claims rather than the foregoing description, and is therefore intended to encompass all variations falling within the meaning and scope of equivalents of the claims. No reference numerals in the claims should be construed as limiting the scope of the claims. Furthermore, it is clear that the word "comprising" does not exclude other units or steps, and the singular does not exclude the plural. Multiple units or devices recited in a device claim may also be implemented by a single unit or device in software or hardware. Terms such as "first," "second," etc., are used only for distinguishing descriptions and do not indicate any particular order, nor should they be construed as indicating or implying relative importance.

[0144] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit them. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features therein. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of this application.

Claims

1. A contract-constrained data transmission method driven by dual-plane data space collaboration, characterized in that, include: In response to a data transmission request, the control plane generates a transmission identifier and sends an execution instruction carrying the transmission identifier and contract constraint information to the data plane. The data plane generates a data access credential containing the contract constraint information based on the execution instruction; In response to receiving an access request carrying the data access credential, the data plane performs data transmission from the data source to the data sink after verifying the contract constraint information in the data access credential. During the data transmission process, the data plane segments the transmitted data according to the type of the data source and records the status information of the segmentation process.

2. The data space dual-plane collaborative driving contract constraint data transmission method according to claim 1, characterized in that, Also includes: The data plane creates a data transmission entity for the data transmission and uses the transmission identifier as the identifier of the data transmission entity.

3. The data space dual-plane collaborative driving contract constraint data transmission method according to claim 2, characterized in that, Also includes: In response to the completion or failure of the data transmission, the data plane sends a status notification carrying the identifier of the data transmission entity to the control plane. The control plane updates the status of the corresponding transmission process based on the status notification.

4. The contract-constrained data transmission method driven by dual-plane collaborative data space according to claim 1, characterized in that, The contract constraint information includes at least one of the following: contract identifier, data asset identifier, and participant identifier; Verifying the contract constraint information in the data access credential includes verifying whether the contract constraint information is consistent with the context information of the access request.

5. The contract-constrained data transmission method driven by dual-plane collaborative data space according to claim 1, characterized in that, The control plane sends execution instructions to the data plane, including: The control plane determines the target data plane from multiple candidate data planes based on the transmission type and data source type associated with the data transmission request; The execution command is sent to the target data plane.

6. The contract-constrained data transmission method driven by dual-plane collaborative data space according to claim 1, characterized in that, The process of fragmenting transmitted data according to the type of data source includes at least one of the following: When the data source is a database, sharding is performed based on data offset. When the data source is a file, file fragmentation is performed based on file size. When the data source is a time series type, it is sharded using a time interval-based method.

7. The data space dual-plane collaborative driving contract constraint data transmission method according to claim 1 or 6, characterized in that, The status information of the record fragment processing includes: The fragmentation identifier and processing status are associated with the transmission identifier and stored accordingly; In response to a data transmission interruption and subsequent recovery, the unfinished fragments are processed again based on the recorded status information.

8. The data space dual-plane collaborative driving contract constraint data transmission method according to claim 1, characterized in that, The execution data transmission includes: The data from the data source is transmitted in real time to the response channel corresponding to the access request using a streaming transmission method.

9. The contract-constrained data transmission method driven by dual-plane collaborative data space according to claim 1, characterized in that, The execution data transmission includes: Match data source instances based on the type of the data source, and match data sink instances based on the type of the data sink; The data transfer is performed using the matched data source instance and data sink instance.

10. A data transmission system, characterized in that, Includes the control plane and the data plane: The control plane is configured to generate a transmission identifier in response to a data transmission request, and send an execution instruction carrying the transmission identifier and contract constraint information to the data plane. The data plane is configured to generate a data access credential containing the contract constraint information based on the execution instruction; in response to receiving an access request carrying the data access credential, after verifying the contract constraint information in the data access credential, perform data transmission from the data source to the data sink; and during the data transmission process, perform data fragmentation processing according to the type of the data source, and record the status information of the fragmentation processing.

Images