Data processing method, device, equipment and medium for event objects

Abstract

The present application discloses a data processing method, device, equipment and medium for event objects. The method includes: responding to a data processing instruction for a specified event object, determining the corresponding target schedule information and target task; determining a target schedule node that matches the target schedule information from the current schedule node record information; and executing the target task for the target schedule node. The present application introduces the concept of version to maintain schedule data, ensures the efficiency and accuracy of data preservation, improves the effectiveness of management of such data, and improves the response capability to relevant data processing instructions. The embodiments of the present application can be applied to various scenarios such as cloud technology, artificial intelligence, smart transportation, and assisted driving.

Description

Technical Field

[0001] The present application relates to the field of Internet communication technology, and in particular to a data processing method, device, equipment and medium for event objects. Background Art

[0002] As an important entertainment project in life, sports events often have a wide audience. Sports events can include traditional sports events such as football, basketball, badminton, etc., and can also include e-sports events. In sports events, the organization and implementation of competitive competitions between participants are achieved according to certain rules. In related technologies, information involved in sports events (such as scores, participant information, etc.) is often managed by staff, such as manual calculation, modification and storage. Relying on manual management methods will lead to a large workload and low work efficiency, and it is also easy to cause information errors due to staff errors, calculation errors, etc. Therefore, it is necessary to provide a solution for effectively managing the information involved in sports events. Summary of the Invention

[0003] In order to solve the problems of low efficiency and error-proneness in the application of existing technologies in managing information related to sports events, this application provides a data processing method, device, equipment and medium for event objects:

[0004] According to a first aspect of the present application, a data processing method for an event object is provided, the method comprising:

[0005] In response to a data processing instruction for a specified event object, determine corresponding target schedule information and target tasks; wherein the target schedule information is set based on a preset competition system calculation unit dimension;

[0006] Determining a target schedule node that matches the target schedule information from the current schedule node record information; wherein the schedule node record information includes at least one schedule data stored based on a schedule node dimension, the schedule data stored in each schedule node indicates the same version identifier, and the schedule data is match data based on the preset competition system calculation unit dimension;

[0007] Execute the target task for the target schedule node.

[0008] According to a second aspect of the present application, a data processing device for an event object is provided, the device comprising:

[0009] Response module: used to respond to the data processing instruction for the specified event object and determine the corresponding target schedule information and target tasks; wherein the target schedule information is set based on the preset competition system calculation unit dimensions;

[0010] A determination module is configured to determine a target schedule node that matches the target schedule information from the current schedule node record information; wherein the schedule node record information includes at least one schedule data stored based on the schedule node dimension, the schedule data stored in each schedule node indicates the same version identifier, and the schedule data is match data based on the preset competition system calculation unit dimension;

[0011] Execution module: used to execute the target task for the target schedule node.

[0012] According to a third aspect of the present application, an electronic device is provided, comprising a processor and a memory, wherein the memory stores at least one instruction or at least one program, and the at least one instruction or the at least one program is loaded and executed by the processor to implement the data processing method for event objects as described in the first aspect.

[0013] According to a fourth aspect of the present application, a computer-readable storage medium is provided, in which at least one instruction or at least one program is stored. The at least one instruction or the at least one program is loaded and executed by a processor to implement the data processing method for event objects as described in the first aspect.

[0014] According to a fifth aspect of the present application, a computer program product or computer program is provided, comprising computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the data processing method for an event object as described in the first aspect.

[0015] The present application provides a data processing method, device, equipment, and medium for event objects, which have the following technical effects:

[0016] This application determines the target schedule information and target task corresponding to the data processing instructions for the specified event object, and then determines the target schedule node that matches the target schedule information from the current schedule node record information, thereby executing the target task for the target schedule node. The schedule node record information used includes at least one schedule data saved based on the schedule node dimension. The schedule data saved by each schedule node indicates the same version identifier. The schedule data is the game data based on the preset competition system calculation unit dimension, and the target schedule information is set based on the preset competition system calculation unit dimension. This application introduces the concept of version to maintain the schedule data, ensures the efficiency and accuracy of data storage, improves the effectiveness of management of such data, and improves the response capability to relevant data processing instructions. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the technical solutions and advantages of the embodiments of the present application or the prior art, the following is a brief introduction to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0018] Figure 1 is a schematic diagram of an application environment provided by an embodiment of the present application;

[0019] Figure 2 This is a flow chart of a data processing method for event objects provided by an embodiment of the present application;

[0020] Figure 3 This is a flowchart of updating the schedule node record information provided by an embodiment of the present application;

[0021] Figure 4 This is a flowchart of a response recovery instruction provided by an embodiment of the present application;

[0022] Figure 5 This is a schematic diagram of an interface for triggering the generation of data processing instructions provided in an embodiment of the present application;

[0023] Figure 6 This is a schematic diagram of the processing flow of the schedule editing and management system provided by the embodiment of the present application;

[0024] Figure 7 This is a schematic diagram of version management provided by an embodiment of the present application;

[0025] Figure 8 、 9 This is a schematic diagram of data submission provided in an embodiment of the present application;

[0026] Figure 10 This is a schematic diagram illustrating the rollback function provided in an embodiment of the present application;

[0027] Figure 11 This is a schematic diagram for introducing the modification function provided in an embodiment of the present application;

[0028] Figure 12 This is a schematic diagram illustrating the recovery function provided in an embodiment of the present application;

[0029] Figure 13 This is a block diagram of a data processing device for event objects provided by an embodiment of the present application;

[0030] Figure 14This is a structural diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0031] The following will be combined with the accompanying drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are only part of the embodiments of this application, not all of the embodiments. Based on the embodiments of this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0032] It should be noted that the terms "including" and "having" and any variations thereof in the specification and claims of this application and the above-mentioned drawings are intended to cover non-exclusive inclusions. For example, a process, method, system, product or server that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or are inherent to these processes, methods, products or devices.

