Process data update control method, device and equipment for construction terminal

CN122817239APending Publication Date: 2026-09-25TECHNOLOGY (CHENGDU) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611158833.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-07-31
Publication Date
2026-09-25

AI Technical Summary

Technical Problem

[0005]然而,实践中发现,当采用上述方式对工序数据更新控制时,经常会存在如下技术问题一:工序数据发生变化时,上述确定结果无法区分各施工终端设备各自所需的内容是否发生变化,使得接收该工序数据的各施工终端设备均被下发上述更新内容,其中,所需内容并未发生变化的施工终端设备,其本地已存储的内容在接收上述更新内容后并未改变,导致服务器与施工终端设备之间的数据传输量增加,网络传输资源浪费

Benefits of technology

[0013]本公开的上述各个实施例中具有如下有益效果:本公开的一些实施例的用于施工终端设备的工序数据更新控制方法可以减少服务器与施工终端设备之间的数据传输量,减少网络传输资源浪费,降低施工终端设备的运行功耗。具体来说,造成服务器与施工终端设备之间的数据传输量增加,网络传输资源浪费的原因在于:工序数据发生变化时,按工序数据的全部内容确定工序数据是否发生变化的确定结果无法区分各施工终端设备各自所需的内容是否发生变化,使得接收该工序数据的各施工终端设备均被下发上述更新内容,其中,所需内容并未发生变化的施工终端设备,其本地已存储的内容在接收上述更新内容后并未改变,导致服务器与施工终端设备之间的数据传输量增加,网络传输资源浪费。基于此,本公开的一些实施例的用于施工终端设备的工序数据更新控制方法可以首先,响应于接收到针对施工终端设备集的工序数据变更信息,获取已存储工序数据集和终端绑定关系信息。在这里,上述已存储工序数据集为后续的增量合并处理和双侧差异抽取处理提供数据基础,上述终端绑定关系信息为后续的关联匹配处理提供数据基础。其次,根据上述已存储工序数据集,对上述工序数据变更信息进行增量合并处理,得到变更后工序数据集。在这里,仅携带发生变更的字段的工序数据变更信息被还原为包括各个字段的完整内容,使得后续的转换处理可以在各条工序数据的完整内容上逐字段进行,减少了因工序数据变更信息不完整而将未发生变更的字段一并确定为发生变化的情况。再次,对上述变更后工序数据集进行转换处理,得到内容版本标识组集。在这里,各个字段的内容被转换为长度固定的内容版本标识,使得内容是否发生变化可以按字段逐一确定,而不必按工序数据的全部内容整体确定,且比对所需的数据量不随字段内容的长度增长而增长。接着,根据上述内容版本标识组集,对上述已存储工序数据集进行跨引用传播处理,得到目标节点信息集。在这里,内容变化沿引用关系向上的传导被逐层感知,使得自身内容并未发生变化而所引用的内容已经发生变化的节点也被纳入上述目标节点信息集,减少了应下发而未下发、进而只能以重新下发全部工序数据的方式纠正的情况。随后,根据上述目标节点信息集,对上述变更后工序数据集进行层级关联投影处理,得到工序数据单元集。在这里,各个节点所需的字段范围由该节点在上述层级结构中的位置逐节点推导得到,使得同一条工序数据针对不同的节点被拆分为内容不同的工序数据单元,为后续的双侧差异抽取处理提供了与各施工终端设备各自所需的内容相同的粒度。然后,根据上述已存储工序数据集和上述内容版本标识组集,对上述工序数据单元集进行双侧差异抽取处理,得到下发数据单元集和失效版本标识集。在这里,在工序数据单元的粒度上一次比对同时得到上述下发数据单元集和上述失效版本标识集,内容和位置均未发生变化的工序数据单元不进入上述两个集合,位置发生变化而内容并未发生变化的工序数据单元仅进入上述下发数据单元集且不携带字段内容。之后,根据上述失效版本标识集和上述目标节点信息集,对上述终端绑定关系信息进行关联匹配处理,得到目标施工终端设备集和失效缓存标识组集。在这里,上述失效版本标识集被收敛至各台目标施工终端设备各自的失效缓存标识组,使得清理的对象精确至单台施工终端设备的单个缓存条目,减少了向所需内容并未发生变化的施工终端设备下发指令的情况。最后,根据上述下发数据单元集和上述失效缓存标识组集,生成更新控制指令集,以及根据上述更新控制指令集,对上述目标施工终端设备集进行工序数据更新控制。在这里,仅所需内容发生变化的施工终端设备被下发其发生变化的内容并清理其失效的缓存条目,所需内容并未发生变化的施工终端设备不再接收更新内容,减少服务器与施工终端设备之间的数据传输量,减少网络传输资源浪费,减少施工终端设备本地存储的写入次数。由此可得,该用于施工终端设备的工序数据更新控制方法可以减少服务器与施工终端设备之间的数据传输量,减少网络传输资源浪费。

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122817239A_ABST
    Figure CN122817239A_ABST
Patent Text Reader

Abstract

Embodiments of the present disclosure disclose a process data update control method, device and equipment for construction terminal equipment. A specific embodiment of the method comprises: performing incremental merging processing on acquired process data change information to obtain a changed process data set; performing hierarchical hash processing on the changed process data set to obtain a content version identification group set; performing cross-reference propagation processing on an acquired stored process data set to obtain a target node information set; performing hierarchical correlation projection processing on the changed process data set to obtain a process data unit set; performing bilateral difference extraction processing on the process data unit set to obtain a delivery data unit set and an invalid version identification set; obtaining a target construction terminal equipment set and an invalid cache identification group set; and generating an update control instruction set to perform process data update control on the target construction terminal equipment set. The embodiment reduces the data transmission amount between the server and the construction terminal equipment and reduces the waste of network transmission resources.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of this disclosure relate to the field of computer technology, and more specifically to a method, apparatus, and device for controlling process data updates in construction terminal equipment. Background Technology

[0002] The method for controlling the update of process data for construction terminal equipment can be a method in which the server controls each construction terminal equipment to update the process data stored locally when the process data changes.

[0003] In practical applications, process data is obtained by breaking down the bill of quantities of the project level by level, and then distributed to each construction terminal device level by level along the hierarchical structure formed by the breakdown. The same process data is received by multiple construction terminal devices during the distribution process, and the content required by each construction terminal device for the same process data is different. At the same time, since some work areas on the construction site have signal shielding (e.g., basement, tunnel), the construction terminal devices need to pre-cache all the process data they need for local reading in offline mode.

[0004] Currently, the common approach for process data update control is as follows: determine whether the process data has changed based on the entire content of the process data, send the updated content of the determined changed process data to each construction terminal device that receives the process data, and control the construction terminal device to write the received updated content into local storage.

[0005] However, in practice, it has been found that when the above method is used to control the update of process data, the following technical problem often occurs: When the process data changes, the above determination result cannot distinguish whether the content required by each construction terminal device has changed. As a result, each construction terminal device that receives the process data is issued the above update content. Among them, the content stored locally by the construction terminal device whose required content has not changed is not changed after receiving the above update content, which leads to an increase in the amount of data transmission between the server and the construction terminal device and a waste of network transmission resources.

[0006] The information disclosed in this background section is only intended to enhance the understanding of the background of the present disclosure concept, and therefore may contain information that does not constitute prior art known to those skilled in the art. Summary of the Invention

[0007] The summary portion of this disclosure is intended to provide a brief overview of the concepts, which will be described in detail in the detailed description portion. This summary portion is not intended to identify key or essential features of the claimed technical solutions, nor is it intended to limit the scope of the claimed technical solutions.

[0008] Some embodiments of this disclosure propose a method, apparatus, and equipment for updating process data of construction terminal equipment to solve one or more of the technical problems mentioned in the background section above.

[0009] In a first aspect, some embodiments of this disclosure provide a method for controlling the update of process data for construction terminal equipment, comprising: in response to receiving process data change information for a set of construction terminal equipment, acquiring a stored process dataset and terminal binding relationship information; performing incremental merging processing on the process data change information based on the stored process dataset to obtain a modified process dataset; performing conversion processing on the modified process dataset to obtain a content version identifier set; performing cross-reference propagation processing on the stored process dataset based on the content version identifier set to obtain a target node information set; and performing cross-reference propagation processing on the modified process dataset based on the target node information set. The process dataset undergoes hierarchical projection processing to obtain a process data unit set. Based on the stored process dataset and the content version identifier set, the process data unit set undergoes bilateral difference extraction processing to obtain a distribution data unit set and a failed version identifier set. Based on the failed version identifier set and the target node information set, the terminal binding relationship information is matched to obtain a target construction terminal equipment set and a failed cache identifier set. Based on the distribution data unit set and the failed cache identifier set, an update control instruction set is generated, and process data update control is performed on the target construction terminal equipment set based on the update control instruction set.

[0010] Secondly, some embodiments of this disclosure provide a process data update control device for construction terminal equipment, comprising: an acquisition unit configured to acquire a stored process dataset and terminal binding relationship information in response to receiving process data change information for a set of construction terminal equipment; a merging unit configured to perform incremental merging processing on the process data change information based on the stored process dataset to obtain a modified process dataset; a conversion unit configured to perform conversion processing on the modified process dataset to obtain a content version identifier set; a propagation unit configured to perform cross-reference propagation processing on the stored process dataset based on the content version identifier set to obtain a target node information set; and a projection unit configured to perform cross-reference propagation processing on the stored process dataset based on the target node information set. The system comprises: an information set, which performs hierarchical association projection processing on the modified process dataset to obtain a process data unit set; an extraction unit, configured to perform bilateral difference extraction processing on the process data unit set based on the stored process dataset and the content version identifier set to obtain a distribution data unit set and a failed version identifier set; a matching unit, configured to perform association matching processing on the terminal binding relationship information based on the failed version identifier set and the target node information set to obtain a target construction terminal equipment set and a failed cache identifier set; and a control unit, configured to generate an update control instruction set based on the distribution data unit set and the failed cache identifier set, and to perform process data update control on the target construction terminal equipment set based on the update control instruction set.

