CN114398137A - Data processing flow deployment method and device and server - Google Patents

Data processing flow deployment method and device and server Download PDF

Info

Publication number
CN114398137A
CN114398137A CN202210056584.9A CN202210056584A CN114398137A CN 114398137 A CN114398137 A CN 114398137A CN 202210056584 A CN202210056584 A CN 202210056584A CN 114398137 A CN114398137 A CN 114398137A
Authority
CN
China
Prior art keywords
unit
data processing
linked list
server
editing
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.)
Pending
Application number
CN202210056584.9A
Other languages
Chinese (zh)
Inventor
时宗胜
蒋剑
薛驰
邵炎
陆金婷
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jiangsu Zhongtian Internet Technology Co ltd
Original Assignee
Jiangsu Zhongtian Internet Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Jiangsu Zhongtian Internet Technology Co ltd filed Critical Jiangsu Zhongtian Internet Technology Co ltd
Priority to CN202210056584.9A priority Critical patent/CN114398137A/en
Publication of CN114398137A publication Critical patent/CN114398137A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/451—Execution arrangements for user interfaces
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
    • G06F3/0484—Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
    • G06F3/0486—Drag-and-drop
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G06Q10/103—Workflow collaboration or project management
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y20/00—Information sensed or collected by the things
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y30/00—IoT infrastructure

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Computer Interaction (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • User Interface Of Digital Computer (AREA)

Abstract

The application provides a data processing flow deployment method, a data processing flow deployment device and a server. The method comprises the following steps: the server may trigger the first drag instruction according to the drag operation. The server may determine a computing unit closest to the target computing unit based on the target location. The server may insert the target computing element into the element linked list in the edit region based on the target computing element and the closest computing element. The server may update the element linked list. The server may trigger a build instruction according to the click operation. The server can construct a data processing function according to the construction instruction and the unit linked list in the editing area. The data processing function comprises at least one anonymous function corresponding to the calculation units which are connected in sequence. The method improves the flexibility of on-line calculation process deployment and improves the data processing efficiency.

Description

Data processing flow deployment method and device and server
Technical Field
The present application relates to the field of computers, and in particular, to a data processing flow deployment method, apparatus, and server.
Background
With the continuous development of Internet of Things (IoT), more and more devices implement interconnection and interworking. With the increasing IoT data.
In the prior art, IoT data can be calculated online by using a flink stream processing framework, an actor model, and the like, and various tasks such as abnormal point warning, abnormal point filtering, predictive maintenance, data routing, and the like are completed.
However, the online computing process using the prior art has the problems of large resource demand and poor flexibility of online computing process deployment.
Disclosure of Invention
The application provides a data processing flow deployment method, a data processing flow deployment device and a server, which are used for solving the problem of poor flexibility of online computing flow deployment.
In a first aspect, the present application provides a data processing flow deployment method, where the data processing flow deployment method includes a display interface, where the display interface includes a control area provided with a plurality of computing units, an editing area displayed with a unit linked list, and a button area provided with a plurality of control buttons, and the method includes:
in response to a first dragging instruction triggered by dragging a target computing unit of the control area to the editing area, inserting the target computing unit into the unit linked list in the editing area according to the first dragging instruction, and updating the unit linked list;
and responding to a construction instruction triggered by clicking a construction button of the button area, and generating a data processing function according to the unit linked list, wherein the data processing function is used for realizing data processing, and the unit linked list comprises at least one computing unit which is sequentially connected.
Optionally, the generating a data processing function according to the unit linked list specifically includes:
traversing the unit chain table in a depth-first mode, and sequentially creating anonymous functions of each computing unit according to the sequence of each computing unit in the unit chain table, wherein input data of each anonymous function is output data of a previous anonymous function, and output data of each anonymous function is input data of a next anonymous function;
and encapsulating the anonymous function of each computing unit in the unit chain table to obtain the data processing function, wherein the input data of the data processing function is the input data of the first computing unit, and the output data of the data processing function is the output data of the last computing unit.
Optionally, a connection line is included between each unit in the unit linked list in the display interface, and a connection order of the connection line is used for explaining an execution order of each computing unit in the unit linked list.
Optionally, the control area further includes a starting unit, and before dragging the target computing unit of the control area to the editing area, the method further includes:
responding to a second dragging instruction triggered by dragging the initial unit of the control area to the editing area, and generating the unit linked list according to the second dragging instruction, wherein the head of the unit linked list is the initial unit.
Optionally, the control area further includes at least one output unit, and the method further includes:
and in response to a third dragging instruction triggered by dragging the target output unit of the control area to the editing area, inserting the target output unit into the unit linked list according to the third dragging instruction, and updating the unit linked list.
Optionally, the method further comprises:
and in response to a first deleting instruction triggered by clicking a deleting button on the computing unit or the output unit in the unit linked list, deleting the computing unit or the output unit from the unit linked list according to the first deleting instruction, and updating the unit linked list.
Optionally, the display interface further includes an information editing area; the method further comprises the following steps:
and responding to an editing instruction, and editing the information in the information editing area according to the editing instruction.
In a second aspect, the present application provides a data processing flow deployment apparatus, including:
the editing module is used for responding to a first dragging instruction triggered by dragging the target computing unit of the control area to the editing area, inserting the target computing unit into the unit linked list in the editing area according to the first dragging instruction, and updating the unit linked list;
and the construction module is used for responding to a construction instruction triggered by clicking a construction button of the button area and generating a data processing function according to the unit chain table, wherein the data processing function is used for realizing data processing, and the unit chain table comprises at least one calculation unit which is sequentially connected.
Optionally, the building module is specifically configured to:
traversing the unit chain table in a depth-first mode, and sequentially creating anonymous functions of each computing unit according to the sequence of each computing unit in the unit chain table, wherein input data of each anonymous function is output data of a previous anonymous function, and output data of each anonymous function is input data of a next anonymous function;
and encapsulating the anonymous function of each computing unit in the unit chain table to obtain the data processing function, wherein the input data of the data processing function is the input data of the first computing unit, and the output data of the data processing function is the output data of the last computing unit.
Optionally, a connection line is included between each unit in the unit linked list in the display interface, and a connection order of the connection line is used for explaining an execution order of each computing unit in the unit linked list.
Optionally, the editing module is further configured to:
responding to a second dragging instruction triggered by dragging the initial unit of the control area to the editing area, and generating the unit linked list according to the second dragging instruction, wherein the head of the unit linked list is the initial unit.
Optionally, the control area further includes at least one output unit, and the method further includes:
and in response to a third dragging instruction triggered by dragging the target output unit of the control area to the editing area, inserting the target output unit into the unit linked list according to the third dragging instruction, and updating the unit linked list.
Optionally, the editing module is further configured to:
and in response to a first deleting instruction triggered by clicking a deleting button on the computing unit or the output unit in the unit linked list, deleting the computing unit or the output unit from the unit linked list according to the first deleting instruction, and updating the unit linked list.
Optionally, the editing module is further configured to:
and responding to an editing instruction, and editing the information in the information editing area according to the editing instruction.
In a third aspect, the present application provides a server, comprising: a memory and a processor;
the memory is used for storing a computer program; the processor is configured to execute the first aspect and the data processing flow deployment method in any one of the possible designs of the first aspect according to the computer program stored in the memory.
In a fourth aspect, the present application provides a readable storage medium, in which a computer program is stored, and when the computer program is executed by at least one processor of a server, the server executes the data processing flow deployment method in any one of the possible designs of the first aspect and the first aspect.
In a fifth aspect, the present application provides a computer program product comprising a computer program which, when executed by at least one processor of a server, causes the server to perform the method for deploying a data processing flow in any one of the possible designs of the first aspect and the first aspect.
According to the data processing flow deployment method, a first dragging instruction is triggered according to the dragging operation; determining a calculation unit closest to the target calculation unit according to the target position; inserting the target computing unit into the unit linked list in the editing area according to the target computing unit and the closest computing unit; updating the unit chain table; triggering a construction instruction according to the clicking operation; and constructing a data processing function according to the construction instruction and the unit chain table in the editing area, wherein the data processing function is used for realizing data processing, the data processing function comprises at least one anonymous function corresponding to the sequentially connected computing unit, the input data of each anonymous function is the output data of the previous anonymous function, and the output data of each anonymous function is the input data of the next anonymous function.
Drawings
In order to more clearly illustrate the technical solutions in the present application or the prior art, the drawings needed for the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic view of a display interface of a data processing flow deployment method according to an embodiment of the present application;
fig. 2 is a flowchart of a data processing flow deployment method according to an embodiment of the present application;
fig. 3 is a code diagram of a data processing flow deployment method according to an embodiment of the present application;
fig. 4 is a flowchart of a data processing flow deployment method according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a data processing flow deployment apparatus according to an embodiment of the present application;
fig. 6 is a schematic hardware structure diagram of a server according to an embodiment of the present application.
Detailed Description
To make the purpose, technical solutions and advantages of the present application clearer, the technical solutions in the present application will be clearly and completely described below with reference to the drawings in the present application, and it is obvious that the described embodiments are some, but not all embodiments of the present application. 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 application.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims of the present application and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged where appropriate. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope herein.
The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
Also, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context indicates otherwise.
It will be further understood that the terms "comprises," "comprising," "includes" and/or "including," when used in this specification, specify the presence of stated features, steps, operations, elements, components, items, species, and/or groups, but do not preclude the presence, or addition of one or more other features, steps, operations, elements, components, items, species, and/or groups thereof.
The terms "or" and/or "as used herein are to be construed as inclusive or meaning any one or any combination. Thus, "A, B or C" or "A, B and/or C" means "any of the following: a; b; c; a and B; a and C; b and C; A. b and C ". An exception to this definition will occur only when a combination of elements, functions, steps or operations are inherently mutually exclusive in some way.
With the continuous development of Internet of Things (IoT), more and more devices implement interconnection and interworking. In the field of internet of things where everything is interconnected and interworked, there is a continuous increase in IoT data and the problem of computing IoT data. IoT data processing may generally be present in a number of tasks such as outlier alerts, outlier filtering, predictive maintenance, data routing, and the like. In the prior art, online computation of IoT data can be realized by using a flink stream processing framework, an actor model, or the like. However, the flink stream processing framework has the problems of large resource requirement and high deployment difficulty. The actor model has the problems of frequent message serialization and deserialization and high performance consumption.
Therefore, the application provides a data processing flow deployment method. The data processing flow deployment method in the server comprises a display interface. The display interface at least comprises three areas, namely a control area, an editing area and a button area.
Wherein, a plurality of computing units (processors) can be included in the control area. Each computing unit includes at least one input data and at least one output data. Different computing units are used to implement different data processing steps. These calculation units are used for data processing. All the computing units in the control area may be defined using anonymous functions. The user may drag at least one computing unit of the control area to the editing area.
The user can arrange the calculation units dragged to the editing area according to a certain sequence to obtain a unit chain table (chain). The unit chain table is mainly used for connecting at least one computing unit. When the element list is taken as a whole, the element list may contain one input data and one output data. In order to indicate the arrangement order of the computing units in the unit chain table, the computing units may be connected by connecting lines. The server may also specify a single (monad) of data stream type using the data base type. The linked list of elements can be viewed topologically as a Directed Acyclic Graph (DAG). The sequence formed by each computing unit in the unit chain table is the computing process of the IoT data.
When the user clicks the build button of the button area, a build instruction may be triggered. And the server generates a data processing function according to the construction instruction and the unit linked list. The data processing function includes an anonymous function generated according to each computing unit of the unit linked list. When the user calls the data processing function, the data processing function can sequentially use the computing units to process the data to be processed according to the sequence of each computing unit in the unit chain table to obtain the final output data. The data processing flow deployment method is used in a streaming computing mode, and meets the real-time requirement of computing of the Internet of things better. Moreover, the data processing function is convenient to deploy and high in flexibility, and the processing efficiency of the IoT data can be further improved.
The technical solution of the present application will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Fig. 1 is a schematic diagram illustrating a display interface of a data processing flow deployment method according to an embodiment of the present application. In the server, a display interface corresponding to the data processing flow deployment method may be as shown in fig. 1. The display interface includes at least a control area 11, an edit area 12, and a button area 13. Optionally, an editing area 14 may also be included in the display interface.
The control area 11 at least includes a plurality of computing units. Different computing units in the control area correspond to different IoT data processing steps. For example, the data unit may include a process for aggregating IoT data processes. Alternatively, the data unit may also be used for data filtering according to the generation device of IoT data. Optionally, the control area 11 may further include a start unit. When the starting unit is dragged into the editing area, the server may generate a unit chain table according to the starting unit. Optionally, the control area 11 may further include a plurality of output units. The output unit may be connected to the computing unit for outputting the output data of the computing unit. Different output units in the control area correspond to different output modes. For example, the output may be directly by the robot, into an HTTP web page, into a mysql database, etc.
The editing area 12 may include at least one unit linked list. When the user drags a start unit to the editing area, the server can generate a unit linked list according to the second dragging instruction. The starting unit is the head of the unit chain table. When a user drags a target computing unit to the editing area, the server may determine the computing unit closest to the target computing unit according to the location of the target computing unit. The server can also determine the insertion position of the target computing unit according to the up-down position relationship between the target computing unit and the closest computing unit. For example, when the element linked list includes three elements, namely, a starting point, a script editing node and HTTP, the user drags the aggregation function above the script editing node. At this time, the aggregation function may be connected to the script editing node in the order in which the script editing node is connected to the aggregation function. The output unit HTTP is used for outputting output data of the script editing node. Also, the HTTP does not output the output data of the aggregation function. Optionally, an enlargement button, a reduction button, a positioning button, and a screenshot button may also be included in the editing area. Wherein the enlargement button and the reduction button are used to enlarge or reduce the display scale of the editing region. Wherein the positioning button is used for positioning to the position of the unit which is inserted last time.
Wherein the button area 13 comprises at least a build button. When the user clicks the build button, the server may generate build instructions. The construction instruction is used for constructing a data processing function according to the unit linked list in the editing area at the current moment. Optionally, a cancel button and a return button may be further included in the button area 13.
The editing area 14 may include information such as name, release status, and creation time. The user can realize the editing of the information by triggering the editing instruction.
In the present application, a server is used as an execution subject to execute the data processing flow deployment method of the following embodiments. Specifically, the execution body may be a hardware device of the server, or a software application in the server, or a computer-readable storage medium on which the software application implementing the following embodiment is installed, or code of the software application implementing the following embodiment.
Fig. 2 shows a flowchart of a data processing flow deployment method according to an embodiment of the present application. On the basis of the embodiment shown in fig. 1, as shown in fig. 2, with a server as an execution subject, the method of this embodiment may include the following steps:
s101, responding to a first dragging instruction triggered by dragging the target computing unit of the control area to the editing area, inserting the target computing unit into a unit chain table in the editing area according to the first dragging instruction, and updating the unit chain table.
In this embodiment, when the user drags the target computing unit in the control area to the target position in the editing area, the server may trigger the first dragging instruction according to the dragging operation. The target computing unit and the target location may be included in the first drag instruction. The server may determine a computing unit closest to the target computing unit based on the target location. The server may determine the connection relationship of the target computing unit according to the context between the target computing unit and the closest computing unit.
For example, when the element linked list includes three elements, a start point, a script editing node and HTTP, the user drags the aggregation function over the script editing node. At this time, the aggregation function may be connected to the script editing node in such a connection order that the aggregation function is connected to the script editing node. And, since the last unit of the script editing node is the start unit, the start unit will be connected to the target computing unit. That is, after the target computing unit is inserted, the connection order of the unit chain table may be a starting point, a target computing unit, a script editing node, and HTTP.
For example, when the element linked list includes three elements, namely, a starting point, a script editing node and HTTP, the user drags the aggregation function above the script editing node. At this time, the aggregation function may be connected to the script editing node in the order in which the script editing node is connected to the aggregation function. As shown in fig. 1, the output unit HTTP is still used to output the output data of the script editing node. That is, after the target computing unit is inserted, the connection order of the unit chain table may be the starting point and the script editing node, and then both the target computing unit and the HTTP are connected to the script editing node.
When multiple element linked lists are included in the edit region, the target compute element still determines its insertion location based on the closest compute element.
In one example, connecting lines are included among the units in the unit chain table in the display interface, and the connecting order of the connecting lines is used for explaining the execution order of the calculation units in the unit chain table. The connection line may be implemented. Alternatively, the connecting line may be a broken line. And/or, the connecting line may also include arrows.
S102, responding to a construction instruction triggered by a construction button of a click button area, and generating a data processing function according to a unit chain table, wherein the data processing function is used for realizing data processing, and the unit chain table comprises at least one calculation unit which is sequentially connected.
In this embodiment, when the user clicks the build button in the button area, the server may trigger the build instruction according to the click operation. The server may begin to construct data processing functions based on the build instructions and the cell linked list in the edit section. The server may construct a data processing function from a linked list of cells in the edit section. When the edit region includes a plurality of element linked lists, the server may construct a plurality of element linked lists.
In the server, each unit in the editing area can use a specified JSON format to describe the sequence of each unit in the unit chain table. For example, the JSON format code for the starting node may be as shown in FIG. 3.
The specific process of the server for constructing the data processing function of the unit linked list according to the construction instruction may include the following steps:
step 1, the server traverses the directed acyclic graph of the unit linked list through a depth-first traversal algorithm. The server may determine the type of the current cell during the traversal process. The type may include a start unit, a calculation unit, an output unit, etc. When the current unit is a computing unit, the server may create a new anonymity function from the computing unit. The input data of the anonymous function corresponding to the current unit is the output data of the anonymous function corresponding to the previous computing unit. The output data of the anonymous function corresponding to the current unit is the input data of the anonymous function corresponding to the next calculation unit. The server may sequentially create anonymous functions for each computing unit based on the order of each computing unit in the unit linked list.
And 2, after the traversal of the whole unit chain table is completed, the server can obtain anonymous functions of each computing unit in the unit chain table and package the anonymous functions together to obtain a data processing function. The data processing function may be an anonymous function. The input data of the data processing function is the input data of the first computing unit, and the output data of the data processing function is the output data of the last computing unit.
In one example, when the server completes the construction of the data processing function, the server may create a calculator using the data processing function. The server can utilize an event bus to transmit data streams to the computing Actor constructed in the last step, and corresponding computing results of the same type are output.
According to the data processing flow deployment method, when a user drags the target computing unit of the control area to the target position of the editing area, the server can trigger a first dragging instruction according to the dragging operation. The server may determine a computing unit closest to the target computing unit based on the target location. The server may insert the target computing element into the element linked list in the edit region based on the target computing element and the closest computing element. The server may update the element linked list. When the user clicks the build button of the button area, the server may trigger a build instruction according to the clicking operation. The server can construct a data processing function according to the construction instruction and the unit linked list in the editing area. The data processing function is used to implement data processing. The data processing function comprises at least one anonymous function corresponding to the calculation units which are connected in sequence. And the input data of each anonymous function is the output data of the previous anonymous function, and the output data of each anonymous function is the input data of the next anonymous function. According to the method and the device, the unit chain table is built, and the data processing function is built according to the unit chain table, so that the flexibility of on-line calculation flow deployment is improved, and the data processing efficiency is improved.
Fig. 4 shows a flowchart of a data processing flow deployment method according to an embodiment of the present application. On the basis of the embodiments shown in fig. 2 and fig. 3, as shown in fig. 4, with a server as an execution subject, the method of the embodiment may include the following steps:
s201, responding to a second dragging instruction triggered by dragging the initial unit of the control area to the editing area, and generating a unit chain table according to the second dragging instruction, wherein the head of the unit chain table is the initial unit.
In this embodiment, the control area further includes a start unit. When the user drags the start unit of the control area to the target position of the editing area, the server can trigger a second dragging instruction according to the dragging operation. The server may generate the unit linked list according to the second drag instruction. The starting unit of the unit chain table is the starting unit. When the user drags the plurality of initial units to the editing area, the server may generate a plurality of unit linked lists according to the plurality of second dragging instructions. When the user drags the first target computing unit to the editing area, the server may determine a starting unit closest to the target position of the target computing unit according to the first dragging instruction. The server may establish a connection between the target computing unit and the closest originating unit.
S202, responding to a third dragging instruction triggered by dragging the target output unit of the control area to the editing area, inserting the target output unit into the unit linked list according to the third dragging instruction, and updating the unit linked list.
In this embodiment, the control area further includes a plurality of output units. When the user drags the target output unit of the control area to the target position of the editing area, the server may trigger a third dragging instruction according to the dragging operation. The third drag instruction may include a target output unit and a target position. The server may determine, based on the target location, a computing unit that is closest to and above the target output unit. The server may connect the target output unit to the computing unit. The target output unit is used for outputting the output data of the calculation unit. And after the server completes the connection of the target output unit, the server updates the unit linked list.
S203, responding to a first deleting instruction triggered by clicking a deleting button on the computing unit or the output unit in the unit linked list, deleting the computing unit or the output unit from the unit linked list according to the first deleting instruction, and updating the unit linked list.
In this embodiment, when a user clicks a delete button on a computing unit or an output unit in a unit linked list of an editing area, a first delete instruction of the computing unit or the output unit may be triggered. The calculation unit or the output unit may be included in the first deletion instruction.
Alternatively, the delete button may be displayed when the user moves the cursor to a compute unit or an output unit in the unit linked list of the edit section.
The server may delete the computing unit or the output unit from the unit linked list according to the first deletion instruction. The server may obtain an updated cell linked list after deleting the computing cell or the output cell.
In one example, a second delete instruction may be triggered when the user clicks the delete button of the starting cell in the cell linked list of the edit section. The server may delete the unit chain table with the start unit as the head table according to the second deletion instruction.
And S204, responding to the editing instruction, and editing the information in the information editing area according to the editing instruction.
In this embodiment, when the display section includes an editing area, an editing instruction may be triggered when the user clicks an edit box of the editing area. The server can edit the content in the edit box according to the edit instruction, so as to modify the information in the edit area.
In one example, the edit region can also edit a popup. The edit popup can pop up when a user clicks a build button to trigger a build instruction. The user can output information in the edit box of the edit popup and generate an edit instruction. The server can modify the content in the editing popup according to the editing instruction. After the user finishes editing the editing popup, the server continues to execute the construction instruction.
According to the data processing flow deployment method, the server can trigger the second dragging instruction according to the dragging operation. The server may generate the unit linked list according to the second drag instruction. The server may trigger a third drag instruction according to the drag operation. The third drag instruction may include a target output unit and a target position. The server may determine, based on the target location, a computing unit that is closest to and above the target output unit. The server may connect the target output unit to the computing unit. The server may delete the computing unit or the output unit from the unit linked list according to the first deletion instruction. The server may obtain an updated cell linked list after deleting the computing cell or the output cell. The server can edit the content in the edit box according to the edit instruction, so as to modify the information in the edit area. According to the method and the device, flexible processing of the unit chain table is achieved through the second dragging instruction, the third dragging instruction, the deleting instruction and other instructions, and flexibility of data processing flow deployment is improved.
Fig. 5 shows a schematic structural diagram of a data processing flow deployment apparatus provided in an embodiment of the present application, and as shown in fig. 5, a data processing flow deployment apparatus 10 of this embodiment is used to implement an operation corresponding to a server in any one of the method embodiments, where the data processing flow deployment apparatus 10 of this embodiment includes:
and the editing module 11 is configured to respond to a first dragging instruction triggered by dragging the target computing unit in the control area to the editing area, insert the target computing unit into the unit chain table in the editing area according to the first dragging instruction, and update the unit chain table.
The building module 12 is configured to generate a data processing function according to a unit chain table in response to a building instruction triggered by clicking a building button in the button area, where the data processing function is used to implement data processing, and the unit chain table includes at least one computing unit connected in sequence.
In one example, the building block 12 is specifically configured to:
and traversing the unit chain table in a depth-first mode, and sequentially creating anonymous functions of each computing unit according to the sequence of each computing unit in the unit chain table, wherein the input data of each anonymous function is the output data of the previous anonymous function, and the output data of each anonymous function is the input data of the next anonymous function.
And packaging the anonymous function of each computing unit in the unit chain table to obtain a data processing function, wherein the input data of the data processing function is the input data of the first computing unit, and the output data of the data processing function is the output data of the last computing unit.
In one example, connecting lines are included among the units in the unit chain table in the display interface, and the connecting order of the connecting lines is used for explaining the execution order of the calculation units in the unit chain table.
In one example, the editing module 11 is further configured to:
and responding to a second dragging instruction triggered by dragging the initial unit of the control area to the editing area, and generating a unit linked list according to the second dragging instruction, wherein the head of the unit linked list is the initial unit.
In one example, the control area further includes at least one output unit, and the method further includes:
and in response to a third dragging instruction triggered by dragging the target output unit of the control area to the editing area, inserting the target output unit into the unit linked list according to the third dragging instruction, and updating the unit linked list.
In one example, the editing module 11 is further configured to:
and in response to a first deleting instruction triggered by clicking a deleting button on the computing unit or the output unit in the unit linked list, deleting the computing unit or the output unit from the unit linked list according to the first deleting instruction, and updating the unit linked list.
In one example, the editing module 11 is further configured to:
and responding to the editing instruction, and editing the information in the information editing area according to the editing instruction.
The data processing flow deployment apparatus 10 provided in the embodiment of the present application may implement the above method embodiment, and for specific implementation principles and technical effects, reference may be made to the above method embodiment, which is not described herein again.
Fig. 6 shows a hardware structure diagram of a server provided in an embodiment of the present application. As shown in fig. 6, the server 20 is configured to implement the operation corresponding to the server in any of the above method embodiments, where the server 20 of this embodiment may include: a memory 21 and a processor 22.
A memory 21 for storing a computer program. The Memory 21 may include a Random Access Memory (RAM), a Non-Volatile Memory (NVM), at least one disk Memory, a usb disk, a removable hard disk, a read-only Memory, a magnetic disk or an optical disk.
The processor 22 is configured to execute the computer program stored in the memory to implement the data processing flow deployment method in the above embodiments. Reference may be made in particular to the description relating to the method embodiments described above. The Processor 22 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
Alternatively, the memory 21 may be separate or integrated with the processor 22.
When memory 21 is a separate device from processor 22, server 20 may also include bus 23. The bus 23 is used to connect the memory 21 and the processor 22. The bus 23 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, the buses in the figures of the present application are not limited to only one bus or one type of bus.
The server provided in this embodiment may be configured to execute the data processing flow deployment method, and an implementation manner and a technical effect of the server are similar, which are not described herein again.
The present application also provides a computer-readable storage medium, in which a computer program is stored, and the computer program is used for implementing the methods provided by the above-mentioned various embodiments when being executed by a processor.
The computer-readable storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, a computer readable storage medium is coupled to the processor such that the processor can read information from, and write information to, the computer readable storage medium. Of course, the computer readable storage medium may also be integral to the processor. The processor and the computer-readable storage medium may reside in an Application Specific Integrated Circuit (ASIC). Additionally, the ASIC may reside in user equipment. Of course, the processor and the computer-readable storage medium may also reside as discrete components in a communication device.
In particular, the computer-readable storage medium may be implemented by any type of volatile or non-volatile Memory device or combination thereof, such as Static Random-Access Memory (SRAM), Electrically-Erasable Programmable Read-Only Memory (EEPROM), Erasable Programmable Read-Only Memory (EPROM), Programmable Read-Only Memory (PROM), Read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk, or optical disk. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
The present application also provides a computer program product comprising a computer program stored in a computer readable storage medium. The computer program can be read by at least one processor of the device from a computer-readable storage medium, and execution of the computer program by the at least one processor causes the device to implement the methods provided by the various embodiments described above.
Embodiments of the present application further provide a chip, where the chip includes a memory and a processor, where the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that a device in which the chip is installed executes the method in the above various possible embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of modules is merely a division of logical functions, and an actual implementation may have another division, for example, a plurality of modules may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or modules, and may be in an electrical, mechanical or other form.
Wherein the modules may be physically separated, e.g. mounted at different locations of one device, or mounted on different devices, or distributed over multiple network elements, or distributed over multiple processors. The modules may also be integrated, for example, in the same device, or in a set of codes. The respective modules may exist in the form of hardware, or may also exist in the form of software, or may also be implemented in the form of software plus hardware. The method and the device can select part or all of the modules according to actual needs to achieve the purpose of the scheme of the embodiment.
When the respective modules are implemented as integrated modules in the form of software functional modules, they may be stored in a computer-readable storage medium. The software functional module is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) or a processor to execute some steps of the methods according to the embodiments of the present application.
It should be understood that, although the respective steps in the flowcharts in the above-described embodiments are sequentially shown as indicated by arrows, the steps are not necessarily performed sequentially as indicated by the arrows. The steps are not performed in the exact order shown and may be performed in other orders unless explicitly stated herein. Moreover, at least some of the steps in the figures may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, in different orders, and may be performed alternately or at least partially with respect to other steps or sub-steps of other steps.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same. Although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: it is also possible to modify the solutions described in the previous embodiments or to substitute some or all of them with equivalents. And the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present application.