[0033] Before further describing the embodiments of the present application in detail, the nouns and terms involved in the embodiments of the present application are explained. The nouns and terms involved in the embodiments of the present application are subject to the following interpretations.

[0034] Tournament: A series of matches and a single match are collectively referred to as a tournament.

[0035] Stage: A virtual directory used to represent the preliminary round, semi-final, and final rounds.

[0036] Round: A round of competition determines which teams advance.

[0037] Team: The smallest unit of participants in a competition. For individual competitions, this can also be abstracted into each person forming a team.

[0038] Player: A member of a team.

[0039] Group: A collection of teams, such as the winners group or losers group.

[0040] Competition format: refers to the rules of the competition, such as single-elimination, double-elimination, or Swiss tournament. Different competition formats require different numbers of matches.

[0041] Interrupt: means that you can interrupt the game during the schedule and save the current game score, game status, and game matches during the interruption.

[0042] Resume: refers to resuming the game schedule from the time of interruption after an interruption.

[0043] Version management: refers to the recording of different stages of the schedule, which makes it convenient to roll back to a certain stage of the schedule.

[0044] See also Figure 1 , Figure 1 This is a schematic diagram of an application environment provided by an embodiment of the present application. The application environment may include a client 10 and a server 20. The client 10 and the server 20 may be directly or indirectly connected via wired or wireless communication. The user may send a data processing instruction for a specified event object to the server 20 via the client 10. The server 20 receives the instruction and determines the corresponding

[0045] The target schedule information and target task are then determined from the current schedule node record information to determine the target schedule node that matches the target schedule information, thereby executing the target task for the target schedule node. Figure 1 Just an example.

[0046] Clients can be physical devices such as smartphones, computers (such as desktops, tablets, and laptops), augmented reality (AR) / virtual reality (VR) devices, digital assistants, intelligent voice interaction devices (such as smart speakers), smart wearables, smart home appliances, and in-vehicle terminals. They can also be software running on physical devices, such as computer programs. Client operating systems can include Android, iOS (a mobile operating system developed by Apple), Linux, and Microsoft Windows.

[0047] The server side can be an independent physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms. The server can include network communication units, processors, and memory, etc. The server side can provide backend services for the corresponding client.

[0048] In practical applications, the aforementioned data processing instructions for a designated event object may indicate an e-sports (or esports) event, and the data processing instructions may include rollback instructions, modification instructions, and recovery instructions. It is understood that e-sports refers to electronic gaming competitions that have reached the "competitive" level. E-sports is a competition between individuals that utilizes electronic devices as sports equipment and combines both intellectual and physical strength.

[0049] In addition, as provided in the embodiments of the present application, the data processing solution for event objects, wherein these data can be stored on the blockchain.

[0050] The following describes a specific embodiment of a data processing method for event objects of the present application. Figure 2 It is a flow chart of a data processing method for event objects provided by an embodiment of the present application. The present application provides method operation steps as described in the embodiment or flow chart, but may include more or fewer operation steps based on conventional or non-creative labor. The order of steps listed in the embodiment is only one way of executing the steps among many steps, and does not represent the only execution order. When the actual system or product is executed, it can be executed in sequence or in parallel (for example, in a parallel processor or multi-threaded processing environment) according to the method shown in the embodiment or the accompanying drawings. Specifically, Figure 2 As shown, the method may include:

[0051] S201: In response to a data processing instruction for a specified event object, determining corresponding target schedule information and target tasks; wherein the target schedule information is set based on a preset competition system calculation unit dimension;

[0052] In an embodiment of the present application, for the data processing instructions received for the specified event object, the server side determines the target schedule information and target task corresponding to the data processing instructions. The data processing instructions can be generated by the target object (such as a user, a simulator, etc.) through the client trigger, and then the client sends the data processing instructions to the server side. The server side can maintain the schedule data corresponding to the relevant event objects, and the specified event object is the specific event object in the relevant event object, usually a specific event object. For example, the server side maintains the schedule data corresponding to event object A, the schedule data corresponding to event object B, and the schedule data corresponding to event object C, and the specified event object is the event object A therein. The event object can indicate a traditional sports event or an e-sports event.

[0053] Data processing instructions are used to instruct the server to process the schedule data it maintains. Taking the data processing instruction as a rollback instruction as an example, the rollback instruction can be used to instruct the server to output, mark or modify (edit) the schedule data of the historical stage. Taking the data processing instruction as a modify instruction as an example, the modify instruction is used to instruct the server to modify (edit) the schedule data of the current stage or the historical stage. Taking the data processing instruction as a restore instruction as an example, the restore instruction often appears after the rollback instruction instructing to modify (edit) the schedule data of the historical stage. The restore instruction can be used to instruct the server to establish an association between the response result (for the rollback instruction) and the original associated schedule data, that is, to determine the original associated schedule data based on the schedule data of the new historical stage and establish an association between the two. For example, the server maintains the schedule data of different stages of event object A. If the current stage is round 4 and the rollback instruction instructs to edit the schedule data of round 2, then the restore instruction is used to establish an association between the edited schedule data of round 2 and the original schedule data of rounds 3-4.

[0054] The target schedule information and target task are determined based on the data processing instruction. It is understandable that the target schedule information can be directly or indirectly determined based on the parameters carried by the data processing instruction. The target task can be directly or indirectly determined based on the parameters carried by the data processing instruction. In combination with the above introduction to the "rollback instruction", "modify instruction" and "restore instruction", the target schedule information is used to indicate the stage of the schedule data to be processed, and the target task is used to standardize how to process the schedule data to be processed. Taking into account the effective maintenance of schedule data and the differences in the competition systems based on different events, the embodiment of the present application uses a preset competition system calculation unit to specify the meaning of the stage. If the preset competition system calculation unit is "round", then the target schedule information can indicate "third round"; if the preset competition system calculation unit is "field", then the target schedule information can indicate "fourth field"; if the preset competition system calculation unit is "half-time", then the target schedule information can indicate "first half"; if the preset competition system calculation unit is "innings", then the target schedule information can indicate "second innings". Taking the data processing instruction as a modification instruction as an example, the target task determined based on the modification instruction is used to standardize how to edit the schedule data to be processed, such as a specific editing item, where the original value A of the editing item needs to be replaced with B.

[0055] In an exemplary embodiment, when the data processing instruction is a rollback instruction, determining the corresponding target schedule information includes the following two methods:

[0056] 1) Determine the specific historical stage of the schedule data that needs to be processed by step-by-step regression, that is, determine the target schedule information;

[0057] Generally speaking, the schedule data for the historical stage targeted by the rollback instruction is the schedule data for the previous stage. The target schedule information can be determined by the following steps: determining the previous stage information that indicates the preset competition system calculation unit, and using the previous stage information as the target schedule information. For example, if the current stage information indicates the fourth round, the previous stage information indicates the previous round, i.e., the third round.

[0058] Of course, if the third round's schedule data doesn't meet the processing requirements, it can be rolled back to the second round; if the second round's schedule data still doesn't meet the processing requirements, it can be rolled back to the first round. The processing requirements here can be viewing requirements, marking requirements, or modification (editing) requirements. The specific execution of the layer-by-layer rollback can be implemented independently by the server or through the cooperation of the client and server.

[0059] For the former, the fallback instruction carries processing requirement information. The server side determines the previous stage information indicating the preset competition system calculation unit and obtains the corresponding schedule data (such as the schedule data of the third round), and uses the processing requirement information to determine whether the schedule data meets the processing requirements. If it does, the previous stage information is used as the target schedule information; if it does not, it determines the previous stage information indicating the preset competition system calculation unit and obtains the corresponding schedule data (such as the schedule data of the second round), and uses the processing requirement information to determine whether the schedule data meets the processing requirements. If it does, the previous stage information is used as the target schedule information, otherwise it continues to fall back as shown above. Combined with the subsequent step S202, it can be understood that when the server side independently implements layer-by-layer fallback, steps S201 and S202 need to cooperate to complete the determination of the target schedule information.

[0060] For the latter, the server side determines the previous stage information indicating the preset competition system calculation unit, and generates the data to be displayed 1 based on the previous stage information and the third preset display rule (refer to the relevant records of the "second preset display rule" in step S203 described later) to send to the user interaction interface. The user interaction interface can be provided by the client, and the user can view the data to be displayed 1 through the user interaction interface, and then generate an approval instruction or a rejection instruction by triggering the relevant interactive controls. The client sends the approval instruction or rejection instruction generated by the user trigger to the server side. In response to the approval instruction for the data to be displayed 1, the server side uses the previous stage information as the target schedule information. In response to the rejection instruction for the data to be displayed 1, the server side does not use the previous stage information as the target schedule information, and at the same time determines the next previous stage information indicating the preset competition system calculation unit, and generates the data to be displayed 2 based on the next previous stage information and the third preset display rule to send to the user interaction interface, and so on.

[0061] 2) Determine the specific historical stage of the schedule data to be processed by viewing the first data to be displayed (which can be regarded as a list of historical stages) and selecting it, that is, determine the target schedule information;

[0062] The specific process may be: determining at least one historical stage information indicating the preset competition system calculation unit, generating first data to be displayed based on the at least one historical stage information and a first preset display rule (refer to the relevant records of the "second preset display rule" in step S203 described later) to send to the user interaction interface, determining the target historical stage information in response to a hit instruction for the first data to be displayed, and using the target historical stage information as the target schedule information.

[0063] Taking "round" as the default calculation unit for the competition system, for example, if the current stage information indicates the fourth round, at least one historical stage information can indicate the previous three rounds. Accordingly, the first data to be displayed can be considered a round list. Compared to the level-by-level rollback in 1), 2) allows for convenient rollback to earlier rounds using the round list. This improves the efficiency of rollback to earlier rounds when many rounds have already been played.

[0064] The first data to be displayed can be displayed to the user via a user interaction interface provided by the client. The user can view the information of each historical stage as candidate schedule information through the user interaction interface. The user can trigger a related interactive control to hit a specific historical stage information, thereby generating a hit instruction indicating the specific historical stage information. The client sends the hit instruction generated by the user trigger to the server. In response to the hit instruction for the first data to be displayed, the server uses the specific historical stage information indicated by the hit instruction as the target schedule information.

[0065] The above two methods ensure that user habits and user interaction experience are taken into consideration when determining the target schedule information, and improve the granularity of responding to user-triggered rollback instructions.

[0066] In practical applications, see Figure 5 Through the user interaction interface provided by the client, users can trigger the "rollback" control to generate a rollback instruction; users can trigger the "edit" control to generate a modification instruction, so as to directly edit the current round; users can trigger the "next round" control to generate a recovery instruction, so as to directly read the current round's schedule data for processing to obtain the next round's match and ranking.

[0067] S202: Determine a target schedule node that matches the target schedule information from the current schedule node record information; wherein the schedule node record information includes at least one schedule data stored based on a schedule node dimension, the schedule data stored in each schedule node indicates the same version identifier, and the schedule data is match data based on the preset competition system calculation unit dimension;

