CN113934799A - Data processing method, device, equipment and medium for event object - Google Patents
Data processing method, device, equipment and medium for event object Download PDFInfo
- Publication number
- CN113934799A CN113934799A CN202111170650.7A CN202111170650A CN113934799A CN 113934799 A CN113934799 A CN 113934799A CN 202111170650 A CN202111170650 A CN 202111170650A CN 113934799 A CN113934799 A CN 113934799A
- Authority
- CN
- China
- Prior art keywords
- course
- node
- data
- target
- competition
- 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
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 20
- 238000012545 processing Methods 0.000 claims abstract description 62
- 238000000034 method Methods 0.000 claims abstract description 55
- 230000004044 response Effects 0.000 claims abstract description 17
- 230000004048 modification Effects 0.000 claims description 38
- 238000012986 modification Methods 0.000 claims description 38
- 230000008569 process Effects 0.000 claims description 24
- 238000003860 storage Methods 0.000 claims description 22
- 230000003993 interaction Effects 0.000 claims description 17
- 238000004364 calculation method Methods 0.000 claims description 13
- 238000004590 computer program Methods 0.000 claims description 4
- 238000013507 mapping Methods 0.000 claims description 2
- 238000007726 management method Methods 0.000 abstract description 21
- 238000013500 data storage Methods 0.000 abstract description 5
- 238000013473 artificial intelligence Methods 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 abstract description 2
- 238000011084 recovery Methods 0.000 description 13
- 238000010586 diagram Methods 0.000 description 11
- 238000004891 communication Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 4
- 238000012423 maintenance Methods 0.000 description 3
- 230000008030 elimination Effects 0.000 description 2
- 238000003379 elimination reaction Methods 0.000 description 2
- 230000014509 gene expression Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000000386 athletic effect Effects 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/283—Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a data processing method, a device, equipment and a medium for an event object. The method comprises the following steps: responding to a data processing instruction aiming at a specified event object, and determining corresponding target course information and a target task; determining a target course node matched with the target course information from the current course node record information; and executing the target task aiming at the target course node. The method and the device introduce the concept of the version to maintain the course data, ensure the efficiency and the accuracy of data storage, improve the management effectiveness of the data and improve the response capability aiming at the relevant data processing instruction. The embodiment of the application can be applied to various scenes such as cloud technology, artificial intelligence, intelligent traffic, auxiliary driving and the like.
Description
Technical Field
The present application relates to the field of internet communication technologies, and in particular, to a method, an apparatus, a device, and a medium for processing data of an event object.
Background
Sporting events often present a wide audience as an important life entertainment item. The sporting events may include traditional sporting events such as soccer, basketball, badminton, etc., and may also include electronic athletic events. In the sports event, the organization and implementation of competition among the competition objects are realized according to certain rules. In the related art, information (such as scores, match object information, and the like) related to a sports event is often managed by staff, such as manual calculation, modification, and storage. The dependence on a manual management mode can cause larger workload and lower working efficiency, and meanwhile, information errors are easy to occur due to writing errors, calculation errors and the like of workers. Accordingly, there is a need to provide a solution for the efficient management of information relating to sporting events.
Disclosure of Invention
In order to solve the problems of low efficiency, high error probability and the like when the prior art is applied to the management of information related to sports events, the application provides a data processing method, a device, equipment and a medium for event objects:
according to a first aspect of the present application, there is provided a data processing method for an event object, the method comprising:
responding to a data processing instruction aiming at a specified event object, and determining corresponding target course information and a target task; the target competition course information is set based on the dimension of a preset competition system calculation unit;
determining a target course node matched with the target course information from the current course node record information; the competition progress node record information comprises at least one piece of competition progress data stored based on the dimension of the competition progress node, the competition progress data stored in each competition progress node indicates the same version identification, and the competition progress data is competition data based on the dimension of the preset competition system computing unit;
and executing the target task aiming at the target course node.
According to a second aspect of the present application, there is provided a data processing apparatus for an event object, the apparatus comprising:
a response module: the data processing instructions are used for responding to the specified event objects, and corresponding target course information and target tasks are determined; the target competition course information is set based on the dimension of a preset competition system calculation unit;
a determination module: the target course node matched with the target course information is determined from the current course node record information; the competition progress node record information comprises at least one piece of competition progress data stored based on the dimension of the competition progress node, the competition progress data stored in each competition progress node indicates the same version identification, and the competition progress data is competition data based on the dimension of the preset competition system computing unit;
an execution module: the target competition progress node is used for executing the target task aiming at the target competition progress node.
According to a third aspect of the present application, there is provided an electronic device comprising a processor and a memory, wherein at least one instruction or at least one program is stored in the memory, and the at least one instruction or the at least one program is loaded by the processor and executed to implement the data processing method for an event object according to the first aspect.
According to a fourth aspect of the present application, there is provided a computer-readable storage medium having stored therein at least one instruction or at least one program, the at least one instruction or the at least one program being loaded and executed by a processor to implement the data processing method for an event object according to the first aspect.
According to a fifth aspect of the present application, there is provided a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer readable storage medium, and the processor executes the computer instructions to cause the computer device to perform the data processing method for the event object as described in the first aspect.
The data processing method, the device, the equipment and the medium for the event object have the following technical effects:
the target course information and the target tasks corresponding to the data processing instructions of the specified event objects are determined, and then the target course nodes matched with the target course information are determined from the current course node record information, so that the target tasks are executed aiming at the target course nodes. The used competition progress node record information comprises at least one piece of competition progress data stored based on the dimension of the competition progress node, the competition progress data stored by each competition progress node indicates the same version identification, the competition progress data is competition data based on the dimension of the preset competition system computing unit, and meanwhile, the target competition progress information is set based on the dimension of the preset competition system computing unit. The method and the device introduce the concept of the version to maintain the course data, ensure the efficiency and the accuracy of data storage, improve the management effectiveness of the data and improve the response capability aiming at the relevant data processing instruction.
Drawings
In order to more clearly illustrate the technical solutions and advantages of the embodiments of the present application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a schematic diagram of an application environment provided by an embodiment of the present application;
FIG. 2 is a schematic flowchart of a data processing method for an event object according to an embodiment of the present application;
fig. 3 is a schematic flow chart illustrating updating of information about a course node record according to an embodiment of the present application;
FIG. 4 is a flow chart illustrating a response recovery instruction provided by an embodiment of the present application;
FIG. 5 is a schematic diagram of an interface for triggering generation of a data processing instruction according to an embodiment of the present application;
FIG. 6 is a schematic view of a process flow of the course editing and managing system according to an embodiment of the present disclosure;
FIG. 7 is a schematic diagram of version management provided by an embodiment of the present application;
FIGS. 8 and 9 are schematic diagrams of data submission provided by embodiments of the present application;
fig. 10 is a schematic diagram illustrating a fallback function according to an embodiment of the present application;
FIG. 11 is a schematic diagram of a modified function introduction provided by an embodiment of the present application;
FIG. 12 is a schematic diagram illustrating a description of a resume function provided by an embodiment of the present application;
FIG. 13 is a block diagram illustrating an example of a data processing apparatus for processing an event object according to an embodiment of the present disclosure;
fig. 14 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. 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.
It should be noted that the terms "comprises" and "comprising," and any variations thereof, in the description and claims of this application and the above-described drawings, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or server that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Before further detailed description of the embodiments of the present application, terms and expressions referred to in the embodiments of the present application will be described, and the terms and expressions referred to in the embodiments of the present application will be used for the following explanation.
Event (sport): the series and the single match are collectively called a single event.
Stage (stage): the virtual directory is used for representing the preliminary match, the repeated match and the final match.
Round (round): a round of competition can decide which teams (teams) to advance.
Team (team): the smallest unit of play. For personal games, one team per person may also be abstracted.
Player (player): members of the team.
Group (group): team sets, such as winner group, loser group.
And (3) racing: refers to rules of competition, such as single elimination, double elimination, Swiss. The number of sessions required for different races is different.
Interrupting: the device can interrupt the events in the course of the events, and stores the event scores, the event states and the event matches of the current events when the interruption occurs.
And (3) recovering: after the interruption, the competition course is recovered from the interruption.
Version management: different stages of the appointed competition process can be recorded, so that the competition process is convenient to return to a certain stage of the competition process.
Referring to fig. 1, fig. 1 is a schematic diagram of an application environment provided by an embodiment of the present application, where the application environment may include a client 10 and a server 20, and the client 10 and the server 20 may be connected directly or indirectly through wired or wireless communication. The user may send data processing instructions for a specified event object to the server 20 via the client 10. The server 20 receives the instruction and determines the corresponding
And then determining a target course node matched with the target course information from the current course node record information, thereby executing the target task aiming at the target course node. It should be noted that fig. 1 is only an example.
The client may be an entity device of a type such as a smart phone, a computer (e.g., a desktop computer, a tablet computer, a laptop computer), an Augmented Reality (AR)/Virtual Reality (VR) device, a digital assistant, an intelligent voice interaction device (e.g., an intelligent sound box), an intelligent wearable device, an intelligent household appliance, a vehicle-mounted terminal, or may be software running in the entity device, such as a computer program. The operating system corresponding to the client may be an Android system (Android system), an iOS system (mobile operating system developed by apple inc.), a linux system (one operating system), a Microsoft Windows system (Microsoft Windows operating system), and the like.
The server side may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing basic cloud computing services such as a cloud service, a cloud database, cloud computing, a cloud function, cloud storage, a Network service, cloud communication, a middleware service, a domain name service, a security service, a CDN (Content Delivery Network), a big data and artificial intelligence platform, and the like. Which may include a network communication unit, a processor, and memory, among others. The server side can provide background services for the corresponding client side.
In practical applications, for the data processing instruction for the specific event object, the specific event object may indicate an electronic competition (may be referred to as a teleracing event), and the data processing instruction may be a rollback instruction, a modification instruction, and a recovery instruction. It can be understood that electronic competition is a sports item of electronic game competition reaching the 'competitive' level, and the electronic competition is a match of intelligence and physical strength between people by using electronic equipment as sports equipment.
In addition, the data processing scheme for the event object as provided by the embodiment of the present application, wherein the data can be saved on the block chain.
The following describes a specific embodiment of a data processing method for an event object according to the present application, and fig. 2 is a flowchart of a data processing method for an event object according to the present application, which provides the method operation steps described in the embodiment or the flowchart, but may include more or less operation steps based on conventional or non-inventive labor. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. In actual system or product execution, sequential execution or parallel execution (e.g., parallel processor or multi-threaded environment) may be possible according to the embodiments or methods shown in the figures. Specifically, as shown in fig. 2, the method may include:
s201: responding to a data processing instruction aiming at a specified event object, and determining corresponding target course information and a target task; the target competition course information is set based on the dimension of a preset competition system calculation unit;
in the embodiment of the application, for a received data processing instruction for a specified event object, a server determines target course information and a target task corresponding to the data processing instruction. The data processing instruction can be generated by a target object (such as a user, a simulator and the like) through triggering of a client, and then the data processing instruction is sent to the server side by the client. The server may maintain the course data corresponding to the related event object, and the specified event object is a specific event object, usually a specific event object, in the related event object. For example, the server maintains the course data corresponding to the event object a, the course data corresponding to the event object B, and the course data corresponding to the event object C, and specifies the event object as the event object a. The event object may indicate a traditional sporting event or may indicate a sporting event.
The data processing instruction is used for instructing the server to process the game course data maintained by the server. Taking the data processing instruction as a backspacing instruction as an example, the backspacing instruction may be used to instruct the server to output, mark or modify (edit) the course data of the history stage. Taking the data processing instruction as an example of a modification instruction, the modification instruction is used for instructing the server to modify (edit) the course data in the current stage or the historical stage. Taking the data processing instruction as an example of a recovery instruction, the recovery instruction is often after a backspace instruction indicating modification (editing) of the course data in the history stage, and the recovery instruction may be used to instruct the server to establish an association relationship between a response result (for the backspace instruction) and the original associated course data, that is, to determine the original associated course data based on the course data in the new history stage and establish an association relationship between the original associated course data and the new history stage. For example, the server maintains the course data of the event object a at different stages, and if the current stage is the 4 th round and the rollback instruction indicates to edit the course data of the 2 nd round, the recovery instruction is used to establish the association relationship between the edited course data of the 2 nd round and the original 3 rd to 4 th round course data.
The target course information and the target task are determined based on the data processing instructions. It will be appreciated that the target course information may be determined directly or indirectly based on parameters carried by the data processing instructions. The target task may be determined directly or indirectly based on parameters carried by the data processing instructions. In combination with the above descriptions of the "back instruction", the "modification instruction", and the "recovery instruction", the target course information is used to indicate the stage of the to-be-processed course data, and the target task is used to specify how to process the to-be-processed course data. In consideration of effective maintenance of the course data and the difference of the different event systems according to different events, the embodiment of the application utilizes the preset event system calculating unit to embody the meaning of the stage. If the preset competition system computing unit is 'round', the target competition course information can indicate 'third round'; if the preset competition system computing unit is 'field', the target competition course information can indicate 'fourth field'; if the preset competition system computing unit is 'half field', the target competition course information can indicate 'upper half field'; if the preset competition system calculation unit is the 'station', the target competition course information may indicate the 'second station'. Taking the data processing instruction as an example of a modification instruction, the target task determined based on the modification instruction is used for standardizing how to edit the course data to be processed, such as a specific edit item, and the original value a of the edit item needs to be replaced by B.
In an exemplary embodiment, when the data processing instruction is a rollback instruction, the determining the corresponding target course information includes the following two types of manners:
1) determining the specific historical stage of the course data to be processed, namely determining target course information, in a layer-by-layer backspacing mode;
generally, the course data of the history stage for which the rollback instruction is directed is the course data of the previous stage. The target course information may be determined by: and determining last-stage information indicating the preset competition system computing unit, and taking the last-stage information as the target competition course information. Taking "round" as the preset race system calculation unit as an example, if the current stage information indicates the fourth round, the previous stage information indicates the previous round, i.e. the third round.
Of course, if the course data of the third round does not meet the processing requirement, the third round can be continuously returned to the second round; if the course data of the second round still does not meet the processing requirement, the process can be continuously returned to the first round. The processing requirement can be a viewing requirement, a marking requirement or a modifying (editing) requirement, and the specific execution of the layer-by-layer rollback can be realized independently by a server side or realized by cooperation of a client side and the server side.
For the former, the rollback instruction carries processing requirement information. The server determines the last-stage information indicating the preset competition system computing unit and acquires corresponding competition course data (such as the third round of competition course data), judges whether the competition course data meet the processing requirement or not by using the processing requirement information, and if so, takes the last-stage information as the target competition course information; if the match result is not satisfied, determining to indicate the information of the previous stage of the preset match system computing unit and acquiring corresponding match process data (such as the match process data of the second round), judging whether the match process data satisfies the processing requirement by using the processing requirement information, if so, using the information of the previous stage as the target match process information, and if not, continuing to retreat as shown before. With reference to the subsequent step S202, it can be understood that when the server independently realizes the layer-by-layer rollback, the steps S201 and S202 cooperate to jointly complete the determination of the target course information.
For the latter, the server determines the last stage information indicating the preset competition system computing unit, and generates the to-be-displayed data 1 based on the last stage information and a third preset display rule (refer to the related description 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 a client, a user can check the data 1 to be displayed through the user interaction interface, and then an agreement instruction or a rejection instruction can be generated through triggering of the related interaction control. The client sends an agreement instruction or a rejection instruction generated by triggering of the user to the server, and the server takes the last-stage information as target course information in response to the agreement instruction aiming at the data 1 to be displayed. In response to the rejection instruction for the data to be displayed 1, the server does not take the previous stage information as the target course information, determines the next previous stage information indicating the preset competition system calculating unit, generates the data to be displayed 2 based on the next previous stage information and a third preset display rule, and sends the data to be displayed 2 to the user interaction interface, and so on.
2) Determining a specific history stage of the course data to be processed, namely determining target course information, by looking up the first data to be displayed (which can be taken as a history stage list) to select;
the specific process can be as follows: the method includes the steps of determining at least one piece of historical stage information indicating the preset competition system calculating unit, generating first data to be displayed to be sent to a user interaction interface based on the at least one piece of historical stage information and a first preset display rule (referring to a related record of a second preset display rule in step S203, which is described later), determining target historical stage information in response to a hit instruction for the first data to be displayed, and taking the target historical stage information as target competition process information.
Taking "round" as an example of the preset competition system calculation unit, if the current stage information indicates the fourth round, at least one piece of history stage information may indicate the previous three rounds, and accordingly, the first data to be displayed may be regarded as a round list. Compared with layer-by-layer backspacing in 1), the backspacing to an earlier turn can be conveniently realized through the turn list in 2), and the efficiency of backspacing to an earlier turn can be improved under the condition that more rounds of competitions are currently carried out.
The first data to be displayed can be displayed to the user through a user interaction interface provided by the client, the user can check the information of each historical stage serving as the candidate course information through the user interaction interface, and the user can hit a specific piece of historical stage information through triggering of the related interaction control, so that a hit instruction indicating the specific piece of historical stage information is generated. The client sends a hit instruction generated by triggering of a user to the server, and in response to the hit instruction for the first data to be displayed, the server takes specific historical stage information indicated by the hit instruction as target course information.
The two modes ensure the consideration of user habits and user interactive experiences when determining the target course information, and improve the fine grain degree of responding to the backspacing instruction triggered by the user.
In practical applications, referring to fig. 5, through a user interaction interface provided by a client, a user may trigger through a control indicating "rollback" to generate a rollback instruction; the user can generate a modification instruction through the triggering of the control indicating 'editing', so that the user can directly edit the current turn; the user can trigger through the control that instructs "next round" to generate the restoration instruction to through directly reading the match-course data of current round and processing in order to draw the battle and the rank of next round.
S202: determining a target course node matched with the target course information from the current course node record information; the competition progress node record information comprises at least one piece of competition progress data stored based on the dimension of the competition progress node, the competition progress data stored in each competition progress node indicates the same version identification, and the competition progress data is competition data based on the dimension of the preset competition system computing unit;
in the embodiment of the application, the server determines the target course node matched with the target course information from the current course node record information. The concept of the introduced version maintains the course data, which is specifically represented as: and creating a course node, and storing the competition data of the specific stage by using the course node, wherein the stored competition data of the specific stage is under one version. Taking "round" as the preset competition system calculating unit as an example, the competition course data stored by one competition course node is competition data of a certain round, and the competition data of the certain round is under one version. That is, if the second round of match data is modified, a new course node is used to store the modified second round of match data. The modified second round of match data indicates one version and the second round of match data before modification indicates another version. For the match data of a specific stage, it can be understood as the related data of a certain round of match, such as the score of the round of match, team information (such as addition, replacement, and deletion of station team member identification), and situation information (such as several matches performed in the round), etc.
The course node record information includes at least one course datum stored based on the course node dimension. Taking "round" as the preset competition system calculating unit as an example, if five rounds of competitions are currently performed, and two versions of competition data exist in the second round. There are six course nodes and correspondingly, there are six pieces of match data. The course node record information includes the six pieces of match data, and the six pieces of match data are stored based on the course node dimensions, that is, the six course nodes are used to store the corresponding match data respectively.
The updating of the course node record information may depend on the progress of the event to generate new course data or on the response of the data processing instruction. Therefore, when the target course node is confirmed, the current course node record information, that is, the latest course node record information, needs to be used. The target course information is used for indicating the stage of the to-be-processed course data, and the course node record information may contain different versions of the match data for the same stage, so that when the target course information is matched, the most recently created course node indicating the same stage is determined as the target course node, that is, the course node corresponding to the latest version of the match data for the same stage.
In an exemplary embodiment, as shown in fig. 3, the updating of the course node record information may include the following steps:
s301: acquiring designated course data aiming at the designated event object;
s302: generating corresponding appointed competition progress nodes based on the appointed competition progress data; wherein the designated course node further comprises a version identifier indicating the designated course data;
s303: and updating the current competition progress node record information by using the appointed competition progress node.
Taking "rounds" as the preset competition system calculating unit as an example, if five rounds of competitions are currently performed. A) The designated course data may be newly generated course data, such as the sixth round of game data. B) The designated course data may also be a modification result of the original course data, such as the modified second round of match data, and refer to "modification instruction" and "rollback instruction". C) The designated course data may also be original course data, such as "third round of match data" associated with the original second type of match data after the second round of match data is modified, which may refer to "resume instructions".
Correspondingly, a corresponding appointed course node is generated based on the appointed course data, and the appointed course data is stored by utilizing the appointed course node, so that the current course node record information is updated. Wherein the designated course node further comprises a version identifier indicating the designated course data. As for the case of which course node is the parent node when the designated course node is generated, the above-mentioned a), the course node of the match data of the fifth round (of the latest version) may be saved as the parent node; in the case of B) above, the course node of the second round of match data before modification may be saved as a parent node; in the case of C) above, the course node of the second round of match data before modification may be saved as the parent node.
The above example provides an application of how to save the course data based on the course node dimension saving of the course node record information, and provides a basis for effective management of the course data.
Further, the updating the current course node record information by using the designated course node may include the following steps: firstly, generating a corresponding version tree based on the version identification indicating the specified course data; then, mounting the appointed course node to the version tree; and then, creating a storage object in the current course node record information, writing the version tree into the current course node record information, and creating an association relationship between the storage object and the version tree to update the current course node record information.
Because the concept of the version is introduced when the course data is maintained, and the designated course node further includes the version identifier indicating the designated course data, a corresponding version tree (tree) can be generated based on the version identifier indicating the designated course data, and the designated course node is mounted to the version tree. Meanwhile, based on the implementation principle of git (a distributed version control system), a storage object (blob) can be created in the current course node record information, the version tree is written into the current course node record information, and the incidence relation between the storage object and the version tree is established to update the current course node record information. And maintaining the versions into a tree based on the git implementation principle so as to realize the version management of the course data. Therefore, the efficiency and the accuracy of data storage are ensured.
In practical applications, if "round" is used as the preset competition system computing unit, every time a round of competition is performed, all competition data at the current stage can be stored as a node (competition progress node) in a json format, and then the node is added to the corresponding version tree. Each node may include a unique id (unique identifier), a save time, remark information, json-formatted course data, a version identification, corresponding parent information. The information in the nodes can form a standard storage structure after being stored so as to be stored persistently. The game course data in the json format may include a plurality of data snapshots described in the json format, where each data snapshot corresponds to a certain time point of the current stage. The version identification may indicate a stage to which the course data corresponds.
New course data is generated every time a round of competition is carried out, and the new course data can be stored as one-time data submission. Referring to fig. 8, first commit: and mounting the node with id 2346b80 below the corresponding version tree, and establishing the association relationship between the version tree and the corresponding storage object (blob). It is understood that a node is an abstract concept, and the information held by the node is actually stored by the blob. The version tree can be used as a directory in the race course node record information and also maintains the information in the blob. Wherein the id can be generated by SHA-1. The blob may store information in txt format. Each data submission generates a node to be mounted on a corresponding version tree and point to a specific blob.
Referring to fig. 9, the second submission: and mounting the nodes with id of Ca3917 under the corresponding version tree, and simultaneously establishing the association relationship between the version tree and the corresponding storage object (blob). It should be noted that the course data related to the second submission is obtained by modifying the course data related to the first submission, and therefore, based on the implementation principle of git, the version tree related to the first submission also maintains the information in the blob related to the second submission.
S203: and executing the target task aiming at the target course node.
In the embodiment of the application, the server executes the target task aiming at the target course node. Because the target task is used for standardizing how to process the to-be-processed course data, and the to-be-processed course data is stored by the target course node, the target course node can be taken as a whole, and the target task is executed aiming at the whole; target course data stored by the target course node may also be obtained or determined, and the target task is executed according to the target course data.
In conjunction with the related descriptions of the "rollback instruction", "modification instruction", and "recovery instruction" in the foregoing step S201, the following will describe the contents of the execution target task:
1) "rollback instruction": the back-off instructions may be used to instruct the server to output, mark or modify (edit) the course data of the history phase.
1.1) when the backspacing instruction indicates the server end to output the course data of the history stage, the target task corresponding to the backspacing instruction can be a viewing task. Then, the process of executing the target task for the target course node may include the following steps: and acquiring corresponding target course data based on the target course node, and generating second data to be displayed based on the target course data and a second preset display rule to send the second data to the user interaction interface.
The target course data is stored in the target course node, and can be regarded as the related data which can more comprehensively reflect a certain stage of competition. The second preset display rule may be used as a specification of the interface display dimension, such as a specific font adopted by the display score; the second preset presentation rule may also be used as a specification of data processing dimensions, such as filtering out some data that are not required for presentation, presenting statistics of some data, and the like. The second data to be displayed can be displayed to the user through a user interaction interface provided by the client, and the user can view the competition related information of the stage indicated by the target competition progress node through the user interaction interface.
1.2) when the backspacing instruction indicates the server end to mark the competition course data in the history stage, the target task corresponding to the backspacing instruction can be a parent node marking task. Then, the process of executing the target task for the target course node may include the following steps: and marking the target course node as a father node of the newly generated course node.
The course data stored by the target course node can more comprehensively reflect the relevant data of a certain stage of competition. A) If the stored course data needs to be modified, the course data can be obtained for modification, and a newly generated course node is used for storing the modified course data, wherein the newly generated course node is a child node taking the target course node as a parent node. B) If the competition progress data stored by the associated competition progress node which originally takes the target competition progress node as the father node is wrong and the competition based on the stage indicated by the competition system associated competition progress node needs to be repeated, marking the target competition progress node as the father node of the newly generated competition progress node can guide the new competition data generated by the repeated competition to be stored by the new associated competition progress node, and the new associated competition progress node also takes the target competition progress node as the child node of the father node. It will be appreciated that the indicia herein is directed to how the course nodes that store such data should be created before the original course data is modified or before a new course data is generated for a re-match.
1.3) when the backspacing instruction instructs the server end to modify (edit) the course data in the history stage, the target task corresponding to the backspacing instruction can be a modification (editing) task. Then, the process of executing the target task for the target course node may include the following steps: firstly, acquiring corresponding target course data based on target course nodes; and then modifying the target course data based on the modification task to generate a new course node taking the target course node as a parent node.
This may correspond to the case of A) in 1.2) above. The target course data is stored by the target course node, the target course data is obtained and modified, and the modified target course data is stored by the new course node. It should be noted that the target course node still stores the target course data. Wherein the modification item indicated by the modification task comprises at least one of the following items: scores, team information, and combat situation information.
In practical application, through a user interaction interface provided by a client, a user can see all currently submitted records and versions and remark information. When the backspacing version is selected, the pointer points to the selected node, and the node stores the complete competition data of the corresponding stage. Referring to fig. 10, the newest node of the branch C1 holds the race data for the fourth round, illustrating that the four rounds of races have been currently performed. However, if the score of the second round of the race is found to be miscalculated, it is necessary to go back to the node that stores the second round of the race data, i.e., the C1-2 node. The data held by the C1-2 node is then modified, and finally a second branch C2 is taken, the C2-1 node including the modified second round of match data. Typically, the current version is the latest version (version), i.e., the version pointer points to the latest version, and the version pointer points to the C2-1 node.
2) "modify instruction": the modification instruction is used for instructing the server end to edit the course data of the current stage or the historical stage.
2.1) editing course data in the history stage: for this, the related content of the target course information determined under the "backspacing instruction" in step S201, and the related content of the modification (editing) task in step 1.3) may be referred to, and will not be described again.
2.2) editing the course data of the current stage: for this, refer to the related content of the aforementioned 1.3) modification (editing) task, which is not described in detail. Correspondingly, the determining the corresponding target course information may include the following steps: and determining current stage information indicating the preset competition system calculating unit, and taking the current stage information as the target competition progress information.
In practical application, when the course data stored in the node is modified after rollback, a new branch is generated. The first node of the new branch is the node generated based on the modification. Referring to fig. 11, the parent node of the node is the source node. This results in 2 branches, the old branch being before the rollback version and the new branch being after the rollback modification. After the modification, the match is renewed. The newest node of the C2 branch (C2-3 node) holds the fourth round of match data. Typically, the current version is the newest version, i.e., the version pointer will point to the newest version, when the version pointer points to the C2-3 node.
3) "resume instruction": the recovery instruction is often present after the backspacing instruction indicating the course data in the history stage is edited, and the recovery instruction may be used to instruct the server to establish an association relationship between the response result (for the backspacing instruction) and the original associated course data, that is, to determine the original associated course data based on the course data in the new history stage and establish an association relationship between the two. The target task to which the resume instruction corresponds may be a resume task.
In practical application, referring to fig. 12, after rollback and modification, the course data of the current version is read, the modified course data is calculated, and new team ranks, matches, scores, and the like are formed after calculation. In essence, each node is regarded as a complete unit, and each node stores the course data of the corresponding stage. Then only the node pointed by the version pointer needs to be read during recovery, and after the course data is read from the C2-2 node, the generation of the C3-1 node is executed. It should be noted that the C2-2 node stores the second round of match data, and the C3-1 node stores the third round of match data.
Further, as shown in fig. 4, after the modifying the target course data based on the modification task to generate a new course node with the target course node as a parent node, the method further includes:
s401: when the current course node record information comprises an associated course node having an association relation with the target course node, acquiring corresponding associated course data based on the associated course node; wherein the generation time of the associated course data is later than that of the target course data;
s402: and generating a new associated course node which takes the new course node as a father node based on the associated course data.
The related content of the task can be modified (edited) by referring to the above 1.3), and the new course node stores the modified target course data. The association relationship may be understood as an affinity relationship, and the generation time of the associated course data is later than that of the target course data, so that the associated course node is generally a descendant node of the target course node, such as a child node, a grandchild node, a great grandchild node, and the like. The current course node record information includes an associated course node having an association relationship with the target course node, and it can be understood that the current course node record information includes a descendant node of the target course node.
When the target course node has only one descendant node, that is, when only the child node exists, "acquire the corresponding associated course data based on the associated course node" and "generate a new associated course node using the new course node as a parent node based on the associated course data", may be regarded as copying the original child node to obtain a new child node, and the new child node is a child node using the new course node as a parent node.
When the target course node has at least two descendant nodes, that is, when a descendant node chain (for example, a descendant node chain consisting of a child node-a grandchild node-a great grandchild node, or the like) exists, "acquiring corresponding associated course data based on the associated course node" and "generating a new associated course node using the new course node as a parent node based on the associated course data", it may be regarded as copying an original descendant node chain to obtain a new descendant node chain, and the new descendant node chain is used as a descendant node chain of the new course node.
After the target course data is modified and the modified target course data is stored by the new course node, compared with the establishment of the incidence relation between the new course node and the original incidence course node, the new incidence course node which takes the new course node as the father node is generated based on the incidence course data, the concept of branches is introduced to maintain the course data, and the maintenance levels of the course data at different stages are enriched.
The specific responses of the backspacing instruction, the modification instruction and the recovery instruction are provided, and the race course data is maintained by matching with the concept of the introduced version, so that the response efficiency and accuracy are ensured.
In an exemplary embodiment, version management of the course data is included as part of the course management, which is embedded at each stage in the progress of the course. The following will describe how to integrate the version management of the course data into each stage of the course advancing; firstly, acquiring a preset competition schedule plan and a preset directed graph structure; then, obtaining match course configuration information based on the preset match course plan; and mapping the course configuration information to the preset directed graph structure to generate a course graph so as to guide the course service object to maintain the course data based on the pointing relationship in the course graph.
Therefore, an executable application example is provided for embedding the version management of the course data in the course management, and the effectiveness and the feasibility of the function of providing the version management of the course data for the course management are ensured. After version management is carried out, race course rollback and modification can be conveniently and rapidly carried out. In the process of the electric competition, players may break rules or increase players, and the player needs to go back to a certain competition period to remove the players or increase the players or modify the player scores and then recalculate the team scores. Meanwhile, under the condition that the event does not go to the next step, the current event state needs to be stored, and when the on-spot event is finished, the execution is started from the stored event state, and then the subsequent game, the ranking, the ratio and the like are calculated. See fig. 7 for the content of version management of the course data.
The preset course plan may be obtained through a system (course editing and managing system) provided in the embodiment of the present application, for example, through an editor provided in the system to edit and set the course. The course plan obtained through the system can be presented in a json sequence form, and the preset course plan presented in a go object form is obtained by performing deserialization processing on the course plan. The preset course plan may include a plurality of go objects, and each go object corresponds to a course configuration information. And obtaining complete course configuration information based on the preset course plan. The preset directed graph structure (corresponding to the "course service execution unit graph" in fig. 6) can be understood based on the concept of a directed graph, that is, if the preset directed graph structure is assigned, the execution of each node in the graph will be performed according to the corresponding directing relationship. Here, the course configuration information is mapped to the preset directed graph structure to generate the course graph, that is, the plurality of go objects are mapped to the preset directed graph structure to generate the course graph.
Referring to fig. 6, taking "wheel" as an example of the preset course calculation unit, the process of guiding the course service object to perform maintenance of the course data based on the directional relationship in the course graph includes: 3. executing a certain element to start to calculate scores and ranks and generating turns; 4. supporting modification/rollback in the execution process, and performing version management on modified data; 5. the result of the next turn is waited after being saved; 6. the next round, and then the cycle is started from the step 3; 7. and when all the rounds are finished, finishing the whole race course and finishing.
According to the technical scheme provided by the embodiment of the application, the target course information and the target task corresponding to the data processing instruction of the specified event object are determined, and then the target course node matched with the target course information is determined from the current course node record information, so that the target task is executed aiming at the target course node. The used competition progress node record information comprises at least one piece of competition progress data stored based on the dimension of the competition progress node, the competition progress data stored by each competition progress node indicates the same version identification, the competition progress data is competition data based on the dimension of the preset competition system computing unit, and meanwhile, the target competition progress information is set based on the dimension of the preset competition system computing unit. The method and the device introduce the concept of the version to maintain the course data, ensure the efficiency and the accuracy of data storage, improve the management effectiveness of the data and improve the response capability aiming at the relevant data processing instruction. The embodiment of the application solves the problem of inefficacy of course rollback, modification and storage from the aspects of version management, interruption, field recovery and the like.
An embodiment of the present application further provides a data processing apparatus for an event object, as shown in fig. 13, the data processing apparatus 1300 for an event object includes:
response module 1301: the data processing instructions are used for responding to the specified event objects, and corresponding target course information and target tasks are determined; the target competition course information is set based on the dimension of a preset competition system calculation unit;
the determination module 1302: the target course node matched with the target course information is determined from the current course node record information; the competition progress node record information comprises at least one piece of competition progress data stored based on the dimension of the competition progress node, the competition progress data stored in each competition progress node indicates the same version identification, and the competition progress data is competition data based on the dimension of the preset competition system computing unit;
the execution module 1303: the target competition progress node is used for executing the target task aiming at the target competition progress node.
It should be noted that the device and method embodiments in the device embodiment are based on the same inventive concept.
The embodiment of the present application provides an electronic device, which includes a processor and a memory, where at least one instruction or at least one program is stored in the memory, 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 an event object provided in the above method embodiment.
Further, fig. 14 is a schematic diagram of a hardware structure of an electronic device for implementing the data processing method for the event object provided by the embodiment of the present application, where the electronic device may participate in or constitute the data processing apparatus for the event object provided by the embodiment of the present application. As shown in fig. 14, the electronic device 100 may include one or more (shown as 1002a, 1002b, … …, 1002 n) processors 1002 (the processors 1002 may include, but are 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. Besides, the method can also comprise the following steps: 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 source, and/or a camera. It will be understood by those skilled in the art that the structure shown in fig. 14 is only an illustration and is not intended to limit the structure of the electronic device. For example, electronic device 100 may also include more or fewer components than shown in FIG. 14, or have a different configuration than shown in FIG. 14.
It should be noted that the one or more processors 1002 and/or other data processing circuitry described above may be referred to generally herein as "data processing circuitry". The data processing circuitry may be embodied in whole or in part in software, hardware, firmware, or any combination thereof. Further, the data processing circuitry may be a single, stand-alone processing module, or incorporated in whole or in part into any of the other elements in the electronic device 100 (or mobile device). As referred to in the embodiments of the application, the data processing circuit acts as a processor control (e.g. selection of a variable resistance termination path connected to the interface).
The memory 1004 may be used to store software programs and modules of application software, such as program instructions/data storage devices corresponding to the data processing method for the event object described in the embodiment of the present application, and the processor 1002 executes various functional applications and data processing by running the software programs and modules stored in the memory 104, so as to implement the above-mentioned data processing method for the event object. The memory 1004 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 1004 may further include memory located remotely from the processor 1002, which may be connected to the electronic device 100 through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission device 1006 is used for receiving or sending data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the electronic device 100. In one example, the transmission device 1006 includes a network adapter (NIC) that can be connected to other network devices through a base station so as to communicate with the internet. In one embodiment, the transmission device 1006 may be a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
The display may be, for example, a touch screen type Liquid Crystal Display (LCD) that may enable a user to interact with a user interface of the electronic device 100 (or mobile device).
Embodiments of the present application further provide a computer-readable storage medium, which may be disposed in an electronic device to store at least one instruction or at least one program for implementing a data processing method for an event object in the method embodiments, where 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 provided in the method embodiments.
Alternatively, in this embodiment, the storage medium may be located in at least one network server of a plurality of network servers of a computer network. Optionally, in this embodiment, the storage medium may include, but is not limited to: various media capable of storing program codes, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
It should be noted that: the sequence of the embodiments of the present application is only for description, and does not represent the advantages and disadvantages of the embodiments. And specific embodiments thereof have been described above. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The embodiments in the present application are described in a progressive manner, and the same and similar parts among the embodiments can be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the device and electronic apparatus embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and reference may be made to some descriptions of the method embodiments for relevant points.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the protection scope of the present application.
Claims (12)
1. A method of data processing for an event object, the method comprising:
responding to a data processing instruction aiming at a specified event object, and determining corresponding target course information and a target task; the target competition course information is set based on the dimension of a preset competition system calculation unit;
determining a target course node matched with the target course information from the current course node record information; the competition progress node record information comprises at least one piece of competition progress data stored based on the dimension of the competition progress node, the competition progress data stored in each competition progress node indicates the same version identification, and the competition progress data is competition data based on the dimension of the preset competition system computing unit;
and executing the target task aiming at the target course node.
2. The method according to claim 1, wherein when the data processing instruction is a rollback instruction, the determining the corresponding target course information comprises:
determining last-stage information indicating the preset competition system computing unit, and taking the last-stage information as the target competition progress information;
or determining at least one piece of historical stage information indicating the preset competition system computing unit, generating first to-be-displayed data based on the at least one piece of historical stage information and a first preset display rule to send the first to-be-displayed data to a user interaction interface, determining the target historical stage information in response to a hit instruction aiming at the first to-be-displayed data, and taking the target historical stage information as the target competition process information.
3. The method of claim 2, wherein the executing the target task for the target course node comprises:
when the target task is a checking task, acquiring corresponding target course data based on the target course node, and generating second data to be displayed based on the target course data and a second preset display rule to send the second data to the user interaction interface;
and when the target task is a father node marking task, marking the target course node as a father node of the newly generated course node.
4. The method of claim 1 or 2, wherein the executing the target task for the target course node comprises:
when the target task is a modification task, acquiring corresponding target course data based on the target course node;
modifying the target course data based on the modification task to generate a new course node with the target course node as a father node; wherein the modification item indicated by the modification task comprises at least one of: the new course node stores the modified target course data.
5. The method of claim 4, wherein after the modifying the target course data based on the modification task to generate a new course node having the target course node as a parent node, the method further comprises:
when the current course node record information comprises an associated course node having an association relation with the target course node, acquiring corresponding associated course data based on the associated course node; wherein the generation time of the associated course data is later than that of the target course data;
and generating a new associated course node which takes the new course node as a father node based on the associated course data.
6. The method of claim 1, further comprising:
acquiring designated course data aiming at the designated event object;
generating corresponding appointed competition progress nodes based on the appointed competition progress data; wherein the designated course node further comprises a version identifier indicating the designated course data;
and updating the current competition progress node record information by using the appointed competition progress node.
7. The method according to claim 6, wherein said updating the current course node record information with the designated course node comprises:
generating a corresponding version tree based on the version identification indicating the specified course data;
mounting the designated course node to the version tree;
and creating a storage object in the current course node record information, writing the version tree into the current course node record information, and creating an incidence relation between the storage object and the version tree to update the current course node record information.
8. The method of claim 1, further comprising:
acquiring a preset competition schedule plan and a preset directed graph structure;
obtaining competition course configuration information based on the preset competition course plan;
and mapping the course configuration information to the preset directed graph structure to generate a course graph so as to guide the course service object to maintain the course data based on the directional relation in the course graph.
9. A data processing apparatus for an event object, the apparatus comprising:
a response module: the data processing instructions are used for responding to the specified event objects, and corresponding target course information and target tasks are determined; the target competition course information is set based on the dimension of a preset competition system calculation unit;
a determination module: the target course node matched with the target course information is determined from the current course node record information; the competition progress node record information comprises at least one piece of competition progress data stored based on the dimension of the competition progress node, the competition progress data stored in each competition progress node indicates the same version identification, and the competition progress data is competition data based on the dimension of the preset competition system computing unit;
an execution module: the target competition progress node is used for executing the target task aiming at the target competition progress node.
10. An electronic device, comprising a processor and a memory, wherein at least one instruction or at least one program is stored in the memory, and the at least one instruction or the at least one program is loaded by the processor and executed to implement the data processing method for an event object according to any one of claims 1-8.
11. A computer-readable storage medium, in which at least one instruction or at least one program is stored, which is loaded and executed by a processor to implement the data processing method for an event object according to any one of claims 1 to 8.
12. A computer program product comprising at least one instruction or at least one program which is loaded and executed by a processor to implement a method of data processing for an event object according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111170650.7A CN113934799A (en) | 2021-10-08 | 2021-10-08 | Data processing method, device, equipment and medium for event object |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111170650.7A CN113934799A (en) | 2021-10-08 | 2021-10-08 | Data processing method, device, equipment and medium for event object |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113934799A true CN113934799A (en) | 2022-01-14 |
Family
ID=79278138
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111170650.7A Pending CN113934799A (en) | 2021-10-08 | 2021-10-08 | Data processing method, device, equipment and medium for event object |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113934799A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115225925A (en) * | 2022-06-16 | 2022-10-21 | 北京新奥特体育传媒有限公司 | Live caption broadcasting method, device and system |
-
2021
- 2021-10-08 CN CN202111170650.7A patent/CN113934799A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115225925A (en) * | 2022-06-16 | 2022-10-21 | 北京新奥特体育传媒有限公司 | Live caption broadcasting method, device and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3235549A1 (en) | Gameplay trigger detection | |
| CN112535865B (en) | Game content playback method, terminal, readable storage medium and electronic device | |
| CN111760295B (en) | Information processing method, information processing device, computer readable medium and electronic equipment | |
| US20140157246A1 (en) | Building cross-platform asynchronous games | |
| US9956488B2 (en) | System and method for video game skill level adjustment | |
| US20180204409A1 (en) | Automated hand strength estimation for card games | |
| CN114061047B (en) | Method and device for controlling air conditioner and air conditioner | |
| US9821230B2 (en) | Data-driven state machine for user interactive displays | |
| US11123639B2 (en) | Server-based mechanics help determination from aggregated user data | |
| CN118632731A (en) | Tracking and processing historical data of digital assets based on non-homogenous tokens | |
| CN113934799A (en) | Data processing method, device, equipment and medium for event object | |
| CN108144301B (en) | Virtual object information display method and device, storage medium and electronic device | |
| CN111054075B (en) | Virtual object control method and device and electronic equipment | |
| US20150065257A1 (en) | System and method for tiered individual player draft for fantasy sports | |
| US11210332B2 (en) | Mapped views of digital content | |
| JP6911258B2 (en) | Team management methods and systems with automatic recommendations for sports game player positions and trainers | |
| CN114489408B (en) | Animation processing system, method, device and storage medium | |
| KR20130089710A (en) | Item information updating method, item purchasing method, and item information updating server for on-line game | |
| CN117046111B (en) | Game skill processing method and related device | |
| CN113318449B (en) | Game element interaction numeralization method and system | |
| US11660543B2 (en) | Player profile management system | |
| CN116860379A (en) | Object grouping display method and device, electronic equipment and storage medium | |
| US20230121618A1 (en) | Reactions of failed attempts during points of gameplay | |
| CN116617665A (en) | Virtual character control method, device, electronic equipment and storage medium | |
| CN115475381A (en) | Data processing method, data processing apparatus, storage medium, and electronic apparatus |
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 |