A low-code data linkage setting method and system

Abstract

The present invention relates to a low-code data linkage setting method and system, the method comprising: based on the position and nesting relationship of the components in the page, traversing the components in the page in a preset manner to obtain an ordered component sequence corresponding to the page; obtaining the structural association of the components based on the ordered component sequence; obtaining the data source association of the components based on the component data binding rules; and setting the components in the page in linkage based on the data source association and structural association of any pair of components. The historical usage data supported by big data of the present invention provides the association between components and data sources for data linkage setting from the component structural relationship contained in the page components and the inherent association of the data source, thereby improving development efficiency and user experience.

Description

[Technical field]

[0001] The present invention belongs to the technical field of user interface design, and in particular, relates to a low-code data linkage setting method and system. [Background technology]

[0002] Low-code environment refers to a software development platform that allows developers to create applications through graphical interfaces and model-driven logic without writing a lot of code. This environment provides a series of tools and components that enable non-professional developers to build, customize and deploy enterprise-level applications. The core features of the low-code environment include: Visual design tools: Provide a drag-and-drop interface that allows users to design the interface and process of the application in a graphical way without in-depth coding. Pre-built components and templates: Provide a rich set of UI components and business logic templates to quickly build common application functions. In a low-code environment, page data binding usually involves several key technologies and methods, which enable developers to complete application development with very little code through graphical interfaces and configuration methods. With the rapid development of information technology, enterprises have an increasing demand for rapid development and deployment of applications. Low-code development platforms have received widespread attention for their fast development cycles and simplified development processes.

[0003] The choice of data source has a direct impact on the linkage effect, because it determines the data content that the component can display and how to respond to user interactions. Here are some of the effects of data source selection on linkage effects: First, the real-time nature of the data: If the data source is updated in real time (such as a database or real-time API), the linkage effect can reflect the latest data status. If the data source is static (such as a predefined array or collection), the linkage effect will be limited to the initially loaded data and will not be updated with external changes. Second, the complexity of the data: Complex data sources (such as nested objects or arrays) may require additional processing to be displayed correctly in the component, which may affect the performance and user experience of the linkage. Simple data sources (such as flat lists) are generally easier to bind and display, and can provide a smoother linkage experience. Third, the filterability of data: Filterable data sources allow developers to dynamically adjust the displayed data set based on the linkage conditions, which is very important for providing user-customized views. Non-filterable data sources limit the flexibility of linkage and may cause the user interface to display irrelevant or excessive data. Fourth, the extensibility of data: Extensible data sources can add more data without changing the existing linkage logic, which helps to expand future functions. Fixed or non-extensible data sources may require rewriting the linkage logic to adapt to new data structures or content. Fifth, data consistency: A consistent data source ensures the uniformity of data formats and types, which helps reduce errors and anomalies in the linkage process. Inconsistent data sources may cause components to fail to parse data correctly, affecting the stability of the linkage effect. Sixth, data security: A secure data source ensures the protection of sensitive information and prevents unauthorized access, which is critical for linkage involving personal or confidential data. An insecure data source may expose data, leading to privacy leaks or security risks. Seventh, data maintainability: An easy-to-maintain data source can be easily updated and modified, which helps to maintain the linkage logic in the long term. A difficult-to-maintain data source may make the linkage logic difficult to update and increase maintenance costs. Eighth, data accessibility: An accessible data source ensures that all users can access the data, regardless of the user's network conditions or devices. An inaccessible data source may cause some users to be unable to load or view the linkage data, affecting the user experience. Therefore, choosing the right data source is crucial to achieving efficient, stable, and user-friendly data linkage. Developers need to choose the right data source based on the needs of the application, the characteristics of the data, and the expected user experience. However, the data linkage settings in the prior art are all based on the user's autonomous selection or rely on the logical relationship existing in the data source itself, and fail to fully utilize the structural relationship of the components in the page and the big data resources to effectively provide the linkage settings.In order to solve the problems in the prior art, the present invention proposes a low-code data linkage setting method and system, which is based on historical usage data supported by big data, and provides the correlation between components and data sources for data linkage setting from the component structure relationship contained in the page components and the inherent correlation of the data source, thereby improving development efficiency and user experience. [Summary of the invention]

[0004] In order to solve the above problems in the prior art, the present invention proposes a low-code data linkage setting method and system, the method comprising:

[0005] Step S1: Perform page layout and component dragging through the page editor on the visual interface, drag components in the component library to the page canvas, and quickly build the page layout; after dragging is completed, the components are laid out on the page;

[0006] Step S2: obtaining data binding rules related to the component, determining a data source and associating the data source with the component; associating component attributes with data source fields based on the data binding rules;

[0007] Step S3: based on the position and nesting relationship of the components in the page, traverse the components in the page in a preset manner to obtain an ordered component sequence corresponding to the page; wherein: the ordered component sequence includes component identifiers arranged in a traversal order;

[0008] Step S4: obtaining the structural association of the components based on the ordered component sequence; obtaining the data source association of the components based on the component data binding rules;

[0009] The step of obtaining the structural association of components based on the ordered component sequence specifically includes the following steps:

[0010] Step S4A1: obtaining an unprocessed component in the page as the current component;

[0011] Step S4A2: searching for historical usage data based on the current ordered component sequence of the current page, and taking the historical usage data in the historical usage data whose ordered component sequence corresponding to the page is the same as or similar to the current ordered component sequence as the historical usage data for the current page;

[0012] Step S4A3: for each piece of historical usage data in the historical usage data of the current component, if the positions of a component and another component in the corresponding ordered component sequence are the same as the positions of the current component and the corresponding another component in the current ordered component sequence, and the data source between the two is used at the same time, then the number of structural associations between the current component and the corresponding another component is increased;

[0013] Step S4A4: dividing the number of structural associations between the current component and the corresponding another component by the total number of structural associations to obtain the structural association degree between the current component and the corresponding another component;

[0014] Step S4A5: Repeat the above steps until all components in the current page are processed;

[0015] Step S4A5: Repeat the above steps until all components in the current page are processed;

[0016] The step of obtaining the data source association of a component based on the component data binding rule specifically includes the following steps:

[0017] Step S4B1: for each component in the page, determine the minimum data source involved in its data binding rule; the minimum data source is the minimum part of the component-associated data source involving the current component;

[0018] Step S4B2: Determine the maximum data source of the minimum data sources of all components based on the minimum data source; the maximum data source is the smallest divisible physical or logical range that includes all the minimum data sources;

[0019] Step S4B3: Analyze the historical usage data for the maximum data source to obtain the number of associations between the minimum data sources; specifically: sort the historical usage data based on the time interval so that the historical usage data within the same time interval constitutes one piece of historical usage data; in each piece of historical usage data, if both minimum data sources are used, then increase the number of associations between the two minimum data sources; otherwise, do not change the number of associations between the two minimum data sources;

[0020] Step S4B4: Divide the number of associations between the two minimum data sources by the total number of associations to obtain the degree of association between the two minimum data sources; and use the degree of association between the two components corresponding to the two minimum data sources as the data source association degree;

[0021] Step S5: Linkage setting is performed on the components in the page based on the data source association and structural association of any pair of components; specifically: for each component, the predicted association between it and any other component is calculated based on the data source association and structural association, and linkage setting is performed between components based on the predicted association; the predicted association is positively correlated with the data source association and structural association.

[0022] Furthermore, the page editor also supports nesting and hierarchical management of components.

[0023] Furthermore, the data source is one or more of a database, an API interface, a data server, a big data service platform, a data class, a data cluster, a data table or other data services.

[0024] Furthermore, the similarity between the current ordered component sequence and the ordered component sequence corresponding to the page in the historical usage data is calculated based on the Euclidean distance.