[0068] In an embodiment of the present application, the server side determines the target schedule node that matches the target schedule information from the current schedule node record information. The concept of version is introduced to maintain the schedule data, which is specifically manifested as: creating a schedule node, using the schedule node to save the game data of a specific stage, and the saved game data of the specific stage is under one version. Taking "round" as the preset competition system calculation unit as an example, the schedule data saved by a schedule node is the game data of a certain round, and the game data of this certain round is under one version. In other words, if the game data of the second round is modified, a new schedule node will be used to save the modified game data of the second round. The modified game data of the second round indicates one version, and the game data of the second round before modification indicates another version. For the game data of a specific stage, it can be understood as the relevant data of a certain round of competition, such as the score of this round of competition, team information (such as the addition, replacement, and deletion of team member identifiers), and battle information (such as how many games were played in this round).

[0069] Schedule node record information includes at least one piece of schedule data stored based on the schedule node dimension. Taking "round" as the default calculation unit for the competition system, for example, if five rounds have already been played and two versions of match data exist for the second round, there are six schedule nodes and, accordingly, six copies of match data. The schedule node record information includes these six copies of match data and stores them based on the schedule node dimension, i.e., using each of the six schedule nodes to store the corresponding match data.

[0070] The update of the schedule node record information can be based on the generation of new schedule data during the event, or it can be based on the response of the data processing instruction. Therefore, when confirming the target schedule node, it is necessary to use the current schedule node record information, that is, the latest schedule node record information. Since the target schedule information is used to indicate the stage of the schedule data to be processed, and the schedule node record information may contain different versions of the game data for the same stage, when matching the target schedule information, the most recently created schedule node indicating the same stage is identified as the target schedule node, that is, the schedule node corresponding to the latest version of the game data for the same stage.

[0071] In an exemplary embodiment, Figure 3As shown, updating the schedule node record information may include the following steps:

[0072] S301: Acquire designated schedule data for the designated event object;

[0073] S302: Generate a corresponding designated schedule node based on the designated schedule data; wherein the designated schedule node further includes a version identifier indicating the designated schedule data;

[0074] S303: Use the designated schedule node to update the current schedule node record information.

[0075] Taking "round" as the preset competition system calculation unit as an example, if five rounds of competition have been carried out. A) The specified schedule data can be newly generated schedule data, such as the sixth round of competition data. B) The specified schedule data can also be the modified result of the original schedule data, such as the modified second round of competition data. Please refer to the "modification instructions" and "rollback instructions". C) The specified schedule data can also be the original schedule data, such as the "third round of competition data" that is associated with the original second type of competition data after the second round of competition data is modified. Please refer to the "restore instructions".

[0076] Accordingly, a corresponding designated schedule node is generated based on the designated schedule data, and the designated schedule node is used to save the designated schedule data, thereby realizing the update of the current schedule node record information. The designated schedule node also includes a version identifier indicating the designated schedule data. As for which schedule node is used as the parent node when generating the designated schedule node, in the case of A) above, the schedule node of the fifth round of game data (the latest version) can be saved as the parent node; in the case of B) above, the schedule node of the second round of game data before modification can be saved as the parent node; in the case of C) above, the schedule node of the second round of game data before modification can be saved as the parent node.

[0077] The above example provides an application of how to save schedule data based on schedule node record information based on schedule node dimensions, providing a basis for the effective management of schedule data.

[0078] Furthermore, the use of the designated schedule node to update the current schedule node record information may include the following steps: first, generating a corresponding version tree based on the version identifier indicating the designated schedule data; then, mounting the designated schedule node to the version tree; further, creating a storage object in the current schedule node record information, writing the version tree into the current schedule node record information, and establishing an association between the storage object and the version tree to update the current schedule node record information.

[0079] Since the concept of version is introduced when maintaining the schedule data, and the specified schedule node also includes a version identifier indicating the specified schedule data, a corresponding version tree can be generated based on the version identifier indicating the specified schedule data, and the specified schedule node can be mounted to the version tree. At the same time, based on the implementation principle of git (a distributed version control system), a storage object (blob) can be created in the current schedule node record information, the version tree can be written into the current schedule node record information, and an association relationship between the storage object and the version tree can be established to update the current schedule node record information. Based on the implementation principle of git, the version is maintained as a tree to achieve version management of the schedule data. This ensures the efficiency and accuracy of data preservation.

[0080] In actual applications, if "round" is used as the preset competition calculation unit, for each round of competition, all the competition data of the current stage can be saved as a node (schedule node) in json format, and then the node is added to the corresponding version tree. Each node can include a unique id (unique identifier), save time, remarks, schedule data in json format, version identification, and corresponding parent node information. After being saved, this information in the node can form a standard storage structure for persistent storage. Among them, the schedule data in json format can include multiple data snapshots described in json format, and each data snapshot corresponds to a certain time point in the current stage. The version identification can indicate the stage to which the schedule data corresponds.

[0081] Each round of competition will generate new schedule data. The storage of new schedule data can be regarded as a data submission. Figure 8 , first submission: mount the node with id 2346b80 under the corresponding version tree, and establish the association relationship between the version tree and the corresponding storage object (blob). It can be understood that the node is an abstract concept, and the information stored by the node is actually stored by the blob. The version tree can be used as a directory in the schedule node record information, and also maintains the information in the blob. Among them, the id can be generated by SHA-1. The blob can store information in txt format. Each data submission will generate a node mounted on the corresponding version tree, and point to a specific blob.

[0082] See also Figure 9, Second submission: Mount the node with id Ca3917 under the corresponding version tree, and establish an association between the version tree and the corresponding storage object (blob). It should be noted that the schedule data involved in the second submission is modified based on the schedule data involved in the first submission. Therefore, based on the implementation principle of git, the version tree involved in the first submission also maintains the information in the blob involved in the second submission.

[0083] S203: Execute the target task for the target schedule node.

[0084] In this embodiment of the present application, the server executes a target task for a target schedule node. Since the target task is used to specify how to process pending schedule data, and the pending schedule data is stored by the target schedule node, the target task can be executed for the target schedule node as a whole. Alternatively, the target schedule data stored by the target schedule node can be obtained or determined, and the target task can be executed for the target schedule data.