Claims (10)

1. A data processing flow deployment method is characterized by comprising a display interface, wherein the display interface comprises a control area provided with a plurality of computing units, an editing area displayed with a unit chain table and a button area provided with a plurality of control buttons, and the method comprises the following steps:
in response to a first dragging instruction triggered by dragging a target computing unit of the control area to the editing area, inserting the target computing unit into the unit linked list in the editing area according to the first dragging instruction, and updating the unit linked list;
and responding to a construction instruction triggered by clicking a construction button of the button area, and generating a data processing function according to the unit linked list, wherein the data processing function is used for realizing data processing, and the unit linked list comprises at least one computing unit which is sequentially connected.
2. The method according to claim 1, wherein the generating a data processing function according to the cell linked list specifically includes:
traversing the unit chain table in a depth-first mode, and sequentially creating anonymous functions of each computing unit according to the sequence of each computing unit in the unit chain table, wherein input data of each anonymous function is output data of a previous anonymous function, and output data of each anonymous function is input data of a next anonymous function;
and encapsulating the anonymous function of each computing unit in the unit chain table to obtain the data processing function, wherein the input data of the data processing function is the input data of the first computing unit, and the output data of the data processing function is the output data of the last computing unit.
3. The method according to claim 1, wherein connecting lines are included between the units in the unit chain table in the display interface, and a connecting sequence of the connecting lines is used for explaining an execution sequence of each computing unit in the unit chain table.
4. The method according to any one of claims 1-3, wherein the control region further comprises a starting unit, and wherein the target computing unit of the control region is dragged before the editing region, the method further comprising:
responding to a second dragging instruction triggered by dragging the initial unit of the control area to the editing area, and generating the unit linked list according to the second dragging instruction, wherein the head of the unit linked list is the initial unit.
5. The method of any of claims 1-3, wherein the control region further comprises at least one output unit, the method further comprising:
and in response to a third dragging instruction triggered by dragging the target output unit of the control area to the editing area, inserting the target output unit into the unit linked list according to the third dragging instruction, and updating the unit linked list.
6. The method according to any one of claims 1-3, further comprising:
and in response to a first deleting instruction triggered by clicking a deleting button on the computing unit or the output unit in the unit linked list, deleting the computing unit or the output unit from the unit linked list according to the first deleting instruction, and updating the unit linked list.
7. The method according to any one of claims 1-3, wherein the display interface further comprises an information editing area; the method further comprises the following steps:
and responding to an editing instruction, and editing the information in the information editing area according to the editing instruction.
8. A server, characterized in that the server comprises: a memory, a processor;
the memory is used for storing a computer program; the processor is configured to implement the data processing flow deployment method according to any one of claims 1 to 7, according to the computer program stored in the memory.
9. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, is configured to implement the data processing flow deployment method according to any one of claims 1 to 7.
10. A computer program product, characterized in that the computer program product comprises a computer program which, when being executed by a processor, implements the data processing flow deployment method of any one of claims 1-7.
CN202210056584.9A 2022-01-18 2022-01-18 Data processing flow deployment method and device and server Pending CN114398137A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210056584.9A CN114398137A (en) 2022-01-18 2022-01-18 Data processing flow deployment method and device and server

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210056584.9A CN114398137A (en) 2022-01-18 2022-01-18 Data processing flow deployment method and device and server