[0025] Further, the position of the component in the page is indicated by a specific position of the component.

[0026] Furthermore, the initial value of the number of structural associations between two components is set to 0; and the initial value of the number of associations between two minimum data sources is set to 0.

[0027] A low-code data linkage setting system, which is used to implement the above-mentioned low-code data linkage setting method.

[0028] A low-code data linkage setting device, which is used to implement the above-mentioned low-code data linkage setting method.

[0029] A low-code data linkage setting module, which is used to implement the above-mentioned low-code data linkage setting method.

[0030] A low-code data linkage setting server, characterized in that the low-code data linkage setting server is used to implement the above-mentioned low-code data linkage setting method.

[0031] The beneficial effects of the present invention include:

[0032] (1) Based on the historical usage data supported by big data, the component structural relationship contained in the page components and the inherent correlation of the data source are used to assist in providing the correlation between components and data sources for data linkage settings, thereby improving development efficiency and user experience. Specifically, through the first position order relationship and the second order relationship, the pre-order plus in-order traversal method can uniquely represent the structural relationship of components in the page, and convert the page organization relationship into an ordered component sequence identified in numerical form, so that the historical usage data can be quickly used to determine the structural correlation between components and their data sources;

[0033] From the perspective of data source association, which is completely different from structural association, it is found that the data source itself has inherent association information, which complements the structural association, thereby helping developers make better data linkage decisions with lower computational complexity and improving the decision quality of applications;

[0034] (2) By quantifying the data source correlation and structural correlation between components, the linkage relationship between components can be predicted and optimized. The weights of the data source correlation and structural correlation can be calculated through normalization processing and the concept of information entropy. Then, through the linkage component queue, developers can prioritize the components that are most likely to need linkage based on the predicted linkage degree. In addition, independent linkage settings and global linkage settings can optimize the linkage settings of the entire page at different levels and from different perspectives.

Brief Description of the Drawings

[0035] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of the present application, but do not constitute an improper limitation of the present invention. In the drawings:

[0036] Figure 1 Schematic diagram of the low-code data linkage setting method provided by the present invention. [Specific implementation method]

[0037] The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments, wherein the illustrative embodiments and descriptions are only used to explain the present invention but are not intended to limit the present invention.

[0038] The present invention proposes a low-code data linkage setting method and system, as shown in the attached Figure 1 As shown, the method comprises the following steps:

[0039] Step S1: Perform page layout and component dragging through the page editor on the visual interface, drag components in the component library to the page canvas, and quickly build the page layout; after dragging is completed, the components are laid out on the page;

[0040] Preferred: The page editor also supports component nesting and hierarchical management;

[0041] Preferably: after the position and size are adjusted, the position and nesting relationship of the component in the page are fixed or temporarily fixed; after the position and nesting relationship are changed, steps S2-S5 are re-executed to perform dynamic data linkage setting;

[0042] Step S2: obtaining data binding rules related to the component, determining the data source and associating the data source with the component; associating component properties with data source fields based on the data binding rules; filtering data in the data source based on the component properties, and returning data in the data source fields that meet the component properties to the component based on the data binding rules;

[0043] Preferably: a data source that complies with the data binding rule is used as a data source bound to the component, and the data source is associated with the component;

[0044] Preferably: the data binding rule includes one or more component attributes related to the component; fill in the attribute values ​​of a part of the component attributes in the data binding rule to filter the data in the data source, and associate another part of the component attributes with the data source field;

[0045] Preferably: automatically associate page components with data sources according to preset data binding rules; the page editor allows users to select and fill in component attribute values, and select corresponding data fields from the data source field list for binding;

[0046] Preferably: the data source is a database, an API interface, a data server, a big data service platform, a data class, a data cluster, a data table or other data services;