[0085] In conjunction with the relevant records of the "rollback instruction", "modification instruction" and "restore instruction" in the aforementioned step S201, the following will introduce the content related to executing the target task:

[0086] 1) “Rollback command”: The rollback command can be used to instruct the server to output, mark or modify (edit) the schedule data of the historical stage.

[0087] 1.1) When a rollback instruction instructs the server to output historical match data, the target task corresponding to the rollback instruction may be a viewing task. The process of executing the target task for the target match node may include the following steps: obtaining corresponding target match data based on the target match node; and generating second to-be-displayed data based on the target match data and a second preset display rule, and transmitting the second to-be-displayed data to the user interface.

[0088] The target schedule data is stored by the target schedule node and can be considered as data that can more comprehensively reflect the relevant data of a certain stage of the game. The second preset display rules can be used as specifications for the interface display dimension, such as the specific font used to display the score. The second preset display rules can also be used as specifications for the data processing dimension, such as filtering out some data that is not necessary for display, displaying the statistical values ​​of certain data, etc. The second data to be displayed can be displayed to the user through the user interaction interface provided by the client. The user can view the relevant information about the game in the stage indicated by the target schedule node through the user interaction interface.

[0089] 1.2) When a rollback instruction instructs the server to mark the schedule data for a historical stage, the target task corresponding to the rollback instruction may be a parent node marking task. The process of executing the target task for the target schedule node may include the following steps: marking the target schedule node as the parent node of the newly generated schedule node.

[0090] The schedule data saved by the target schedule node can more comprehensively reflect the relevant data of a certain stage of the game. A) If it is necessary to modify the schedule data it saves, the schedule data can be obtained for modification, and a newly generated schedule node can be used to save the modified schedule data, and the newly generated schedule node is a child node with the target schedule node as the parent node. B) If the schedule data saved by the associated schedule node that originally took the target schedule node as the parent node is incorrect, and the game at the stage indicated by the associated schedule node based on the competition system needs to be replayed, then marking the target schedule node as the parent node of the newly generated schedule node can guide the new game data generated by the replay to be saved by the new associated schedule node, which is also a child node with the target schedule node as the parent node. It can be understood that the marking here is to guide how to create the schedule node that saves such data before modifying the original schedule data, or before the replay generates new game data.

[0091] 1.3) When a rollback instruction instructs the server to modify (edit) the schedule data for a historical stage, the target task corresponding to the rollback instruction may be a modification (editing) task. The process of executing the target task for the target schedule node may include the following steps: first, obtaining the corresponding target schedule data based on the target schedule node; then, modifying the target schedule data based on the modification task to generate a new schedule node with the target schedule node as its parent node.

[0092] This corresponds to scenario A) in 1.2) above. The target schedule data is stored in the target schedule node. The target schedule data is obtained and modified, and the modified target schedule data is saved using the new schedule node. It should be noted that the target schedule node still stores the target schedule data. The modification items indicated by the modification task include at least one of the following: score, team information, and battle status information.

[0093] In actual applications, through the user interface provided by the client, users can see all currently submitted records and versions, as well as notes. When selecting a rollback version, the pointer will point to the selected node, which stores the complete competition data for the corresponding stage. Figure 10, the latest node of the C1 branch stores the fourth round of game data, indicating that four rounds of games have been played. However, if the score of the second round is found to be incorrect, it is necessary to roll back to the node that stores the second round of game data, that is, the C1-2 node. Then, the data stored in the C1-2 node is modified, and finally a second branch C2 is branched out. The C2-1 node contains the modified second round of game data. Generally speaking, the current version is the latest version (version), which means that the version pointer will point to the latest version. At this time, the version pointer points to the C2-1 node.

[0094] 2) “Modify Instructions”: Modify instructions are used to instruct the server to edit the schedule data of the current stage or historical stages.

[0095] 2.1) Edit the schedule data of the historical stage: For this, please refer to the relevant content of determining the target schedule information under the "rollback instruction" in the aforementioned step S201, as well as the relevant content of modifying (editing) the task mentioned above 1.3), which will not be repeated here.

[0096] 2.2) Editing the Current Stage's Schedule Data: For this purpose, please refer to the aforementioned 1.3) Modify (Edit) Task for details, which will not be further elaborated. Accordingly, determining the corresponding target schedule information may include the following steps: determining the current stage information indicating the preset competition system calculation unit, and using the current stage information as the target schedule information.

[0097] In actual applications, when the schedule data saved by the node is modified after the rollback, a new branch will be generated. The first node of the new branch is the node generated based on the above modification. Figure 11 , the parent node of this node is the source node. This creates two branches: the old branch is from before the rollback, and the new branch is from after the rollback modification. After the modification, the game is restarted. The latest node of branch C2 (node ​​C2-3) stores the fourth round of game data. Generally speaking, the current version is the latest version, which means that the version pointer will point to the latest version. In this case, the version pointer points to node C2-3.

[0098] 3) "Restore Instructions": Restore instructions often appear after a rollback instruction that instructs the server to edit the schedule data for a previous stage. Restore instructions can be used to instruct the server to establish a relationship between the response result (to the rollback instruction) and the original associated schedule data. In other words, based on the schedule data for the new historical stage, the original associated schedule data is determined and the relationship between the two is established. The target task corresponding to the restore instruction can be a restore task.

[0099] In practical applications, see Figure 12After rolling back and modifying, the current version of the schedule data will be read, and the modified schedule data will be calculated. At the same time, the new team rankings, games, scores, etc. will be formed after the calculation. Recovery actually regards each node as a complete unit, and each node itself stores the schedule data of the corresponding stage. Then, when restoring, you only need to read the node pointed to by the version pointer, read the schedule data from the C2-2 node, and then generate the C3-1 node. It should be noted that the C2-2 node stores the second round of game data, and the C3-1 node stores the third round of game data.

