A Smart Park Visual Management and Control System and Method Based on High-Concurrency Processing

By employing homomorphic encryption technology in the smart park visualization management system, semantic similarity can be calculated within the ciphertext space. This solves the problems of privacy and security risks and high-concurrency processing complexity in the metadata alignment process, and achieves efficient and secure data stream transformation and visualization.

CN123122876APending Publication Date: 2026-11-17GCSOFT CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611175272.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-08-04
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Existing metadata alignment technologies require exposing the plaintext logic of the original semantics during the alignment process, which can easily lead to serious privacy and security risks. Furthermore, they have high computational complexity in high-concurrency processing, making it difficult to guarantee data privacy and processing efficiency.

Method used

The smart park visualization management and control system adopts high-concurrency processing. It performs data matching operations in the ciphertext space through homomorphic encryption technology, calculates semantic similarity by using the homomorphic properties of scalar multiplication and addition, performs business domain coarse screening and extraction at the edge computing end, and performs ciphertext aggregation and display on the server side to ensure that data privacy is not leaked.

Benefits of technology

Calculating semantic similarity without decryption reduces the computation time complexity of ciphertext, protects data privacy, and enables efficient data stream transformation and visualization at the second-level streaming processing level.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123122876A_ABST
    Figure CN123122876A_ABST
Patent Text Reader

Abstract

This invention provides a smart park visualization management system and method based on high-concurrency processing, belonging to the field of computer data processing technology. It aims to achieve real-time, secure, and standardized governance of business data streams without exposing the semantics of the original metadata. By introducing an encryption mechanism, the server-side can directly calculate the ciphertext score representing semantic similarity within the ciphertext space without any decryption operations, using only the homomorphic properties of scalar multiplication and addition. This prevents the leakage of sensitive original business data. The edge computing end performs coarse screening of the business domain using a first retrieval identifier, defining a preset candidate range, effectively reducing the time complexity of ciphertext computation. While ensuring that the core semantics of multi-source heterogeneous data are not stolen, this invention provides a solid engineering feasibility guarantee for the server-side to handle high-concurrency, second-level stream processing business.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of computer data processing technology, and in particular to a smart park visualization management and control system and method based on high-concurrency processing. Background Technology

[0002] To actively respond to the development of digital transformation, explore the value of digital assets, promote the transformation of digital governance methods in the park, and facilitate the deep integration and application of traditional industries with digitalization, the park aims to drive innovation through data-led development. By constructing a smart park visualization platform, the park seeks to improve management and service efficiency, promote enterprise software digitalization reform, and establish a comprehensive, dynamically monitored, and highly efficient park operation system. As enterprise informatization deepens, the data platform of smart parks has become a core hub for aggregating and integrating data assets from multiple subsystems. In this process, operational data, as the basic label describing data attributes, structure, and business meaning, serves as the logical foundation for achieving automated identification, standardized mapping, and real-time cleaning and distribution of heterogeneous data, directly determining the data platform's governance efficiency for massive amounts of business information. Existing metadata alignment technologies typically require each business subsystem to periodically upload the collected raw metadata tags to the data platform via an encrypted channel. Metadata itself often carries extremely high business sensitivity, and existing technical solutions usually need to expose the plaintext logic of the original semantics during the alignment process, which can easily lead to serious privacy and security risks, and there is room for improvement. Summary of the Invention

[0003] This invention provides a smart park visualization management and control system and method based on high-concurrency processing, which enables real-time and secure standardized governance of business data streams without exposing the original metadata semantics.

[0004] To achieve the above objectives, the present invention adopts the following technical solution: Firstly, a smart park visualization management and control method based on high-concurrency processing is provided, applied to the server side, wherein the server side is connected to the edge computing terminals of multiple subsystems, including the following steps: Acquire a data processing session sent from the edge computing terminal, wherein the data processing session is used to perform a data matching operation on the running data of the subsystem corresponding to the edge computing terminal; According to the computation required to perform the data matching operation, the data matching operation is performed on the first ciphertext feature of the subsystem's running data corresponding to the computation, wherein the first ciphertext feature is obtained by the edge computing end encrypting the plaintext feature vector of the subsystem's running data using the homomorphic operation corresponding to the data matching operation; A processing response carrying a second ciphertext feature is generated and sent to the edge computing terminal. The second ciphertext feature is the ciphertext matching result of multiple matching similarity scores of the data matching operation, so that the edge computing terminal can use its private key to decrypt and determine the corresponding target matching object identifier, and establish a mapping and conversion rule between the running data and the target matching object identifier. The system continuously receives the third ciphertext feature sent by the edge computing terminal based on the mapping and transformation rules, and inputs the third ciphertext feature into the stream processing engine for real-time aggregation and index calculation for visualization; wherein, the third ciphertext feature is data that has been stripped of plaintext data and has the target matching object identifier and ciphertext value attached.

[0005] Optionally, the first encrypted feature of the running data of the subsystem corresponding to the operation performs a data matching operation to obtain a second encrypted feature of multiple encrypted matching results with similarity scores, including: The data processing session is parsed to extract the first retrieval identifier. The first retrieval identifier is a plaintext label extracted by the edge computing terminal for business domain coarse screening of the running data. Based on the first retrieval identifier, the local standardized ontology library is searched and filtered to extract a subset of standard ontology feature vectors that match the first retrieval identifier. For each plaintext standard ontology feature vector in the subset of standard ontology feature vectors, calculate its ciphertext inner product with the first ciphertext feature to obtain the matching similarity score corresponding to the candidate standard ontology. The candidate standard ontology identifiers and their corresponding matching similarity scores within the subset are combined and packaged to generate the encrypted matching results.

[0006] Optionally, the localized standardized ontology library includes multiple standard ontology mapping entries. The standard ontology mapping entries include standard ontology identifiers for characterizing device data attributes, plaintext standard ontology feature vectors for characterizing the vector position of the standard ontology in the semantic space, and business domain coarse-screen plaintext tags for retrieval. The plaintext standard ontology feature vectors have the same extraction dimension as the plaintext feature vectors generated by the edge computing terminal.

[0007] Optionally, for each plaintext standard ontology feature vector in the subset of standard ontology feature vectors, the ciphertext inner product of the plaintext feature vector with the first ciphertext feature is calculated to obtain the matching similarity score corresponding to the candidate standard ontology, including: For any target plaintext standard ontology feature vector in the subset, extract multiple feature components contained therein in sequence according to feature dimensions, use the feature components as the second plaintext vector, and extract multiple components of the corresponding dimension in the first ciphertext feature as the first ciphertext vector. Based on the scalar multiplication homomorphism preset for the operation required to perform data matching, the second plaintext vector and the first ciphertext vector in the same dimension are multiplied by ciphertext to obtain the third ciphertext product corresponding to that dimension. Based on the additive homomorphic property of the operation preset required for performing data matching, the multiple third ciphertext products generated under all feature dimensions are added together to generate a fourth ciphertext score that represents the semantic distance between the two, and the fourth ciphertext score is used as the matching similarity score of the target plaintext standard ontology feature vector.

[0008] Optionally, the second ciphertext feature is returned to the edge computing terminal so that the edge computing terminal can use its private key to decrypt and determine a unique target matching object identifier, and establish a mapping and conversion rule between the running data and the target matching object identifier, including: The encrypted matching result is sent to the edge computing terminal to trigger the edge computing terminal to execute a preset threshold judgment logic, decrypt the encrypted matching result and extract the highest similarity score. When the similarity score is greater than or equal to the preset confidence threshold, the corresponding standard ontology identifier is confirmed as the target matching object identifier.

[0009] Optionally, the first ciphertext feature, obtained by the edge computing terminal using a public key to homomorphically encrypt the plaintext feature vector extracted from the running data, further includes: When the edge computing terminal collects multiple operational data representing multiple heterogeneous subsystems within a preset first time window, it converts them into multiple plaintext feature vectors, and concatenates the multiple plaintext feature vectors to construct a plaintext feature matrix. The edge computing terminal uses a local public key to perform an overall encryption operation on the packaged plaintext feature matrix to generate the first ciphertext feature matrix.

[0010] Optionally, it also includes: The multiple plaintext feature vectors are concatenated dimensionally to construct a plaintext feature matrix, and the plaintext feature matrix is ​​then encrypted as a whole. Based on the frame rate length of the first time window, a plaintext polynomial ring space with N plaintext slots is predefined. After collecting the plaintext feature vectors of m heterogeneous subsystems, where m is less than or equal to n, the m independent plaintext feature vectors are encoded and mapped into the plaintext slots to obtain the packaged plaintext feature matrix. Calculate the homomorphic matrix product of the first ciphertext feature matrix and the standard ontology plaintext matrix, and aggregate them to generate a second ciphertext feature that represents the semantic similarity scores of multiple heterogeneous subsystems.

[0011] Optionally, it also includes: Extract the ciphertext matrix from the first ciphertext features, and construct the plaintext standard ontology feature vector subset extracted from the local standardized ontology library into a standard ontology plaintext matrix according to a preset dimension; Based on the homomorphic properties of matrix multiplication and addition in homomorphic encryption, while keeping the first ciphertext feature matrix as ciphertext, the homomorphic matrix product of the first ciphertext feature matrix and the plaintext matrix of the standard ontology is calculated, and the second ciphertext feature is aggregated to generate a second ciphertext feature that represents the semantic similarity scores of multiple heterogeneous subsystems. The second ciphertext feature is used as the ciphertext matching result and returned to the edge computing end in parallel at the second time, so that the edge computing end can use the private key to decrypt and split the second ciphertext feature as a whole, thereby establishing multiple mapping and transformation rules between the running data and the corresponding target benchmark identifier in parallel.

[0012] Secondly, a smart park visualization management and control system based on high-concurrency processing is provided, applied to the server side, wherein the server side is connected to multiple edge computing terminals, and the system includes: The query acquisition module is used to acquire the data processing session sent by the edge computing terminal. The data processing session includes a first retrieval identifier and a first ciphertext feature. The first ciphertext feature is obtained by the edge computing terminal using a public key to homomorphically encrypt the plaintext feature vector extracted from the running data. The ciphertext matching module is used to calculate the similarity between the first ciphertext feature and multiple preset standard ontology feature vectors, and generate a second ciphertext feature containing multiple ciphertext matching results with matching similarity scores. The mapping distribution module is used to return the second ciphertext feature to the edge computing terminal, so that the edge computing terminal can use its private key to decrypt and determine the unique target matching object identifier, and establish a mapping conversion rule between the running data and the target matching object identifier; The aggregation and display module is used to receive the third ciphertext feature sent by the edge computing terminal based on the mapping and transformation rules, and input the third ciphertext feature into the stream processing engine for real-time aggregation and index calculation for visualization display. The third ciphertext feature is data that has been stripped of plaintext data and has the target matching object identifier and ciphertext value attached.

[0013] Thirdly, an electronic device is provided, comprising: a processor and a memory; the memory is used to store a computer program, and when the processor executes the computer program, the electronic device performs the smart park visualization management system and method based on high-concurrency processing described in the first aspect.

[0014] In one possible design, the electronic device described in the third aspect may further include a transceiver. This transceiver may be a transceiver circuit or an interface circuit. The transceiver can be used for communication between the electronic device described in the third aspect and other electronic devices.

