CN114254068A - Data transfer method and system - Google Patents
Data transfer method and system Download PDFInfo
- Publication number
- CN114254068A CN114254068A CN202210190410.1A CN202210190410A CN114254068A CN 114254068 A CN114254068 A CN 114254068A CN 202210190410 A CN202210190410 A CN 202210190410A CN 114254068 A CN114254068 A CN 114254068A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- data context
- injected
- component
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 61
- 238000012546 transfer Methods 0.000 title abstract description 12
- 230000015654 memory Effects 0.000 claims description 20
- 238000004590 computer program Methods 0.000 claims description 11
- 230000003068 static effect Effects 0.000 claims description 9
- 238000002347 injection Methods 0.000 claims description 6
- 239000007924 injection Substances 0.000 claims description 6
- 230000003993 interaction Effects 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 238000011161 development Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000010168 coupling process Methods 0.000 description 2
- 238000005859 coupling reaction Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 239000000243 solution Substances 0.000 description 2
- 238000012800 visualization Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000013479 data entry Methods 0.000 description 1
- 238000013499 data model Methods 0.000 description 1
- 238000000802 evaporation-induced self-assembly Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
- G06F16/316—Indexing structures
- G06F16/322—Trees
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The embodiment of the application discloses a data transfer method and a system, wherein the method comprises the following steps: the data context module receives data according to a global variable receiving function, wherein the global variable receiving function is determined according to a target data context node and input data; if the target data context node is a root node, merging the input data into the self attribute of the root node; and if the target data context node is an unknown node, establishing an identification of the unknown node, storing the identification in a father node, and combining the input data into the self attribute of the established node. The data transfer capability in the low-code platform is effectively improved, and the data interaction requirement under a complex service scene is flexibly realized.
Description
Technical Field
The embodiment of the application relates to the technical field of program development, in particular to a data transfer method and a data transfer system.
Background
The Low Code Development Platform (LCDP) is a development platform that can quickly generate an application without encoding (0 code) or with a small amount of code. The method for developing the application program through visualization (referring to a visual programming language) enables developers with different experience levels to create web pages and mobile application programs through a graphical user interface by using a dragging component and model-driven logic.
With the expansion of the digitization and informatization scale of enterprises, the low-code market grows rapidly. Informatization systems developed based on a low-code platform mode, particularly front-end service systems, are increasing. Due to the good model abstraction capability of the low-code system, the front end can obtain more bottom-layer and richer metadata information. At present, a low-code platform on the market can be customized to complete system building through rich component styles and dragging capability.
However, for the developer, the following problems still remain: at present, the data transfer capability in a low-code platform is very limited, and data interaction under a fixed scene can be realized only by a fixed format or an agreed rule; the data coupling degree with the interface of the back end is high, the back end needs to adjust codes or configure to realize conversion when replacing a data structure, and the development cost is high; the components cannot communicate with each other or the communication is not flexible and variable enough, and the service requirement under a complex scene is difficult to realize.
Disclosure of Invention
Therefore, the embodiment of the application provides a data transfer method and a data transfer system, which effectively improve the data transfer capability in a low-code platform and flexibly meet the data interaction requirement in a complex service scene.
In order to achieve the above object, the embodiments of the present application provide the following technical solutions:
according to a first aspect of embodiments of the present application, there is provided a data flow method, including:
setting a data context tree in a global variable of a low-code platform, wherein the data context tree at least comprises a root node;
acquiring data to be injected, wherein the data to be injected comprises a target node identifier and data to be injected;
if a data context node corresponding to the target node identification exists in the data context tree, injecting the data needing to be injected into the data context node;
if the data context node corresponding to the target node identification does not exist in the data context tree, a data context node corresponding to the target node identification is newly established, the target node identification is stored in a father node, and the data needing to be injected is injected into the newly established data context node.
Optionally, the method further comprises:
determining a data context node where data to be acquired is located and a corresponding data path;
and acquiring the data to be acquired from the data context node according to the data path.
Optionally, the source of the data to be injected at least includes a backend interface, a static file, or a component module; if the source is an assembly module, the data to be injected is the basic attribute of the assembly module.
Optionally, the attributes of the data context node include a self attribute and a reference attribute;
if the data context node is a father node, the reference attribute is null;
and if the data context node is a child node, the reference attribute is a collection of the self attribute and the reference attribute of the parent node to which the child node belongs.
Optionally, if a second component in the component module needs to acquire the basic attribute of the first component, the method includes:
the data context module receives data to be injected of a first component, wherein the data to be injected of the first component comprises a target node identifier and a basic attribute of the first component;
if the data context module determines that the data context node corresponding to the target node identifier does not exist in the data context tree, establishing the data context node corresponding to the target node identifier, storing the target node identifier in a parent node, and injecting the basic attribute of the first component into the self attribute of the established data context node; if the data context node corresponding to the target node identification exists in the data context tree, injecting the basic attribute of the first component into the self attribute of the data context node;
and the data context module calls the basic attribute of the first component from the data context node where the basic attribute of the first component is located according to the data path corresponding to the basic attribute of the first component in the data context tree, and sends the called basic attribute of the first component to the second component.
According to a second aspect of embodiments of the present application, there is provided a data flow system, the system including:
the data context tree setting module is used for setting a data context tree in global variables of a low-code platform, and the data context tree at least comprises a root node;
the data acquisition module is used for acquiring data to be injected, wherein the data to be injected comprises a target node identifier and data to be injected;
a first data injection module, configured to inject the data to be injected into the data context node if a data context node corresponding to the target node identifier exists in the data context tree;
and the second data injection module is used for creating a data context node corresponding to the target node identifier if the data context node corresponding to the target node identifier does not exist in the data context tree, storing the target node identifier in a parent node, and injecting the data to be injected into the created data context node.
Optionally, the system further comprises:
the data acquisition module is used for determining a data context node where the data to be acquired is located and a corresponding data path; and acquiring the data to be acquired from the data context node according to the data path.
Optionally, the source of the data to be injected at least includes a backend interface, a static file, or a component module; if the source is an assembly module, the data to be injected is the basic attribute of the assembly module.
According to a third aspect of embodiments of the present application, there is provided an electronic apparatus, including: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the computer program to implement the method of the first aspect.
According to a fourth aspect of embodiments herein, there is provided a computer readable storage medium having stored thereon computer readable instructions executable by a processor to implement the method of the first aspect described above.
To sum up, the embodiment of the present application provides a data flow method and system, where a data context tree is set in a global variable of a low code platform, where the data context tree at least includes a root node; acquiring data to be injected, wherein the data to be injected comprises a target node identifier and data to be injected; if a data context node corresponding to the target node identification exists in the data context tree, injecting the data needing to be injected into the data context node; if the data context node corresponding to the target node identification does not exist in the data context tree, a data context node corresponding to the target node identification is newly established, the target node identification is stored in a father node, and the data needing to be injected is injected into the newly established data context node. The data transfer capability in the low-code platform is effectively improved, and the data interaction requirement under a complex service scene is flexibly realized.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below. It should be apparent that the drawings in the following description are merely exemplary, and that other embodiments can be derived from the drawings provided by those of ordinary skill in the art without inventive effort.
The structures, ratios, sizes, and the like shown in the present specification are only used for matching with the contents disclosed in the specification, so that those skilled in the art can understand and read the present invention, and do not limit the conditions for implementing the present invention, so that the present invention has no technical significance, and any structural modifications, changes in the ratio relationship, or adjustments of the sizes, without affecting the functions and purposes of the present invention, should still fall within the scope of the present invention.
Fig. 1 is a schematic flow chart of a data flow method according to an embodiment of the present application;
FIG. 2 is a diagram of an example data-driven model provided by an embodiment of the present application;
FIG. 3 is a diagram of an example data context model provided by an embodiment of the present application;
FIG. 4 is a diagram of an example data context tree binding data model provided by an embodiment of the present application;
FIG. 5 is a diagram illustrating an exemplary component model provided by an embodiment of the present application;
fig. 6 is a block diagram of a data flow system according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device provided in an embodiment of the present application;
fig. 8 shows a schematic diagram of a computer-readable storage medium provided by an embodiment of the present application.
Detailed Description
The present invention is described in terms of particular embodiments, other advantages and features of the invention will become apparent to those skilled in the art from the following disclosure, and it is to be understood that the described embodiments are merely exemplary of the invention and that it is not intended to limit the invention to the particular embodiments disclosed. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 illustrates a data flow method provided in an embodiment of the present application, where the method includes:
step 101: setting a data context tree in a global variable of a low-code platform, wherein the data context tree at least comprises a root node;
step 102: acquiring data to be injected, wherein the data to be injected comprises a target node identifier and data to be injected;
step 103: if a data context node corresponding to the target node identification exists in the data context tree, injecting the data needing to be injected into the data context node;
step 104: if the data context node corresponding to the target node identification does not exist in the data context tree, a data context node corresponding to the target node identification is newly established, the target node identification is stored in a father node, and the data needing to be injected is injected into the newly established data context node.
In one possible embodiment, the method further comprises: determining a data context node where data to be acquired is located and a corresponding data path; and acquiring the data to be acquired from the data context node according to the data path.
In a possible embodiment, the source of the data to be injected at least comprises a backend interface, a static file or a component module; if the source is an assembly module, the data to be injected is the basic attribute of the assembly module.
In one possible implementation, the attributes of the data context node include a self attribute and a reference attribute; if the data context node is a father node, the reference attribute is null; and if the data context node is a child node, the reference attribute is a collection of the self attribute and the reference attribute of the parent node to which the child node belongs.
In one possible embodiment, if a second component in the component module needs to obtain the basic property of the first component, the method includes:
the data context module receives data to be injected of a first component, wherein the data to be injected of the first component comprises a target node identifier and a basic attribute of the first component;
if the data context module determines that the data context node corresponding to the target node identifier does not exist in the data context tree, establishing the data context node corresponding to the target node identifier, storing the target node identifier in a parent node, and injecting the basic attribute of the first component into the self attribute of the established data context node; if the data context node corresponding to the target node identification exists in the data context tree, injecting the basic attribute of the first component into the self attribute of the data context node;
and the data context module calls the basic attribute of the first component from the data context node where the basic attribute of the first component is located according to the data path corresponding to the basic attribute of the first component in the data context tree, and sends the called basic attribute of the first component to the second component.
In the data component module provided in the embodiment of the present application, the component may call data attributes of other components through the data context module.
In one possible implementation, the data context module receives data according to a global variable receive function that is determined according to the target data context node identification and the injected data.
In one possible implementation, the data context module calls data according to a global variable call function, where the global variable call function is determined according to the target data context node identifier and a data path of the call data.
According to the data flow method provided by the embodiment of the application, the data nodes in the data context module are bound through the components, the design mode of the data driving components is effectively realized, and the data flow capacity in the low-code platform is improved.
A unique data binding path is designated by binding the data context identification of the corresponding attribute when the component is selected and analyzing the specific structure of the data in the specific identification. The coupling degree between the component and the data interface can be reduced, and the component can designate a unique data binding path regardless of how the data structure of the interface is designed by the back end. While components may place their properties into the data context module for use by other components. When the attribute changes, the components bound with the data can receive the change at the same time, thereby greatly improving the flexibility of communication among the components and being convenient for realizing the service requirements under the complex service scene.
The data flow method based on the low-code platform provided by the embodiment of the application is described in detail below with reference to the accompanying drawings.
Fig. 2 shows a data-driven model diagram provided in an embodiment of the present application. The entire model proceeds around the data context module.
The data context module is used for data collection work of the low-code platform, and the data source of the data context module can be any mode such as a backend interface, a static file and a component module. Meanwhile, an external data structure of the data context module can provide a unique path for the components to bind data, the attribute of the component module also supports data input into the data context module, and other components realize communication among the components by binding data input into the data context module by any component. Wherein the component module is a module that the low code platform itself has. The embodiment of the application focuses on the part of the component module related to data circulation.
The complete data flow process involves the following aspects:
in a first aspect, a data context tree is initialized.
A data context tree is the underlying data structure in a data context module. Fig. 3 shows a data context model diagram provided by an embodiment of the present application. In the data context model, each data set has a respective child data set and parent data set. A tree-type context model structure is formed through the parent-child relationship, a parent data set is not provided as a root data set, and a child data set is not provided as a leaf data set. While each identifiable data set has two attributes: self attributes and reference attributes. The data in the self attribute is owned or set by the data set at the initial creation and represents the data owned by the data set. The reference attribute refers to a set of self attributes and reference attributes owned by a parent data set for a child data set.
During the process of initializing the data context tree, an empty root data set is generated, and the node of the data set in the data context is marked as D0The node has an attribute data for storing its own attribute, and also has a neighbor relation child children for storing a child level data set identification. Child children is used for the parent deposit subset identification. Finally, the data context TREE is defined in a global variable of the low code platform, with a name of $ TREE, which is referred to below as the data context TREE.
In a second aspect, data is input into a data context tree.
The data context module defines the data input mode as set, and the method for globally acquiring data input is $ tree. The input data can be from data sets such as backend interfaces, static files, etc., or from component inputs, etc.
The process of data entry requires the specification of the corresponding data context node, described as the expression of the function $ treenTdata), where DnFor the data context node, Tdata is data to be input.
Data is input from the root node by default when no input node is selected. When selecting root node D0When data is input, only the data needs to be merged to the attribute data; when a new data node needs to be created, the new node may be identified as D1And inputting data in its data attribute, and simultaneously at D1Parent node D of0Child's in-neighbor identification D1。
When the source of the input data in the data context is a component, a global input method needs to be called in the component, and a basic attribute unique to the component is input, and the function is described as $ tree.set (D)nPropertyData), in which DnFor self-specified data context nodes, PropertyData is a component property.
FIG. 3 shows an internal schematic of a data context model. data2 and data3 are a subset of data1, data3 is a subset of data1 and data2, and data4 is a subset of data1 and data 3. Data2 says that data2 has reference attributes in addition to its own attributes, and the reference attributes of data2 are sets of self attributes (a, b) and reference attributes (none) owned by the child data set data2 to reference the parent data set data 1. All data sets are selectable nodes.
As shown in fig. 3, when the data context module inputs data, in data3, when the self attribute and the reference attribute in a certain data set are renamed, the self attribute covers the reference attribute during analysis, the value of the reference attribute a in data4 is the value of the self attribute a in data3, the self attribute a in data1 is not affected, and the data is transmitted in a chain structure.
In a third aspect, data in a data context tree is obtained.
The data context tree needs to define an acquisition method get of data, and the acquisition method for globally acquiring data is $ tree. Data node D needing to be appointed to be acquired when data is acquirednAnd an acquired datapath describing a function $ treen, path)。
As shown in FIG. 4, an arbitrary data set (a collection of self attributes plus reference attributes) is stored in a tree structure in the data context module. Brackets are used to express the hierarchy within the data set. When a certain attribute value in a data context node needs to be acquired, the data node identifier D can be specified1And a data path. The way in which the property values are bound in fig. 4 is expressed as the function $ tree1B, f, h). The data path is (b, f, h). The global data acquisition method $ tree.get can also be used within the same module to bind to the required data value.
The specific processes of data node designation and path identification need to be implemented in a visualization form on a low-code platform, and the implementation manners of different platforms are different, so that the embodiments of the present application are not further discussed in this respect.
In a fourth aspect, inter-component communication.
The second aspect mentioned above has mentioned that the self-attributes in the component can be input into the data context, and if necessary, the component can selectively input the self-unique basic attributes into the data context module. The other components can bind the property through a global data acquisition method $ tree. As shown in fig. 5, when a component binds a certain property in the data context tree, the property can be used by the internal logic of the component through real-time flow, that is, the property can be called by other components. Therefore, in the process, the component only needs to pay attention to the logic of the component without paying attention to specific definition, sources, reference modes and the like of the bound attribute, and the limitation that only fixed scenes can be realized by fixed formats or convention rules is broken through.
To sum up, the embodiment of the present application provides a data flow method, where a data context tree is set in a global variable of a low code platform, where the data context tree at least includes a root node; acquiring data to be injected, wherein the data to be injected comprises a target node identifier and data to be injected; if a data context node corresponding to the target node identification exists in the data context tree, injecting the data needing to be injected into the data context node; if the data context node corresponding to the target node identification does not exist in the data context tree, a data context node corresponding to the target node identification is newly established, the target node identification is stored in a father node, and the data needing to be injected is injected into the newly established data context node. The data transfer capability in the low-code platform is effectively improved, and the data interaction requirement under a complex service scene is flexibly realized.
Based on the same technical concept, an embodiment of the present application further provides a data flow system, as shown in fig. 6, the system includes:
a data context tree setting module 601, configured to set a data context tree in a global variable of a low-code platform, where the data context tree at least includes a root node;
a data obtaining module 602, configured to obtain data to be injected, where the data to be injected includes a target node identifier and data to be injected;
a first data injection module 603, configured to inject the data to be injected into the data context node if a data context node corresponding to the target node identifier exists in the data context tree;
a second data injection module 604, configured to, if there is no data context node corresponding to the target node identifier in the data context tree, create a new data context node corresponding to the target node identifier, store the target node identifier in a parent node, and inject the data to be injected into the newly created data context node.
In one possible embodiment, the system further comprises: the data acquisition module is used for determining a data context node where the data to be acquired is located and a corresponding data path; and acquiring the data to be acquired from the data context node according to the data path.
In a possible embodiment, the source of the data to be injected at least comprises a backend interface, a static file or a component module; if the source is an assembly module, the data to be injected is the basic attribute of the assembly module.
The embodiment of the application also provides electronic equipment corresponding to the method provided by the embodiment. Please refer to fig. 7, which illustrates a schematic diagram of an electronic device according to some embodiments of the present application. The electronic device 20 may include: the system comprises a processor 200, a memory 201, a bus 202 and a communication interface 203, wherein the processor 200, the communication interface 203 and the memory 201 are connected through the bus 202; the memory 201 stores a computer program that can be executed on the processor 200, and the processor 200 executes the computer program to perform the method provided by any of the foregoing embodiments of the present application.
The Memory 201 may include a high-speed Random Access Memory (RAM) and may further include a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. The communication connection between the network element of the system and at least one other network element is realized through at least one physical port 203 (which may be wired or wireless), and the internet, a wide area network, a local network, a metropolitan area network, and the like can be used.
The processor 200 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 200. The Processor 200 may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in the memory 201, and the processor 200 reads the information in the memory 201 and completes the steps of the method in combination with the hardware thereof.
The electronic device provided by the embodiment of the application and the method provided by the embodiment of the application have the same inventive concept and have the same beneficial effects as the method adopted, operated or realized by the electronic device.
Referring to fig. 8, the computer-readable storage medium is an optical disc 30, on which a computer program (i.e., a program product) is stored, and when the computer program is executed by a processor, the computer program performs the method of any of the foregoing embodiments.
It should be noted that examples of the computer-readable storage medium may also include, but are not limited to, a phase change memory (PRAM), a Static Random Access Memory (SRAM), a Dynamic Random Access Memory (DRAM), other types of Random Access Memories (RAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a flash memory, or other optical and magnetic storage media, which are not described in detail herein.
The computer-readable storage medium provided by the above-mentioned embodiments of the present application and the method provided by the embodiments of the present application have the same advantages as the method adopted, executed or implemented by the application program stored in the computer-readable storage medium.
It should be noted that:
the algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose devices may be used with the teachings herein. The required structure for constructing such a device will be apparent from the description above. In addition, this application is not directed to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the present application as described herein, and any descriptions of specific languages are provided above to disclose the best modes of the present application.
In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the application may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the application, various features of the application are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the application and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: this application is intended to cover such departures from the present disclosure as come within known or customary practice in the art to which this invention pertains. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this application.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the application and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.
The various component embodiments of the present application may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that a microprocessor or Digital Signal Processor (DSP) may be used in practice to implement some or all of the functions of some or all of the components in the creation apparatus of a virtual machine according to embodiments of the present application. The present application may also be embodied as apparatus or device programs (e.g., computer programs and computer program products) for performing a portion or all of the methods described herein. Such programs implementing the present application may be stored on a computer readable medium or may be in the form of one or more signals. Such a signal may be downloaded from an internet website or provided on a carrier signal or in any other form.
It should be noted that the above-mentioned embodiments illustrate rather than limit the application, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The application may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names.
The above description is only for the preferred embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present application should be covered within the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method for data streaming, the method comprising:
setting a data context tree in a global variable of a low-code platform, wherein the data context tree at least comprises a root node;
acquiring data to be injected, wherein the data to be injected comprises a target node identifier and data to be injected;
if a data context node corresponding to the target node identification exists in the data context tree, injecting the data needing to be injected into the data context node;
if the data context node corresponding to the target node identification does not exist in the data context tree, a data context node corresponding to the target node identification is newly established, the target node identification is stored in a father node, and the data needing to be injected is injected into the newly established data context node.
2. The method of claim 1, wherein the method further comprises:
determining a data context node where data to be acquired is located and a corresponding data path;
and acquiring the data to be acquired from the data context node according to the data path.
3. The method of claim 1, wherein the source of the data to be injected comprises at least a backend interface, a static file, or a component module; if the source is an assembly module, the data to be injected is the basic attribute of the assembly module.
4. The method of claim 1, wherein the attributes of the data context node include a self attribute and a reference attribute;
if the data context node is a father node, the reference attribute is null;
and if the data context node is a child node, the reference attribute is a collection of the self attribute and the reference attribute of the parent node to which the child node belongs.
5. The method of any one of claims 1 to 4, wherein if a second component in the component module needs to obtain the base property of the first component, the method comprises:
the data context module receives data to be injected of a first component, wherein the data to be injected of the first component comprises a target node identifier and a basic attribute of the first component;
if the data context module determines that the data context node corresponding to the target node identifier does not exist in the data context tree, establishing the data context node corresponding to the target node identifier, storing the target node identifier in a parent node, and injecting the basic attribute of the first component into the self attribute of the established data context node; if the data context node corresponding to the target node identification exists in the data context tree, injecting the basic attribute of the first component into the self attribute of the data context node;
and the data context module calls the basic attribute of the first component from the data context node where the basic attribute of the first component is located according to the data path corresponding to the basic attribute of the first component in the data context tree, and sends the called basic attribute of the first component to the second component.
6. A data streaming system, the system comprising:
the data context tree setting module is used for setting a data context tree in global variables of a low-code platform, and the data context tree at least comprises a root node;
the data acquisition module is used for acquiring data to be injected, wherein the data to be injected comprises a target node identifier and data to be injected;
a first data injection module, configured to inject the data to be injected into the data context node if a data context node corresponding to the target node identifier exists in the data context tree;
and the second data injection module is used for creating a data context node corresponding to the target node identifier if the data context node corresponding to the target node identifier does not exist in the data context tree, storing the target node identifier in a parent node, and injecting the data to be injected into the created data context node.
7. The system of claim 6, wherein the system further comprises:
the data acquisition module is used for determining a data context node where the data to be acquired is located and a corresponding data path; and acquiring the data to be acquired from the data context node according to the data path.
8. The system of claim 6, wherein the source of the data to be injected comprises at least a backend interface, a static file, or a component module; if the source is an assembly module, the data to be injected is the basic attribute of the assembly module.
9. An electronic device, comprising: memory, processor and computer program stored on the memory and executable on the processor, characterized in that the processor executes when executing the computer program to implement the method according to any of claims 1-5.
10. A computer-readable storage medium having computer-readable instructions stored thereon, the computer-readable instructions being executable by a processor to implement the method of any one of claims 1-5.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210190410.1A CN114254068B (en) | 2022-02-28 | 2022-02-28 | Data transfer method and system |
| PCT/CN2023/074684 WO2023160367A1 (en) | 2022-02-28 | 2023-02-07 | Data transfer method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210190410.1A CN114254068B (en) | 2022-02-28 | 2022-02-28 | Data transfer method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114254068A true CN114254068A (en) | 2022-03-29 |
| CN114254068B CN114254068B (en) | 2022-08-09 |
Family
ID=80800157
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210190410.1A Active CN114254068B (en) | 2022-02-28 | 2022-02-28 | Data transfer method and system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN114254068B (en) |
| WO (1) | WO2023160367A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023160367A1 (en) * | 2022-02-28 | 2023-08-31 | 杭州未名信科科技有限公司 | Data transfer method and system |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106570017A (en) * | 2015-10-09 | 2017-04-19 | 北大方正集团有限公司 | Data caching method and system |
| CN107679049A (en) * | 2016-08-02 | 2018-02-09 | 北京京东尚科信息技术有限公司 | Obtain the method, apparatus and system of the hop of tree structure data two |
| CN108255895A (en) * | 2016-12-29 | 2018-07-06 | 孙翔 | A kind of web data acquisition methods using context environmental rule |
| CN108932137A (en) * | 2018-07-17 | 2018-12-04 | 西安航空学院 | A kind of assembly level interprocedual pointer analysis method based on speculative multithreading |
| CN110162525A (en) * | 2019-04-17 | 2019-08-23 | 平安科技（深圳）有限公司 | Read/write conflict solution, device and storage medium based on B+ tree |
| CN112395483A (en) * | 2020-11-13 | 2021-02-23 | 郑州阿帕斯数云信息科技有限公司 | Page rendering method and device based on tree structure |
| CN112698831A (en) * | 2020-12-25 | 2021-04-23 | 昆明理工大学 | Code automatic generation quality evaluation method |
| CN112905847A (en) * | 2021-01-13 | 2021-06-04 | 浪潮云信息技术股份公司 | Tree structure construction method and device |
| CN112988599A (en) * | 2021-04-29 | 2021-06-18 | 腾讯科技（深圳）有限公司 | Page debugging method and device, electronic equipment and storage medium |
| US20210263834A1 (en) * | 2020-02-20 | 2021-08-26 | 4Logik LLC | Code Generation Platform |
| CN113392068A (en) * | 2021-06-28 | 2021-09-14 | 上海商汤科技开发有限公司 | Data processing method, device and system |
| CN113612818A (en) * | 2021-07-09 | 2021-11-05 | 中国汽车技术研究中心有限公司 | Industrial app issuing system and method of low-code platform |
| CN113918151A (en) * | 2021-10-12 | 2022-01-11 | 平安国际智慧城市科技股份有限公司 | Low-code page development method, device, equipment and storage medium |
| CN114089986A (en) * | 2021-11-23 | 2022-02-25 | 浩云科技股份有限公司 | Method, system, device and medium for configuring low code development platform function expression |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114254068B (en) * | 2022-02-28 | 2022-08-09 | 杭州未名信科科技有限公司 | Data transfer method and system |
-
2022
- 2022-02-28 CN CN202210190410.1A patent/CN114254068B/en active Active
-
2023
- 2023-02-07 WO PCT/CN2023/074684 patent/WO2023160367A1/en unknown
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106570017A (en) * | 2015-10-09 | 2017-04-19 | 北大方正集团有限公司 | Data caching method and system |
| CN107679049A (en) * | 2016-08-02 | 2018-02-09 | 北京京东尚科信息技术有限公司 | Obtain the method, apparatus and system of the hop of tree structure data two |
| CN108255895A (en) * | 2016-12-29 | 2018-07-06 | 孙翔 | A kind of web data acquisition methods using context environmental rule |
| CN108932137A (en) * | 2018-07-17 | 2018-12-04 | 西安航空学院 | A kind of assembly level interprocedual pointer analysis method based on speculative multithreading |
| CN110162525A (en) * | 2019-04-17 | 2019-08-23 | 平安科技（深圳）有限公司 | Read/write conflict solution, device and storage medium based on B+ tree |
| US20210263834A1 (en) * | 2020-02-20 | 2021-08-26 | 4Logik LLC | Code Generation Platform |
| CN112395483A (en) * | 2020-11-13 | 2021-02-23 | 郑州阿帕斯数云信息科技有限公司 | Page rendering method and device based on tree structure |
| CN112698831A (en) * | 2020-12-25 | 2021-04-23 | 昆明理工大学 | Code automatic generation quality evaluation method |
| CN112905847A (en) * | 2021-01-13 | 2021-06-04 | 浪潮云信息技术股份公司 | Tree structure construction method and device |
| CN112988599A (en) * | 2021-04-29 | 2021-06-18 | 腾讯科技（深圳）有限公司 | Page debugging method and device, electronic equipment and storage medium |
| CN113392068A (en) * | 2021-06-28 | 2021-09-14 | 上海商汤科技开发有限公司 | Data processing method, device and system |
| CN113612818A (en) * | 2021-07-09 | 2021-11-05 | 中国汽车技术研究中心有限公司 | Industrial app issuing system and method of low-code platform |
| CN113918151A (en) * | 2021-10-12 | 2022-01-11 | 平安国际智慧城市科技股份有限公司 | Low-code page development method, device, equipment and storage medium |
| CN114089986A (en) * | 2021-11-23 | 2022-02-25 | 浩云科技股份有限公司 | Method, system, device and medium for configuring low code development platform function expression |
Non-Patent Citations (4)
| Title |
|---|
| CLAUDIO DI SIPIO 等: "Democratizing the development of recommender systems by means of low-code platforms", 《ACM》 * |
| YUH-SHYAN CHEN 等: "Code placement and replacement schemes for WCDMA Rotated-OVSF code tree management", 《IEEE》 * |
| 孙强: "面向对象程序的指向分析技术研究", 《中国优秀博硕士学位论文全文数据库(博士)信息科技辑》 * |
| 张明: "一种SAP低代码开发平台的设计与实现", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023160367A1 (en) * | 2022-02-28 | 2023-08-31 | 杭州未名信科科技有限公司 | Data transfer method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2023160367A1 (en) | 2023-08-31 |
| CN114254068B (en) | 2022-08-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10579344B2 (en) | Converting visual diagrams into code | |
| CN109976761B (en) | Software development kit generation method and device and terminal equipment | |
| JP2021144719A (en) | Impact analysis | |
| CN115617327A (en) | Low code page building system, method and computer readable storage medium | |
| CN111177621B (en) | Web page development method, device and system | |
| CN110069259B (en) | ID L file-based parsing method and device, electronic equipment and storage medium | |
| CN106557307B (en) | Service data processing method and system | |
| CN109408354B (en) | Data processing method and device for application component | |
| JP4001286B2 (en) | Program maintenance support apparatus, program maintenance support method, and program | |
| CN115756433A (en) | Code platform migration method and device, electronic equipment and readable storage medium | |
| CN114254068B (en) | Data transfer method and system | |
| CN114707086A (en) | Route generation method and system | |
| CN111666100A (en) | Software framework generation method and device, electronic equipment and storage medium | |
| da Cruz et al. | A metamodel-based approach for automatic user interface generation | |
| CN113377652A (en) | Test data generation method and device | |
| CN112068879A (en) | Method and device for constructing client application development framework based on configuration | |
| CN116107669B (en) | Operator registration method, device and equipment of deep learning framework and storage medium | |
| CN114721647B (en) | Object-oriented programming method based on codeless application development | |
| CN107506299B (en) | Code analysis method and terminal equipment | |
| Gazzarri et al. | Supporting structured parallel program design, development and tuning in FastFlow | |
| CN114677114A (en) | Approval process generation method and device based on graph dragging | |
| CN113672638A (en) | Method, system and electronic equipment for querying data | |
| CN111158684B (en) | System creation method, device, electronic equipment and readable storage medium | |
| CN112463202A (en) | Configuration method and device of operating system functional components | |
| CN113760226B (en) | Service construction method, device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |