A system for one-key issuing, rapid application generation and migration and a working method thereof

Abstract

The application belongs to the technical field of zero code platform, and particularly relates to a system for one-key issuing, quickly generating application and migrating and a working method thereof; the system comprises an identity recognition module, an application creation module, an application configuration module, a web editing module, an attribute editing module, a verification checking module, a background analysis module and a security protection module; the application provides an application system of zero code platform and a working method thereof, has the development capability, customization capability and compatible integration capability of complex application, and can meet the personalized business demand of enterprises; the system can realize complex data processing, rendering and interaction functions, uses efficient unique algorithms and data structures, optimizes background processing, ensures the high performance of the generated application, and has high security and use stability.

Description

Technical Field

[0001] This invention belongs to the field of no-code platform technology. Specifically, it relates to a system and its working method for one-click deployment, rapid application generation and migration. Background Technology

[0002] No-code platforms have emerged against the backdrop of the maturity of cloud computing, front-end technologies, microservice architecture, and the development of AI. They address the challenges of developer resource shortages, rapidly changing business needs, and digital transformation, making them particularly suitable for SMEs and business units' in-house development and innovation projects. Currently, thanks to the open-source community and no-code platforms, some enterprises have achieved rapid application building and deployment, but some pain points remain unresolved. For example, these no-code platforms often compromise on functionality in their design to lower the development threshold. This results in insufficient capabilities for developing complex applications, customization, and compatibility, making it difficult to meet the personalized business needs of enterprises. Furthermore, because the code generated by the platform is automatically generated through drag-and-drop components, lacking manual optimization, it is highly likely that the generated applications will suffer from poor performance, data leaks, or vulnerability to attacks. Summary of the Invention

[0003] To address the aforementioned problems in existing technologies, the present invention aims to provide a system and its working method that enables developers to achieve one-click deployment, rapid application generation, and migration through visual tools and components, allowing them to use drag-and-drop, configuration, and other methods.

[0004] To solve the above problems, the technical solution adopted by the present invention is as follows:

[0005] A one-click deployment and rapid application generation and migration system, comprising an identity recognition module, an application creation module, an application configuration module, a web editing module, an attribute editing module, a verification module, and a backend parsing module;

[0006] The identity recognition module is used to identify the user's identity;

[0007] Users can query and view the list of created applications or create new applications through the application creation module, and enter the application configuration module after creating a new application;

[0008] Users can add or edit materials through the material area, editing area, and material attribute area on the page via the application configuration module.

[0009] The web editing module provides different types of web components in the material area. Users can drag and drop the web components into the editing area and edit the display of the web components on the application page in the editing area.

[0010] After completing the web editing, the user can click on the selected web component in the editing area through the attribute editing module, and edit the attributes of the web component in the material attribute area;

[0011] The verification module verifies the integrity and accuracy of the JSON data that the user has edited, saved, and submitted to the backend.

[0012] The backend parsing module parses the JSON data uploaded by the user, obtains the type, and calls the corresponding page generation logic or template according to the type to generate the corresponding page, ensuring that the structure and content of the generated page are consistent with the configuration data.

[0013] The background parsing module uses an ET+ tree data structure, and the matrix representation of the ET+ tree is as follows:

[0014] In the ET+ tree, each node N i All are represented as a d-dimensional hyperrectangular MBR i = [l1,u1]×[l2,u2]×...×[l id ,u id ], where l id and u id Let represent the minimum and maximum boundaries of the superoccurrence in the d-th dimension, respectively;

[0015] The node segmentation of the ET+ tree is represented as follows:

[0016] The node N i Based on a certain segmentation value t of a certain dimension j ij This causes the node to split into two child nodes N. i1 and N i2 ,in

[0017] In the above formula, SplitCost represents the splitting method;

[0018] The query processing of the ET+ tree is a range query Q = [q1, q2, ..., q d ], where q d This indicates the range of the query along the d-th dimension. The query processing procedure is as follows:

[0019] S1.1 - Starting from the root node: Starting from the root node N of the treeroot Start query processing;

[0020] S1.2 - Recursive Search: Recursively check the hyperrectangular MBR of each node. i Determine whether it is necessary to further explore its child nodes;

[0021] S1.3 - Query Processing Function: Search(N) i The definition of Q is:

[0022]

[0023] Where, N i1 N i2 ,...,N ik As a child node, MBR i1 MBR i2 MBR ik These are their corresponding hyperrectangles;

[0024] S1.4 - Leaf Node Processing: If node N i If a node is a leaf node and contains a data object o that satisfies the query range Q, then return that object o to the query results.

[0025] In the application creation module, an optimized map rendering method is used, and the steps are as follows:

[0026] S2.1 - Projection Conversion:

[0027]

[0028]

[0029] in, The center latitude is Δy, and the difference in longitude is Δy.

[0030] S2.2 - Symbolic Parameterization: Selecting colors based on attribute data:

[0031] color=interpolate(value,[min value ,max value ],[color1,color2]);

[0032] Interpolate is an interpolation function that determines the color by linearly interpolating the attribute value between its minimum and maximum values.

[0033] S2.3 - Screen coordinate calculation:

[0034]

[0035] Where x and y are the projected geographic coordinates, x min and y min It is the smallest boundary of the map area, Δ x and Δ y It represents the pixel width and height of the map on the screen;

[0036] S2.4 - Screen Rendering: Based on the symbolized geographic feature attributes, fill the polygon features with the corresponding colors, draw point symbols, and apply the corresponding point symbol styles; then draw the feature boundaries based on the calculated coordinates and apply the corresponding line widths and styles.

[0037] In the application creation module, a recursive tracing algorithm is used to handle complex scenarios. The process of the recursive tracing algorithm is as follows:

[0038] S3.1 - Basic Equation:

[0039]

[0040] in, Let be the position vector of the observation point. Let t be the unit direction vector pointing from the observation point to the pixel on the screen, and t be the length of the ray.

[0041] S3.2 - Calculation of the intersection point of the spheres:

[0042]

[0043] The center of the sphere is The ray has a radius of R, and the point where it intersects the surface of the sphere is...

[0044] S3.3 - Calculation of plane intersection points:

[0045]

[0046] in Let be the intersection point of the ray and the plane. Calculate the parameter t obtained by solving the ray equation and the plane equation.

[0047] S3.4 - Recursive ray tracking calculation:

[0048]

[0049] Where n1 and n2 are the refractive indices, It is the normal vector. The direction of refraction;

[0050] S3.5 - Recursive Calculation:

[0051] Once the direction of the reflected or refracted light is obtained, the recursive tracing will recursively process these light rays in the same way until the maximum recursion depth is reached or the light is no longer reflected or refracted by the object's surface.

[0052] Furthermore, the system also includes a security protection module, which encrypts the transmitted data, controls access permissions, and performs security auditing.

[0053] The security protection module manages and assigns user permissions based on a role-permission model. Each user is assigned to one or more roles, and each role is further assigned specific permissions. The security protection module implements data permission isolation based on multi-tenancy.

[0054] The security protection module records all user operation events and generates audit logs.

[0055] Furthermore, in the application creation module, the applications that can be created include APP, H5, and mini-program;

[0056] In the application configuration module, configurable applications include information configuration, add page, delete page and edit page, and the information configuration includes application name and application image.

[0057] Furthermore, the web editing includes changing component positions, copying / deleting components, clearing components, saving the page, previewing the page, and generating templates.

[0058] Furthermore, the attributes of the web component include event information, network request information, page redirection information, and page configuration information.

[0059] Furthermore, after the backend parsing module completes the parsing, it synchronously sends the page collection to the frontend project directory, where the shell configures the packaging to generate the corresponding application and publishes it to the corresponding server.

[0060] A working method for one-click deployment and rapid generation of applications and migration systems, as described above, includes the following steps:

[0061] Step 1: The user logs into the platform and verifies their identity through the identity recognition module;

[0062] Step two: After identity verification, users can use the application creation module to query and display the list of created applications or create new applications.

[0063] Step 3: After creating a new application, the user can add or edit materials through the material area, editing area, and material attribute area on the page via the application configuration module.

[0064] Step 4: After the user finishes editing the new application, they can drag and drop the web component from the material area to the editing area through the web editing module, and then display the web component on the application page in the editing area to complete the web editing.

[0065] Step 5: After completing the web editing, the user clicks on the selected web component in the editing area through the attribute editing module, and then edits the attributes of the web component in the material attributes.

[0066] Step 6: After the user completes the editing of the web component properties, the verification module saves the web component and application that the user has edited, and generates JSON data to be submitted to the backend for verification of data integrity and accuracy.

[0067] Step 7: The backend parsing module parses the received user-uploaded JSON data, obtains the type, and calls the corresponding page generation logic or template according to the type to generate the corresponding page, while ensuring that the structure and content of the generated page are consistent with the configuration data.

[0068] The background parsing module uses an ET+ tree data structure, and the matrix representation of the ET+ tree is as follows:

[0069] In the ET+ tree, each node N i All are represented as a d-dimensional hyperrectangular MBR i = [l1,u1]×[l2,u2]×...×[l id ,u id ], where l id and u id Let represent the minimum and maximum boundaries of the superoccurrence in the d-th dimension, respectively;

[0070] The node segmentation of the ET+ tree is represented as follows:

[0071] The node N i Based on a certain segmentation value t of a certain dimension j ij This causes the node to split into two child nodes N. i1 and N i2 ,in

[0072] In the above formula, SplitCost represents the splitting method;

[0073] The query processing of the ET+ tree is a range query Q = [q1, q2, ..., q d ], where q d This indicates the range of the query along the d-th dimension. The query processing procedure is as follows:

[0074] S1.1 - Starting from the root node: Starting from the root node N of the tree root Start query processing;

[0075] S1.2 - Recursive Search: Recursively check the hyperrectangular MBR of each node. i Determine whether it is necessary to further explore its child nodes;

[0076] S1.3 - Query Processing Function: Search(N) i The definition of Q is:

[0077]

[0078] Where, N i1 N i2 ,...,N ik As a child node, MBR i1 MBR i2 MBR ik These are their corresponding hyperrectangles;

[0079] S1.4 - Leaf Node Processing: If node N i If a node is a leaf node and contains a data object o that satisfies the query range Q, then return that object o to the query results.

[0080] In the application creation module, an optimized map rendering method is used, and the steps are as follows:

[0081] S2.1 - Projection Conversion:

[0082]

[0083] in, The center latitude is Δy, and the difference in longitude is Δy.

[0084] S2.2 - Symbolic Parameterization: Selecting colors based on attribute data:

[0085] color=interpolate(value,[min value max value ],[color1,color2]);

[0086] Interpolate is an interpolation function that determines the color by linearly interpolating the attribute value between its minimum and maximum values.

[0087] S2.3 - Screen coordinate calculation:

[0088]

[0089] Where x and y are the projected geographic coordinates, x min and y min It is the smallest boundary of the map area, Δ x and Δ y It represents the pixel width and height of the map on the screen;

[0090] S2.4 - Screen Rendering: Based on the symbolized geographic feature attributes, fill the polygon features with the corresponding colors, draw point symbols, and apply the corresponding point symbol styles; then draw the feature boundaries based on the calculated coordinates and apply the corresponding line widths and styles.

[0091] In the application creation module, a recursive tracing algorithm is used to handle complex scenarios. The process of the recursive tracing algorithm is as follows:

[0092] S3.1 - Basic Equation:

[0093]

[0094] in, Let be the position vector of the observation point. Let t be the unit direction vector pointing from the observation point to the pixel on the screen, and t be the length of the ray.

[0095] S3.2 - Calculation of the intersection point of the spheres:

[0096]

[0097] The center of the sphere is The ray has a radius of R, and the point where it intersects the surface of the sphere is...

[0098] S3.3 - Calculation of plane intersection points:

[0099]

[0100] in Let be the intersection point of the ray and the plane. Calculate the parameter t obtained by solving the ray equation and the plane equation.

[0101] S3.4 - Recursive ray tracking calculation:

[0102]

[0103] Where n1 and n2 are the refractive indices, It is the normal vector. The direction of refraction;

[0104] S3.5 - Recursive Calculation:

[0105] Once the direction of the reflected or refracted light is obtained, the recursive tracing will recursively process these light rays in the same way until the maximum recursion depth is reached or the light is no longer reflected or refracted by the object's surface.

[0106] An electronic device includes at least one processor; a memory; and at least one application, wherein the at least one application is stored in the memory and configured to be executed by the at least one processor, the at least one application being used to perform the working method of one-click deployment, rapid generation of applications and migration systems according to claim 7.

[0107] A computer-readable storage medium having a computer program stored thereon, which, when executed in a computer, causes the computer to perform the working method of one-click deployment, rapid generation of application and migration system as described in claim 7.

[0108] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0109] This invention provides a zero-code platform application system and its working method, which has the ability to develop complex applications, customize them, and integrate them, thus meeting the personalized business needs of enterprises. The system can realize complex data processing, rendering, and interaction functions, uses efficient and unique algorithms and data structures, optimizes the backend processing, ensures the high performance of the generated application, and has high security and stability. Attached Figure Description

[0110] Figure 1 This is a schematic diagram of the module structure of the system described in this invention;

[0111] Figure 2 This is a schematic diagram of the steps of the method described in this invention; Detailed Implementation

[0112] The present invention will be further described below with reference to specific embodiments.

[0113] like Figure 1 As shown, the one-click deployment, rapid application generation and migration system of the present invention includes an identity recognition module, an application creation module, an application configuration module, a web editing module, an attribute editing module, a verification module, a backend parsing module, and a security protection module.

[0114] First, users who log in to the platform need to verify their identity through the identity recognition module. After passing the identity verification, they can enter the application creation module. In this module, users can view and see the list of already created applications, or directly select to create and configure a new application. The applications that can be created include, but are not limited to, APP, H5, and mini-program. The configurable applications include, but are not limited to, information configuration, adding pages, deleting pages, and editing pages. The information configuration includes, but is not limited to, the application name and application image.

[0115] After creating a new application, users enter the application configuration module. In this module, users can add or edit pages using the material area, editing area, and material attribute area. The material area contains different types of web components stored according to different business needs, and users then enter the web editing module.

[0116] Users can drag and drop web components into the editing area using the web editing module, and edit the display of web components on the application page within the editing area. The functions of the editing area include, but are not limited to, changing the position of components, copying / deleting components, clearing components, saving the page, previewing the page, and generating templates.

[0117] After completing the web editing, the user proceeds to the attribute editing module. In this module, the user needs to select the web component in the editing area and then edit the specific attributes of the web component in the corresponding material attribute area, including but not limited to event information, network request information, page jump information, and page configuration information.

[0118] After the overall attribute editing is completed, the basic application creation is finished. The verification module then saves the edited application and generates JSON data for submission to the backend. During the submission process, to ensure the accuracy and completeness of the configuration data, the submitted JSON data is verified and validated to ensure that the backend can correctly parse and process the received data. Simultaneously, a unique transmission and processing mechanism should be used during the submission process.

[0119] This invention employs efficient algorithms and data structures to optimize the processing and ensure high-performance application generation. Due to the large volume, complex structure, and frequent queries of map data, optimizing algorithms and data structures is crucial for improving performance, scalability, and user experience. This invention utilizes an ET+tree data structure to significantly improve user experience, resource utilization, and accelerate map data loading and spatial analysis operations.

[0120] In traditional WebGIS applications, R-trees are typically used as the storage structure, which is extremely inefficient for frequent operations such as large-scale insertions or deletions. Furthermore, the uneven space utilization of R-trees leads to an unbalanced data structure and wasted space. This platform, based on R-trees, Kd-trees, and Geohash, has created a unique data structure (ET+tree) specifically for WebGIS applications. By differentiating between two-dimensional and three-dimensional spatial data and static data, and by processing geographic data into special vector data, it achieves the ability to quickly respond to geographic data queries.

[0121] Specifically, the matrix representation of the ET+ tree is as follows:

[0122] In the ET+ tree, each node N i All are represented as a d-dimensional hyperrectangular MBR i = [l1,u1]×[l2,u2]×...×[l id ,u id ], where l id and u id Let represent the minimum and maximum boundaries of the superoccurrence in the d-th dimension, respectively;

[0123] The node partitioning of an ET+ tree is represented as follows:

[0124] Node N i Based on a certain segmentation value t of a certain dimension j ij This causes the node to split into two child nodes N. i1 and N i2 ,in

[0125] In the above formula, SplitCost represents the splitting method;

[0126] The query processing of ET+ trees is a range query Q = [q1, q2, ..., q d ], where q d This indicates the range of the query along the d-th dimension. The query processing procedure is as follows:

[0127] S1.1 - Starting from the root node: Starting from the root node N of the tree root Start query processing;

[0128] S1.2 - Recursive Search: Recursively check the hyperrectangular MBR of each node. i Determine whether it is necessary to further explore its child nodes;

[0129] S1.3 - Query Processing Function: Search(N) i The definition of Q is:

[0130]

[0131] Where, N i1 N i2 ,...,N ik As a child node, MBR i1 MBR i2 MBR ik These are their corresponding hyperrectangles;

[0132] S1.4 - Leaf Node Processing: If node N i If a node is a leaf node and contains a data object o that satisfies the query range Q, then that object o is returned to the query results.

[0133] Secondly, it features a unique query and display function, namely unique vector rendering. Traditional WebGIS applications typically use tile algorithms or vector map rendering methods. Tile algorithms, designed for static or relatively stable map data, are insufficient for dynamic or frequently updated scenarios. Vector map rendering, on the other hand, requires significant computation, resulting in very high storage and computational costs. This system combines the advantages and disadvantages of both mainstream algorithms, making unique optimizations to the map rendering algorithm. Targeted compression mechanisms, fragmented caching load balancing, and automatic splitting of computational tasks for asynchronous computation effectively reduce storage and caching costs. Based on the special vector data transformation in the ET+ tree data structure, innovative symbol processing algorithms and geometric calculation methods significantly reduce the computational power required for vector rendering. Simultaneously, vector maps can be dynamically generated and updated in real time using vector data, addressing the limitations of tile algorithms in supporting dynamic data.

[0134] This invention employs an optimized map rendering method, the steps of which are as follows:

[0135] S2.1 - Projection Conversion:

[0136]

[0137] in, The center latitude is Δy, and the difference in longitude is Δy.

[0138] S2.2 - Symbolic Parameterization: Selecting colors based on attribute data:

[0139] color=interpolate(value,[min value max value ],[colo1,color2]);

[0140] Interpolate is an interpolation function that determines the color by linearly interpolating the attribute value between its minimum and maximum values.

[0141] S2.3 - Screen coordinate calculation:

[0142]

[0143] Where x and y are the projected geographic coordinates, x min and y min It is the smallest boundary of the map area, Δ x and Δ y It represents the pixel width and height of the map on the screen;

[0144] S2.4 - Screen Rendering: Based on the symbolized geographic feature attributes, fill the polygon features with the corresponding colors, draw point symbols, and apply the corresponding point symbol styles; then draw the feature boundaries based on the calculated coordinates and apply the corresponding line widths and styles.