[0015] In the embodiments of the present invention, the electronic device described in the third aspect may be a terminal, or a chip (system) or other component or assembly disposed in the terminal, or a system containing the terminal.

[0016] Fourthly, a computer-readable storage medium is provided, comprising: a computer program or instructions; when the computer program or instructions are executed on a computer, the computer causes the computer to perform the smart park visualization management system and method based on high-concurrency processing described in the first aspect.

[0017] In summary, the above methods and systems have the following technical effects: This invention introduces an encryption mechanism, allowing the server to directly calculate the ciphertext score representing semantic similarity within the ciphertext space without any decryption, solely through the homomorphic properties of scalar multiplication and addition. This eliminates the leakage of sensitive original business data. The edge computing end performs coarse screening of the business domain using a first retrieval identifier, defining a preset candidate range and effectively reducing the time complexity of ciphertext computation. While ensuring that the core semantics of multi-source heterogeneous data are not stolen, this invention provides a solid engineering feasibility guarantee for the server to handle high-concurrency, second-level stream processing. A single ciphertext polynomial multiplication instruction executed by the server is equivalent to performing independent operations on multiple plaintext slots simultaneously, enabling even industrial edge environments with limited computing power to support the real-time ciphertext conversion of second-level concurrent data streams. Attached Figure Description

[0018] Figure 1 This is a flowchart illustrating the intelligent park visualization management and control method based on high-concurrency processing provided in an embodiment of the present invention. Detailed Implementation

[0019] The technical solution of the present invention will now be described with reference to the accompanying drawings.

[0020] In this embodiment of the invention, "instruction" can include direct and indirect instructions, as well as explicit and implicit instructions. The information indicated by a certain piece of information is called the information to be instructed. In specific implementation, there are many ways to instruct the information to be instructed, such as, but not limited to, directly instructing the information to be instructed, such as the information to be instructed itself or its index. It can also indirectly instruct the information to be instructed by instructing other information, where there is a correlation between the other information and the information to be instructed. It can also instruct only a part of the information to be instructed, while the other parts are known or pre-agreed upon. For example, the instruction of specific information can be achieved by using a pre-agreed (e.g., protocol-defined) arrangement of various pieces of information, thereby reducing instruction overhead to some extent. Simultaneously, common parts of various pieces of information can be identified and uniformly indicated to reduce the instruction overhead caused by individually indicating the same information.

[0021] Furthermore, the specific indication method can also be any existing indication method, such as, but not limited to, the above-mentioned indication methods and their various combinations. Specific details of various indication methods can be found in existing technologies, and will not be elaborated upon here. As described above, for example, when multiple pieces of information of the same type need to be indicated, the indication methods for different pieces of information may differ. In specific implementation, the required indication method can be selected according to specific needs. This embodiment of the invention does not limit the selected indication method; therefore, the indication methods involved in this embodiment of the invention should be understood to cover various methods that enable the party to be indicated to obtain the information to be indicated.

[0022] It should be understood that the information to be indicated can be sent as a whole or divided into multiple sub-information messages sent separately, and the sending period and / or timing of these sub-information messages can be the same or different. The specific sending method is not limited in this embodiment of the invention. The sending period and / or timing of these sub-information messages can be predefined, for example, according to a protocol, or configured by the sending device by sending configuration information to the receiving device.

[0023] "Predefined" or "pre-configured" can be achieved by pre-saving corresponding codes, tables, or other means that can be used to indicate relevant information in the device. This embodiment of the invention does not limit the specific implementation method. "Saving" can refer to saving in one or more memories. These memories can be separate installations or integrated into the encoder, decoder, processor, or electronic device. Alternatively, some memories can be separately installed, while others are integrated into the decoder, processor, or electronic device. The type of memory can be any form of storage medium, and this embodiment of the invention does not limit this.

[0024] In the embodiments of this invention, the “protocol” may refer to a protocol family in the field of communication, a standard protocol with a similar protocol family frame structure, or a related protocol applied to a future smart park visualization management and control system and method system based on high concurrency processing. The embodiments of this invention do not specifically limit this.

[0025] In this embodiment of the invention, descriptions such as "when," "under the circumstances," "if," and "if" all refer to the device making corresponding processing under certain objective circumstances, and are not limited to a specific time. They do not require the device to make a judgment action during implementation, nor do they imply any other limitations.

[0026] In the description of the embodiments of the present invention, unless otherwise stated, " / " indicates that the objects before and after are in an "or" relationship. For example, A / B can represent A or B. "And / or" in the embodiments of the present invention is merely a description of the relationship between the related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone, where A and B can be singular or plural. Furthermore, in the description of the embodiments of the present invention, unless otherwise stated, "multiple" refers to two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple. Additionally, to facilitate a clear description of the technical solutions of the embodiments of the present invention, the terms "first" and "second" are used in the embodiments of the present invention to distinguish identical or similar items with essentially the same function and effect. Those skilled in the art will understand that the terms "first," "second," etc., do not limit the quantity or order of execution, and that "first," "second," etc., are not necessarily different. Furthermore, in the embodiments of this invention, words such as "exemplary" or "for example" are used to indicate that something is being described as an example, illustration, or description. Any embodiment or design scheme described as "exemplary" or "for example" in the embodiments of this invention should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner for ease of understanding.

[0027] The network architecture and business scenarios described in the embodiments of this invention are for the purpose of more clearly illustrating the technical solutions of the embodiments of this invention, and do not constitute a limitation on the technical solutions provided by the embodiments of this invention. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of this invention are also applicable to similar technical problems.

[0028] In order to actively respond to the development of digital transformation, explore the value of digital assets, promote the transformation of digital governance methods in the park, promote the deep integration and application of traditional industries and digitalization, drive innovation with data, and improve the management and service efficiency of the smart park through the construction of a smart park visualization platform, promote the digital reform of enterprise software, and form a park operation system with comprehensive perception, dynamic monitoring and efficient operation. As enterprise informatization deepens, the data platform of smart parks has become a core hub for aggregating and integrating data assets from multiple subsystems. In this process, operational data, as the basic label describing data attributes, structure, and business meaning, serves as the logical foundation for achieving automated identification, standardized mapping, and real-time cleaning and distribution of heterogeneous data, directly determining the data platform's governance efficiency for massive amounts of business information. Existing metadata alignment technologies typically require each business subsystem to periodically upload the collected raw metadata tags to the data platform via an encrypted channel. The platform's management node then decrypts and matches the metadata within a specific processing range based on predefined static business rules or traditional batch mapping schemes. This associates and maps non-standard metadata from external systems with the platform's internal standard system. Metadata itself often carries extremely high business sensitivity, and existing technical solutions usually need to expose the plaintext logic of the original semantics during the alignment process, which can easily lead to serious privacy and security risks, leaving room for improvement.

[0029] This invention improves the management and service efficiency of smart parks by building a smart park visualization platform, forming a park operation system with comprehensive perception, dynamic monitoring, and efficient operation.

[0030] A smart park visualization management and control method based on high-concurrency processing, applied to the server side, wherein the server side is connected to multiple edge computing terminals, may specifically include the following steps: S101. Obtain a data processing session sent from the edge computing terminal, wherein the data processing session is used to perform a data matching operation on the running data of the subsystem corresponding to the edge computing terminal; S102. According to the operation required to perform the data matching operation, perform the data matching operation on the first ciphertext feature of the subsystem's running data corresponding to the operation, wherein the first ciphertext feature is obtained by the edge computing end encrypting the plaintext feature vector of the subsystem's running data using the homomorphic operation corresponding to the data matching operation. S103. Generate and send a processing response carrying a second ciphertext feature to the edge computing terminal, wherein the second ciphertext feature is the ciphertext matching result of multiple matching similarity scores of performing data matching operation, so that the edge computing terminal can use its private key to decrypt and determine the corresponding target matching object identifier, and establish a mapping conversion rule between the running data and the target matching object identifier. S104. Continuously receive the third ciphertext feature sent by the edge computing terminal based on the mapping transformation rule, and input the third ciphertext feature into the stream processing engine for real-time aggregation and index calculation for visualization; wherein, the third ciphertext feature is data that has been stripped of plaintext data and has the target matching object identifier and ciphertext value attached.

[0031] Specifically: The core of homomorphic encryption is homomorphic addition: That is, the sum of the ciphertext and the plaintext are equal to the sum of the plaintext and the ciphertext is not revealed.

[0032] Scalar multiplication: That is, the plaintext constant multiplied by the ciphertext equals the ciphertext obtained by multiplying the plaintext and does not reveal the secret A.

[0033] For example: The edge computing terminal generates a encrypted request. Assume the edge gateway in the stamping workshop extracts unknown business fields (such as "phase A") via NLP. The semantics of "" were used to generate a simple 3D plaintext semantic feature vector. ; The edge computing device generates a key pair locally: a public key pk and a private key sk. The edge gateway uses the public key pk as a vector. Each dimension is encrypted independently: The edge gateway will generate the ciphertext vector The key and public key are sent together to the data platform. At this point, the server only receives a bunch of gibberish and cannot deduce the three original feature values ​​2, 5, and 1. The server performs blind inner product calculation on the encrypted text, and the server-side standardized ontology library matches the plaintext vectors of two national standard fields: Standard body 1 (representing "voltage") 伏特 (): ; Standard Body 2 (representing "current") 峰值 (): ; The server-side goal is to compute. The vector inner product (the larger the inner product, the more semantically similar), meaning the server does not need to decrypt and can directly use homomorphic properties to perform cross operations: First, calculate the ciphertext score with standard ontology 1: the server performs a vector dot product operation to convert the plaintext score to the ciphertext score. With ciphertext Multiply the corresponding dimensions and then add them together: ; Due to the properties of scalar multiplication, this is equivalent to: ; Using the properties of homomorphic addition, this is further equivalent to: ; Calculate the ciphertext score with standard ontology 2: Similarly, the middle platform compares the plaintext v2 with the ciphertext v2. Based on the calculation, Enc(27) was obtained, and the server calculated... and These are the two encrypted results, but the middleware does not have the private key sk, so it does not know whether it has calculated 2 or 27. The result is returned and decrypted at the edge computing end. The server then packages the two ciphertext scores and returns them to the edge computing end. ; After receiving the data, the edge computing terminal decrypts it using the private key sk to obtain the plaintext result: The local logic at the edge computing end immediately makes a judgment: (2) Therefore, the edge computing terminal confirms the local "A phase". Semantically, it belongs to the "Standard Ontology 2 (Current)" of the middle platform. 峰值 The algorithm achieves high-precision alignment without revealing plaintext semantics throughout the entire process. It also generates mapping and transformation rules for the corresponding data locally and outputs the target matching object identifier for the rules. During subsequent transmission, the target matching object identifier and the corresponding data are directly identified. Even if the data is hijacked, only garbled characters of the target matching object identifier can be obtained.

[0034] Performing a data matching operation on the first encrypted feature of the running data of the subsystem corresponding to the operation, and obtaining a second encrypted feature of multiple encrypted matching results with similarity scores, includes: The data processing session is parsed to extract the first retrieval identifier. The first retrieval identifier is a plaintext label extracted by the edge computing terminal for business domain coarse screening of the running data. Based on the first retrieval identifier, the local standardized ontology library is searched and filtered to extract a subset of standard ontology feature vectors that match the first retrieval identifier. For each plaintext standard ontology feature vector in the subset of standard ontology feature vectors, calculate its ciphertext inner product with the first ciphertext feature to obtain the matching similarity score corresponding to the candidate standard ontology. The candidate standard ontology identifiers and their corresponding matching similarity scores within the subset are combined and packaged to generate the encrypted matching results.

