One-key issuing, rapid application generation and migration system and working method thereof

Abstract

The invention belongs to the technical field of zero code platforms, and particularly relates to a system for one-key issuing, rapid application generation and migration 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 module, a background analysis module and a security protection module. According to the application system of the zero-code platform and the working method of the application system, the development capability, the customization capability and the compatible integration capability of complex applications are achieved, and the personalized business requirements of enterprises can be met; according to the system, complex data processing, rendering and interaction functions can be realized, an efficient unique algorithm and a data structure are used, background processing is optimized, high performance of a generated application is ensured, and the system has relatively high safety and use stability.

Description

Technical Field

[0001] The present invention belongs to the technical field of zero-code platforms, and specifically, relates to a system for one-click distribution, rapid application generation and migration, and a working method thereof. Background Art

[0002] The zero-code platform emerged against the backdrop of the maturity of cloud computing, front-end technology, microservice architecture, and the development of AI. It solves the challenges of developer resource shortages, rapid changes in business needs, and digital transformation, and is particularly suitable for independent development and innovation projects by small and medium-sized enterprises and business departments. At present, with the help of open source communities and zero-code platforms, some companies have achieved rapid construction and deployment of applications, but there are still some pain points that are difficult to solve. For example, these zero-code platforms usually make some functional compromises in their designs in order to lower the development threshold. This leads to the platform's lack of development capabilities, customization capabilities, and compatible integration capabilities for complex applications, making it difficult to meet the personalized business needs of enterprises. At the same time, since the code generated by the platform is automatically generated by dragging and dropping components and lacks manual optimization, it is very likely that the generated applications will have poor performance, data leakage, or application attacks. Summary of the invention

[0003] In view of the above-mentioned problems existing in the prior art, the purpose of the present invention is to provide a system and a working method thereof that can use visual tools and components to allow developers to achieve one-click distribution, rapid generation of applications and migration through dragging, configuration, etc.

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

[0005] A one-click distribution, rapid application generation and migration system, the system includes an identity recognition module, an application creation module, an application configuration module, a web editing module, a property editing module, a verification module, and a background analysis module;

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

[0007] The user queries and displays the 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;

[0008] The user adds or edits the material area, editing area, and material attribute area in the application configuration module using the page;

[0009] The web editing module provides different types of web components in the material area, and the user performs web editing by dragging the web component to the editing area and performing display editing of the web component on the application page in the editing area;

[0010] After completing the web editing, the user clicks on the selected web component in the editing area through the property editing module, and edits the properties of the web component in the material property area;

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

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

[0013] In the background parsing module, the data structure of ET+ tree is adopted, and the matrix of the ET+ tree is represented as follows:

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

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

[0016] The node N i According to a certain segmentation value t of a certain dimension j ij Split the node into two child nodes N i1 and N i2 ,in

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

[0018] The query processing of the ET+ tree is a range query Q = [q1, q2, ..., q d ], where q d represents the range of the query range on the dth dimension, and the query processing process is:

[0019] S1.1-Start from the root node: 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 its child nodes need to be further explored;

[0021] S1.3-Query processing function: Query processing function Search (N i ,Q) is defined as:

[0022]

[0023] Among them, N i1 ,N i2 ,...,N ik For child nodes, MBR i1 ,MBR i2 ,...,MBR ik are their corresponding hyperrectangles;

[0024] S1.4- Leaf node processing: If node N i is a leaf node, and the data object o it contains satisfies the query range Q, then the object o is returned to the query result;

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

[0026] S2.1-Projection transformation:

[0027]

[0028]

[0029] in, is the center latitude, Δy is the difference in longitude;

[0030] S2.2-Symbolization parameterization: Select colors based on attribute data:

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

[0032] Among them, interpolate is an interpolation function, which determines the color by linear interpolation between the minimum and maximum values ​​according to the attribute value;

[0033] S2.3-Screen coordinate calculation:

[0034]

[0035] Among them, x and y are the projected geographic coordinates, x min and min is the minimum boundary of the map range, Δ x and Δ y is the pixel width and height of the map extent on the screen;

[0036] S2.4-Screen rendering: Fill the area features with the corresponding colors according to the symbolized geographic feature attributes, draw the point symbols, and apply the corresponding point symbol style; then draw the feature boundaries according to the calculated coordinates and apply the corresponding line width and style;

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

[0038] S3.1 - Basic equations:

[0039]

[0040] in, is the position vector of the observation point, is the unit direction vector of the pixel pointing from the observation point to the screen, and t is the length of the ray;

[0041] S3.2 - Sphere Intersection Point Calculation:

[0042]

[0043] The center of the sphere is The radius is R, and the intersection of the ray and the surface of the sphere is

[0044] S3.3-Plane intersection calculation:

[0045]

[0046] in is the intersection point of the ray and the plane, and the parameter t is calculated by solving the ray equation and the plane equation

[0047] S3.4- Refraction ray recursive tracing calculation:

[0048]

[0049] Among them, n1 and n2 are refractive indices, is the normal vector, is the refraction direction;

[0050] S3.5-Recursive calculation:

[0051] After obtaining the direction of the reflected or refracted light, recursive tracing will recursively perform the same process on these central rays until the maximum recursion depth is reached or the light is no longer reflected or refracted by the surface of the object.

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

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

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

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

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

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

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

[0059] Furthermore, after the background parsing module completes the parsing, the page collection is synchronously sent to the front-end project directory, and the shell configuration packages the generated corresponding application and publishes it to the corresponding server.

[0060] A working method for quickly generating an application and migrating a system based on the above one-click distribution includes the following steps:

[0061] Step 1: The user logs into the platform and verifies and checks his / her identity through the identity recognition module;

[0062] Step 2: After passing the identity verification, the user can query and display the list of created applications through the application creation module, or create a new application;

[0063] Step 3: After creating a new application, the user can add or edit the material area, editing area, and material attribute area in the application configuration module page;

[0064] Step 4: After the user has finished editing the new application, the user drags the web component from the material area to the editing area through the web editing module, and displays the web component on the application page in the editing area to complete the web editing;

[0065] Step 5: After completing web editing, the user clicks on the selected web component in the editing area through the property editing module, and edits the properties of the web component in the material properties;

[0066] Step 6: After the user completes editing the web component properties, the verification module saves the web component and application edited by the user, and generates JSON data submitted to the background for verification of data integrity and accuracy;

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

[0068] In the background parsing module, the data structure of ET+ tree is adopted, and the matrix of the ET+ tree is represented as follows:

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

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

[0071] The node N i According to a certain segmentation value t of a certain dimension j ij Split the node into two child nodes N i1 and N i2 ,in

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

[0073] The query processing of the ET+ tree is a range query Q = [q1, q2, ..., q d ], where q d represents the range of the query range on the dth dimension, and the query processing process is:

[0074] S1.1-Start from the root node: 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 its child nodes need to be further explored;

[0076] S1.3-Query processing function: Query processing function Search (N i ,Q) is defined as:

[0077]

[0078] Among them, N i1 ,N i2 ,...,N ik For child nodes, MBR i1 ,MBR i2 ,...,MBR ik are their corresponding hyperrectangles;

[0079] S1.4- Leaf node processing: If node N i is a leaf node, and the data object o it contains satisfies the query range Q, then the object o is returned to the query result;

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

[0081] S2.1-Projection transformation:

[0082]

[0083] in, is the center latitude, Δy is the difference in longitude;

[0084] S2.2-Symbolization parameterization: Select colors based on attribute data:

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

[0086] Among them, interpolate is an interpolation function, which determines the color by linear interpolation between the minimum and maximum values ​​according to the attribute value;

[0087] S2.3-Screen coordinate calculation:

[0088]

[0089] Among them, x and y are the projected geographic coordinates, x min and min is the minimum boundary of the map range, Δ x and Δ y is the pixel width and height of the map extent on the screen;

[0090] S2.4-Screen rendering: Fill the area features with the corresponding colors according to the symbolized geographic feature attributes, draw the point symbols, and apply the corresponding point symbol style; then draw the feature boundaries according to the calculated coordinates and apply the corresponding line width and style;

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

[0092] S3.1 - Basic equations:

[0093]

[0094] in, is the position vector of the observation point, is the unit direction vector of the pixel pointing from the observation point to the screen, and t is the length of the ray;

[0095] S3.2 - Sphere Intersection Point Calculation:

[0096]

[0097] The center of the sphere is The radius is R, and the intersection of the ray and the surface of the sphere is

[0098] S3.3-Plane intersection calculation:

[0099]

[0100] in is the intersection point of the ray and the plane, and the parameter t is calculated by solving the ray equation and the plane equation

[0101] S3.4- Refraction ray recursive tracing calculation:

[0102]

[0103] Among them, n1 and n2 are refractive indices, is the normal vector, is the refraction direction;

[0104] S3.5-Recursive calculation:

[0105] After obtaining the direction of the reflected or refracted light, recursive tracing will recursively perform the same process on these central rays until the maximum recursion depth is reached or the light is no longer reflected or refracted by the surface of the object.

[0106] An electronic device comprises at least one processor; a memory; and at least one application, wherein the at least one application is stored in the memory and is configured to be executed by the at least one processor, and the at least one application is used to execute the working method of one-click distribution, rapid generation of applications and migration system 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 execute the working method of one-click distribution, rapid generation of applications and migration system as described in claim 7.

[0108] Compared with the prior art, the present invention has the following beneficial effects:

[0109] The present invention provides an application system of a zero-code platform and a working method thereof, which has the ability to develop complex applications, customization capabilities and compatible integration capabilities, and can meet the personalized business needs of enterprises; the system can realize complex data processing, rendering and interactive functions, uses efficient and unique algorithms and data structures, optimizes background processing, ensures the high performance of generated applications, and has high security and stability in use. BRIEF DESCRIPTION OF THE DRAWINGS

[0110] Figure 1 It is a schematic diagram of the module structure of the system of the present invention;

[0111] Figure 2 A schematic diagram of the steps of the method described in the present invention; DETAILED DESCRIPTION

[0112] The present invention is further described below in conjunction with specific embodiments.

[0113] like Figure 1 As shown, the one-click distribution, rapid application generation and migration system described in the present invention includes an identity recognition module, an application creation module, an application configuration module, a web editing module, a property editing module, a verification module, a background analysis module and a security protection module.

[0114] First, users who log in to the platform need to identify their identities through the identity recognition module, and after passing the identity verification, enter the application creation module. In this module, users can query and display the list of applications that have been created, or directly choose to create and configure new applications in this module. The applications that can be created include but are not limited to APP, H5, and mini-programs. The applications that can be configured 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 picture.

[0115] After completing the creation of a new application, the user enters the application configuration module, in which the user can use the material area, editing area, and material attribute area in the page to add or edit the page. In the material area, there are different types of web components stored according to different businesses, and the user will then enter the web editing module.

[0116] Users can drag web components to the editing area through the web editing module, and edit the display of web components on the application page in the editing area. The functions of the editing area include but are not limited to changing component positions, copying / deleting components, clearing components, saving pages, previewing pages, and generating templates.

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

[0118] After the overall property editing is completed, the basic application creation is completed. Then the verification module saves the edited application and generates and submits JSON data to the background. In the process of submitting to the background, in order to ensure the accuracy and completeness of the configuration data, the submitted JSON data will be verified and checked to ensure that the background can correctly parse and process the data after receiving it. At the same time, the data should also adopt a unique transmission and processing mechanism during the submission process.

[0119] The present invention uses efficient algorithms and data structures to optimize the processing process and ensure high performance of generated applications. Since map data has the characteristics of large data volume, complex structure, and frequent queries, optimizing algorithms and data structures is crucial to improving performance, scalability, and user experience. The present invention uses the ET+ tree data structure to significantly improve the user experience and resource utilization, and speed up the efficiency of map data loading and spatial analysis operations.