[0145] Finally, a unique spatial differentiation and partitioning algorithm is employed. Traditional WEIGIS applications typically use the ray casting method for spatial differentiation and partitioning, but this method is computationally complex and unsuitable for dynamic scenes and complex data processing such as shadows. This system, building upon the original ray casting algorithm, utilizes its ET+ tree data structure to differentiate spatial data, enabling the rapid elimination of non-intersecting objects. Simultaneously, a self-developed recursive tracing algorithm is used to calculate and handle complex scenes such as refraction and shadows. Thanks to the system's unique vector rendering and ET+ tree spatial differentiation data structure, only changing objects or regions are updated per frame, rather than requiring a complete recalculation, effectively supporting ray tracing and spatial collision issues in dynamic scenes.

[0146] Specifically, the recursive tracing algorithm works as follows:

[0147] S3.1 - Basic Equation:

[0148]

[0149] in, Let be the position vector of the observation point. Let t be the unit direction vector pointing from the observation point to the pixel on the screen, and t be the length of the ray.

[0150] S3.2 - Calculation of the intersection point of the spheres:

[0151]

[0152] The center of the sphere is The ray has a radius of R, and the point where it intersects the surface of the sphere is...

[0153] S3.3 - Calculation of plane intersection points:

[0154]

[0155] in Let be the intersection point of the ray and the plane. Calculate the parameter t obtained by solving the ray equation and the plane equation.

[0156] S3.4 - Recursive ray tracking calculation:

[0157]

[0158] Where n1 and n2 are the refractive indices, It is the normal vector. The direction of refraction;

[0159] S3.5 - Recursive Calculation:

[0160] Once the direction of the reflected or refracted light is obtained, the recursive tracing will recursively process these light rays in the same way until the maximum recursion depth is reached or the light is no longer reflected or refracted by the object's surface.

[0161] The backend parsing module parses the received JSON data uploaded by the user, obtains the `type` attribute, and calls the corresponding page generation logic or template based on the `type` to generate the corresponding page, ensuring that the generated page structure and content are consistent with the configured data. Using specific page generation logic or templates during the generation process ensures adaptability to different page requirements. Simultaneously, it implements performance optimization and error handling mechanisms during page generation to guarantee the quality and stability of the generated pages, thereby avoiding page generation anomalies caused by data parsing errors or logical vulnerabilities.

[0162] Finally, the generated page collection is placed in the front-end project directory, and the shell configuration packages and deploys the corresponding application to the appropriate server. During the synchronization process, optimized page collection placement and organizational structure design ensure maintainability and scalability. By managing and maintaining the front-end project's dependencies and configurations, the generated pages are ensured to be consistent with the existing front-end project's structure and specifications, facilitating integration and use. Version management and update strategies for the page collection guarantee page availability and stability.

[0163] In this invention, the security protection module encrypts the transmitted data, controls access permissions, and performs security audits.

[0164] First, regarding data encryption, we employ advanced encryption standards to encrypt data during the storage and transmission of critical data. This ensures that data is not stolen or tampered with by unauthorized access during transmission and storage. Simultaneously, we employ a strict key management strategy to ensure the security and confidentiality of encryption keys. Keys are only decrypted when necessary, and access to the keys is strictly limited to prevent internal or external threats from accessing encrypted data.

[0165] In terms of access control, we manage and assign user permissions based on the classic User-Role-Permission (RBAC) model. Each user is assigned to one or more roles, and each role is further assigned specific permissions, thus achieving precise control over the access permissions of different users within the system. We also implement multi-tenant data access isolation to ensure that data from different tenants is isolated within the system. Each tenant has its own data space and resources, and the system uses a strict access control mechanism to ensure that users can only access the data of their assigned tenant, effectively preventing data leakage and misuse.

[0166] In terms of security auditing, the platform records all critical events, such as user logins, permission changes, and data access. Each event is logged and traceable to the specific user and time. Detailed audit logs are generated, recording the execution of each important operation, including the operation time, executor, and operation content. This log data is securely stored, ensuring its integrity and immutability. Our security auditing function complies with industry standards and regulatory requirements (Level 2 Security Protection), ensuring that system operations meet relevant compliance requirements and supporting auditing of system operations.

[0167] like Figure 2 As shown, the working method of the present invention for one-click deployment, rapid generation of applications and migration systems includes the following steps:

[0168] Step 1: Users log in to the platform and verify their identity through the identity recognition module;

[0169] Step two: After identity verification, users can use the application creation module to view and display the list of created applications or create a new application.

[0170] Step 3: After creating a new application, users can add or edit materials through the material area, editing area, and material attribute area on the application configuration module.

[0171] Step 4: After the user finishes editing the new application, they can drag and drop web components from the material area to the editing area through the web editing module, and then display the web components on the application page in the editing area to complete the web editing.

[0172] Step 5: After completing the web editing, the user can click on the selected web component in the editing area through the attribute editing module, and then edit the attributes of the web component in the material attributes.

[0173] Step 6: After the user completes the editing of the web component properties, the verification module saves the web component and application that the user has edited, and generates JSON data to be submitted to the backend for verification of data integrity and accuracy.

[0174] Step 7: The backend parsing module parses the received user-uploaded JSON data, obtains the type, and calls the corresponding page generation logic or template based on the type to generate the corresponding page, while ensuring that the structure and content of the generated page are consistent with the configuration data.

[0175] In the backend parsing module, the ET+ tree data structure is used. The matrix representation of the ET+ tree is as follows:

[0176] In the ET+ tree, each node N i All are represented as a d-dimensional hyperrectangular MBR i = [l1,u1]×[l2,u2]×...×[l id ,u id ], where l id and u id Let represent the minimum and maximum boundaries of the superoccurrence in the d-th dimension, respectively;

[0177] The node partitioning of an ET+ tree is represented as follows:

[0178] Node N i Based on a certain segmentation value t of a certain dimension j ij This causes the node to split into two child nodes N. i1 and N i2 ,in

[0179] In the above formula, SplitCost represents the splitting method;

[0180] The query processing of ET+ trees is a range query Q = [q1, q2, ..., q d ], where q d This indicates the range of the query along the d-th dimension. The query processing procedure is as follows:

[0181] S1.1 - Starting from the root node: Starting from the root node N of the tree root Start query processing;

[0182] S1.2 - Recursive Search: Recursively check the hyperrectangular MBR of each node. iDetermine whether it is necessary to further explore its child nodes;

[0183] S1.3 - Query Processing Function: Search(N) i The definition of Q is:

[0184]

[0185] Where, N i1 N i2 ,...,N ik As a child node, MBR i1 MBR i2 MBR ik These are their corresponding hyperrectangles;

[0186] S1.4 - Leaf Node Processing: If node N i If a node is a leaf node and contains a data object o that satisfies the query range Q, then return that object o to the query results.

[0187] In the application creation module, the optimized map rendering method is used, and the steps are as follows:

[0188] S2.1 - Projection Conversion:

[0189]

[0190] in, The center latitude is Δy, and the difference in longitude is Δy.

[0191] S2.2 - Symbolic Parameterization: Selecting colors based on attribute data:

[0192] color=interpolate(value,[min value ,max value ],[color1,color2]);

[0193] Interpolate is an interpolation function that determines the color by linearly interpolating the attribute value between its minimum and maximum values.

[0194] S2.3 - Screen coordinate calculation:

[0195]

[0196]

[0197] Where x and y are the projected geographic coordinates, x min and y min It is the smallest boundary of the map area, Δ x and Δy It represents the pixel width and height of the map on the screen;

[0198] S2.4 - Screen Rendering: Based on the symbolized geographic feature attributes, fill the polygon features with the corresponding colors, draw point symbols, and apply the corresponding point symbol styles; then draw the feature boundaries based on the calculated coordinates and apply the corresponding line widths and styles.

[0199] In the application creation module, a recursive tracing algorithm is used to handle complex scenarios. The process of the recursive tracing algorithm is as follows:

[0200] S3.1 - Basic Equation:

[0201]

[0202] in, Let be the position vector of the observation point. Let t be the unit direction vector pointing from the observation point to the pixel on the screen, and t be the length of the ray.

[0203] S3.2 - Calculation of the intersection point of the spheres:

[0204]

[0205] The center of the sphere is The ray has a radius of R, and the point where it intersects the surface of the sphere is...

[0206] S3.3 - Calculation of plane intersection points:

[0207]

[0208] in Let be the intersection point of the ray and the plane. Calculate the parameter t obtained by solving the ray equation and the plane equation.

[0209] S3.4 - Recursive ray tracking calculation:

[0210]

[0211] Where n1 and n2 are the refractive indices, It is the normal vector. The direction of refraction;

[0212] S3.5 - Recursive Calculation:

[0213] Once the direction of the reflected or refracted light is obtained, the recursive tracing will recursively process these light rays in the same way until the maximum recursion depth is reached or the light is no longer reflected or refracted by the object's surface.

[0214] An electronic device according to the present invention includes at least one processor; a memory; and at least one application program, wherein the at least one application program is stored in the memory and configured to be executed by the at least one processor, and the at least one application program is used to perform the working method of one-click delivery, rapid generation of application and migration system according to claim 7.

[0215] The present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed in a computer, causes the computer to perform the working method of one-click deployment, rapid generation of application and migration system as described in claim 7.

Claims