[0011] Thirdly, some embodiments of this disclosure provide an electronic device, including: one or more processors; and a storage device having one or more programs stored thereon, such that when the one or more programs are executed by the one or more processors, the one or more processors implement the method as described in any implementation of the first aspect.

[0012] Fourthly, some embodiments of this disclosure provide a computer-readable medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the method as described in any implementation of the first aspect.

[0013] The above embodiments of this disclosure have the following beneficial effects: The process data update control method for construction terminal equipment in some embodiments of this disclosure can reduce the amount of data transmission between the server and the construction terminal equipment, reduce the waste of network transmission resources, and reduce the operating power consumption of the construction terminal equipment. Specifically, the reason for the increase in the amount of data transmission between the server and the construction terminal equipment and the waste of network transmission resources is that when the process data changes, the determination result of whether the process data has changed based on the entire content of the process data cannot distinguish whether the content required by each construction terminal equipment has changed. This results in all construction terminal equipment receiving the process data being issued the above-mentioned update content. Among them, the content stored locally by the construction terminal equipment whose required content has not changed remains unchanged after receiving the above-mentioned update content, leading to an increase in the amount of data transmission between the server and the construction terminal equipment and a waste of network transmission resources. Based on this, the process data update control method for construction terminal equipment in some embodiments of this disclosure can first, in response to receiving process data change information for the set of construction terminal equipment, obtain the stored process dataset and terminal binding relationship information. Here, the above-mentioned stored process dataset provides a data basis for subsequent incremental merging processing and bilateral difference extraction processing, and the above-mentioned terminal binding relationship information provides a data basis for subsequent association matching processing. Secondly, based on the stored process dataset, incremental merging of the process data change information is performed to obtain the modified process dataset. Here, process data change information carrying only the changed fields is restored to include the complete content of each field, allowing subsequent conversion processing to be performed field-by-field on the complete content of each process data, reducing the possibility of incorrectly identifying unchanged fields as changed due to incomplete process data change information. Thirdly, the modified process dataset is converted to obtain a content version identifier set. Here, the content of each field is converted into a fixed-length content version identifier, allowing content changes to be determined field-by-field, rather than based on the entire process data, and the amount of data required for comparison does not increase with the length of the field content. Next, based on the content version identifier set, cross-reference propagation processing is performed on the stored process dataset to obtain a target node information set. Here, content changes are perceived layer by layer as they propagate upwards along the reference relationship, ensuring that nodes whose own content has not changed but whose referenced content has changed are also included in the target node information set, reducing the possibility of failure to distribute data as required, thus necessitating the re-distribution of all process data for correction. Subsequently, based on the aforementioned target node information set, the modified process dataset is subjected to hierarchical association projection processing to obtain the process data unit set.Here, the required field range for each node is derived node-by-node from its position in the aforementioned hierarchical structure. This allows the same process data to be split into process data units with different content for different nodes, providing the same granularity for subsequent two-sided difference extraction processing, consistent with the content required by each construction terminal device. Then, based on the stored process dataset and the content version identifier set, two-sided difference extraction processing is performed on the process data unit set to obtain the distribution data unit set and the invalid version identifier set. Here, at the granularity of the process data unit, a single comparison yields both the distribution data unit set and the invalid version identifier set. Process data units whose content and position have not changed are not included in either set, while process data units whose position has changed but whose content has not changed are only included in the distribution data unit set without carrying any field content. Subsequently, based on the invalid version identifier set and the target node information set, the terminal binding relationship information is matched to obtain the target construction terminal device set and the invalid cache identifier set. Here, the aforementioned set of invalid version identifiers is converged to the invalid cache identifier groups of each target construction terminal device, making the cleanup target precise to a single cache entry of a single construction terminal device, reducing the need to issue instructions to construction terminal devices whose required content has not changed. Finally, based on the aforementioned set of issued data units and the aforementioned set of invalid cache identifier groups, an update control instruction set is generated, and based on the aforementioned update control instruction set, the aforementioned set of target construction terminal devices is subjected to process data update control. Here, only construction terminal devices whose required content has changed are issued the changed content and their invalid cache entries are cleaned; construction terminal devices whose required content has not changed no longer receive update content, reducing the amount of data transmission between the server and the construction terminal devices, reducing network transmission resource waste, and reducing the number of writes to the local storage of the construction terminal devices. Therefore, this process data update control method for construction terminal devices can reduce the amount of data transmission between the server and the construction terminal devices and reduce network transmission resource waste. Attached Figure Description

[0014] The above and other features, advantages, and aspects of the embodiments of this disclosure will become more apparent from the accompanying drawings and the following detailed description. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic, and elements are not necessarily drawn to scale.

[0015] Figure 1 This is a flowchart of some embodiments of the process data update control method for construction terminal equipment according to the present disclosure; Figure 2 These are schematic diagrams of some embodiments of a process data update control device for construction terminal equipment according to the present disclosure; Figure 3 This is a schematic diagram of the structure of an electronic device suitable for implementing some embodiments of the present disclosure. Detailed Implementation

[0016] Embodiments of this disclosure will now be described in more detail with reference to the accompanying drawings. While some embodiments of this disclosure are shown in the drawings, it should be understood that this disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of this disclosure. It should be understood that the accompanying drawings and embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of protection of this disclosure.

[0017] It should also be noted that, for ease of description, only the parts relevant to the invention are shown in the accompanying drawings. Unless otherwise specified, the embodiments and features described in this disclosure can be combined with each other.

[0018] It should be noted that the concepts of "first" and "second" mentioned in this disclosure are used only to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or their interdependencies.

[0019] It should be noted that the terms "a" and "a plurality of" used in this disclosure are illustrative rather than restrictive, and those skilled in the art should understand that, unless otherwise expressly indicated in the context, they should be understood as "one or more".

[0020] The names of messages or information exchanged between multiple devices in the embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.

[0021] This disclosure will now be described in detail with reference to the accompanying drawings and embodiments.

[0022] Figure 1 A flow 100 of some embodiments of a process data update control method for construction terminal equipment according to the present disclosure is shown. The process data update control method for construction terminal equipment includes the following steps: Step 101: In response to receiving process data change information for the construction terminal equipment set, obtain the stored process data set and terminal binding relationship information.

[0023] In some embodiments, the executing entity (e.g., an electronic device) of the above-described method for controlling the update of process data for construction terminal equipment can, in response to receiving process data change information for the set of construction terminal equipment, obtain the stored process dataset and terminal binding relationship information via a wired or wireless connection. The construction terminal equipment in the aforementioned set of construction terminal equipment can be electronic devices deployed at the construction site of an engineering project, allowing construction workers to locally display process data offline. For example, the aforementioned construction terminal equipment may include, but is not limited to, at least one of the following: an industrial tablet computer, a handheld data acquisition terminal, a construction site dashboard all-in-one machine, or a mobile terminal with a construction management application installed. The aforementioned process data change information can be a structured data packet used to request changes to the process data of the engineering project. The aforementioned process data can be structured data describing the content and requirements of a single construction operation in the engineering project. The aforementioned process data is obtained by breaking down the bill of quantities of the engineering project level by level. Each piece of process data corresponds to a node in the hierarchical structure formed by the breakdown. The aforementioned hierarchical structure can be a tree structure formed by breaking down the bill of quantities level by level (e.g., unit project—sub-project—item project—process). The aforementioned process data may include, but is not limited to, at least one of the following: process data identifier, hierarchical path identifier, name field, content field set, and reference identifier set. The aforementioned process data identifier may be a unique identifier for the aforementioned process data within the aforementioned project (e.g., "WBS-0001"). The aforementioned process data identifier also serves as the identifier of the node corresponding to the aforementioned process data. The aforementioned hierarchical path identifier may be an identifier representing the subordinate path of the node corresponding to the aforementioned process data, descending level by level from the root node of the aforementioned hierarchical structure (e.g., "01.02.03", representing that this node is the third child node of the second child node of the first child node under the root node). The aforementioned name field may be a field describing the name of the node corresponding to the aforementioned process data (e.g., "C30 concrete column pouring"). Each process data has one and only one name field. The content fields in the aforementioned content field set may be fields describing the specific content and requirements of the construction work corresponding to the aforementioned process data. For example, the aforementioned content field set may include, but is not limited to, at least one of the following: quantity field, unit of measurement field, process method field, material specification field, and planned construction period field. The reference identifiers in the aforementioned set of reference identifiers can be the process data identifiers of other process data referenced by the content fields of the aforementioned process data (for example, if the process method fields of multiple process data jointly reference the same process data describing a general process method, the process data identifier of that process data is the reference identifier of each of the aforementioned multiple process data). The aforementioned process data change information can include, but is not limited to, at least one of the following: project identifier, changed process dataset, and change type identifier. The aforementioned project identifier can be the identifier of the engineering project to which the aforementioned process data change information is targeted.The changed process data in the aforementioned changed process dataset can be the content of the process data carried by the process data change information. The aforementioned change type identifier can be an identifier representing the change method of the changed process data (e.g., addition, modification, deletion). Changed process data with a change type identifier of modification can only include the fields that have changed. Changed process data with a change type identifier of addition includes all the fields included in the aforementioned process data. Changed process data with a change type identifier of deletion can only include the process data identifier. The stored process data in the aforementioned stored process dataset can be the process data saved on the server side after the last process data update control was completed. In addition to the fields included in the aforementioned process data, the aforementioned stored process data may also include: a stored content version identifier group, a stored node identifier, and issued record information. The stored content version identifier in the aforementioned stored content version identifier group can be a fixed-length string representing the content of the corresponding field included in the aforementioned stored process data (e.g., "e3b0c44298fc1c14"). Fields with the same content have the same stored content version identifier. The aforementioned stored node identifier can be a fixed-length string representing the content of each field included in the aforementioned stored process data and the content of each piece of stored process data referenced by the aforementioned stored process data. The aforementioned issued record information can be information representing which construction terminal equipment in the aforementioned hierarchical structure has been issued to which each field included in the aforementioned stored process data. The aforementioned issued record information can include at least one issued record. The aforementioned issued record can include: issued field name and issued attribution identifier set. The aforementioned issued field name can be the name of a field issued in the aforementioned stored process data (e.g., "process method"). The issued attribution identifier in the aforementioned issued attribution identifier set can be the identifier of a node. The construction terminal equipment bound to the aforementioned node has received the field indicated by the aforementioned issued field name. The aforementioned terminal binding relationship information can be structured data reflecting the correspondence between construction terminal equipment and nodes in the aforementioned hierarchical structure. The aforementioned terminal binding relationship information can include: a binding record set. The binding records in the aforementioned binding record set can include: a terminal identifier, a process data identifier, and a cache identifier prefix. The aforementioned terminal identifier can be a unique identifier for the construction terminal equipment in the aforementioned project (e.g., "PAD-A3-016"). The process data identifier included in the aforementioned binding record can be the identifier of the node that the construction terminal equipment corresponding to the terminal identifier included in the aforementioned binding record is responsible for. The same node can correspond to multiple terminal identifiers (e.g., the same sub-project is jointly handled by multiple construction workers each holding their own construction terminal equipment). The same terminal identifier can correspond to multiple process data identifiers (e.g., the same construction terminal equipment is simultaneously responsible for multiple adjacent sub-projects).The aforementioned cache identifier prefix can be the prefix of the key of the cache entry in the local cache of the construction terminal device corresponding to the terminal identifier included in the aforementioned binding record (e.g., "project identifier: terminal identifier").