[0035] Specifically: The server first obtains the data processing session sent by the edge computing terminal. In order to avoid excessive computing power overhead when matching massive graph nodes with fully homomorphic encryption, this embodiment introduces a two-stage retrieval architecture of coarse-grained plaintext tags and fine-grained ciphertext vectors.

[0036] Specifically, the data processing session includes a first retrieval identifier and a first ciphertext feature. The first retrieval identifier is a plaintext label extracted by the edge computing end from the running data through business domain coarse screening. The edge computing end uses a pre-generated public key pk to homomorphically encrypt the plaintext feature vector extracted from the running data (such as semantic features extracted through NLP models) to generate the first ciphertext feature and send it to the data platform. This process reduces the time complexity of ciphertext retrieval and provides engineering feasibility for second-level stream processing.

[0037] Specifically: In step S104, after the mapping and transformation rules are established, the server continuously receives the third encrypted feature sent by the edge computing terminal. The third encrypted feature is data that has been stripped of plaintext data and only carries the target matching object identifier and encrypted value. The server securely inputs this data into the stream processing engine for real-time aggregation and index calculation, and finally outputs it to the front end for the visualization and dynamic monitoring and display of the smart park.

[0038] The localized standardized ontology library includes multiple standard ontology mapping entries. Each standard ontology mapping entry includes a standard ontology identifier for characterizing device data attributes, a plaintext standard ontology feature vector for characterizing the vector position of the standard ontology in the semantic space, and a business domain coarse-screen plaintext label for retrieval. The plaintext standard ontology feature vector has the same extraction dimension as the plaintext feature vector generated by the edge computing terminal.

[0039] Specifically, in this embodiment of the invention, a local standardized ontology library is deployed on the server side to eliminate data silos and semantic ambiguities among multiple heterogeneous subsystems (such as HVAC, security monitoring, access control gates, fire alarms, etc.) within a smart park. The local standardized ontology library stores multiple standard ontology mapping entries, each entry containing at least three dimensions of fields: The standard ontology identifier is a globally unique numeric or character code that represents a certain standardized equipment attribute within the park (for example, the identifier T_1F_A_001 is uniformly defined as "temperature sensor in area A on the first floor").

[0040] The plaintext standard ontology feature vector is a multidimensional floating-point number or integer array whose vector dimension is strictly aligned with the dimension of the "plaintext feature vector of the running data" generated by the edge computing end, and is used to characterize the position of the standard ontology in the semantic space or feature space.

[0041] The business domain coarse screening plaintext tags correspond to retrieval identifiers, which are used to identify the physical space (such as floor, area) or logical category (such as water system, electricity system) to which the standard ontology belongs, so as to perform dimensionality reduction filtering before performing ciphertext inner product operations and reduce the computing power overhead of homomorphic computation on the server.

[0042] When establishing a local standardized ontology library, data dictionaries, national standard BIM model data, and historical operation logs from equipment manufacturers of various subsystems in the smart park are collected as raw corpora. Natural language processing models (such as pre-trained BERT models or Word2Vec models) or time-series feature extraction algorithms are used to map the descriptive text about equipment type, data physical unit, and installation location in the above raw corpora into plaintext feature vectors of fixed dimensions. Corresponding standard ontology identifiers and business domain coarse-screened plaintext labels are assigned to the extracted plaintext feature vectors, and they are persistently stored in the storage medium on the server side in the form of key-value pairs or graph databases to form a complete local standardized ontology library. When constructing the local standardized ontology library, it is necessary to ensure that the dimensional composition, data sorting method, and data bit width of the extracted plaintext standard ontology feature vectors are consistent with the extraction logic of the plaintext feature vectors before the "first ciphertext feature" is generated by the edge computing end, so as to ensure that the ciphertext inner product operation results performed by the server side based on additive homomorphism and multiplicative homomorphism can reflect the semantic Euclidean distance or cosine similarity between the edge running data and the standard ontology.

[0043] The additive and multiplicative homomorphic properties based on homomorphic encryption are used to calculate the ciphertext inner product of each plaintext standard ontology feature vector in the subset of standard ontology feature vectors with the first ciphertext feature, respectively, to obtain the matching similarity score corresponding to the candidate standard ontology, including: For any target plaintext standard ontology feature vector in the subset, extract multiple feature components contained therein in sequence according to feature dimensions, use the feature components as the second plaintext vector, and extract multiple components of the corresponding dimension in the first ciphertext feature as the first ciphertext vector. Based on the preset homomorphic property of scalar multiplication, the second plaintext vector and the first ciphertext vector in the same dimension are multiplied by ciphertext to obtain the third ciphertext product corresponding to that dimension. Based on the preset additive homomorphic property, the multiple third ciphertext products generated under all feature dimensions are ciphertext-added to generate a fourth ciphertext score that represents the semantic distance between the two, and the fourth ciphertext score is used as the matching similarity score of the target plaintext standard ontology feature vector.

[0044] Specifically, let the encrypted feature vector uploaded by the edge computing terminal be... The pre-defined plaintext standard ontology feature vector on the server side is: .

[0045] The server performs a ciphertext inner product operation: ; Without performing any decryption operations, the ciphertext score representing semantic similarity is directly calculated in the ciphertext space. This mechanism enables high-dimensional natural language semantic similarity calculation to be completed efficiently in an environment with zero knowledge leakage.

[0046] The second ciphertext feature is returned to the edge computing terminal, so that the edge computing terminal can use its private key to decrypt it and determine a unique target matching object identifier. The mapping and conversion rules between the running data and the target matching object identifier are established, including: The encrypted matching result is sent to the edge computing terminal to trigger the edge computing terminal to execute a preset threshold judgment logic, decrypt the encrypted matching result and extract the highest similarity score. When the similarity score is greater than or equal to the preset confidence threshold, the corresponding standard ontology identifier is confirmed as the target matching object identifier.

[0047] The first ciphertext feature, obtained by homomorphically encrypting the plaintext feature vector extracted from the running data using the public key at the edge computing terminal, further includes: When the edge computing terminal collects multiple operational data representing multiple heterogeneous subsystems within a preset first time window, it converts them into multiple plaintext feature vectors, and concatenates the multiple plaintext feature vectors to construct a plaintext feature matrix. The edge computing terminal uses a local public key to perform an overall encryption operation on the packaged plaintext feature matrix to generate the first ciphertext feature matrix.

[0048] Also includes: The multiple plaintext feature vectors are concatenated dimensionally to construct a plaintext feature matrix, and the plaintext feature matrix is ​​then encrypted as a whole. Based on the frame rate length of the first time window, a plaintext polynomial ring space with N plaintext slots is predefined. After collecting the plaintext feature vectors of m heterogeneous subsystems, where m is less than or equal to n, the m independent plaintext feature vectors are encoded and mapped into the plaintext slots to obtain the packaged plaintext feature matrix. Calculate the homomorphic matrix product of the first ciphertext feature matrix and the standard ontology plaintext matrix, and aggregate them to generate a second ciphertext feature that represents the semantic similarity scores of multiple heterogeneous subsystems.

[0049] Specifically, in a preferred embodiment of the present invention, the process of generating the first ciphertext feature matrix using single instruction packing technology is implemented based on a fully homomorphic encryption scheme under a ring learning fault-tolerant mechanism.

[0050] The specific steps are as follows: 1. Plaintext slot allocation and encoding: The edge aggregation gateway (first node) predefines a plaintext polynomial ring space with N plaintext slots. The specific data processing and encoding steps are as follows: Scaling and discretization yield a plaintext feature floating-point vector of dimension m: Using scaling factor Magnify and round to obtain the scaled vector with precision preserved. .

[0051] Based on the canonical embedding inverse mapping of IFFT, the pre-defined Fast Discrete Fourier Transform (IFFT) module is invoked to map and transform the scaling vector into a plaintext polynomial with integer coefficients, using the scaling vector as the evaluation points on each conjugate complex root. .

[0052] Polynomial encryption, using public key pk to encrypt plaintext polynomials Perform overall encryption to generate the first ciphertext feature matrix. This step only performs one encryption operation, significantly reducing computational overhead. Subsequently, while maintaining the ciphertext state, the server calculates the homomorphic matrix product of the first ciphertext feature matrix and the standard ontology plaintext matrix. At this point, the underlying single ciphertext polynomial multiplication is equivalent to performing element-wise multiplication on the data in N plaintext slots simultaneously, thus compressing the time complexity. Furthermore, it also includes quickly determining the range of the standard ontology plaintext matrix by using multiple first retrieval identifiers corresponding to the first ciphertext feature matrix, and returning the aggregated second ciphertext features to the edge end for parallel decryption, thereby establishing multiple mapping and transformation rules for running data in parallel.

[0053] Extract the ciphertext matrix from the first ciphertext features, and construct the plaintext standard ontology feature vector subset extracted from the local standardized ontology library into a standard ontology plaintext matrix according to a preset dimension; Based on the homomorphic properties of matrix multiplication and addition in homomorphic encryption, while keeping the first ciphertext feature matrix as ciphertext, the homomorphic matrix product of the first ciphertext feature matrix and the plaintext matrix of the standard ontology is calculated, and the second ciphertext feature is aggregated to generate a second ciphertext feature that represents the semantic similarity scores of multiple heterogeneous subsystems. The second ciphertext feature is used as the ciphertext matching result and returned to the edge computing end in parallel at the second time, so that the edge computing end can use the private key to decrypt and split the second ciphertext feature as a whole, thereby establishing multiple mapping and transformation rules between the running data and the corresponding target benchmark identifier in parallel.

[0054] The methods provided by the embodiments of the present invention have been described in detail above. The following describes in detail a smart park visualization management system based on high-concurrency processing for implementing the methods provided by the embodiments of the present invention. This system is applied to a server, which is connected to multiple edge computing terminals. The system includes: The query acquisition module is used to acquire the data processing session sent by the edge computing terminal. The data processing session includes a first retrieval identifier and a first ciphertext feature. The first ciphertext feature is obtained by the edge computing terminal using a public key to homomorphically encrypt the plaintext feature vector extracted from the running data. The ciphertext matching module is used to calculate the similarity between the first ciphertext feature and multiple preset standard ontology feature vectors, and generate a second ciphertext feature containing multiple ciphertext matching results with matching similarity scores. The mapping distribution module is used to return the second ciphertext feature to the edge computing terminal, so that the edge computing terminal can use its private key to decrypt and determine the unique target matching object identifier, and establish a mapping conversion rule between the running data and the target matching object identifier; The aggregation and display module is used to receive the third ciphertext feature sent by the edge computing terminal based on the mapping and transformation rules, and input the third ciphertext feature into the stream processing engine for real-time aggregation and index calculation for visualization display. The third ciphertext feature is data that has been stripped of plaintext data and has the target matching object identifier and ciphertext value attached.

[0055] The electronic device provided in this embodiment of the invention, exemplarily, can be a network device, or a chip (system) or other component or assembly that can be disposed in a network device. The electronic device may include a processor. Optionally, the electronic device may also include a memory and / or a transceiver. The processor is coupled to the memory and transceiver, for example, by means of a communication bus connection.