[0047] Step S3: Based on the position and nesting relationship of the components in the page, the components in the page are traversed in a preset manner to obtain an ordered component sequence corresponding to the page; wherein: the ordered component sequence includes component identifiers arranged in a traversal order; the ordered component sequence rigorously expresses the page structure from a quantitative perspective, and at the same time, it does not have strict requirements on the actual organizational structure of the page, but only describes the relative relationship between the components and their general layout in the page, so that the linkage setting can use appropriate page structure information;

[0048] Preferably: the preset manner is to traverse the components in the page in a specific positional relationship order based on the positions of the components in the page and the nested relationships between the components in the page, and to arrange the component identifiers in sequence in the traversal order to form an ordered component sequence;

[0049] Preferably: the component identifier is used to indicate the type of the component; each component type has a unique identifier, that is, when the user drags a component, the type of the dragged component is determined;

[0050] Preferably: each component identifier is unique; therefore, when comparing ordered component sequences, a comparison is actually made of the relative loose positions of component types in the page;

[0051] Preferably: the specific position relationship sequence is first up then down, first left then right (first row then column);

[0052] Preferably: the traversal of the nested relationship is one of pre-order, in-order, and post-order traversal;

[0053] Preferably: the position of the component in the page is indicated by a specific position of the component; for example: the position of the upper left corner of the component, the position closest to the upper left corner of the page, etc.;

[0054] Based on the position and nesting relationship of the components in the page, the components in the page are traversed in a preset manner to obtain an ordered component sequence corresponding to the page; specifically, the steps include:

[0055] Step S3A1: Determine the location of each component's specific position in the page;

[0056] Step S3A2: traverse based on the position order relationship; specifically: according to the first position order relationship, traverse based on the position of the specific position in the page, and put the traversal results into the first ordered component sequence in sequence; repeat this step until the traversal is completed; according to the second position order relationship, traverse based on the position of the specific position in the page, and put the traversal results into the second ordered component sequence; repeat this step until the traversal is completed; for nested relationships, traverse in a pre-order traversal manner;

[0057] Wherein: when a component is nested within a component, a tree structure is used to represent the component and the nested relationship within it, and the direct nested relationship is represented as a parent-child relationship in the tree structure; multiple components within the same nest are sorted according to the first position sequence relationship or the second position sequence relationship, and are represented as sibling relationships; a pre-order traversal is performed on the tree structure of the component to obtain a traversal result corresponding to the component and the nested relationship within it, and the traversal result is placed in the corresponding position of the component in the first ordered component sequence or the second ordered component sequence;

[0058] Preferably: the first position sequence relationship and the second position sequence relationship are different;

[0059] Preferably: the first position order relationship is a row-first-column-later order relationship, and the second position order relationship is a column-first-row-later order relationship; traversing based on two different order relationships can improve the uniqueness of the sequence representation of the page;

[0060] Alternatively, the step S3A2 is specifically as follows: traverse based on the nested sequence relationship; specifically: traverse based on the position of the specific position in the page according to the first position sequence relationship, and put the traversal results into the first ordered component sequence in sequence; traverse the nested relationship in a pre-order traversal manner; repeat this step until the traversal is completed; traverse based on the position of the specific position in the page according to the first position sequence relationship, and put the traversal results into the second ordered component sequence in sequence; traverse the nested relationship in an in-order traversal manner; repeat this step until the traversal is completed;

[0061] Preferably: the step S3A2 specifically comprises: determining the proportion of components in a nested relationship among the components, and when the proportion is greater than a preset proportion value, traversing based on the nested order relationship; otherwise, traversing based on the position order relationship; that is, when the component nesting relationship is complex, traversing based on the position order relationship can improve the uniqueness of the page representation, otherwise, traversing in a non-replacement manner can improve the uniqueness of the page representation;

[0062] Preferably: the preset ratio value is 50%;

[0063] Step S3A3: concatenate the first ordered component sequence and the second ordered component sequence to obtain an ordered component sequence; the ordered component sequence can uniquely represent the structural relationship of the components in the page;

[0064] Preferred: The page editor provides an intuitive interface that allows developers to quickly build page layouts by dragging components from the component library onto the canvas; the component library includes a variety of pre-made UI components, such as text boxes, buttons, lists, charts, etc. Developers can configure the properties of each component through the property panel, such as setting text, color, size, etc.;

[0065] Step S4: obtaining the structural association of the components based on the ordered component sequence; obtaining the data source association of the components based on the component data binding rules;

[0066] The step of obtaining the structural association of components based on the ordered component sequence specifically includes the following steps:

[0067] Step S4A1: obtaining an unprocessed component in the page as the current component;

[0068] Step S4A2: searching for historical usage data based on the current ordered component sequence of the current page, and taking the historical usage data in the historical usage data whose ordered component sequence corresponding to the page is the same as or similar to the current ordered component sequence as the historical usage data for the current page;

[0069] Preferably: calculating whether the current ordered component sequence is similar to the ordered component sequence corresponding to the page in the historical usage data based on the Euclidean distance;

[0070] Preferably: the historical usage data includes one or more of the organization mode, structural relationship, data binding rules of the page and its components, usage data of the data source and / or data linkage setting mode, etc.;

[0071] Alternatively: determine the historical usage data for the current page based on the current ordered component sequence of the current page; specifically: if there is a page in the historical usage data, its corresponding ordered component sequence and the current ordered component sequence The same subsequence in If the following conditions (1) or (2) are met, the historical usage data of the page is used as the historical usage data for the current page; wherein; is the subsequence length ratio threshold, It is the proportion threshold when the subsequence length is k. Is the length subsequence of yes The number of is the length of the current ordered component sequence, Is the length The length of the subsequence is is the subsequence length number, is a subsequence of the current ordered component sequence; is the current ordered component sequence The number of non-empty subsequences of ;

[0072] (1);

[0073] (2);

[0074] Preferred: Subsequence length ratio threshold, proportion threshold for subsequence length k is the default value;

[0075] Step S4A3: for each piece of historical usage data in the historical usage data of the current component, if the positions of one component and another component (in the same page) in the corresponding ordered component sequence are the same as the positions of the current component and the corresponding another component in the current ordered component sequence, and the data source between the two (specifically limited to the associated fields) is used at the same time, then the number of structural associations between the current component and the corresponding another component is increased; otherwise, the number of structural associations between the current component and the corresponding another component is not changed; obviously, the component identifiers of the one component and the current component are the same, and the component identifiers of the other component and the corresponding another component in the current page are the same; through comparison of the ordered group sequence, the positions of the one component and the other component pair in the page of historical usage data are the same as the positions of the current component and the corresponding another component in the current page;

[0076] If the comparison of the ordered component sequence is loose, that is, the comparison is made in a similar way, it is necessary to compare the identifiers first when processing each component. If the identifiers are different, no other operations of the historical usage data for the current component are required; and if they are the same, some differences between the pages involved in the historical usage data and the current page in the ordered component sequence can be ignored;

[0077] Preferably: set the initial value of the number of structural associations between two arbitrary components to 0;

[0078] Preferably, the simultaneous use is simultaneous use within a time interval; of course, the simultaneous use can be limited and screened by other parameters;

[0079] The simultaneous use refers to the data source data or the part of the data source involving one component and another component (specifically limited to the data table where the associated field is located) being updated, changed, accessed and / or passively accessed, or a combination thereof;

[0080] The data sources between the one component and the other component are used simultaneously, specifically: if the usage data is updated and changed, it is further determined that if the numerical amplitude of the update or change is greater than a preset amplitude, it is determined that they are used simultaneously; if the usage data is accessed and / or passively accessed, it is further determined that if the frequency of access and / or being accessed is greater than a preset frequency threshold, it is determined that they are used simultaneously;

[0081] Step S4A4: dividing the number of structural associations between the current component and the corresponding another component by the total number of structural associations to obtain the structural association degree between the current component and the corresponding another component;