[0100] Further, such as Figure 4 As shown, after modifying the target schedule data based on the modification task to generate a new schedule node with the target schedule node as the parent node, the method further includes:

[0101] S401: When the current schedule node record information includes an associated schedule node associated with the target schedule node, obtaining corresponding associated schedule data based on the associated schedule node; wherein the associated schedule data is generated later than the target schedule data;

[0102] S402: Generate a new associated schedule node based on the associated schedule data, with the new schedule node as the parent node.

[0103] You can refer to the above 1.3) to modify (edit) the relevant content of the task, and the new schedule node saves the modified target schedule data. The association relationship can be understood as a kinship relationship, and if the generation time of the associated schedule data is later than the generation time of the target schedule data, the associated schedule node is generally a descendant node of the target schedule node, such as a child node, a grandchild node, a great-grandchild node, etc. The current schedule node record information includes the associated schedule nodes that have an association relationship with the target schedule node. It can be understood that the current schedule node record information includes the descendant nodes of the target schedule node.

[0104] When the target schedule node has only one descendant node, that is, when there is only a child node, "obtaining corresponding associated schedule data based on the associated schedule node" and "generating a new associated schedule node with the new schedule node as the parent node based on the associated schedule data" can be regarded as copying the original child node to obtain a new child node, and the new child node is a child node with the new schedule node as the parent node.

[0105] When the target schedule node has at least two descendant nodes, that is, there is a descendant node chain (for example, a descendant node chain consisting of a child node-grandson node, a descendant node chain consisting of a child node-grandson node-great-grandson node, etc.), "obtaining corresponding associated schedule data based on the associated schedule node" and "generating a new associated schedule node with the new schedule node as the parent node based on the associated schedule data" can be regarded as copying the original descendant node chain to obtain a new descendant node chain, and the new descendant node chain serves as the descendant node chain of the new schedule node.

[0106] After modifying the target schedule data and using the new schedule node to save the modified target schedule data, compared to establishing an association relationship between the new schedule node and the original associated schedule node, a new associated schedule node with the new schedule node as the parent node is generated based on the associated schedule data, and the concept of branches is introduced to maintain the schedule data, enriching the maintenance level of schedule data at different stages.

[0107] The above provides specific responses to "rollback instructions", "modify instructions" and "restore instructions", and the mechanism for maintaining schedule data by introducing the concept of versioning ensures the efficiency and accuracy of the response.

[0108] In one exemplary implementation, version management of schedule data is integrated into each stage of schedule development as part of schedule management. The following describes how to integrate version management of schedule data into each stage of schedule development: first, a preset schedule plan and a preset directed graph structure are obtained; then, schedule configuration information is obtained based on the preset schedule plan; and finally, the schedule configuration information is mapped to the preset directed graph structure to generate a schedule graph, guiding schedule service objects to maintain schedule data based on the directed relationships in the schedule graph.

[0109] This provides an executable application example for embedding version management of schedule data in schedule management, ensuring the effectiveness and feasibility of giving schedule data version management functions to schedule management. After version management, schedule rollbacks and modifications can be convenient and quick. During e-sports competitions, there may be violations by players or the addition of players, and it is necessary to roll back to a certain schedule period to remove players, add players, or modify player scores, and then recalculate team scores. At the same time, when the event does not proceed to the next step, it is necessary to save the current event status, and wait until the end of the game to start executing from the moment of the saved event status, and then calculate subsequent games, rankings, scores, etc. Among them, the content of version management of schedule data can also be found in Figure 7 .