[0120] In traditional WEBGIS applications, R-tree is usually used as a storage structure. When some operations are frequent, such as a large number of insertion or deletion operations, the efficiency is very low. At the same time, due to the uneven space utilization of R-tree, the data structure will be unbalanced, resulting in space waste. Based on R-tree, Kd-tree, and Geohash, this platform has created a unique data structure (ET+tree) for WEBGIS applications. Through the structure that distinguishes between two-dimensional, three-dimensional spatial data, and static data, and the way to process geographic data into special vector data, the ability to quickly respond to geographic data queries can be achieved.

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

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

[0123] The node partitioning of the ET+ tree is expressed as:

[0124] Node N i According to a certain segmentation value t of a certain dimension j ij Split the node into two child nodes N i1 and N i2 ,in

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

[0126] The query processing of ET+ tree is range query Q = [q1,q2,...,q d ], where q d Indicates the query range on the dth dimension. The query processing process is:

[0127] S1.1-Start from the root node: 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 its child nodes need to be further explored;

[0129] S1.3-Query processing function: Query processing function Search (N i ,Q) is defined as:

[0130]

[0131] Among them, N i1 ,N i2 ,...,N ik For child nodes, MBR i1 ,MBR i2 ,...,MBR ik are their corresponding hyperrectangles;

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

[0133] The second is the unique query display function, that is, the unique vector rendering. In traditional WEBGIS applications, tile algorithms or vector map rendering methods are usually used as map rendering algorithms. Among them, the tile algorithm is an algorithm made for static or relatively stable map data, and it does not support dynamic or frequently updated scenes. And the vector map rendering method has a large amount of calculation, so the storage and computing costs required are very high. In this system, the advantages and disadvantages of the two mainstream algorithms are combined to make a unique optimization of the map rendering algorithm. The use of targeted compression mechanisms, sharded cache load mechanisms, and automatic splitting of computing tasks and asynchronous computing can effectively reduce storage and cache costs. Based on the special vector data conversion in the ET+ tree data structure, the use of innovative symbol processing algorithms and geometric calculation methods can significantly reduce the computing power required for vector rendering. At the same time, through vector data, vector maps can be dynamically generated and updated in real time to solve the lack of support for dynamic data by tile algorithms.

[0134] The present invention adopts an optimized map rendering method, the steps are:

[0135] S2.1-Projection transformation:

[0136]

[0137] in, is the center latitude, Δy is the difference in longitude;

[0138] S2.2-Symbolization parameterization: Select colors based on attribute data:

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

[0140] Among them, interpolate is an interpolation function, which determines the color by linear interpolation between the minimum and maximum values ​​according to the attribute value;

[0141] S2.3-Screen coordinate calculation:

[0142]

[0143] Among them, x and y are the projected geographic coordinates, x min and min is the minimum boundary of the map range, Δ x and Δ y is the pixel width and height of the map extent on the screen;

[0144] S2.4-Screen rendering: Fill the surface features with the corresponding colors according to the attributes of the symbolized geographic features, draw point symbols at the same time, and apply the corresponding point symbol style; then draw the boundaries of the features according to the calculated coordinates, and apply the corresponding line width and style.

[0145] Finally, a unique spatial distinction and division algorithm is adopted. In traditional WEIGIS applications, the ray method is usually used to distinguish and divide space, but the calculation complexity of the ray method is very high, and there are also problems such as it is not suitable for dynamic scenes, shadows and other data processing difficulties. Based on the original ray method algorithm, this system distinguishes spatial data through the ET+ tree data structure of this system, which can quickly exclude non-intersecting objects. At the same time, a self-developed recursive tracing algorithm is used to calculate and process complex scenes such as refraction and shadows. Thanks to the unique vector rendering and ET+ tree space distinction data structure of this system, only the changed objects or areas can be updated in each frame, instead of recalculating the entire thing, thereby effectively supporting the problems of ray tracing and spatial collision in dynamic scenes.

[0146] Specifically, the process of the recursive tracking algorithm is:

[0147] S3.1 - Basic equations:

[0148]

[0149] in, is the position vector of the observation point, is the unit direction vector of the pixel pointing from the observation point to the screen, and t is the length of the ray;

[0150] S3.2 - Sphere Intersection Point Calculation:

[0151]

[0152] The center of the sphere is The radius is R, and the intersection of the ray and the surface of the sphere is

[0153] S3.3-Plane intersection calculation:

[0154]

[0155] in is the intersection point of the ray and the plane, and the parameter t is calculated by solving the ray equation and the plane equation

[0156] S3.4- Refraction ray recursive tracing calculation:

[0157]

[0158] Among them, n1 and n2 are refractive indices, is the normal vector, is the refraction direction;

[0159] S3.5-Recursive calculation:

[0160] After obtaining the direction of the reflected or refracted light, recursive tracing will recursively perform the same process on these central rays until the maximum recursion depth is reached or the light is no longer reflected or refracted by the surface of the object.

[0161] The background parsing module parses the JSON data uploaded by the user, obtains the type, calls the corresponding page generation logic or template according to the type, generates the corresponding page, and ensures that the generated page structure and content are consistent with the configuration data. During the generation process, the use of specific page generation logic or templates can ensure that different types of page requirements are met. At the same time, performance optimization and error handling mechanisms can be implemented during the page generation process to ensure the quality and stability of the generated page, thereby avoiding page generation anomalies caused by data parsing errors or logic vulnerabilities.

[0162] Finally, the generated page collection is synchronously placed in the front-end project directory, and the shell configuration is packaged to generate the corresponding application and published to the corresponding server. During the synchronization process, the maintainability and scalability are ensured through the optimized placement of page collections and the design of organizational structure. By managing and maintaining the dependencies and configurations of the front-end project, the generated pages are ensured to be consistent with the structure and specifications of the existing front-end project, which is convenient for integration and use. The availability and stability of the page are guaranteed through the version management and update strategy of the page collection.

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

[0164] First, in terms of data encryption, we use the Advanced Encryption Standard to encrypt data during the storage and transmission of critical data. This ensures that data will not be stolen or tampered with by unauthorized access during transmission and storage. At the same time, a strict key management policy is adopted to ensure the security and confidentiality of encryption keys. Keys are only decrypted when necessary, and access to keys is strictly limited to prevent internal or external threats from accessing encrypted data.

[0165] In the area of ​​permission 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 assigned specific permissions, thereby achieving precise control over the access rights of different users in the system. We isolate data permissions based on multiple tenants to ensure that data from different tenants is isolated from each other within the system. Each tenant has its own data space and resources. The system uses a strict access control mechanism to ensure that users can only access the data of the tenant to which they belong, effectively preventing data leakage and misuse.

[0166] In the security audit part, the platform can record all key events, such as user login, permission changes, data access, etc. Each event will be recorded and can be traced back to the specific user and time. At the same time, a detailed audit log is generated to record the execution of each important operation, including key information such as operation time, executor, and operation content. These log data are stored securely to ensure their integrity and non-tamperability. Our security audit function complies with industry standards and regulatory requirements (Second Level Security Protection), ensures that system operations meet relevant compliance requirements, and supports audits of system operations.

[0167] like Figure 2 As shown, the working method of the present invention for one-key distribution, rapid generation of application and migration system includes the following steps:

[0168] Step 1: The user logs into the platform and verifies and checks his / her identity through the identity recognition module;

[0169] Step 2: After passing the identity verification, the user can query and display the list of created applications through the application creation module, or create a new application;

[0170] Step 3: After creating a new application, the user can add or edit the material area, editing area, and material attribute area in the application configuration module page;

[0171] Step 4: After the user has finished editing the new application, the user drags the web component from the material area to the editing area through the web editing module, and displays the web component on the application page in the editing area to complete the web editing;

[0172] Step 5: After completing web editing, the user clicks on the selected web component in the editing area through the property editing module, and edits the properties of the web component in the material properties;

[0173] Step 6: After the user completes editing the web component properties, the verification module saves the web component and application edited by the user, and generates JSON data submitted to the background for verification of data integrity and accuracy;

[0174] Step 7: The background 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, while ensuring that the generated page structure and content are consistent with the configuration data;

[0175] In the background parsing module, the data structure of ET+ tree is adopted, and the matrix of ET+ tree is represented as follows:

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

[0177] The node partitioning of the ET+ tree is expressed as:

[0178] Node N i According to a certain segmentation value t of a certain dimension j ij Split the node into two child nodes N i1 and N i2 ,in

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

[0180] The query processing of ET+ tree is range query Q = [q1,q2,...,q d ], where q d Indicates the query range on the dth dimension. The query processing process is:

[0181] S1.1-Start from the root node: 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 i, determine whether its child nodes need to be further explored;

[0183] S1.3-Query processing function: Query processing function Search (N i ,Q) is defined as:

[0184]

[0185] Among them, N i1 ,N i2 ,...,N ik For child nodes, MBR i1 ,MBR i2 ,...,MBR ik are their corresponding hyperrectangles;

[0186] S1.4- Leaf node processing: If node N i is a leaf node, and the data object o it contains satisfies the query range Q, then the object o is returned to the query result;

[0187] In the application creation module, the optimized map rendering method is used. The steps are:

[0188] S2.1-Projection transformation:

[0189]

[0190] in, is the center latitude, Δy is the difference in longitude;

[0191] S2.2-Symbolization parameterization: Select colors based on attribute data:

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

[0193] Among them, interpolate is an interpolation function, which determines the color by linear interpolation between the minimum and maximum values ​​according to the attribute value;

[0194] S2.3-Screen coordinate calculation:

[0195]

[0196]

[0197] Among them, x and y are the projected geographic coordinates, x min and min is the minimum boundary of the map range, Δ x and Δy is the pixel width and height of the map extent on the screen;

[0198] S2.4-Screen rendering: Fill the area features with the corresponding colors according to the symbolized geographic feature attributes, draw the point symbols, and apply the corresponding point symbol style; then draw the feature boundaries according to the calculated coordinates and apply the corresponding line width and style;

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

[0200] S3.1 - Basic equations:

[0201]

[0202] in, is the position vector of the observation point, is the unit direction vector of the pixel pointing from the observation point to the screen, and t is the length of the ray;

[0203] S3.2 - Sphere Intersection Point Calculation:

[0204]

[0205] The center of the sphere is The radius is R, and the intersection of the ray and the surface of the sphere is

[0206] S3.3-Plane intersection calculation:

[0207]

[0208] in is the intersection point of the ray and the plane, and the parameter t is calculated by solving the ray equation and the plane equation

[0209] S3.4- Refraction ray recursive tracing calculation:

[0210]

[0211] Among them, n1 and n2 are refractive indices, is the normal vector, is the refraction direction;

[0212] S3.5-Recursive calculation:

[0213] After obtaining the direction of the reflected or refracted light, recursive tracing will recursively perform the same process on these central rays until the maximum recursion depth is reached or the light is no longer reflected or refracted by the surface of the object.

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

[0215] A computer-readable storage medium of the present invention stores a computer program thereon. When the computer program is executed in a computer, the computer is caused to execute the working method of one-click distribution, rapid generation of application and migration system as described in claim 7.

Claims

1. A one-click distribution, rapid application generation and migration system, characterized in that: The system includes an identity recognition module, an application creation module, an application configuration module, a web editing module, a property editing module, a verification module, and a background analysis module; The identity recognition module is used to identify the identity of the user; The user queries and displays the 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 the material area, editing area, and material attribute area in the application configuration module using the page; The web editing module provides different types of web components in the material area, and the user performs web editing by dragging the web component to the editing area and performing display editing of the web component on the application page in the editing area; After completing the web editing, the user clicks on the selected web component in the editing area through the property editing module, and edits the properties of the web component in the material property area; The verification module verifies the integrity and accuracy of the JSON data that the user has edited, saved, and generated and submitted to the backend; The background parsing module parses the JSON data uploaded by the user, obtains the type type, and calls the corresponding page generation logic or template according to the type type to generate the corresponding page, and ensures that the generated page structure and content are consistent with the configuration data; In the background parsing module, the data structure of ET+ tree is adopted, and the matrix of the ET+ tree is represented as follows: In the ET+ tree, each node N i Both are represented as a d-dimensional hyperrectangle MBR i =[l1,u1]×[l2,u2]×...×[l id ,u id ], where l id and u id They represent the minimum and maximum boundaries of the hyperparameter in the dth dimension respectively; The node segmentation of the ET+ tree is expressed as: The node N i According to a certain segmentation value t of a certain dimension j ij Split the node into two child nodes N i1 and N i2 ,in In the above formula, SplitCost is the splitting method; The query processing of the ET+ tree is a range query Q = [q1, q2, ..., q d ], where q d represents the range of the query range on the dth dimension, and the query processing process is: S1.1-Start from the root node: From the root node N of the tree root Start query processing; S1.2- Recursive Search: Recursively check the hyperrectangular MBR of each node i , determine whether its child nodes need to be further explored; S1.3-Query processing function: Query processing function Search (N i ,Q) is defined as: Among them, N i1 ,N i2 ,...,N ik For child nodes, MBR i1 ,MBR i2 ,...,MBR ik are their corresponding hyperrectangles; S1.4- Leaf node processing: If node N i is a leaf node, and the data object o it contains satisfies the query range Q, then the object o is returned to the query result; In the application creation module, an optimized map rendering method is used, and the steps are as follows: S2.1-Projection transformation: in, is the center latitude, Δy is the difference in longitude; S2.2-Symbolization parameterization: Select colors based on attribute data: color=interpolate(value,[min value ,max value ],[color1,color2]); Among them, interpolate is an interpolation function, which determines the color by linear interpolation between the minimum and maximum values ​​according to the attribute value; S2.3-Screen coordinate calculation: Among them, x and y are the projected geographic coordinates, x min and min is the minimum boundary of the map range, Δ x and Δ y is the pixel width and height of the map extent on the screen; S2.4-Screen rendering: Fill the area features with the corresponding colors according to the symbolized geographic feature attributes, draw the point symbols, and apply the corresponding point symbol style; then draw the feature boundaries according to the calculated coordinates and apply the corresponding line width and style; In the application creation module, a recursive tracing algorithm is used to process complex scenes. The process of the recursive tracing algorithm is as follows: S3.1 - Basic equations: in, is the position vector of the observation point, is the unit direction vector of the pixel pointing from the observation point to the screen, and t is the length of the ray; S3.2 - Sphere Intersection Point Calculation: 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 calculation: in is the intersection point of the ray and the plane, and the parameter t is calculated by solving the ray equation and the plane equation S3.4- Refraction ray recursive tracing calculation: Among them, n1 and n2 are refractive indices, is the normal vector, is the refraction direction; S3.5-Recursive calculation: After obtaining the direction of the reflected or refracted light, recursive tracing will recursively perform the same process on these central rays 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-click distribution, rapid application generation and migration system according to claim 1 is characterized in that: The system also includes a security protection module, which encrypts the transmitted data, controls permissions, and performs security audits; The security protection module manages and allocates user permissions based on a user-role-permission model. Each user is assigned to one or more roles, and each role is assigned specific permissions. The security protection module implements data permission isolation based on multi-tenants; The security protection module records all user operation events and generates an audit log.

3. The one-click distribution, rapid application generation and migration system according to claim 1 is characterized in that: In the application creation module, the applications that can be created include APP, H5 and mini-programs; In the application configuration module, 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-click distribution, rapid application generation and migration system according to claim 1 is characterized in that: The web editing includes changing component position, copying / deleting components, clearing components, saving pages, previewing pages, and generating templates.

5. The one-click distribution, rapid application generation and migration system according to claim 1 is characterized in that: The properties of the web component include event information, network request information, page jump information and page configuration information.

6. The one-click distribution, rapid application generation and migration system according to claim 1 is characterized in that: After the background parsing module completes the parsing, the page collection is synchronously sent to the front-end project directory, and the shell configuration is packaged to generate the corresponding application and published to the corresponding server.