[0082] Alternatively: the total number of structural associations is the sum of all structural associations in the historical usage data of the current component or the average of the sum of all structural associations;

[0083] Step S4A5: Repeat the above steps until all components in the current page are processed;

[0084] The step of obtaining the data source association of a component based on the component data binding rule specifically includes the following steps:

[0085] Step S4B1: for each component in the page, determine the minimum data source involved in its data binding rule; the minimum data source is the minimum part of the component-associated data source involved in the current component (minimum data source range); for example: the minimum divisible hardware or logic range involved in the data source field; for example: data table A, data tables A~F, etc., data page A, data pages A~Z, etc.;

[0086] Step S4B2: Determine the maximum data source (maximum data source range) of the minimum data sources including all components based on the minimum data source; the maximum data source is the smallest divisible physical or logical range including all minimum data sources; the maximum data source includes continuous data; for example: senior high school student information data source, all data in the address range from 0000h to 1111h;

[0087] Step S4B3: Analyze the historical usage data (or the most recent historical usage data) for the maximum data source to obtain the number of associations between the minimum data sources; specifically: sort the historical usage data based on the time interval so that the historical usage data within the same time interval constitutes one piece of historical usage data; in each piece of historical usage data, if both minimum data sources are used, then increase the number of associations between the two minimum data sources; otherwise, do not change the number of associations between the two minimum data sources;

[0088] Preferably: the time interval is a preset value;

[0089] In fact, the association between the minimum data sources is not limited to two-by-two associations, and there may be multiple simultaneous associations. However, in order to reduce the complexity of analysis, the multi-level association analysis is reduced to a one-dimensional two-by-two association analysis, supplemented by structural association to make up for the accuracy; the data items in the minimum data source and the maximum data source are continuous in the physical or logical space corresponding to the minimum data source, and the physical or logical space is the minimum physical or logical space that satisfies the data binding rules corresponding to the component; for example: all data in the minimum data source exist in a file, a data table, or a data block, and all data items have the same data attributes, etc.;

[0090] Step S4B4: Divide the number of associations between the two minimum data sources by the total number of associations to obtain the degree of association between the two minimum data sources; and use the degree of association between the two components corresponding to the two minimum data sources as the data source association degree;

[0091] Preferably: the total number of associations is the sum of the number of associations of all minimum data sources;

[0092] Step S5: Linkage setting is performed on the components in the page based on the data source association and structure association of any pair of components; specifically: for each component, the predicted association between it and any other component is calculated based on the data source association and structure association, and linkage setting is performed between the components based on the predicted association; the predicted association is positively correlated with the data source association and structure association;

[0093] The step S5 specifically includes the following steps:

[0094] Step S51: Based on any pair of components Data source relevance and structural relevance The amount of information entropy is used to determine the data source association weight corresponding to the data source association degree. And the structural association weight corresponding to the structural association degree Specifically: Determine the data source association weight based on the following formulas (3)-(8): and structural association weight ;in: and is the component number; , , , are all intermediate variables;

[0095]

[0096] Step S52: For each component , based on the data source association weight and structural association weight , Components and any other components The correlation between data sources and structural relevance , determine component cc and any other component The predicted linkage between ; Arrange the components based on the predicted linkage degree to form a linkage component queue; so that the components with a high predicted linkage degree are located at the head of the linkage component queue, and the components with a low predicted linkage degree are located at the tail of the linkage component queue;

[0097] Preferably: Determine component cc and any other component based on the following formula (9): The predicted linkage between ;

[0098]

[0099] Step S53: Targeting components based on the linkage component queue Providing data linkage setting; specifically: issuing a linkage setting request for component cc, obtaining a linkage component queue corresponding to component cc based on the request, and presenting component identifiers in the linkage setting interface according to their order in the linkage component queue, so that the user can perform linkage setting between components according to the presented order;

[0100] Preferably: the predicted linkage degree is also additionally presented in the linkage setting interface;

[0101] The step S53 further includes: firstly providing global linkage settings for components in the page based on the linkage component queue; specifically: constructing a linkage component matrix based on the linkage component queue, and providing global linkage settings for components in the page based on the linkage component matrix; specifically including the following steps:

[0102] Step S531: For each component cc, insert the component cc into the head of its linkage component queue, and set its predicted linkage degree equal to the maximum value of the elements in its linkage component queue ( );

[0103] Step S532: Arrange the linkage component queues corresponding to all components row by row to form a linkage component matrix;

[0104] Step S533: Calculate the mean of the elements in the linkage component matrix ;

[0105] Step S534: Obtain the predicted linkage degree corresponding to the element value in the linkage component matrix that is greater than the element mean value As the candidate linkage prediction degree;

[0106] Step S535: Arrange the linkage prediction degrees to be selected in descending order, and perform linkage setting reminders in sequence; present the two components involved in the linkage prediction degrees to be selected in sequence on the visual interface Linkage settings reminders;

[0107] Since the linkage prediction degree has been matrixed, other quantitative calculations can be performed on the basis of the linkage prediction matrix to optimize the global linkage setting, which will not be described in detail here;

[0108] Embodiment 1:

[0109] The present invention is applied to a dynamic product list page of an e-commerce website. There is a product list component on the page, which needs to display different product data according to different classification and screening conditions. Through the page editor, the user constructs a page layout containing multiple data binding rules and a nested relationship. The data source corresponding to each component and its component attribute-field correspondence are determined according to the data binding rules set by the user; after the page layout is completed, the above steps S2-S5 are executed to provide independent linkage setting reminders and their corresponding linkage settings for each component separately, or to provide global linkage reminders and their corresponding linkage settings for component pairs; later, the data synchronization module is responsible for displaying the product data generated by the data source that complies with the data binding rules in real time in the page component;

[0110] Preferably: when the data source is updated, the data displayed by the page component is automatically updated synchronously; the data synchronization module is responsible for monitoring the changes of the data source and updating the displayed content of the page component in real time;

[0111] Preferably: the data synchronization module uses WebSocket technology. WebSocket provides a full-duplex communication channel, allowing the data source to actively push data to the user interface. When the data source changes, the server where the data source is located notifies the client user interface in real time through the WebSocket channel. The data synchronization module then updates the page components to ensure that the user interface and the data source are synchronized, so as to improve the efficiency and real-time performance of data synchronization.

[0112] Based on the same inventive concept, the present invention also provides a low-code data linkage setting system, which is used to implement the above-mentioned low-code data linkage setting method;

[0113] Based on the same inventive concept, the present invention also provides a low-code data linkage setting server, and the system is used to implement the above-mentioned low-code data linkage setting method;

[0114] Based on the same inventive concept, the present invention also provides a low-code data linkage setting client, and the system is used to implement the above-mentioned low-code data linkage setting method;

[0115] A computer program (also referred to as a program, software, software application, script, or code) can be written in any form of a programming language, including an assembled or interpreted language, a declarative or procedural language, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, object, or other unit suitable for use in a computing environment. A computer program may, but need not, correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program, or in multiple collaborative files (e.g., files storing one or more modules, subroutines, or code portions). A computer program can be deployed to execute on one computer or on multiple computers located at one site or distributed across multiple sites and interconnected by a communication network.