[0110] The preset schedule plan can be obtained through the system (schedule editing and management system) provided by the embodiment of the present application, such as by editing and setting the schedule through the editor provided by the system. The schedule plan obtained by the system can be presented in the form of a json sequence, which is deserialized to obtain the preset schedule plan presented in the form of a go object. The preset schedule plan may include multiple go objects, each go object corresponding to a schedule configuration information. Based on the preset schedule plan, the complete schedule configuration information can be obtained. Preset directed graph structure (corresponding to Figure 6 The "Schedule Service Execution Unit Diagram" in the figure can be understood based on the concept of a directed graph. That is, if a preset directed graph structure is assigned, then the execution of each node in the graph will be carried out according to the corresponding pointing relationship. Here, the schedule configuration information is mapped to the preset directed graph structure to generate the schedule graph, that is, multiple go objects are mapped to the preset directed graph structure to generate the schedule graph.

[0111] See also Figure 6 Taking "round" as the preset competition calculation unit as an example, the process of guiding the schedule service object to maintain the schedule data based on the pointing relationship in the schedule diagram includes: 3. Executing a certain component to start calculating scores and rankings and generate rounds; 4. Supporting modification / rollback during execution and performing version management on the modified data; 5. After saving, the next step is to wait for the results of the next round; 6. The next round, and then the cycle starts from step 3; 7. When all rounds are over, the entire schedule is completed and ends.

[0112] It can be seen from the technical solutions provided by the above embodiments of the present application that, in the embodiments of the present application, by determining the target schedule information and target tasks corresponding to the data processing instructions for the specified event object, and then determining the target schedule node that matches the target schedule information from the current schedule node record information, the target task is executed for the target schedule node. The schedule node record information used includes at least one schedule data saved based on the schedule node dimension, and the schedule data saved by each schedule node indicates the same version identifier. The schedule data is the game data based on the preset competition system calculation unit dimension, and the target schedule information is set based on the preset competition system calculation unit dimension. The present application introduces the concept of version to maintain the schedule data, ensures the efficiency and accuracy of data preservation, improves the effectiveness of management of such data, and improves the response capability to relevant data processing instructions. The embodiments of the present application solve the problem of inefficiency in schedule rollback, modification, and preservation from several angles, such as version management, interruption, and on-site recovery.

[0113] The embodiment of the present application also provides a data processing device for event objects, such as Figure 13 As shown, the data processing device 1300 for the event object includes:

[0114] Response module 1301: for responding to a data processing instruction for a specified event object and determining corresponding target schedule information and target tasks; wherein the target schedule information is set based on a preset competition system calculation unit dimension;

[0115] Determination module 1302: configured to determine a target schedule node that matches the target schedule information from current schedule node record information; wherein the schedule node record information includes at least one schedule data stored based on a schedule node dimension, the schedule data stored in each schedule node indicates the same version identifier, and the schedule data is match data based on the preset competition system calculation unit dimension;

[0116] Execution module 1303: used to execute the target task for the target schedule node.

[0117] It should be noted that the device and method embodiments in the device embodiment are based on the same inventive concept.

[0118] An embodiment of the present application provides an electronic device, which includes a processor and a memory, wherein the memory stores at least one instruction or at least one program, and the at least one instruction or the at least one program is loaded and executed by the processor to implement the data processing method for event objects provided in the above-mentioned method embodiment.

[0119] Furthermore, Figure 14 The hardware structure diagram of an electronic device for implementing the data processing method for event objects provided by the embodiment of the present application is shown. The electronic device may participate in or include the data processing device for event objects provided by the embodiment of the present application. Figure 14 As shown, the electronic device 100 may include one or more (illustrated as 1002a, 1002b, ..., 1002n in the figure) processors 1002 (the processor 1002 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA), a memory 1004 for storing data, and a transmission device 1006 for communication functions. In addition, it may also include: a display, an input / output interface (I / O interface), a universal serial bus (USB) port (which may be included as one of the ports of the I / O interface), a network interface, a power supply and / or a camera. It will be understood by those skilled in the art that Figure 14 The structure shown is only for illustration and does not limit the structure of the above electronic device. Figure 14 More or fewer components than shown, or with Figure 14 Different configurations shown.

[0120] It should be noted that the one or more processors 1002 and / or other data processing circuits described above may generally be referred to herein as "data processing circuitry". The data processing circuitry may be embodied in whole or in part as software, hardware, firmware, or any other combination thereof. In addition, the data processing circuitry may be a single independent processing module, or may be incorporated in whole or in part into any of the other components of the electronic device 100 (or mobile device). As described in the embodiments of the present application, the data processing circuitry serves as a processor control (e.g., selection of a variable resistor terminal path connected to an interface).

[0121] The memory 1004 can be used for storing software programs and modules of application software, such as the program instructions / data storage device corresponding to the data processing method for the event object described in the embodiment of the present application, the processor 1002 performs various functional applications and data processing by running the software programs and modules stored in the memory 104, i.e., realizes the above-mentioned data processing method for the event object. The memory 1004 can include a high-speed random access memory, and can also include a non-volatile memory, such as one or more magnetic storage devices, flash memory or other non-volatile solid-state memories. In some instances, the memory 1004 can further include a memory remotely arranged relative to the processor 1002, and these remote memories can be connected to the electronic device 100 via a network. The example of the above-mentioned network includes but is not limited to the Internet, corporate intranet, local area network, mobile communication network and a combination thereof.

[0122] The transmission device 1006 is used to receive or send data via a network. Specific examples of the aforementioned network may include a wireless network provided by the communication provider of the electronic device 100. In one embodiment, the transmission device 1006 includes a network interface controller (NIC), which can be connected to other network devices via a base station to enable communication with the Internet. In one embodiment, the transmission device 1006 may be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0123] The display may be, for example, a touch screen liquid crystal display (LCD) that enables a user to interact with a user interface of the electronic device 100 (or mobile device).

[0124] An embodiment of the present application also provides a computer-readable storage medium, which can be set in an electronic device to store at least one instruction or at least one program related to implementing a data processing method for event objects in a method embodiment. The at least one instruction or the at least one program is loaded and executed by the processor to implement the data processing method for event objects provided by the above-mentioned method embodiment.

[0125] Optionally, in this embodiment, the storage medium may be located in at least one of a plurality of network servers in a computer network. Optionally, in this embodiment, the storage medium may include, but is not limited to, various media capable of storing program code, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk, or an optical disk.

[0126] It should be noted that the order of the embodiments of the present application described above is for descriptive purposes only and does not represent the superiority or inferiority of the embodiments. The above description is of specific embodiments of the present application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps described in the claims can be performed in an order different from that in the embodiments and still achieve the desired results. In addition, the processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0127] The various embodiments in this application are described in a progressive manner. Similar parts between the various embodiments can be referred to in conjunction with each other. Each embodiment focuses on the differences between the other embodiments. In particular, the device and electronic device embodiments are generally similar to the method embodiments, so the description is relatively simple. For relevant parts, refer to the partial description of the method embodiments.

[0128] Those skilled in the art will understand that all or part of the steps to implement the above embodiments may be accomplished by hardware, or by a program to instruct the relevant hardware, and the program may be stored in a computer-readable storage medium, which may be a read-only memory, a disk, or an optical disk, etc.

[0129] The above description is only a preferred embodiment of the present application and is not intended to limit the present application. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application should be included in the scope of protection of the present application.

Claims

1. A data processing method for event objects, characterized in that: The method comprises: In response to a data processing instruction for a specified event object, target schedule information and target tasks are determined, wherein the target schedule information is set based on a preset competition system calculation unit dimension and is used to indicate the stage of the schedule data to be processed; Determining a target schedule node that matches the target schedule information from current schedule node record information, wherein the schedule node record information includes at least one schedule data stored based on a schedule node dimension, the schedule data stored in each schedule node indicates the same version identifier, and the schedule data is match data based on the preset competition system calculation unit dimension; Execute the target task for the target schedule node: when the target task is a modification task, obtain the target schedule data saved by the target schedule node, modify the target schedule data based on the modification task and create a branch with the new schedule node as the first node, the branch also includes a descendant node chain of the new schedule node, the descendant node chain of the new schedule node is obtained by copying the descendant node chain of the target schedule node, the parent node of the new schedule node is the target schedule node, and the new schedule node saves the modified target schedule data.