7. A method for one-click distribution, rapid generation of application and migration system according to any one of claims 1 to 6, characterized in that: The following steps are involved: Step 1: The user logs into the platform and verifies and checks his / her identity through the identity recognition module; Step 2: After passing the identity verification, the user can query and display the list of created applications through the application creation module, or create a new application; Step 3: After creating a new application, the user can add or edit the material area, editing area, and material attribute area in the application configuration module page; Step 4: After the user has finished editing the new application, the user drags the web component from the material area to the editing area through the web editing module, and displays the web component on the application page in the editing area to complete the web editing; Step 5: After completing web editing, the user clicks on the selected web component in the editing area through the property editing module, and edits the properties of the web component in the material properties; Step 6: After the user completes editing the web component properties, the verification module saves the web component and application edited by the user, and generates JSON data submitted to the background for verification of data integrity and accuracy; Step 7: The background parsing module parses the received JSON data uploaded by the user, obtains the type type, and calls the corresponding page generation logic or template according to the type type to generate the corresponding page, while ensuring that the generated page structure and content are consistent with the configuration data; In the background parsing module, the data structure of ET+ tree is adopted, and the matrix of the ET+ tree is represented as follows: In the ET+ tree, each node N i Both are represented as a d-dimensional hyperrectangle MBR i =[l1,u1]×[l2,u2]×...×[l id ,u id ], where l id and u id They represent the minimum and maximum boundaries of the hyperparameter in the dth dimension respectively; The node segmentation of the ET+ tree is expressed as: The node N i According to a certain segmentation value t of a certain dimension j ij Split the node into two child nodes N i1 and N i2 ,in In the above formula, SplitCost is the splitting method; The query processing of the ET+ tree is a range query Q = [q1, q2, ..., q d ], where q d represents the range of the query range on the dth dimension, and the query processing process is: S1.1-Start from the root node: From the root node N of the tree root Start query processing; S1.2- Recursive Search: Recursively check the hyperrectangular MBR of each node i , determine whether its child nodes need to be further explored; S1.3-Query processing function: Query processing function Search (N i ,Q) is defined as: Among them, N i1 ,N i2 ,...,N ik For child nodes, MBR i1 ,MBR i2 ,...,MBR ik are their corresponding hyperrectangles; S1.4- Leaf node processing: If node N i is a leaf node, and the data object o it contains satisfies the query range Q, then the object o is returned to the query result; In the application creation module, an optimized map rendering method is used, and the steps are as follows: S2.1-Projection transformation: in, is the center latitude, Δy is the difference in longitude; S2.2-Symbolization parameterization: Select colors based on attribute data: color=interpolate(value,[min value ,max value ],[color1,color2]); Among them, interpolate is an interpolation function, which determines the color by linear interpolation between the minimum and maximum values ​​according to the attribute value; S2.3-Screen coordinate calculation: Among them, x and y are the projected geographic coordinates, x min and min is the minimum boundary of the map range, Δ x and Δ y is the pixel width and height of the map extent on the screen; S2.4-Screen rendering: Fill the area features with the corresponding colors according to the symbolized geographic feature attributes, draw the point symbols, and apply the corresponding point symbol style; then draw the feature boundaries according to the calculated coordinates and apply the corresponding line width and style; In the application creation module, a recursive tracing algorithm is used to process complex scenes. The process of the recursive tracing algorithm is as follows: S3.1 - Basic equations: in, is the position vector of the observation point, is the unit direction vector of the pixel pointing from the observation point to the screen, and t is the length of the ray; S3.2 - Sphere Intersection Point Calculation: 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 calculation: in is the intersection point of the ray and the plane, and the parameter t is calculated by solving the ray equation and the plane equation S3.4- Refraction ray recursive tracing calculation: Among them, n1 and n2 are refractive indices, is the normal vector, is the refraction direction; S3.5-Recursive calculation: After obtaining the direction of the reflected or refracted light, recursive tracing will recursively perform the same process on these central rays until the maximum recursion depth is reached or the light is no longer reflected or refracted by the surface of the object.

8. An electronic device, characterized in that: It includes at least one processor; a memory; and at least one application, wherein the at least one application is stored in the memory and is configured to be executed by the at least one processor, and the at least one application is used to execute the working method of one-click distribution, rapid generation of applications and migration system according to claim 7.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed in a computer, the computer is caused to execute the working method of one-click distribution, rapid generation of application and migration system as described in claim 7.

Images