[0116] It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0117] The present invention is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0118] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0119] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0120] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. A low-code data linkage setting method, characterized in that: The method comprises: Step S1: Perform page layout and component dragging through the page editor on the visual interface, drag components in the component library to the page canvas, and quickly build the page layout; After dragging is completed, the components are laid out on the page; Step S2: obtaining data binding rules related to the component, determining a data source and associating the data source with the component; Associate component properties with data source fields based on data binding rules; Step S3: based on the position and nesting relationship of the components in the page, traverse the components in the page in a preset manner to obtain an ordered component sequence corresponding to the page; wherein: the ordered component sequence includes component identifiers arranged in a traversal order; Step S4: obtaining the structural association of the components based on the ordered component sequence; obtaining the data source association of the components based on the data binding rules; The step of obtaining the structural association of components based on the ordered component sequence specifically includes the following steps: Step S4A1: obtaining an unprocessed component in the page as the current component; Step S4A2: searching for historical usage data based on the current ordered component sequence of the current page, and taking the historical usage data in the historical usage data whose ordered component sequence corresponding to the page is the same as or similar to the current ordered component sequence as the historical usage data for the current page; Step S4A3: for each piece of historical usage data in the historical usage data of the current component, if the positions of a component and another component in the corresponding ordered component sequence are the same as the positions of the current component and the corresponding another component in the current ordered component sequence, and the data source between the two is used at the same time, then the number of structural associations between the current component and the corresponding another component is increased; Step S4A4: dividing the number of structural associations between the current component and the corresponding another component by the total number of structural associations to obtain the structural association degree between the current component and the corresponding another component; Step S4A5: Repeat the above steps until all components in the current page are processed; The step of obtaining the data source association of a component based on a data binding rule specifically includes the following steps: Step S4B1: for each component in the page, determine the minimum data source involved in its data binding rule; the minimum data source is the minimum part of the component-associated data source involving the current component; Step S4B2: Determine the maximum data source of the minimum data sources including all components based on the minimum data source; the maximum data source is the minimum divisible physical or logical range including all the minimum data sources; Step S4B3: analyzing the historical usage data for the maximum data source to obtain the number of associations between the minimum data sources; specifically: arranging the historical usage data based on time intervals so that the historical usage data within the same time interval constitutes one piece of historical usage data; in each piece of historical usage data, if both minimum data sources are used, then increasing the number of associations between the two minimum data sources; otherwise, not changing the number of associations between the two minimum data sources; Step S4B4: Divide the number of associations between the two minimum data sources by the total number of associations to obtain the degree of association between the two minimum data sources; and use the degree of association between the two components corresponding to the two minimum data sources as the data source association degree; Step S5: Linkage setting is performed on the components in the page based on the data source association and structural association of any pair of components; specifically: for each component, the predicted association between it and any other component is calculated based on the data source association and structural association, and linkage setting is performed between components based on the predicted association; the predicted association is positively correlated with the data source association and structural association.

2. The low-code data linkage setting method according to claim 1 is characterized in that: The page editor also supports nesting and hierarchical management of components.

3. The low-code data linkage setting method according to claim 2 is characterized in that: The data source is one or more of a database, an API interface, a data server, a big data service platform, a data class, a data cluster, and a data table.

4. The low-code data linkage setting method according to claim 3 is characterized in that: The similarity between the current ordered component sequence and the ordered component sequence corresponding to the page in the historical usage data is calculated based on the Euclidean distance.

5. The low-code data linkage setting method according to claim 4 is characterized in that: The location of the component in the page is indicated by the component's specific position.

6. The low-code data linkage setting method according to claim 5 is characterized in that: Set the initial value of the number of structural associations between two components to 0; set the initial value of the number of associations between two minimum data sources to 0.

7. A low-code data linkage setting system, characterized in that: The low-code data linkage setting system is used to implement the low-code data linkage setting method described in any one of claims 1 to 6.

8. A low-code data linkage setting device, characterized in that: The low-code data linkage setting device is used to implement the low-code data linkage setting method described in any one of claims 1 to 6.

9. A low-code data linkage setting module, characterized in that: The low-code data linkage setting module is used to implement the low-code data linkage setting method described in any one of claims 1 to 6.

10. A low-code data linkage setting server, characterized in that: The low-code data linkage setting server is used to implement the low-code data linkage setting method described in any one of claims 1 to 6.

Images