[0024] Step 102: Based on the stored process dataset, perform incremental merging of process data change information to obtain the changed process dataset.

[0025] In some embodiments, the aforementioned executing entity can perform incremental merging processing on the aforementioned process data change information based on the aforementioned stored process dataset to obtain a modified process dataset. The modified process data in the modified process dataset can be structured data describing the content and requirements of a single construction operation in the aforementioned project after this change (e.g., process data where the quantity field is changed from "120 cubic meters" to "126 cubic meters"). The fields included in the modified process data are the same as those included in the aforementioned process data.

[0026] In some optional implementations of certain embodiments, the incremental merging process data change information based on the stored process dataset to obtain the changed process dataset may include the following steps: The first step involves generating a set of content information to be merged and a new process dataset based on the aforementioned process data change information and the existing stored process dataset. The content information to be merged in the set of content information to be merged can be changed process data with the same process data identifier as those in the existing stored process dataset. The new process data in the new process dataset can be changed process data with the same process data identifier as those in the existing stored process dataset. In practice, the executing entity can first add the process data identifiers of each stored process data entry in the existing stored process dataset to a HashSet container in the Java Collections Framework, obtaining a set of stored identifiers. Then, it filters out changed process data with the change type identifier of "new" or "modified" from the changed process dataset, obtaining a set of changed process data to be processed. Next, for each changed process data in the set of data to be processed, the process data identifiers included in the changed process data are searched in the existing stored identifier set to obtain search results. Finally, the changed process data with matching search results are identified as content information to be merged, and the changed process data with no matching search results are identified as new process data.

[0027] The second step involves merging each piece of information in the aforementioned set of information to be merged into the corresponding stored process data in the aforementioned stored process dataset, resulting in merged process data. This merged process data can be structured data describing the content and requirements of a single construction operation in the project after merging the information to be merged. The fields included in the merged process data are the same as those included in the stored process data. In practice, the executing entity can, for each piece of information to be merged in the aforementioned set of information, first filter the stored process data in the aforementioned stored process dataset whose process data identifiers match those of the information to be merged, obtaining target stored process data. Then, using the object node interface provided by the Jackson library, replace the content of fields in the target stored process data that have the same names as the fields included in the information to be merged with the content of the corresponding fields included in the information to be merged, thus obtaining merged process data. Fields in the aforementioned target stored process data that have different names from the fields included in the information to be merged will retain their original content before replacement.

[0028] The third step involves updating the stored process dataset based on the merged process dataset and the newly added process dataset, resulting in the modified process dataset. In practice, the executing entity can first filter out the modified process data with the change type identifier "deleted" from the modified process dataset, obtaining the dataset of modified processes to be deleted. Then, the process data identifiers included in each piece of content information to be merged in the merged content information set and the process data identifiers included in each piece of modified process data to be deleted in the deleted modified process dataset are determined as the processed identifier set. Next, the stored process data whose process data identifiers are not included in the processed identifier set are filtered out from the stored process dataset, resulting in the unchanged process dataset. Finally, each merged process data in the merged process dataset, each newly added process data in the newly added process dataset, and each unchanged process data in the unchanged process dataset are determined as the modified process dataset. This data update process can be performed in the memory of the executing entity. The stored process dataset remains unchanged after the data update process.

[0029] Step 103: Transform the modified process dataset to obtain a content version identifier set.

[0030] In some embodiments, the executing entity may transform the modified process dataset to obtain a content version identifier set. The content version identifiers included in the content version identifier set may be fixed-length strings representing the content of corresponding fields in the modified process data. Fields with the same content have the same content version identifier.

[0031] In some optional implementations of certain embodiments, the above-described transformation of the modified process dataset to obtain a content version identifier set may include the following steps: The first step is to perform the following transformation steps for each modified process data in the modified process dataset: Sub-step 1: Serialize each field of the modified process data according to a preset serialization format to obtain a normalized content sequence group. The normalized content sequence group can be a byte sequence representing the content of the corresponding field in the modified process data. The preset serialization format can be a pre-defined format that converts field content into a byte sequence (e.g., JSON normalized serialization format). In practice, the executing entity can first sort the keys in the content of each field of the modified process data according to the arrangement order specified in JSON normalized serialization (JCS, RFC 8785) to obtain sorted field content, then remove whitespace characters from the sorted field content to obtain whitespace-removed field content, and finally encode the whitespace-removed field content according to UTF-8 encoding to obtain a normalized content sequence. The arrangement order can be the lexicographical order of the UTF-16 encoding units of each key.

[0032] Sub-step 2 involves performing a digest conversion on the aforementioned standardized content sequence group to obtain a content version identifier group. In practice, the executing entity can use the SHA-256 digest algorithm to convert the digest of each standardized content sequence included in the aforementioned standardized content sequence group to obtain a content version identifier. The digest algorithm can also be the BLAKE3 digest algorithm. Each content version identifier in the aforementioned content version identifier group corresponds one-to-one with each field included in the aforementioned modified process data. Step 104: Based on the content version identifier set, perform cross-reference propagation processing on the stored process dataset to obtain the target node information set.

[0033] In some embodiments, the execution entity can perform cross-reference propagation processing on the stored process dataset based on the content version identifier set to obtain a target node information set. The target node information in the target node information set can be information about nodes in the hierarchical structure whose content has changed after this modification. The target node information can include: process data identifiers and hierarchical path identifiers (e.g., information where the process data identifier is "WBS-0001" and the hierarchical path identifier is "01.02.03"). The process data identifiers included in the target node information can be the identifiers of the nodes corresponding to the target node information. The hierarchical path identifiers included in the target node information can be the hierarchical path identifiers included in the modified process data corresponding to the process data identifier.

[0034] In addressing the technical problems mentioned above, the application scenario—specifically, the control of process data updates for prefabricated building projects using standardized designs (e.g., a standard prefabricated section of an underground station is assembled from hundreds of identical prefabricated components, with each ring sharing the same assembly process)—often presents the following technical problem: Because determining whether process data has changed based solely on its content fails to detect the propagation of content changes along referencing relationships, all process data in referenced processes that have changed are deemed unchanged. This results in the corresponding construction terminal equipment not receiving updated content, leading to inconsistencies between its locally stored content and the updated content. Furthermore, it becomes impossible to determine which construction terminal equipment's locally stored content has become invalid, necessitating the re-issuance of all required process data to the relevant equipment. This increases data transmission volume between the server and the construction terminal equipment, wasting network resources. Considering the following requirements for this application scenario: multi-layered propagation capability of referencing relationships, perceptibility of changes in referenced content, and convergence of propagation scope, we have decided to adopt the following solution: Optionally, the process of performing cross-reference propagation on the stored process dataset based on the aforementioned content version identifier set to obtain the target node information set may include the following steps: The first step is to construct a reference index on the aforementioned stored process dataset to obtain reference index information. This reference index information can represent how each stored process data in the aforementioned stored process dataset is referenced by other stored process data. The reference index information can include at least one index entry. This index entry can include: the identifier of the referenced process data and a set of identifiers of the referencing process data (for example, the identifier of the referenced process data is the process data identifier "WBS-9001" describing a general process practice, and the set of identifiers of the referencing process data consists of the individual process data identifiers of each process data that references this process data). In practice, the executing entity can, for each stored process data in the aforementioned stored process dataset, use each reference identifier from the set of reference identifiers included in the stored process data as a key and the process data identifiers included in the stored process data as values, and add them to the Multimap container of the Guava library to obtain the reference index information.

[0035] The second step involves performing version difference location processing on the stored process dataset based on the aforementioned content version identifier set, resulting in an initial propagation node information set. The initial propagation node information in this set can be information about nodes in the aforementioned hierarchical structure whose content of included fields has changed. The content of the initial propagation node information is the same as that of the target node information. In practice, the executing entity can, for each changed process data in the changed process dataset, first filter out stored process data from the stored process dataset whose process data identifiers are the same as those included in the changed process data, obtaining the reference stored process data. Then, it compares the content version identifiers in the content version identifier set corresponding to the changed process data with the stored content version identifiers of the same-named fields in the reference stored process data, obtaining the comparison results. Finally, the information of nodes corresponding to changed process data with different comparison results is determined as the initial propagation node information. The executing entity can also determine the information of nodes corresponding to each newly added process data in the newly added process dataset as the initial propagation node information.