[0056] The following is a detailed introduction to the various components of the electronic device: In this context, the processor is the control center of the electronic device. It can be a single processor or a collective term for multiple processing elements. For example, a processor can be one or more central processing units (CPUs), an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present invention, such as one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs).

[0057] Alternatively, the processor can perform various functions of the electronic device, such as the methods described above, by running or executing software programs stored in memory and by calling data stored in memory.

[0058] In a specific implementation, as one example, the processor may include one or more CPUs, such as CPU0 and CPU1.

[0059] In a specific implementation, as one example, the electronic device may also include multiple processors. Each of these processors may be a single-core processor (single-CPU) or a multi-core processor (multi-CPU). Here, a processor may refer to one or more devices, circuits, and / or processing cores used to process data (e.g., computer program instructions).

[0060] The memory is used to store the software program that executes the solution of the present invention, and the execution is controlled by the processor. The specific implementation method can be referred to the above method embodiment, and will not be repeated here.

[0061] Optionally, the memory can be read-only memory (ROM) or other types of static storage devices capable of storing static information and instructions, random access memory (RAM) or other types of dynamic storage devices capable of storing information and instructions, or electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but not limited thereto. The memory can be integrated with the processor or exist independently and coupled to the processor through an interface circuit of an electronic device; the embodiments of the present invention do not specifically limit this.

[0062] A transceiver is used for communication with other electronic devices. For example, if the electronic device is a terminal, the transceiver can be used to communicate with a network device or with another terminal device. Similarly, if the electronic device is a network device, the transceiver can be used to communicate with a terminal or with another network device.

[0063] Optionally, the transceiver may include a receiver and a transmitter. The receiver is used to implement the receiving function, and the transmitter is used to implement the sending function.

[0064] Optionally, the transceiver can be integrated with the processor or exist independently and coupled to the processor through the interface circuit of the electronic device. This embodiment of the invention does not specifically limit this.

[0065] It is understandable that the structure of an electronic device does not constitute a limitation on the electronic device. An actual electronic device may include more or fewer components, or combine certain components, or have different component arrangements.

[0066] Furthermore, the technical effects of the electronic device can be referred to the technical effects of the method described in the above method embodiments, and will not be repeated here.

[0067] It should be understood that the processor in the embodiments of the present invention can be a central processing unit (CPU), or it can be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or any conventional processor.

[0068] It should also be understood that the memory in the embodiments of the present invention can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of random access memory (RAM) are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate synchronous DRAM (DDRSDRAM), enhanced synchronous DRAM (ESDRAM), synchronous linked DRAM (SLDRAM), and direct rambus RAM (DRRAM).

[0069] The above embodiments can be implemented, in whole or in part, by software, hardware (such as circuits), firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, all or part of the processes or functions described in the embodiments of the present invention are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more sets of available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. A semiconductor medium can be a solid-state drive.

[0070] It should be understood that the term "and / or" in this article is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. A and B can be singular or plural. Additionally, the character " / " in this article generally indicates an "or" relationship between the preceding and following related objects, but it can also represent an "and / or" relationship. Please refer to the context for a more accurate understanding.

[0071] In this invention, "at least one" means one or more, and "more than one" means two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of a single item or a plurality of items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be a single item or multiple items.

[0072] It should be understood that, in various embodiments of the present invention, the order of the above-mentioned process numbers does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

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

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

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

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

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

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

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

Claims

1. A smart park visualization management and control method based on high-concurrency processing, applied to a server-side, wherein the server-side is connected to edge computing terminals of multiple subsystems, characterized in that... Includes the following steps: Acquire a data processing session sent from the edge computing terminal, wherein the data processing session is used to perform a data matching operation on the running data of the subsystem corresponding to the edge computing terminal; According to the computation required to perform the data matching operation, the data matching operation is performed on the first ciphertext feature of the subsystem's running data corresponding to the computation, wherein the first ciphertext feature is obtained by the edge computing end encrypting the plaintext feature vector of the subsystem's running data using the homomorphic operation corresponding to the data matching operation; A processing response carrying a second ciphertext feature is generated and sent to the edge computing terminal. The second ciphertext feature is the ciphertext matching result of multiple matching similarity scores of the data matching operation, so that the edge computing terminal can use its private key to decrypt and determine the corresponding target matching object identifier, and establish a mapping and conversion rule between the running data and the target matching object identifier. The system continuously receives the third ciphertext feature sent by the edge computing terminal based on the mapping and transformation rules, and inputs the third ciphertext feature into the stream processing engine for real-time aggregation and index calculation for visualization; wherein, the third ciphertext feature is data that has been stripped of plaintext data and has the target matching object identifier and ciphertext value attached.

2. The intelligent park visualization management and control method based on high-concurrency processing according to claim 1, characterized in that, Performing a data matching operation on the first encrypted feature of the running data of the subsystem corresponding to the operation, and obtaining a second encrypted feature of multiple encrypted matching results with similarity scores, includes: The data processing session is parsed to extract the first retrieval identifier. The first retrieval identifier is a plaintext label extracted by the edge computing terminal for business domain coarse screening of the running data. Based on the first retrieval identifier, the local standardized ontology library is searched and filtered to extract a subset of standard ontology feature vectors that match the first retrieval identifier. For each plaintext standard ontology feature vector in the subset of standard ontology feature vectors, calculate its ciphertext inner product with the first ciphertext feature to obtain the matching similarity score corresponding to the candidate standard ontology. The candidate standard ontology identifiers and their corresponding matching similarity scores within the subset are combined and packaged to generate the encrypted matching results.

3. The intelligent park visualization management and control method based on high-concurrency processing according to claim 2, characterized in that, The localized standardized ontology library includes multiple standard ontology mapping entries. Each standard ontology mapping entry includes a standard ontology identifier for characterizing device data attributes, a plaintext standard ontology feature vector for characterizing the vector position of the standard ontology in the semantic space, and a business domain coarse-screen plaintext label for retrieval. The plaintext standard ontology feature vector has the same extraction dimension as the plaintext feature vector generated by the edge computing terminal.

4. The smart park visualization management and control method based on high-concurrency processing according to claim 3, characterized in that, For each plaintext standard ontology feature vector in the subset of standard ontology feature vectors, the ciphertext inner product of each vector with the first ciphertext feature is calculated to obtain the matching similarity score corresponding to the candidate standard ontology, including: For any target plaintext standard ontology feature vector in the subset, extract multiple feature components contained therein in sequence according to feature dimensions, use the feature components as the second plaintext vector, and extract multiple components of the corresponding dimension in the first ciphertext feature as the first ciphertext vector. Based on the scalar multiplication homomorphism preset for the operation required to perform data matching, the second plaintext vector and the first ciphertext vector in the same dimension are multiplied by ciphertext to obtain the third ciphertext product corresponding to that dimension. Based on the additive homomorphic property of the operation preset required for performing data matching, the multiple third ciphertext products generated under all feature dimensions are added together to generate a fourth ciphertext score that represents the semantic distance between the two, and the fourth ciphertext score is used as the matching similarity score of the target plaintext standard ontology feature vector.

5. The intelligent park visualization management and control method based on high-concurrency processing according to claim 1, characterized in that, The second ciphertext feature is returned to the edge computing terminal, so that the edge computing terminal can use its private key to decrypt it and determine a unique target matching object identifier. The mapping and conversion rules between the running data and the target matching object identifier are established, including: The encrypted matching result is sent to the edge computing terminal to trigger the edge computing terminal to execute a preset threshold judgment logic, decrypt the encrypted matching result and extract the highest similarity score. When the similarity score is greater than or equal to the preset confidence threshold, the corresponding standard ontology identifier is confirmed as the target matching object identifier.

6. The intelligent park visualization management and control method based on high-concurrency processing according to claim 1, characterized in that, The first ciphertext feature is obtained by encrypting the plaintext feature vector of the subsystem's running data using the homomorphic operation corresponding to the data matching operation at the edge computing end, including: When the edge computing terminal collects multiple operational data representing multiple heterogeneous subsystems within a preset first time window, it converts them into multiple plaintext feature vectors, and concatenates the multiple plaintext feature vectors to construct a plaintext feature matrix. The edge computing terminal uses a local public key to perform an overall encryption operation on the packaged plaintext feature matrix to generate the first ciphertext feature.

7. The smart park visualization management and control method based on high-concurrency processing according to claim 6, characterized in that, Concatenating the dimensions of the multiple plaintext feature vectors to construct a plaintext feature matrix, and then encrypting the plaintext feature matrix as a whole, further includes: Based on the frame rate length of the first time window, a plaintext polynomial ring space with N plaintext slots is predefined. After collecting plaintext feature vectors of m heterogeneous subsystems, where m is less than or equal to n, the m independent plaintext feature vectors are encoded and mapped into the plaintext slots to obtain the packaged plaintext feature matrix.

8. The smart park visualization management and control method based on high-concurrency processing according to claim 7, characterized in that, Generating and sending a processing response carrying a second ciphertext feature to the edge computing endpoint includes: Extract the ciphertext matrix from the first ciphertext features, and construct the plaintext standard ontology feature vector subset extracted from the local standardized ontology library into a standard ontology plaintext matrix according to a preset dimension; Based on the homomorphic properties of matrix multiplication and addition in homomorphic encryption, while keeping the first ciphertext feature matrix as ciphertext, the homomorphic matrix product of the first ciphertext feature matrix and the plaintext matrix of the standard ontology is calculated, and the second ciphertext feature is aggregated to generate a second ciphertext feature that represents the semantic similarity scores of multiple heterogeneous subsystems. The second ciphertext feature is used as the ciphertext matching result and returned to the edge computing end in parallel at the second time, so that the edge computing end can use the private key to decrypt and split the second ciphertext feature as a whole, thereby establishing multiple mapping and transformation rules between the running data and the corresponding target benchmark identifier in parallel.

9. A smart park visualization management and control system based on high-concurrency processing, applied on a server side, wherein the server side is connected to multiple edge computing terminals, characterized in that, The system includes: The query acquisition module is used to acquire the data processing session sent by the edge computing terminal. The data processing session includes a first retrieval identifier and a first ciphertext feature. The first ciphertext feature is obtained by the edge computing terminal using a public key to homomorphically encrypt the plaintext feature vector extracted from the running data. The ciphertext matching module is used to calculate the similarity between the first ciphertext feature and multiple preset standard ontology feature vectors, and generate a second ciphertext feature containing multiple ciphertext matching results with matching similarity scores. The mapping distribution module is used to return the second ciphertext feature to the edge computing terminal, so that the edge computing terminal can use its private key to decrypt and determine the unique target matching object identifier, and establish a mapping conversion rule between the running data and the target matching object identifier; The aggregation and display module is used to receive the third ciphertext feature sent by the edge computing terminal based on the mapping and transformation rules, and input the third ciphertext feature into the stream processing engine for real-time aggregation and index calculation for visualization display. The third ciphertext feature is data that has been stripped of plaintext data and has the target matching object identifier and ciphertext value attached.

10. An electronic device, characterized in that, include: A memory and one or more processors, wherein the memory is coupled to the processors; The memory stores computer program code, which includes computer instructions. When the computer instructions are executed by the processor, the electronic device performs the smart park visualization management method based on high-concurrency processing as described in any one of claims 1 to 8.