1. A one-key push, rapid application generation and migration system, characterized in that, The system comprises an identity recognition module, an application creation module, an application configuration module, a web editing module, an attribute editing module, a verification checking module, and a background analysis module; The identity recognition module identifies the identity of a user; The user queries a list of created applications or creates a new application through the application creation module, and enters the application configuration module after creating the new application; The user adds or edits through the material area, the editing area, and the material attribute area in the page using the application configuration module; The web editing module provides different types of web components in the material area, and the user drags the web components to the editing area and edits the display of the web components in the application page to perform web editing; After completing the web editing, the user clicks the selected web components in the editing area through the attribute editing module, and edits the attributes of the web components in the material attribute area; The verification checking module verifies the data integrity and accuracy of the JSON data submitted to the background after being edited and saved by the user; The background analysis module analyzes the received JSON data uploaded by the user, obtains the type, and calls the corresponding page generation logic or template according to the type to generate a corresponding page, and ensures that the structure and content of the generated page are consistent with the configuration data; In the background analysis module, the data structure of the ET+ tree is adopted, and the matrix representation of the ET+ tree is: In the ET+ tree, each node N i All are represented as a d-dimensional hyperrectangular MBR i = [l1,u1]×[l2,u2]×...×[l id ,u id ], where l id and u id Let represent the minimum and maximum boundaries of the hyperrectangle along the d-th dimension, respectively; The node segmentation of the ET+ tree is represented as: The node N i According to a certain split value t of a certain dimension j ij Such that the node splits into two child nodes N i1 And N i2 Wherein In the above formula, SplitCost is the segmentation method; The query processing of the ET+ tree is a range query Q=[q1, q2,..., q d ], where q d represents a range of the query range in the dth dimension, and the procedure of the query processing is: S1.1 - Starting from the root node: From the root node N of the tree root Start query processing; S1.2 - Recursive search: Recursively check each node's hyper-rectangle MBR i to determine if further exploration of its children is needed; S1.3 - Query processing function: The definition of the query processing function Search(N i Q) is: where N i1 , N i2 , ..., N ik are the child nodes, MBR i1 , MBR i2 , ..., MBR ik are their corresponding hyper-rectangles; S1.4-Leaf node processing: If node N i is a leaf node and the contained data object o satisfies the query range Q, return the object o to the query result; In the application creation module, an optimized map rendering method is adopted, and the steps are as follows: S2.1-Projection conversion: wherein is the central latitude and Ay is the difference in longitude. S2.2-Symbolization parameterization: select color according to attribute data: color = interpolate ( value, [min value ,max value ], [color1, color2] ) ; Wherein, interpolate is an interpolation function, which determines the color by linear interpolation between the minimum value and the maximum value according to the attribute value value; S2.3-Screen coordinate calculation: where x and y are the projected geographical coordinates, x min and y min are the minimum boundaries of the map range, Δ x and Δ y are the pixel width and height of the map range on the screen; S2.4-Screen rendering: according to the symbolized attribute of geographic features, fill the face feature with the corresponding color, draw point symbols, and apply the corresponding point symbol style; then draw the boundary of the feature according to the calculated coordinates, and apply the corresponding line width and style; In the application creation module, a recursive tracking algorithm is used to process complex scenes, and the process of the recursive tracking algorithm is as follows: S3.1-Basic equation: wherein is the position vector of the observation point, is the unit direction vector of the pixel to which the observation point is pointing, and t is the length of the ray; S3.2-Sphere intersection point calculation: Wherein the center of the sphere is The radius is R, and the intersection of the ray and the surface of the sphere is S3.3-Plane intersection point calculation: wherein is the intersection of the ray with the plane, calculated by solving the ray equation and the plane equation for the parameter t S3.4-Recursive tracking calculation of refracted light: wherein n1, n2 are refractive indices, is a normal vector, is a refractive direction; S3.5-Recursive calculation: After obtaining the direction of the reflected or refracted light, the recursive tracking recursively processes these new light in the same way until the maximum recursion depth is reached or the light is no longer reflected or refracted by the surface of the object. 2.The one-key issuing, rapid application generating and migrating system according to claim 1, characterized in that, The system further comprises a security protection module, which encrypts the transmitted data, controls the permissions, and performs security audit; The system further comprises a security protection module, which encrypts the transmitted data, controls the permissions, and performs security audit; The security protection module manages the permissions of the assigned users based on a user-role-permission model, each user is assigned to one or more roles, and each role is assigned with specific permissions; The security protection module implements multi-tenant-based data permission isolation; The security protection module records all user operation events and generates audit logs. 3.The one-key launching, rapid application generating and migrating system according to claim 1, characterized in that, In the application creation module, the creatable applications include APP, H5 and applet; In the application configuration module, the configurable applications include information configuration, new page, delete page and edit page, and the information configuration includes application name and application picture.

4. The one-key push, rapid application generation and migration system according to claim 1, wherein, The web editing includes changing component position, copying / deleting component, clearing component, saving page, previewing page and generating template.

5. The one-key push, rapid application generation and migration system according to claim 1, wherein, The properties of the web component include event information, network request information, page jump information and page configuration information.