[0036] The third step is to determine the initial propagation node information set as the already propagated node information set, and based on the initial propagation node information set and the already propagated node information set, perform the following propagation steps: Sub-step 1: Based on the aforementioned reference index information, perform reverse single-hop diffusion processing on the initial propagation node information set to obtain a candidate propagation node information set. The candidate propagation node information in the candidate propagation node information set can be information about nodes in the aforementioned hierarchical structure that reference the initial propagation node information set. The content of the candidate propagation node information is the same as the content of the target node information. In practice, the executing entity can, for each initial propagation node information in the initial propagation node information set, first select index entries from the reference index information that have the same referenced process data identifier as the process data identifier included in the initial propagation node information to obtain target index entries, and then determine the information of the nodes corresponding to the referenced process data identifiers in the referenced process data identifier set included in the target index entry as candidate propagation node information.

[0037] Sub-step 2 involves performing reference chain folding and aggregation on the candidate propagation node information set based on the aforementioned content version identifier set, the aforementioned stored process dataset, and the aforementioned initial propagation node information set, to obtain a candidate node identifier set. The candidate node identifiers in the candidate node identifier set can be fixed-length strings representing the content of each field included in the node corresponding to the candidate propagation node information and the content of each process data referenced by the node after this change. Each candidate node identifier in the candidate node identifier set corresponds one-to-one with each candidate propagation node information in the candidate propagation node information set. In practice, the executing entity can first create reconstruction identifier mapping information. This reconstruction identifier mapping information can be information representing the correspondence between process data identifiers and node identifiers obtained after reconstruction following this change. Then, for each candidate propagation node in the aforementioned candidate propagation node information set, firstly, select the content version identifier group corresponding to the process data identifier included in the aforementioned content version identifier group set to obtain its own content identifier group. Then, for each reference identifier in the reference identifier set of the stored process data included in the aforementioned process data identifier, perform the following determination steps. Next, sort the content version identifiers included in the aforementioned own content identifier group and the obtained reference node identifiers in lexicographical order to obtain a sorted identifier sequence. Then, use the SHA-256 digest algorithm to perform digest conversion processing on the sorted identifier sequence to obtain candidate node identifiers. Finally, add the correspondence between the process data identifiers included in the aforementioned candidate propagation node information and the aforementioned candidate node identifiers to the aforementioned reconstructed identifier mapping information. The aforementioned determination steps may include: in response to determining that there is a node identifier in the aforementioned reconstructed identifier mapping information that corresponds to the aforementioned reference identifier, determining the aforementioned node identifier as a reference node identifier; in response to determining that there is no node identifier in the aforementioned reconstructed identifier mapping information that corresponds to the aforementioned reference identifier, and that the aforementioned reference identifier is included in the process data identifiers included in each of the initial propagation node information in the aforementioned initial propagation node information set, processing the process data corresponding to the aforementioned reference identifier according to the aforementioned reference chain folding aggregation processing method to obtain the reference node identifier; in response to determining that there is no node identifier in the aforementioned reconstructed identifier mapping information that corresponds to the aforementioned reference identifier, and that the aforementioned reference identifier is not included in the process data identifiers included in each of the initial propagation node information in the aforementioned initial propagation node information set, determining the stored node identifiers included in the stored process data corresponding to the aforementioned reference identifier as reference node identifiers.

[0038] Sub-step 3: Based on the aforementioned stored process dataset, perform an identifier difference comparison process on the aforementioned candidate node identifier set to obtain a difference node identifier set. In practice, the aforementioned execution entity can, for each candidate node identifier in the aforementioned candidate node identifier set, first filter out the stored process data from the aforementioned stored process dataset whose process data identifier is the same as the process data identifier included in the candidate propagation node information corresponding to the aforementioned candidate node identifier, obtain the comparison stored process data, then compare the aforementioned candidate node identifier with the stored node identifiers included in the comparison stored process data to obtain the comparison result, and finally determine the candidate node identifiers that are different from the comparison result as difference node identifiers.

[0039] Sub-step 4 involves determining the candidate propagation node information set corresponding to the candidate propagation node information set and the difference node identifier set as the node information set to be propagated. In practice, the executing entity can filter out the candidate propagation node information whose corresponding candidate node identifiers are included in the difference node identifier set from the candidate propagation node information set to obtain the node information set to be propagated.

[0040] Sub-step 5: In response to determining that the above-mentioned information set of nodes to be propagated is empty, the above-mentioned information set of nodes that have been propagated is determined as the target information set.

[0041] Sub-step 6: In response to determining that the aforementioned set of node information to be propagated is not empty, the aforementioned set of node information to be propagated is added to the aforementioned set of already propagated node information to obtain a post-addition propagation node information set. The post-addition propagation node information set is then defined as the already propagated node information set, and the aforementioned set of node information to be propagated is defined as the initial propagation node information set, so that the aforementioned propagation steps are executed again. In practice, the executing entity can add the node information to be propagated from the aforementioned set of node information to be propagated, where the process data identifier is not included in the process data identifiers included in the aforementioned set of already propagated node information, to the aforementioned set of already propagated node information to obtain a post-addition propagation node information set.

[0042] The above-mentioned technical solution and its related content, as an inventive point of this disclosure, combined with step "Step 108" below, solves technical problem two: "The method of determining whether process data has changed based on the content of the process data itself cannot perceive the transmission of content changes along the reference relationship, resulting in an increase in data transmission volume between the server and construction terminal equipment and a waste of network transmission resources." Factors leading to an increase in data transmission volume between the server and construction terminal equipment and a waste of network transmission resources are often as follows: the content of each process data item referencing the changed process data has not changed itself and is determined to be unchanged, resulting in the corresponding construction terminal equipment not receiving updated content, its locally stored content being inconsistent with the content after the change, and it being impossible to determine which construction terminal equipment's locally stored content has become invalid, requiring the re-issuance of all required process data to the relevant construction terminal equipment. Solving these factors can reduce the data transmission volume between the server and construction terminal equipment and reduce the waste of network transmission resources. To achieve this effect, this disclosure first performs reference index construction processing on the above-mentioned stored process dataset to obtain reference index information, and performs version difference location processing on the above-mentioned stored process dataset based on the above-mentioned content version identifier set to obtain an initial propagation node information set. Here, the instances where each process data is referenced by other process data are pre-collected into the aforementioned reference index information. This eliminates the need to examine each stored process dataset individually when determining which process data references a particular process data during the subsequent propagation process. Furthermore, the aforementioned reference index information is reused in each round of propagation without needing to be reconstructed. Next, the aforementioned initial propagation node information set is determined as the propagated node information set. Based on the aforementioned initial propagation node information set and the aforementioned propagated node information set, the propagation steps are executed: according to the aforementioned reference index information, the aforementioned initial propagation node information set undergoes reverse single-hop diffusion processing to obtain a candidate propagation node information set; and according to the aforementioned content version identifier set, the aforementioned stored process dataset, and the aforementioned initial propagation node information set, the aforementioned candidate propagation node information set undergoes reference chain folding aggregation processing to obtain a candidate node identifier set. Here, each round propagates outwards by only one hop from the newly added nodes in the previous round, and the content of each candidate propagation node after the change is collapsed and aggregated into a candidate node identifier of fixed length. This allows the content of a node itself and the content of each process data it references after the change to be determined together, without having to expand all the content referenced by the node layer by layer along the reference relationship in each round. Subsequently, based on the stored process dataset, the candidate node identifier set is subjected to identifier difference comparison processing to obtain the difference node identifier set, and the candidate propagation node information corresponding to the difference node identifier set in the candidate propagation node information set is determined as the node information set to be propagated.Here, candidate propagation nodes whose content has not changed are not included in the aforementioned propagation node information set. This ensures that the propagation scope is converged to nodes whose content has indeed changed in each round, reducing the possibility of the propagation scope spreading to all process data of the project as the number of reference layers increases. Finally, in response to determining that the aforementioned propagation node information set is empty, the aforementioned propagated node information set is determined as the target node information set; in response to determining that the aforementioned propagation node information set is not empty, the aforementioned propagation node information set is added to the aforementioned propagated node information set to obtain the added propagation node information set. The added propagation node information set is determined as the propagated node information set, and the aforementioned propagation node information set is determined as the initial propagation node information set, so that the above propagation steps are executed again. Here, propagation terminates when no new nodes with changed content are generated, ensuring that the content changes transmitted by the multi-layered nested reference relationship are perceived layer by layer to the end. The corresponding construction terminal equipment is issued its changed content, reducing the possibility of reissuing all process data due to inconsistencies between locally stored content and the content after the change, reducing the amount of data transmission between the server and the construction terminal equipment, and reducing the waste of network transmission resources. Therefore, the above technical solution and its related content, combined with step "108" below, can reduce the amount of data transmission between the server and the construction terminal equipment, and reduce the waste of network transmission resources.

[0043] Step 105: Based on the target node information set, perform hierarchical association projection processing on the modified process dataset to obtain the process data unit set.

[0044] In some embodiments, the execution entity may perform hierarchical association projection processing on the modified process dataset based on the target node information set to obtain a process data unit set. The process data unit in the process data unit set may be a piece of content required when the construction terminal equipment locally displays a node in the hierarchical structure in an offline state. The process data unit may include: a belonging process data identifier, a source process data identifier, a field name, and a field content. The belonging process data identifier may be the identifier of the node served by the process data unit. The source process data identifier may be the identifier of the node to which the field content belongs (e.g., a process data unit with a belonging process data identifier of "WBS-0001", a source process data identifier of "WBS-0088", a field name of "Name", and a field content of "Three-story Masonry Engineering").

[0045] In some optional implementations of certain embodiments, the process of performing hierarchical association projection processing on the modified process dataset based on the target node information set to obtain a process data unit set may include the following steps: The first step is to perform hierarchical subordination parsing on the target node information set to obtain the upstream node information set. The upstream node information set can be a group composed of information from each level of nodes in the hierarchical structure, starting from the root node and ending at the parent node of the node corresponding to a target node. Each upstream node information group in the upstream node information set corresponds one-to-one with each target node in the target node information set. The content of the upstream node information included in the upstream node information set is the same as the content included in the target node information. In practice, the executing entity can, for each target node in the target node information set, first perform prefix truncation on the hierarchical path identifiers included in the target node information using a period as a separator to obtain an upstream hierarchical path identifier group. Then, it can filter out the modified process data whose hierarchical path identifiers are included in the upstream hierarchical path identifier group from the modified process data set to obtain an upstream modified process data group. Finally, the information of the nodes corresponding to each upstream modified process data in the upstream modified process data group is determined as the upstream node information group.

[0046] The second step involves performing full-field projection processing on the modified process dataset based on the aforementioned target node information set, resulting in a first process data unit set. The attributing process data identifier included in the first process data unit set is identical to the source process data identifier included in the first process data unit set. In practice, the executing entity can, for each target node information in the aforementioned target node information set, first filter out modified process data from the modified process dataset whose process data identifiers are identical to those included in the target node information, obtaining target modified process data. Then, for each field included in the target modified process data, determine the process data identifier included in the target node information as the attributing process data identifier and the source process data identifier, determine the field name as the field name, and determine the field content as the field content, thus obtaining the first process data unit.

[0047] The third step involves projecting the identifier field onto the modified process dataset based on the aforementioned upstream node information set, resulting in a second process data unit set. The field names included in the second process data unit set are the names of the aforementioned name fields. In practice, the executing entity can, for each upstream node information group in the aforementioned upstream node information set, and for each upstream node information included in the aforementioned upstream node information group, first filter out modified process data from the modified process dataset whose process data identifiers are the same as those included in the aforementioned upstream node information, obtaining the upstream target modified process data. Then, determine the process data identifier included in the target node information corresponding to the aforementioned upstream node information group as the belonging process data identifier, determine the process data identifier included in the aforementioned upstream node information as the source process data identifier, determine the name field name included in the aforementioned upstream target modified process data as the field name, and determine the content of the aforementioned name field as the field content, thus obtaining the second process data unit.

[0048] The fourth step is to determine the first process data unit set and the second process data unit set as the process data unit set.

[0049] Step 106: Based on the stored process dataset and content version identifier set, perform bilateral difference extraction on the process data unit set to obtain the issued data unit set and the invalid version identifier set.

[0050] In some embodiments, the execution entity can perform bilateral difference extraction processing on the process data unit set based on the stored process dataset and the content version identifier set to obtain a distribution data unit set and a failed version identifier set. The distribution data unit in the distribution data unit set can be content that the construction terminal equipment needs to write to local storage after this change. The distribution data unit can include: the belonging process data identifier, the source process data identifier, the field name, the display position identifier, and the field content. The display position identifier can be a string representing the position of the node corresponding to the source process data identifier in the hierarchical structure (e.g., "1.3.5"). The failed version identifier in the failed version identifier set can be an identifier of content that the construction terminal equipment no longer needs to retain after this change. The aforementioned invalid version identifier may include: the identifier of the process to which it belongs, the identifier of the process to which it originates ...

[0051] In addressing the technical problems mentioned above, the following technical problem arises in the application scenario: for underground engineering projects where construction methods have changed (e.g., after a tunnel section is changed from the bench method to the central diaphragm method, multiple sectional excavation processes are inserted between the original excavation processes) where process data update control is required. This scenario often presents the following technical problem three: Inserting nodes into the hierarchical structure shifts the paths of subsequent nodes under the same parent node. The method of determining whether process data has changed based on the path of the process data in the hierarchical structure cannot correspond the same node before and after the path shift. This results in nodes whose content and hierarchical relationships remain unchanged being identified as changed, causing the content corresponding to these nodes to be repeatedly sent to the corresponding construction terminal equipment. The locally stored content remains unchanged after receiving this content, leading to increased data transmission volume between the server and the construction terminal equipment and wasted network transmission resources. To address the following requirements for this application scenario: node insertion capability, comparability of structural positions before and after insertion, separate transmission of content and position, and incremental transmission, we have decided to adopt the following solution: Optionally, the above-mentioned process data unit set is subjected to two-sided difference extraction processing based on the stored process dataset and the content version identifier set to obtain the distribution data unit set and the failed version identifier set, which may include the following steps: The first step is to perform hierarchical positional labeling on the aforementioned stored process dataset to obtain a set of stored positional identifiers. The stored positional identifiers in this set can be strings representing the position of the node corresponding to the stored process data within the hierarchical structure. A new positional identifier can be inserted between any two adjacent stored positional identifiers in the set, and all other stored positional identifiers remain unchanged after insertion. Each stored positional identifier in the set corresponds one-to-one with each stored process data entry in the aforementioned stored process dataset. In practice, the aforementioned execution entity can, for each stored process data in the aforementioned stored process dataset, first split the hierarchical path identifiers included in the stored process data using a period (.) as the separator to obtain a hierarchical sequence number group. Then, according to the ORDPATH encoding rule, each hierarchical sequence number group is sequentially mapped to an odd-numbered sequence number to obtain the stored position identifier (for example, the stored position identifier corresponding to the hierarchical path identifier "01.02.03" is "1.3.5"). The aforementioned ORDPATH encoding rule can be an encoding rule that uses odd-numbered sequence numbers to represent the initial node and even-numbered sequence numbers to represent subsequently inserted nodes.

[0052] The second step involves performing hierarchical dependency change identification processing on the aforementioned stored process data unit set, based on the stored process dataset, to obtain a dependency change unit set. The dependency change units in this set can be process data units whose positions in the hierarchical structure differ between the original and current versions of the node corresponding to the source process data identifier. In practice, the executing entity can, for each process data unit in the set, first filter out the changed process data whose process data identifier matches the source process data identifier included in the changed process dataset, obtaining the changed source process data; then filter out the stored process data whose process data identifier matches the source process data identifier, obtaining the stored source process data; next, compare the hierarchical path identifier included in the changed source process data with the hierarchical path identifier included in the stored source process data, obtaining the comparison result; finally, process data units whose comparison result is different are identified as dependency change units. The difference in the comparison result could be due to a change in the arrangement sequence number under the same parent node of the node corresponding to the source process data after the change, or a change in the parent node of the node corresponding to the source process data after the change. The executing entity can also identify process data units in the stored process dataset that do not contain the same process data identifier as subordinate change units.

[0053] The third step involves updating the stored position identifier set by embedding the stored position identifier set according to the aforementioned set of subordinate change units, resulting in an updated position identifier set. The updated position identifier in this set can be a string representing the node's position in the hierarchical structure after the change. The updated position identifier of a node that has not undergone a subordinate change is the same as its stored position identifier. In practice, the executing entity can, for each subordinate change unit in the set, first determine the preceding and following sibling nodes of the node corresponding to the source process data identifier included in the changed process dataset after the change, obtaining the predecessor and successor nodes. Then, according to the insertion rules of the ORDPATH encoding rule, an even-numbered sequence is generated between the stored position identifier of the predecessor node and the stored position identifier of the successor node to obtain the updated position identifier (for example, inserting between "1.3.5" and "1.3.7" results in "1.3.6.1"). The aforementioned executing entity may also determine the stored position identifiers of nodes in the aforementioned stored position identifier set that have not undergone subordinate changes as the updated position identifiers.

[0054] Fourth, based on the previously stored position identifier set and the updated position identifier set, position matching and pairing processing is performed on the previously stored process data unit set and the previously stored process dataset to obtain a first paired information set and a first unpaired information set. The previously stored process data unit can be content that the construction terminal equipment had already written into local storage before this change. The previously stored process data unit can include: the belonging process data identifier, the source process data identifier, and the field name. The first paired information in the first paired information set can be information consisting of a paired process data unit and a previously stored process data unit. The first unpaired information in the first unpaired information set can be a process data unit that is not paired with a previously stored process data unit, or a previously stored process data unit that is not paired with a previously stored process data unit. In practice, the aforementioned executing entity can first, for each stored process data in the aforementioned stored process dataset, and for each issued record in the issued record information included in the aforementioned stored process data, sequentially determine each issued attribution identifier in the issued attribution identifier set included in the issued record as the attribution process data identifier, determine the process data identifier included in the aforementioned stored process data as the source process data identifier, and determine the issued field name included in the aforementioned issued record as the field name, thus obtaining a stored process data unit. Then, for each stored process data unit in the aforementioned stored process data unit set, concatenate the stored position identifier corresponding to the attribution process data identifier included in the aforementioned stored process data unit, the stored position identifier corresponding to the source process data identifier included in the aforementioned stored process data unit, and the field name included in the aforementioned stored process data unit to form a stored pairing key. Next, for each process data unit in the aforementioned process data unit set, the updated position identifier corresponding to the belonging process data identifier, the updated position identifier corresponding to the source process data identifier, and the field name included in the process data unit are concatenated to form a pairing key. Then, process data units with the same stored pairing key as the pairing key and the stored process data units are identified as first pairing information. Finally, process data units in the aforementioned process data unit set that did not participate in obtaining the first pairing information and stored process data units in the aforementioned stored process data unit set that did not participate in obtaining the first pairing information are identified as first unpaired information.

[0055] Fifth, based on the first paired information set and the preset ratio, the first unpaired information set is subjected to neighborhood proportion transfer pairing processing to obtain a second paired information set and a second unpaired information set. The preset ratio can be a pre-defined minimum percentage (e.g., 0.6) of the number of child nodes required to determine if two nodes are the same node in the hierarchical structure before and after the change. In practice, the executing entity can first filter out process data units from the first unpaired information set to obtain an unpaired process data unit set. Then, for each belonging process data identifier included in each process data unit in the above-mentioned unpaired process data unit set, firstly, the child nodes of the node corresponding to the belonging process data identifier in this change are determined from the above-mentioned changed process data set to obtain a child node information group. Then, the source process data identifiers included in the stored process data units that are paired with each child node information in the above-mentioned child node information group are determined from the above-mentioned first pairing information set to obtain a paired source identifier group. Next, the parent node of the node corresponding to the source process data identifier that appears most frequently in the above-mentioned paired source identifier group is determined as a candidate same node. Then, the ratio of the number of source process data identifiers of the child nodes belonging to the above-mentioned candidate same node in the above-mentioned paired source identifier group to the number of child node information included in the above-mentioned child node information group is determined as the neighborhood pairing ratio. Finally, in response to determining that the neighborhood pairing ratio is not less than the above-mentioned preset ratio, the process data units corresponding to the above-mentioned belonging process data identifier and the stored process data units corresponding to the above-mentioned candidate same node that have the same field name and source node position are determined as the second pairing information. The aforementioned executing entity may also identify the first unpaired information that did not participate in obtaining the second pairing information in the first unpaired information set as the second unpaired information.

[0056] Step 6: Based on the stored position identifier set and the updated position identifier set, perform position offset increment extraction processing on the first pairing information set and the second pairing information set to obtain a position update unit set. The position update units in the position update unit set can be data units that do not include field content. In practice, the executing entity can, for each pairing information in the first and second pairing information sets, first compare the updated position identifier corresponding to the source process data identifier of the process data unit included in the pairing information with the stored position identifier corresponding to the source process data identifier of the stored process data unit included in the pairing information, obtain the comparison result, and then, in response to determining that the comparison result is different, determine the belonging process data identifier, source process data identifier, and field name included in the process data unit, along with the updated position identifier, as the position update unit.

[0057] Step 7: Based on the aforementioned content version identifier set and the aforementioned stored process dataset, perform content version identifier comparison processing on the aforementioned first pairing information set and the aforementioned second pairing information set to obtain a content change unit set. The content change units in the aforementioned content change unit set can be data units that include field content. In practice, the aforementioned executing entity can, for each pair of information in the first and second pairing information sets, first filter out the content version identifier group corresponding to the source process data identifier of the process data unit included in the pairing information from the content version identifier group set to obtain the source content version identifier group. Then, filter out the content version identifier of the field with the same name as the field name included in the process data unit from the source content version identifier group to obtain the content version identifier to be compared. Next, filter out the stored content version identifier of the field with the same name in the stored content version identifier group of the stored process data included in the stored process data corresponding to the source process data identifier of the pairing information from the stored process data set to obtain the comparison stored content version identifier. Then, compare the content version identifier to be compared with the comparison stored content version identifier to obtain the comparison result. Finally, in response to determining that the comparison result is different, determine the updated position identifier of each item included in the process data unit and the source process data identifier as the content change unit.

[0058] Step 8: The process data units, the position update unit set, and the content change unit set included in the second unpaired information set are determined as the data unit set to be issued. In practice, the executing entity can determine the updated position identifier corresponding to the source process data identifier included in the source process data identifier of each process data unit included in the second unpaired information set as the data unit to be issued.

[0059] Step 9: Based on the aforementioned stored process dataset, perform failure identifier extraction processing on the aforementioned second unpaired information set to obtain a failure version identifier set. In practice, the aforementioned execution entity can, for each stored process data unit included in the aforementioned second unpaired information set, first filter out stored process data whose process data identifier is the same as the source process data identifier included in the aforementioned stored process data unit from the aforementioned stored process dataset to obtain the failure source process data; then filter out the stored content version identifiers of fields with the same names as the field names included in the aforementioned stored process data unit from the stored content version identifier group included in the aforementioned failure source process data to obtain the failure content version identifier; finally, determine the failure version identifier by combining the contents included in the aforementioned stored process data unit with the aforementioned failure content version identifier.

[0060] The above technical solution and its related content, as an inventive point of this disclosure, combined with step "Step 108" below, solves technical problem three: "Inserting nodes in the above hierarchical structure causes the paths of subsequent nodes under the same parent node to shift as a whole. The method of determining whether process data has changed based on the path of process data in the above hierarchical structure cannot correspond the same node before and after the path shift, resulting in an increase in data transmission volume between the server and the construction terminal equipment and a waste of network transmission resources." The factors leading to an increase in data transmission volume and a waste of network transmission resources between the server and the construction terminal equipment are often as follows: nodes whose content and subordinate relationships have not changed are determined to have changed due to path shifting, causing the content corresponding to the above nodes to be repeatedly sent to the corresponding construction terminal equipment, while the content already stored locally remains unchanged after receiving the above content. If the above factors are solved, the effect of reducing the data transmission volume between the server and the construction terminal equipment and reducing the waste of network transmission resources can be achieved. To achieve this effect, this disclosure first performs hierarchical positional labeling processing on the aforementioned stored process dataset to obtain a stored positional identifier set. Then, based on the aforementioned stored process dataset, it performs hierarchical subordinate change identification processing on the aforementioned process data unit set to obtain a subordinate change unit set. Finally, based on the aforementioned subordinate change unit set, it performs positional embedding and updating processing on the aforementioned stored positional identifier set to obtain an updated positional identifier set. Here, the position of a node in the aforementioned hierarchical structure is represented by a stored positional identifier that can be inserted between any two adjacent positional identifiers while the remaining positional identifiers remain unchanged. This ensures that when a node is inserted, only the newly inserted node is assigned a new positional identifier, and the positional identifiers of subsequent nodes under the same parent node do not change accordingly. Next, based on the previously stored position identifier set and the updated position identifier set, position matching and pairing processing is performed on the aforementioned process data unit set and the aforementioned stored process dataset to obtain a first paired information set and a first unpaired information set. Then, based on the first paired information set and a preset ratio, neighborhood proportion transfer pairing processing is performed on the aforementioned first unpaired information set to obtain a second paired information set and a second unpaired information set. Here, process data units are paired with previously stored process data units according to their positions in the aforementioned hierarchical structure, such that two process data units in the same position before and after the insertion node are identified as the same process data unit. For nodes whose position identifiers have changed, if the proportion of paired child nodes is not less than the aforementioned preset ratio, the node is still identified as the same node, ensuring that pairing is not interrupted by changes in the position identifier of a single node.Subsequently, based on the stored position identifier set and the updated position identifier set, the first pairing information set and the second pairing information set are subjected to position offset incremental extraction processing to obtain a position update unit set. Then, based on the content version identifier set and the stored process dataset, the first pairing information set and the second pairing information set are subjected to content version identifier comparison processing to obtain a content change unit set. Here, the position and content of paired process data units are compared separately. Process data units whose position changes but whose content does not change are only extracted for their position; their field content is no longer sent, ensuring that the amount of data sent does not increase with the number of nodes with position changes. Finally, the process data units included in the second unpaired information set, the position update unit set, and the content change unit set are determined as the sent data unit set. Finally, based on the stored process dataset, the second unpaired information set is subjected to failure identifier extraction processing to obtain a failure version identifier set. Here, process data units whose position and content remain unchanged are neither included in the aforementioned set of issued data units nor in the aforementioned set of invalid version identifiers. This ensures that when inserting a node, the content corresponding to the other nodes is no longer repeatedly issued to the corresponding construction terminal equipment, reducing the amount of data transmission between the server and the construction terminal equipment and reducing the waste of network transmission resources. Therefore, the above technical solution and its related content, combined with step "Step 108" below, can reduce the amount of data transmission between the server and the construction terminal equipment and reduce the waste of network transmission resources.

[0061] Step 107: Based on the set of invalid version identifiers and the set of target node information, perform association matching processing on the terminal binding relationship information to obtain the set of target construction terminal equipment and the set of invalid cache identifiers.

[0062] In some embodiments, the execution entity can perform association matching processing on the terminal binding relationship information based on the aforementioned invalid version identifier set and the aforementioned target node information set to obtain a target construction terminal device set and an invalid cache identifier group set. The target construction terminal devices in the aforementioned target construction terminal device set can be construction terminal devices whose bound nodes have changed content after this change. The invalid cache identifier groups in the aforementioned invalid cache identifier group set can be keys of cache entries that no longer need to be retained in the local cache of the construction terminal device. Each invalid cache identifier group in the aforementioned invalid cache identifier group set corresponds one-to-one with each target construction terminal device in the aforementioned target construction terminal device set. The aforementioned invalid cache identifier group can be an empty group.

[0063] In some optional implementations of certain embodiments, the process of performing association matching on the terminal binding relationship information based on the failed version identifier set and the target node information set to obtain the target construction terminal equipment set and the failed cache identifier set may include the following steps: The first step is to perform identifier matching processing on the terminal binding relationship information based on the aforementioned target node information set to obtain the target construction terminal equipment set. In practice, the executing entity can first determine the process data identifiers included in each target node information in the aforementioned target node information set as the target identifier set. Then, it can filter out the binding records whose process data identifiers are included in the aforementioned target identifier set from the binding record set included in the aforementioned terminal binding relationship information to obtain the target binding record set. Next, it can perform deduplication processing on the terminal identifiers included in each target binding record in the aforementioned target binding record set to obtain the target terminal identifier set. Finally, it can determine the construction terminal equipment corresponding to each target terminal identifier in the aforementioned target terminal identifier set as the target construction terminal equipment set.

[0064] The second step involves, for each target construction terminal device in the aforementioned target construction terminal device set, performing an identifier conversion process on the failure version identifiers associated with the aforementioned target construction terminal device in the aforementioned failure version identifier set, to obtain a failure cache identifier group. The failure version identifier associated with the aforementioned target construction terminal device can be the failure version identifier of the node whose belonging process data identifier is the identifier of the node bound to the aforementioned target construction terminal device. In practice, the aforementioned executing entity can, for each target construction terminal device in the aforementioned target construction terminal device set, first filter out target binding records from the aforementioned target binding record set whose terminal identifiers are the same as the terminal identifiers of the aforementioned target construction terminal devices, thus obtaining a current binding record group. Then, determine the process data identifiers included in each target binding record within the aforementioned current binding record group as the current attribution identifier group. Next, filter out failed version identifiers from the aforementioned failed version identifier set whose attribution process data identifiers are included in the aforementioned current attribution identifier group, thus obtaining an associated failed version identifier group. Finally, for each associated failed version identifier within the aforementioned associated failed version identifier group, using colons as separators, concatenate the cache identifier prefix included in the aforementioned current binding record group, the attribution process data identifier included in the aforementioned associated failed version identifier, the source process data identifier included in the aforementioned associated failed version identifier, the field name included in the aforementioned associated failed version identifier, and the stored content version identifier included in the aforementioned associated failed version identifier in sequence to obtain a failed cache identifier. All target binding records within the aforementioned current binding record group have the same cache identifier prefix.

[0065] Step 108: Generate an update control instruction set based on the issued data unit set and the invalid cache identifier set, and perform process data update control on the target construction terminal equipment set based on the update control instruction set.

[0066] In some embodiments, the executing entity can generate an update control instruction set based on the issued data unit set and the invalid cache identifier set, and perform process data update control on the target construction terminal equipment set according to the update control instruction set. The update control instructions in the update control instruction set can be structured data packets used to instruct a target construction terminal equipment to update its locally stored process data. The update control instructions can include: a terminal identifier, a write data unit group, and an invalid cache identifier group. The write data unit group includes write data units that are issued data units from the issued data unit set, belonging to the node bound to the target construction terminal equipment whose process data identifier is the terminal identifier. Each update control instruction in the update control instruction set corresponds one-to-one with each target construction terminal equipment in the target construction terminal equipment set. The process data update control can include at least one of the following: writing the issued data unit set to the local storage of the target construction terminal equipment set; deleting the process data record corresponding to the invalid cache identifier set in the local storage of the target construction terminal equipment set; and releasing the cache space associated with the process data record in the local storage of the target construction terminal equipment set. The aforementioned process data records can be records in the local storage of the construction terminal equipment, using a cache identifier as the key and a content item as the value. The aforementioned cache space can be the storage space in the local storage of the construction terminal equipment used to store the aforementioned process data records. In practice, the aforementioned execution entity can first, for each target construction terminal equipment in the aforementioned target construction terminal equipment set, filter out the data units whose belonging process data identifiers are included in the current belonging identifier group corresponding to the aforementioned target construction terminal equipment from the aforementioned data unit set, obtaining a write data unit group. Then, the terminal identifier of the aforementioned target construction terminal equipment, the aforementioned write data unit group, and the aforementioned expired cache identifier group corresponding to the aforementioned target construction terminal equipment are determined as update control instructions. Next, for each update control instruction in the aforementioned update control instruction set, the update control instruction is serialized according to the Protocol Buffers serialization format to obtain an instruction byte sequence. Then, through the MQTT protocol publishing interface, the aforementioned instruction byte sequence is published to the topic corresponding to the terminal identifier included in the aforementioned update control instruction, so that the target construction terminal equipment corresponding to the aforementioned terminal identifier updates its locally stored process data. Finally, the modified process dataset and the content version identifier group set are written into the data table where the stored process dataset is located. The process data identifier and field name of each written data unit included in the written data unit group are added to the issued record information. The issued ownership identifier corresponding to each invalid cache identifier included in the invalid cache identifier group is removed from the issued record information.The aforementioned target construction terminal equipment can use the SQLite database engine to update its locally stored process data. The target construction terminal equipment can first concatenate the following components sequentially, using colons as separators: the target construction terminal equipment's cache identifier prefix, the belonging process data identifier included in the written data unit, the source process data identifier included in the written data unit, the field names included in the written data unit, and a digest of the field content included in the written data unit. This concatenation yields a write cache identifier. This write cache identifier, along with the display position identifier and field content included in the written data unit, is then written to its local storage to obtain a process data record. The digest can be a fixed-length string obtained by using the SHA-256 digest algorithm to digest the field content serialized according to the aforementioned preset serialization format. Write data units excluding field content can be used only to update the display position identifier in their corresponding process data record.

[0067] The above embodiments of this disclosure have the following beneficial effects: The process data update control method for construction terminal equipment in some embodiments of this disclosure can reduce the amount of data transmission between the server and the construction terminal equipment, reduce the waste of network transmission resources, and reduce the operating power consumption of the construction terminal equipment. Specifically, the reason for the increase in the amount of data transmission between the server and the construction terminal equipment and the waste of network transmission resources is that when the process data changes, the determination result of whether the process data has changed based on the entire content of the process data cannot distinguish whether the content required by each construction terminal equipment has changed. This results in all construction terminal equipment receiving the process data being issued the above-mentioned update content. Among them, the content stored locally by the construction terminal equipment whose required content has not changed remains unchanged after receiving the above-mentioned update content, leading to an increase in the amount of data transmission between the server and the construction terminal equipment and a waste of network transmission resources. Based on this, the process data update control method for construction terminal equipment in some embodiments of this disclosure can first, in response to receiving process data change information for the set of construction terminal equipment, obtain the stored process dataset and terminal binding relationship information. Here, the above-mentioned stored process dataset provides a data basis for subsequent incremental merging processing and bilateral difference extraction processing, and the above-mentioned terminal binding relationship information provides a data basis for subsequent association matching processing. Secondly, based on the stored process dataset, incremental merging of the process data change information is performed to obtain the modified process dataset. Here, process data change information carrying only the changed fields is restored to include the complete content of each field, allowing subsequent conversion processing to be performed field-by-field on the complete content of each process data, reducing the possibility of incorrectly identifying unchanged fields as changed due to incomplete process data change information. Thirdly, the modified process dataset is converted to obtain a content version identifier set. Here, the content of each field is converted into a fixed-length content version identifier, allowing content changes to be determined field-by-field, rather than based on the entire process data, and the amount of data required for comparison does not increase with the length of the field content. Next, based on the content version identifier set, cross-reference propagation processing is performed on the stored process dataset to obtain a target node information set. Here, content changes are perceived layer by layer as they propagate upwards along the reference relationship, ensuring that nodes whose own content has not changed but whose referenced content has changed are also included in the target node information set, reducing the possibility of failure to distribute data as required, thus necessitating the re-distribution of all process data for correction. Subsequently, based on the aforementioned target node information set, the modified process dataset is subjected to hierarchical association projection processing to obtain the process data unit set.Here, the required field range for each node is derived node-by-node from its position in the aforementioned hierarchical structure. This allows the same process data to be split into process data units with different content for different nodes, providing the same granularity for subsequent two-sided difference extraction processing, consistent with the content required by each construction terminal device. Then, based on the stored process dataset and the content version identifier set, two-sided difference extraction processing is performed on the process data unit set to obtain the distribution data unit set and the invalid version identifier set. Here, at the granularity of the process data unit, a single comparison yields both the distribution data unit set and the invalid version identifier set. Process data units whose content and position have not changed are not included in either set, while process data units whose position has changed but whose content has not changed are only included in the distribution data unit set without carrying any field content. Subsequently, based on the invalid version identifier set and the target node information set, the terminal binding relationship information is matched to obtain the target construction terminal device set and the invalid cache identifier set. Here, the aforementioned set of invalid version identifiers is converged to the invalid cache identifier group of each target construction terminal device, making the cleanup target precise to a single cache entry of a single construction terminal device, reducing the need to issue instructions to construction terminal devices whose required content has not changed. Finally, based on the aforementioned set of issued data units and the aforementioned set of invalid cache identifier groups, an update control instruction set is generated, and based on the aforementioned update control instruction set, the aforementioned set of target construction terminal devices is subjected to process data update control. Here, only construction terminal devices whose required content has changed are issued the changed content and their invalid cache entries are cleaned; construction terminal devices whose required content has not changed no longer receive update content, reducing the amount of data transmission between the server and the construction terminal devices, reducing network transmission resource waste, reducing the number of writes to the local storage of the construction terminal devices, and reducing the operating power consumption of the construction terminal devices. Therefore, this process data update control method for construction terminal devices can reduce the amount of data transmission between the server and the construction terminal devices, reduce network transmission resource waste, and reduce the operating power consumption of the construction terminal devices.

[0068] Further reference Figure 2 As an implementation of the methods shown in the above figures, this disclosure provides some embodiments of a process data update control device for construction terminal equipment. These device embodiments are similar to... Figure 1 Corresponding to the method embodiments shown, the process data update control device for construction terminal equipment can be specifically applied to various electronic devices.

[0069] like Figure 2As shown, a process data update control device 200 for construction terminal equipment includes: an acquisition unit 201, a merging unit 202, a conversion unit 203, a propagation unit 204, a projection unit 205, an extraction unit 206, a matching unit 207, and a control unit 208. The acquisition unit 201 is configured to: in response to receiving process data change information for a set of construction terminal equipment, acquire a stored process dataset and terminal binding relationship information. The merging unit 202 is configured to: perform incremental merging processing on the process data change information based on the stored process dataset to obtain a changed process dataset. The conversion unit 203 is configured to: perform conversion processing on the changed process dataset to obtain a content version identifier set. The propagation unit 204 is configured to: perform cross-reference propagation processing on the stored process dataset based on the content version identifier set to obtain a target node information set. The projection unit 205 is configured to: perform hierarchical association projection processing on the changed process dataset based on the target node information set to obtain a process data unit set. Extraction unit 206 is configured to: perform bilateral difference extraction processing on the above-mentioned process data unit set based on the above-mentioned stored process dataset and the above-mentioned content version identifier set, to obtain the issued data unit set and the failed version identifier set. Matching unit 207 is configured to: perform association matching processing on the above-mentioned terminal binding relationship information based on the above-mentioned failed version identifier set and the above-mentioned target node information set, to obtain the target construction terminal equipment set and the failed cache identifier set. Control unit 208 is configured to: generate an update control instruction set based on the above-mentioned issued data unit set and the above-mentioned failed cache identifier set, and perform process data update control on the above-mentioned target construction terminal equipment set based on the above-mentioned update control instruction set.

[0070] It is understandable that the units recorded in the process data update control device 200 for construction terminal equipment are related to the reference. Figure 1 The steps in the described method correspond to each other. Therefore, the operations, features, and beneficial effects described above for the method also apply to the process data update control device 200 for construction terminal equipment and the units contained therein, and will not be repeated here.

[0071] The following is for reference. Figure 3 It shows a schematic diagram of the structure of an electronic device (e.g., an electronic device) 300 suitable for implementing some embodiments of the present disclosure. Figure 3 The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of the embodiments of this disclosure.

[0072] like Figure 3As shown, the electronic device 300 may include a processing unit (e.g., a central processing unit, a graphics processing unit, etc.) 301, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 302 or a program loaded from a storage device 308 into a random access memory (RAM) 303. The RAM 303 also stores various programs and data required for the operation of the electronic device 300. The processing unit 301, ROM 302, and RAM 303 are interconnected via a bus 304. An input / output (I / O) interface 305 is also connected to the bus 304.

[0073] Typically, the following devices can be connected to I / O interface 305: input devices 306 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 307 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices 308 including, for example, magnetic tapes, hard disks, etc.; and communication devices 309. Communication device 309 allows electronic device 300 to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 3 An electronic device 300 with various devices is shown; however, it should be understood that it is not required to implement or possess all of the devices shown. More or fewer devices may be implemented or possessed alternatively. Figure 3 Each box shown can represent a device or multiple devices as needed.

[0074] In particular, according to some embodiments of this disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, some embodiments of this disclosure include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication device 309, or installed from storage device 308, or installed from ROM 302. When the computer program is executed by processing device 301, it performs the functions defined in the methods of some embodiments of this disclosure.

[0075] It should be noted that, in some embodiments of this disclosure, the computer-readable medium described above may be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium may be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In some embodiments of this disclosure, a computer-readable storage medium may 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. In some embodiments of this disclosure, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wires, optical fibers, RF (radio frequency), etc., or any suitable combination thereof.

[0076] In some implementations, clients and servers can communicate using any currently known or future-developed network protocol such as HTTP (Hypertext Transfer Protocol) and can interconnect with digital data communication (e.g., communication networks) of any form or medium. Examples of communication networks include local area networks (“LANs”), wide area networks (“WANs”), the Internet (e.g., the Internet of Things), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future-developed networks.

[0077] The aforementioned computer-readable medium may be included in the aforementioned electronic device; or it may exist independently and not assembled into the electronic device. The aforementioned computer-readable medium carries one or more programs, which, when executed by the electronic device, cause the electronic device to: in response to receiving process data change information for a set of construction terminal devices, acquire a stored process dataset and terminal binding relationship information; perform incremental merging processing on the process data change information based on the stored process dataset to obtain a changed process dataset; perform conversion processing on the changed process dataset to obtain a content version identifier set; perform cross-reference propagation processing on the stored process dataset based on the content version identifier set to obtain a target node information set; and perform cross-reference propagation processing on the stored process dataset based on the target node information set. The modified process dataset is subjected to hierarchical association projection processing to obtain a process data unit set; based on the stored process dataset and the content version identifier set, the process data unit set is subjected to bilateral difference extraction processing to obtain a distributed data unit set and a failed version identifier set; based on the failed version identifier set and the target node information set, the terminal binding relationship information is subjected to association matching processing to obtain a target construction terminal equipment set and a failed cache identifier set; based on the distributed data unit set and the failed cache identifier set, an update control instruction set is generated, and process data update control is performed on the target construction terminal equipment set based on the update control instruction set.

[0078] Computer program code for performing operations of some embodiments of this disclosure 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 the "C" language or similar programming 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 a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0079] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. 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, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0080] The units described in some embodiments of this disclosure can be implemented in software or in hardware. The described units can also be located in a processor.

[0081] The functions described above in this document can be performed at least in part by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, include: field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), system-on-a-chip (SoCs), complex programmable logic devices (CPLDs), and so on.

[0082] The above description is merely a selection of preferred embodiments of this disclosure and an explanation of the technical principles employed. Those skilled in the art should understand that the scope of the invention involved in the embodiments of this disclosure is not limited to technical solutions formed by specific combinations of the above-described technical features, but should also cover other technical solutions formed by arbitrary combinations of the above-described technical features or their equivalents without departing from the above-described inventive concept. For example, technical solutions formed by substituting the above-described features with (but not limited to) technical features with similar functions disclosed in the embodiments of this disclosure.

Claims

1. A method for updating and controlling process data for construction terminal equipment, comprising: In response to receiving process data change information for the construction terminal equipment set, obtain the stored process data set and terminal binding relationship information; Based on the stored process dataset, the process data change information is incrementally merged to obtain the changed process dataset; The modified process dataset is transformed to obtain a content version identifier set; Based on the content version identifier set, cross-reference propagation processing is performed on the stored process dataset to obtain the target node information set; Based on the target node information set, the modified process dataset is subjected to hierarchical association projection processing to obtain a process data unit set; Based on the stored process dataset and the content version identifier set, perform bilateral difference extraction on the process data unit set to obtain the distribution data unit set and the failed version identifier set. Based on the set of failed version identifiers and the set of target node information, the terminal binding relationship information is matched to obtain the target construction terminal equipment set and the set of failed cache identifiers. Based on the issued data unit set and the invalid cache identifier set, an update control instruction set is generated, and based on the update control instruction set, process data update control is performed on the target construction terminal equipment set.

2. The method according to claim 1, wherein, The process data update control includes at least one of the following: writing the issued data unit set into the local storage of the target construction terminal equipment set, deleting the process data record corresponding to the invalid cache identifier set in the local storage of the target construction terminal equipment set, and releasing the cache space associated with the process data record in the local storage of the target construction terminal equipment set.

3. The method according to claim 1, wherein, The step of incrementally merging the process data change information based on the stored process dataset to obtain the changed process dataset includes: Based on the process data change information and the stored process dataset, generate a content information set to be merged and a new process dataset; For each piece of content information to be merged in the set of content information to be merged, the above-mentioned content information to be merged is merged into the stored process data in the stored process data set that corresponds to the above-mentioned content information to be merged, so as to obtain the merged process data. Based on the merged process dataset and the newly added process dataset, the stored process dataset is updated to obtain the modified process dataset.

4. The method according to claim 1, wherein, The transformation process of the modified process dataset to obtain a content version identifier set includes: For each modified process data in the modified process dataset, perform the following transformation steps: According to the preset serialization format, the fields included in the above-mentioned modified process data are serialized to obtain a standardized content sequence group; The above-mentioned standardized content sequence group is subjected to a summary conversion process to obtain the content version identifier group.

5. The method according to claim 1, wherein, The step of performing hierarchical association projection processing on the modified process dataset based on the target node information set to obtain a process data unit set includes: The target node information set is subjected to hierarchical subordinate parsing to obtain the upstream node information set; Based on the target node information set, the modified process dataset is subjected to full-field projection processing to obtain the first process data unit set; Based on the upstream node information set, the modified process dataset is subjected to identifier field projection processing to obtain the second process data unit set; The first process data unit set and the second process data unit set are determined as the process data unit set.

6. The method according to claim 1, wherein, The step of performing association matching processing on the terminal binding relationship information based on the failed version identifier set and the target node information set to obtain the target construction terminal equipment set and the failed cache identifier group set includes: Based on the target node information set, the terminal binding relationship information is subjected to identifier matching processing to obtain the target construction terminal equipment set; For each target construction terminal device in the target construction terminal device set, the failure version identifiers associated with the aforementioned target construction terminal devices in the failure version identifier set are subjected to identifier conversion processing to obtain a failure cache identifier group.

7. A process data update control device for construction terminal equipment, comprising: The acquisition unit is configured to acquire the stored process dataset and terminal binding relationship information in response to receiving process data change information for the construction terminal equipment set; The merging unit is configured to perform incremental merging processing on the process data change information based on the stored process dataset to obtain the changed process dataset; The conversion unit is configured to convert the modified process dataset to obtain a content version identifier set. The propagation unit is configured to perform cross-reference propagation processing on the stored process dataset based on the content version identifier set to obtain the target node information set. The projection unit is configured to perform hierarchical association projection processing on the modified process dataset based on the target node information set to obtain a process data unit set; The extraction unit is configured to perform bilateral difference extraction processing on the process data unit set based on the stored process dataset and the content version identifier set to obtain the distribution data unit set and the invalid version identifier set. The matching unit is configured to perform association matching processing on the terminal binding relationship information based on the failed version identifier set and the target node information set to obtain the target construction terminal equipment set and the failed cache identifier set; The control unit is configured to generate an update control instruction set based on the issued data unit set and the invalid cache identifier set, and to perform process data update control on the target construction terminal equipment set based on the update control instruction set.

8. An electronic device, comprising: One or more processors; Storage device, on which one or more programs are stored, When the one or more programs are executed by the one or more processors, the one or more processors implement the method as described in any one of claims 1-6.

9. A computer-readable medium having a computer program stored thereon, wherein, When the computer program is executed by a processor, it implements the method as described in any one of claims 1-6.