Publications (1)

Publication Number Publication Date
CN114398137A true CN114398137A (en) 2022-04-26

Family

ID=81230702

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210056584.9A Pending CN114398137A (en) 2022-01-18 2022-01-18 Data processing flow deployment method and device and server

Country Status (1)

Country Link
CN (1) CN114398137A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115291856A (en) * 2022-07-19 2022-11-04 中电金信软件有限公司 Flow establishing method and device and electronic equipment

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110058985A (en) * 2019-04-09 2019-07-26 美林数据技术股份有限公司 A kind of system and method for towed building enterprise-level AI application
CN110688600A (en) * 2019-09-09 2020-01-14 平安普惠企业管理有限公司 Online editing method, device and equipment based on HTML (Hypertext markup language) page and storage medium
CN112181602A (en) * 2020-10-23 2021-01-05 济南浪潮数据技术有限公司 Resource arranging method and device, electronic equipment and storage medium
CN112783632A (en) * 2021-02-07 2021-05-11 树根互联股份有限公司 Stream calculation system, method, electronic device, and readable storage medium
CN113867600A (en) * 2021-08-25 2021-12-31 上海浦东发展银行股份有限公司 Development method and device for processing streaming data and computer equipment

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110058985A (en) * 2019-04-09 2019-07-26 美林数据技术股份有限公司 A kind of system and method for towed building enterprise-level AI application
CN110688600A (en) * 2019-09-09 2020-01-14 平安普惠企业管理有限公司 Online editing method, device and equipment based on HTML (Hypertext markup language) page and storage medium
CN112181602A (en) * 2020-10-23 2021-01-05 济南浪潮数据技术有限公司 Resource arranging method and device, electronic equipment and storage medium
CN112783632A (en) * 2021-02-07 2021-05-11 树根互联股份有限公司 Stream calculation system, method, electronic device, and readable storage medium
CN113867600A (en) * 2021-08-25 2021-12-31 上海浦东发展银行股份有限公司 Development method and device for processing streaming data and computer equipment

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115291856A (en) * 2022-07-19 2022-11-04 中电金信软件有限公司 Flow establishing method and device and electronic equipment
CN115291856B (en) * 2022-07-19 2023-09-22 中电金信软件有限公司 Flow establishing method and device and electronic equipment

Similar Documents

Publication Publication Date Title
CN110908667B (en) Method and device for joint compilation of neural network and electronic equipment
CN111310936B (en) Construction method, platform, device, equipment and storage medium for machine learning training
CN114008594A (en) Scheduling operations on a computational graph
CN112561640A (en) Commodity page template generation method and device, computer equipment and storage medium
US11567628B2 (en) Cognitive composition of multi-dimensional icons
CN110633959A (en) Method, device, equipment and medium for creating approval task based on graph structure
CN113448728B (en) Cloud resource scheduling method, device, equipment and storage medium
CN114398137A (en) Data processing flow deployment method and device and server
CN111124644B (en) Method, device and system for determining task scheduling resources
CN112035229A (en) Calculation graph processing method and device and storage medium
CN114647409A (en) Large-screen visualization application creation platform, method, computing device and storage medium
CN113094125B (en) Business process processing method, device, server and storage medium
JP7369288B2 (en) Image processing method, image processing command generation method and device
CN112328225A (en) Page operation method and operation system thereof
CN116541336A (en) Software running method of multi-core chip and coprocessor
CN109086137B (en) GPU parallel computing resource configuration method and device
CN109766236A (en) KAFKA message queue number monitoring method, device, electronic equipment and storage medium
CN107247594B (en) Logic system, implementation method thereof, computing device and computer-readable storage medium
CN115016769A (en) Scaffold building method based on field drive design and application development method
CN115408002A (en) Webpage generation method, system, electronic equipment and storage medium
CN110992443B (en) Business flow chart construction method and device and computer readable storage medium
CN114675819A (en) RPA component recommendation method, device, equipment and readable storage medium
CN111158684B (en) System creation method, device, electronic equipment and readable storage medium
CN113778412A (en) Data resource arranging method and device, computer equipment and readable storage medium
CN113098960A (en) Service operation method, device, server 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