6. The one-key push, rapid application generation and migration system according to claim 1, wherein, After the background analysis module completes the analysis, the page collection is sent to the project directory of the front end, and the corresponding application is generated by shell configuration packaging and published to the corresponding server.

7. The working method of the one-key issuing, rapid application generating and migrating system according to any one of claims 1-6, characterized in that, The method comprises the following steps: Step one, the user logs in to the platform, and the identity verification and check are performed through the identity recognition module; Step two, after the identity check, the user can query and display the created application list through the application creation module, or create a new application; Step three, after creating a new application, the user adds or edits the material area, editing area and material attribute area in the page through the application configuration module; Step four, after editing the new application, the user drags the web component in the material area to the editing area through the web editing module, and completes the web editing by displaying the web component in the application page in the editing area; Step five, after completing the web editing, the user selects the web component in the editing area by clicking through the attribute editing module, and edits the properties of the web component in the material attribute area; Step six, after completing the editing of the properties of the web component, the verification and check module saves the web component and the application edited by the user, and generates JSON data submitted to the background for data integrity and accuracy verification and check; Step seven, the background analysis module analyzes the JSON data uploaded by the user, obtains the type, and calls the corresponding page generation logic or template according to the type to generate the corresponding page, while ensuring that the structure and content of the generated page are consistent with the configuration data; In the background analysis module, the data structure of ET+ tree is adopted, and the matrix representation of the ET+ tree is: In the ET+ tree, each node N i All are represented as a d-dimensional hyperrectangular MBR i = [l1,u1]×[l2,u2]×...×[l id ,u id ], where l id and u id Let represent the minimum and maximum boundaries of the hyperrectangle along the d-th dimension, respectively; The node segmentation of the ET+ tree is represented as: The node N i According to a certain split value t of a certain dimension j ij Such that the node splits into two child nodes N i1 And N i2 Wherein In the above formula, SplitCost is the segmentation method; The query processing of the ET+ tree is a range query Q=[q1, q2,..., q d ], where q d represents a range of the query range in the dth dimension, and the procedure of the query processing is: S1.1 - Starting from the root node: From the root node N of the tree root Start query processing; S1.2 - Recursive search: Recursively check each node's hyper-rectangle MBR i to determine if further exploration of its children is needed; S1.3 - Query processing function: The definition of the query processing function Search(N i Q) is: where N i1 , N i2 , ..., N ik are the child nodes, MBR i1 , MBR i2 , ..., MBR ik are their corresponding hyper-rectangles; S1.4 - Leaf node processing: If node N i is a leaf node and the contained data object o satisfies the query range Q, return the object o to the query result; In the application creation module, an optimized map rendering method is adopted, and the steps are as follows: S2.1-Projection conversion: wherein is the central latitude and Ay is the difference in longitude. S2.2-Symbolic parameterization: select color according to attribute data: color = interpolate ( value, [min value ,max value ], [color1, color2] ) ; Wherein, interpolate is an interpolation function, and the color is determined according to linear interpolation between the minimum value and the maximum value of the attribute value value; S2.3-screen coordinate calculation: where x and y are the projected geographical coordinates, x min and y min are the minimum boundaries of the map range, Δ x and Δ y are the pixel width and height of the map range on the screen; S2.4-screen rendering: according to the symbolized geographic feature attribute, the corresponding color is filled in the surface element, and the point symbol is drawn, and the corresponding point symbol style is applied; then, according to the calculated coordinates, the boundary of the element is drawn, and the corresponding line width and style are applied; In the application creation module, a recursive tracking algorithm is used to process a complex scene, and a process of the recursive tracking algorithm is as follows: S3.1-basic equation: wherein is a position vector of the observation point, is a unit direction vector of the pixel to which the observation point is directed, and t is the length of the ray; S3.2-sphere intersection point calculation: wherein the center of the sphere is a radius R, and the intersection of the ray with the surface of the sphere is S3.3-plane intersection point calculation: wherein is the intersection of the ray with the plane, calculated by solving the ray equation and the plane equation for the parameter t S3.4-refracted ray recursive tracking calculation: wherein n1, n2 are refractive indices, is a normal vector, is a refractive direction; S3.5-recursive calculation: After the direction of the reflected or refracted ray is obtained, the recursive tracking recursively processes the new rays in the same way until a maximum recursion depth is reached or the ray is no longer reflected or refracted by the surface of an object.

8. An electronic device, comprising: The application comprises at least one processor; a memory; at least one application program, wherein the at least one application program is stored in the memory and is configured to be executed by the at least one processor, and the at least one application program is used to execute the working method of the one-key pushdown, fast application generation and migration system according to claim 7.

9. A computer readable storage medium having stored thereon a computer program, characterized in that, When the computer program is executed in the computer, the computer executes the working method of the one-key pushdown, fast application generation and migration system according to claim 7.

Images