2. The method according to claim 1, characterized in that When the data processing instruction is a rollback instruction, determining the target schedule information includes: Determining the previous stage information indicating the preset competition system calculation unit, and using the previous stage information as the target competition schedule information; Alternatively, determine at least one historical stage information indicating the preset competition system calculation unit, generate first data to be displayed based on the at least one historical stage information and a first preset display rule to send to the user interaction interface, determine target historical stage information in response to a hit instruction for the first data to be displayed, and use the target historical stage information as the target schedule information.

3. The method according to claim 2, characterized in that The executing of the target task for the target schedule node further includes: When the target task is a viewing task, obtaining corresponding target schedule data based on the target schedule node, and generating second data to be displayed based on the target schedule data and a second preset display rule to send to the user interaction interface; When the target task is a parent node marking task, the target schedule node is marked as the parent node of the newly generated schedule node.

4. The method according to claim 1, wherein The method further comprises: Obtaining designated schedule data for the designated event object; Generate a corresponding designated schedule node based on the designated schedule data, wherein the designated schedule node further includes a version identifier indicating the designated schedule data; The designated schedule node is used to update the current schedule node record information.

5. The method according to claim 4, characterized in that The updating of the current schedule node record information using the designated schedule node includes: Generate a corresponding version tree based on the version identifier indicating the specified schedule data; Mounting the designated schedule node to the version tree; Create a storage object in the current schedule node record information, write the version tree into the current schedule node record information, and establish an association relationship between the storage object and the version tree to update the current schedule node record information.

6. The method according to claim 1, characterized in that The method further comprises: Obtain the preset schedule and the preset directed graph structure; Obtaining schedule configuration information based on the preset schedule plan; The schedule configuration information is mapped to the preset directed graph structure to generate a schedule graph, so as to guide the schedule service object to maintain the schedule data based on the pointing relationship in the schedule graph.

7. A data processing device for event objects, characterized in that: The device comprises: A response module, configured to determine target schedule information and target tasks in response to a data processing instruction for a specified event object, wherein the target schedule information is set based on a preset competition system calculation unit dimension and indicates the stage of the schedule data to be processed; a determination module, configured to determine a target schedule node that matches the target schedule information from current schedule node record information, wherein the schedule node record information includes at least one schedule data stored based on a schedule node dimension, the schedule data stored in each schedule node indicates a same version identifier, and the schedule data is match data based on the preset competition system calculation unit dimension; An execution module is used to execute the target task for the target schedule node: when the target task is a modification task, the target schedule data saved by the target schedule node is obtained, the target schedule data is modified based on the modification task and a branch with the new schedule node as the first node is created, the branch also includes a descendant node chain of the new schedule node, the descendant node chain of the new schedule node is obtained by copying the descendant node chain of the target schedule node, the parent node of the new schedule node is the target schedule node, and the new schedule node saves the modified target schedule data.

8. The device according to claim 7, characterized in that When the data processing instruction is a rollback instruction, determining the target schedule information includes: Determining the previous stage information indicating the preset competition system calculation unit, and using the previous stage information as the target competition schedule information; Alternatively, determine at least one historical stage information indicating the preset competition system calculation unit, generate first data to be displayed based on the at least one historical stage information and a first preset display rule to send to the user interaction interface, determine target historical stage information in response to a hit instruction for the first data to be displayed, and use the target historical stage information as the target schedule information.

9. The device according to claim 8, characterized in that The execution module is also used to obtain corresponding target schedule data based on the target schedule node when the target task is a viewing task, and generate second data to be displayed based on the target schedule data and a second preset display rule to send to the user interaction interface; when the target task is a parent node marking task, mark the target schedule node as the parent node of the newly generated schedule node.

10. The device according to claim 7, characterized in that The device also includes an update module; the update module is used to obtain designated schedule data for the designated event object; generate a corresponding designated schedule node based on the designated schedule data, and the designated schedule node also includes a version identifier indicating the designated schedule data; and use the designated schedule node to update the current schedule node record information.

11. The device according to claim 10, characterized in that The method of using the designated schedule node to update the current schedule node record information includes: generating a corresponding version tree based on the version identifier indicating the designated schedule data; mounting the designated schedule node to the version tree; creating a storage object in the current schedule node record information, writing the version tree into the current schedule node record information, and establishing an association between the storage object and the version tree to update the current schedule node record information.

12. The device according to claim 7, characterized in that The device further includes a schedule graph generation module; the schedule graph generation module is used to obtain a preset schedule plan and a preset directed graph structure; and obtain schedule configuration information based on the preset schedule plan; The schedule configuration information is mapped to the preset directed graph structure to generate a schedule graph, so as to guide the schedule service object to maintain the schedule data based on the pointing relationship in the schedule graph.

13. An electronic device, characterized in that: The electronic device includes a processor and a memory, wherein the memory stores at least one instruction or at least one program, and the at least one instruction or the at least one program is loaded and executed by the processor to implement the data processing method for event objects as described in any one of claims 1-6.

14. A computer-readable storage medium, characterized in that The storage medium stores at least one instruction or at least one program, and the at least one instruction or the at least one program is loaded and executed by the processor to implement the data processing method for the event object according to any one of claims 1 to 6.

15. A computer program product, characterized in that The computer program product includes at least one instruction or at least one program segment, and the at least one instruction or the at least one program segment is loaded and executed by a processor to implement the data processing method for event objects according to any one of claims 1 to 6.

Images