CN117992542A - Post-class business data processing method and device, electronic equipment and storage medium - Google Patents

Post-class business data processing method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN117992542A
CN117992542A CN202410133250.6A CN202410133250A CN117992542A CN 117992542 A CN117992542 A CN 117992542A CN 202410133250 A CN202410133250 A CN 202410133250A CN 117992542 A CN117992542 A CN 117992542A
Authority
CN
China
Prior art keywords
data
marketing
course
class
attendance
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202410133250.6A
Other languages
Chinese (zh)
Inventor
汪宗叶
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Jinzhigang Education Consulting Co ltd
Original Assignee
Guangzhou Jinzhigang Education Consulting Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangzhou Jinzhigang Education Consulting Co ltd filed Critical Guangzhou Jinzhigang Education Consulting Co ltd
Priority to CN202410133250.6A priority Critical patent/CN117992542A/en
Publication of CN117992542A publication Critical patent/CN117992542A/en
Pending legal-status Critical Current

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The embodiment of the application provides a method and a device for processing postclass business data, electronic equipment and a storage medium, and belongs to the technical field of data processing. The method comprises the following steps: synchronizing key data of the current school stage of the relation type database on-reading curriculum schedule to the non-relation type database on-reading curriculum schedule; acquiring attendance data; generating class marketing data according to the attendance data through a queue of the non-relational database, and storing the class marketing data to a class marketing list of the relational database through the queue of the non-relational database, wherein the class marketing data is used for verifying the class; changing the number of the classes and the number of the leave-free nodes of the key data in the reading curriculum schedule of the non-relational database according to the class selling data; and calculating the state of the student by the key data of the non-relational database in the course list reading. The embodiment of the application can lengthen the data processing time, improve the real-time property and consistency of the data and promote the user experience.

Description

Post-class business data processing method and device, electronic equipment and storage medium
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a method and an apparatus for processing post-class business data, an electronic device, and a storage medium.
Background
Due to the specificity of the post-class services, the service time of the post-class services is highly concentrated, wherein the most frequent business is an attendance business, and the attendance business is also associated with a marketing business. Therefore, the high concentration of service operation time causes that a system needs a large amount of computing resources to support the service in a period of time, and the system has a large delay in terms of real-time performance, which may cause that a user gets wrong data or cannot get real-time data, and the stability and accuracy of the system are affected.
Disclosure of Invention
The embodiment of the application mainly aims to provide a method and a device for processing post-class business data, electronic equipment and a storage medium, and aims to improve the real-time performance and consistency of data and user experience.
In order to achieve the above object, an aspect of an embodiment of the present application provides a post-class business data processing method, where the method includes:
Synchronizing key data of the current learning period of the relation type database in the reading course table to the non-relation type database in the reading course table, wherein the key data comprise the number of reported nodes of the course, the number of withdrawn nodes of the course, the number of classes and the number of false nodes required;
Acquiring attendance data;
Generating class marketing data according to the attendance data through a queue of a non-relational database, and storing the class marketing data to a class marketing list of the relational database through the queue of the non-relational database, wherein the class marketing data is used for verifying a class;
Changing the number of the classes and the number of the leave-free classes of the key data in the reading curriculum schedule of the non-relational database according to the class selling data;
and calculating the state of the student according to the key data of the non-relational database in the course reading process, wherein the state of the student comprises at least one of non-registering, registered, course setting, course marketing completion or arrearage.
In some embodiments, the method further comprises:
Synchronizing key data of the service system to a relation database on-reading curriculum schedule through a distributed publishing and subscribing message system;
Displaying the status of the students, the number of to-be-sold accounts and the number of owed accounts through a class detail page, wherein the number of to-be-sold accounts is determined through the number of reported accounts of the courses, the number of returned accounts of the courses, the number of on-lessons and the number of required false accounts, and the number of owed accounts is determined through the number of reported accounts of the courses, the number of returned accounts of the courses, the number of on-lessons and the number of required false accounts;
And displaying the reported number of the courses, the number of the on-lessons, the number of the to-be-sold, the number of the off-lessons and the number of the arrearages on the course detail page.
In some embodiments, the method further comprises:
Updating the relational database on-reading curriculum schedule;
the updating the relational database on-reading curriculum schedule comprises:
acquiring order data and student codes, wherein the order data comprises newly added order data and refund data;
counting the number of the reported courses and the number of the returned courses of each student in batches according to the order data and the student codes;
And updating the reported number of courses and the returned number of courses to a relational database in a course reading table.
In some embodiments, the attendance data includes check-in data and leave data, the leave data includes leave detail data and leave residual amount data, the generating the leave data according to the attendance data by a queue of the non-relational database includes:
Generating class marketing detail data according to the check-in data or the leave-out data through a queue of the non-relational database;
and acquiring historical class sales balance data, and generating current class sales balance data according to the class sales detail data and the historical class sales residual amount data through a queue of a non-relational database.
In some embodiments, the marketing data includes attendance creation time, student code, and class time code, and the storing the marketing data to a relational database class marketing textbook via a queue of the non-relational database includes:
checking whether the current course marketing data and the historical course marketing data of the relation database course marketing table are repeated or not through a unique index, wherein the unique index consists of attendance checking creation time, student codes and class time codes;
if the current course marketing data is not repeated with the historical course marketing data, the current course marketing data is stored in the relational database course marketing list;
And if the current marketing course data is repeated with the historical marketing course data, comparing the attendance creation time of the current marketing course data with the attendance creation time of the historical marketing course data, and if the attendance creation time of the current marketing course data is later than the attendance creation time of the historical marketing course data, updating the historical marketing course data through the current marketing course data.
In some embodiments, the attendance data comprises a school date, a school code, an attendance type, a class time code, and a marketing class code, and the marketing class data comprises a school date, a school code, a student code, an attendance type, a class time code, and a marketing class code, the method further comprising:
Storing the attendance data into a relational database attendance check-in table;
updating the relation database course marketing textbook;
the updating of the relational database course marketing textbook comprises the following steps:
acquiring first attendance data from the relational database attendance check-in table according to the school period and school code;
Acquiring first lesson marketing data from the relational database lesson marketing textbook according to the academic period, school code, student code and attendance code;
Comparing whether the first attendance data is consistent with the attendance type, the lesson taking time code and the lesson selling code of the first lesson selling data; if the first marketing course data are inconsistent, updating the first marketing course data;
Acquiring second lesson marketing data from the relation database lesson marketing textbook according to the learning period and school code;
Acquiring second attendance data from the relational database attendance check-in table according to the school period, school code and time range;
Comparing whether the learning period, student code, class and attendance code of the second marketing class data and the second attendance data are consistent; and if the second marketing class data are inconsistent, updating the second marketing class data.
In some embodiments, the key data further includes course codes, and the calculating, by the non-relational database, the status of the student when reading the key data of the curriculum schedule includes:
when the number of the reported courses is less than or equal to zero, determining that the current student status is not registered;
calculating the remaining lessons, wherein the calculation formula of the remaining lessons is as follows:
remaining lessons = number of lessons reported-number of lessons returned-number of lessons spent + number of dummy spent;
when the residual lessons are greater than zero, determining the current student status as the registered state;
When the residual lessons are smaller than zero, determining that the current student status is arrearage;
When the number of reported courses is greater than zero and the number of remaining courses is equal to zero, determining that the current student status is that the marketing course is completed;
And acquiring the course ending time according to the course codes, and determining the current student status as a course setting if the current time exceeds the course ending time.
To achieve the above object, another aspect of the embodiments of the present application provides a post-class business data processing device, including:
the synchronous module is used for synchronizing the key data of the current learning period of the relation type database in the course reading table to the non-relation type database in the course reading table, wherein the key data comprises the number of reported nodes of the course, the number of withdrawn nodes of the course, the number of classes and the number of required false nodes;
the attendance acquisition module is used for acquiring attendance data;
The class marketing module is used for generating class marketing data according to the attendance data through a queue of the non-relational database, storing the class marketing data to a class marketing list of the relational database through the queue of the non-relational database, and the class marketing data is used for verifying the class marketing;
the changing module is used for changing the number of the classes and the number of the leave-in nodes of the key data of the non-relational database in the course reading list according to the course marketing data;
And the calculating module is used for calculating the state of the student according to the key data of the non-relational database in the course reading table, wherein the state of the student comprises at least one of non-registered, lesson-forming, lesson-marketing completion or arrearage.
To achieve the above object, another aspect of the embodiments of the present application provides an electronic device, including a memory and a processor, where the memory stores a computer program, and the processor implements the method described above when executing the computer program.
To achieve the above object, a fourth aspect of the embodiments of the present application proposes a computer-readable storage medium storing a computer program which, when executed by a processor, implements the method described above.
The embodiment of the application at least comprises the following beneficial effects: the application provides a post-class business data processing method and device, electronic equipment and storage medium, wherein the scheme enables a non-relational database to reflect the latest and most accurate course conditions when the non-relational database reads a course table by synchronizing key data of the relational database in the current learning period of the course table to the non-relational database; acquiring attendance data; the class marketing data is generated according to the attendance data through the queue of the non-relational database, and is stored into the class marketing list of the relational database through the queue of the non-relational database, so that the data processing time can be prolonged, the verification of the classes is more automatic, the working efficiency is improved, and the possibility of human errors is reduced; the number of the classes and the number of the leave-free nodes of the key data in the curriculum reading schedule of the non-relational database are changed according to the class selling data, so that the real-time performance and the accuracy of the data are improved; the status of the student is calculated by the non-relational database through reading key data of the curriculum schedule, and the status of the student comprises at least one of non-registered, lesson-taking, lesson-selling completion or arrearage, so that the status of the student can be known to a user. The embodiment of the application can lengthen the data processing time, improve the real-time property and consistency of the data and promote the user experience.
Drawings
FIG. 1 is a flowchart of a post-class business data processing method provided by an embodiment of the present application;
FIG. 2 is another alternative flow chart of a post-class business data processing method provided by an embodiment of the present application;
FIG. 3 is a timing diagram for order payment according to an embodiment of the present application;
FIG. 4 is a flowchart of a relational database update on read curriculum provided by an embodiment of the application;
FIG. 5 is a flow chart of a relational database curriculum inventory update provided by an embodiment of the application;
Fig. 6 is a flowchart of step S103 in fig. 1;
fig. 7 is a schematic diagram of data storage of a post-class business data processing method according to an embodiment of the present application;
FIG. 8 is a diagram of a Redis on-reading curriculum synchronization flow provided by an embodiment of the application;
FIG. 9 is a schematic view of a class details page provided by an embodiment of the present application;
FIG. 10 is a diagram of a read lesson detail page provided by an embodiment of the present application;
Fig. 11 is a schematic structural diagram of a post-class business data processing device according to an embodiment of the present application;
Fig. 12 is a schematic hardware structure of an electronic device according to an embodiment of the present application.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with embodiments of the application, but are merely examples of apparatuses and methods consistent with aspects of embodiments of the application as detailed in the accompanying claims.
It is to be understood that the terms "first," "second," and the like, as used herein, may be used to describe various concepts, but are not limited by these terms unless otherwise specified. These terms are only used to distinguish one concept from another. For example, the first information may also be referred to as second information, and similarly, the second information may also be referred to as first information, without departing from the scope of embodiments of the present application. The words "if", as used herein, may be interpreted as "at … …" or "at … …" or "in response to a determination", depending on the context.
The terms "at least one", "a plurality", "each", "any" and the like as used herein, at least one includes one, two or more, a plurality includes two or more, each means each of the corresponding plurality, and any one means any of the plurality.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of the application only and is not intended to be limiting of the application.
Before describing embodiments of the present application in detail, some of the terms and expressions that are referred to in the embodiments of the present application will be described first, and the terms and expressions that are referred to in the embodiments of the present application are applicable to the following explanation.
1) The course marketing, i.e. course elimination and course marketing, is the process of recording the course of students in the aspect of institutions after the students participate in course study.
2) Kafka is a high throughput distributed publish-subscribe messaging system.
3) XXL-Job is an open-source distributed task scheduling platform for solving the scheduling needs of a large number of distributed tasks.
Since post-class services are typically concentrated over a fixed period of time, the demands of students and teachers during this period of time can reach a peak. The attendance service is one of basic services in post-class services, mainly relates to recording and management of attendance situations of students, and is important for determining the situation that the students take part in courses and corresponding teaching services. The attendance information also generally directly influences the performance of the sales class business, wherein the sales class business refers to the process of verifying and selling courses, and the attendance situation of students needs to be accurately recorded to ensure that the sales class business is free of errors.
During periods of high concentration of business hours, such as school hours, a large number of students and teachers may be simultaneously performing attendance operations, which may result in a background system having to process a large number of data requests in a short period of time, possibly causing strain on system resources. This resource shortage may lead to several problems:
(1) System response delay: the need for significant computing resources to process the attendance data over a period of time may slow the system response.
(2) The accuracy of data processing decreases: delays or errors may occur in the system when handling a large number of requests, resulting in inaccurate attendance data.
(3) The user experience is degraded: users (e.g., students, teachers) may experience system delays or inaccurate data when attempting to obtain real-time attendance information, affecting the user's satisfaction with the post-class service.
System stability problem: long high load operation may have an impact on system stability, increasing the risk of system crashes.
In view of this, in the embodiment of the application, a method and a device for processing post-class business data, an electronic device and a storage medium are provided, and the scheme synchronizes key data of a relational database in the current learning period of a reading curriculum schedule to a non-relational database in the reading curriculum schedule, so that the latest and most accurate curriculum conditions can be reflected by the non-relational database in the reading curriculum schedule; acquiring attendance data; the class marketing data is generated according to the attendance data through the queue of the non-relational database, and is stored into the class marketing list of the relational database through the queue of the non-relational database, so that the data processing time can be prolonged, the verification of the classes is more automatic, the working efficiency is improved, and the possibility of human errors is reduced; the number of the classes and the number of the leave-free nodes of the key data in the curriculum reading schedule of the non-relational database are changed according to the class selling data, so that the real-time performance and the accuracy of the data are improved; the status of the student is calculated by the non-relational database through reading key data of the curriculum schedule, and the status of the student comprises at least one of non-registered, lesson-taking, lesson-selling completion or arrearage, so that the status of the student can be known to a user. The embodiment of the application can lengthen the data processing time, improve the real-time property and consistency of the data and promote the user experience.
The embodiment of the application provides a post-class business data processing method, which relates to the technical field of data processing. The post-class business data processing method provided by the embodiment of the application can be applied to a terminal, a server and software running in the terminal or the server. In some embodiments, the terminal may be, but is not limited to, a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart speaker, a smart watch, a vehicle-mounted terminal, and the like; the server side can be configured as an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, and can be configured as a cloud server for providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDNs, basic cloud computing services such as big data and artificial intelligence platforms, and the server can also be a node server in a blockchain network; the software may be an application or the like that implements the post-class business data processing method, but is not limited to the above form.
The application is operational with numerous general purpose or special purpose computer system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like. The application may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
Fig. 1 is an optional flowchart of a post-class business data processing method provided by an embodiment of the present application, where the method in fig. 1 may include, but is not limited to, steps S101 to S106.
Step S101, synchronizing the key data of the current school stage of the relation type database in the reading course schedule to the non-relation type database in the reading course schedule.
Specifically, the reading curriculum schedule is data for expressing that a student registers a school curriculum in a specific learning period, and the main fields are student codes, curriculum IDs and learning period codes, the number of reported curriculum nodes, the number of returned curriculum nodes, the number of submitted curriculum nodes and the number of required false nodes. The key data comprises the number of reported knots of the course, the number of returned knots of the course, the number of knots on the course and the number of pseudo knots on the leave.
The application does not limit the relational database specifically, and can be flexibly selected in combination with the actual processing requirement. Illustratively, a MySQL database may be employed, as well as an Oracle database.
The application does not limit the non-relational database specifically, and can be flexibly selected in combination with the actual processing requirement. Illustratively, a Redis database, a Memcached database, and a MongoDB database may be employed.
In some embodiments, the key data further includes student code, course ID, school code, course number of courses.
It can be understood that the course can pay according to different node numbers for many times, and refund can also pay according to different node numbers for many times, and each time of order payment and refund needs asynchronous notification of the reported node number of the course and the refund node number of the course which are read from the relation database. The attendance of each time needs to be obtained by acquiring lesson marketing data, and the lesson number and the leave number of the non-relational database are modified when the lesson list is read.
Further, the relational database and the non-relational database need to synchronize and update data when reading the curriculum schedule, so the relational database and the non-relational database synchronize and update data when reading the curriculum schedule.
The application does not limit the update time of the relation type database in reading course table and the non-relation type database in reading course table, and can be flexibly selected in combination with the actual processing requirement. The update time may be a default update time of the system, or may be an update time set by the user.
Illustratively, the relational database is uniformly updated during the course of reading and the non-relational database is uniformly updated during the course of reading by the timing tasks of the data unification process in the early morning of each day.
In this embodiment, the key data of the current learning period of the curriculum reading schedule of the relational database is synchronized to the curriculum reading schedule of the non-relational database, so that the curriculum reading schedule of the non-relational database can reflect the latest and most accurate curriculum conditions.
Step S102, obtaining attendance data.
Specifically, the attendance data includes a type field including a check-in type or a leave type, and the attendance data may be classified into check-in data and leave data through the type field.
The method does not limit the acquisition of the attendance data specifically, and can be flexibly selected in combination with actual processing requirements. The attendance data may be obtained from a database, for example, or may be generated at roll-call time.
In some embodiments, the attendance data is generated at roll-call time, generated according to student check-in or leave-out, and written into a relational database check-in attendance table.
It will be appreciated that errors may occur in the attendance data, and therefore, the erroneous data in the attendance data may be revoked or deleted. Specifically, the written attendance data is modified to be in a deleting state, a queue deleting task is inserted into a course marketing processing queue, the number of the classes and the number of the leave-in nodes (sign-in minus one) and the number of the leave-out nodes (leave-leave minus one) in the Redis are changed in an increment mode, the latest class detail information is returned, and the class detail information is displayed through a class detail page.
In this embodiment, attendance data is obtained, and preparation is made for generating lecture data according to the attendance data later.
And step S103, generating class marketing data according to the attendance data through a queue of the non-relational database, and storing the class marketing data to a class marketing list of the relational database through the queue of the non-relational database.
The application does not limit the queue of the non-relational database, and can be flexibly selected in combination with the actual processing requirement. Illustratively, the queue of the non-relational database may be a redis queue or a MongoDB queue.
In some embodiments, after the attendance data is stored in the relational database and checked in to the attendance table, the ID will be put in the redis queue, the queue is read periodically, and the course sales data is generated and synchronized to the relational database course sales table. The generation of the lesson-marketing data is gradually completed by the delay of the Redis peak clipping queue. Illustratively, the generating task is put into a Redis peak clipping queue, and the timing task is established to continuously acquire data from the peak clipping queue for batch concurrency processing.
Specifically, there are three operations that generate a corresponding queue: 1. inserting a sign-in record; 2. inserting a leave-out record; 3. the check-in to leave records is withdrawn.
It can be understood that, the queue of the non-relational database is adopted to generate the class marketing data and synchronize to the class marketing table of the relational database, so that the consistency of the synchronous data needs to be ensured to be consistent mainly for prolonging the data processing time, and serious performance problems exist when the data to be processed are processed piece by piece due to a relatively large amount of data to be processed.
In some embodiments, the class list of the course of the relational database adopts a database design of a database division table, and peak clipping queues of a plurality of non-relational databases are adopted according to a rule of the database division table, so that the asynchronous processing speed is improved, and batch inquiry and batch storage operations are used as much as possible. The attendance information can be distributed to a plurality of peak clipping queues for batch processing according to the mode of student code modular picking during the school.
In some embodiments, the attendance data comprises check-in data and leave data, the offer data comprises offer detail data and offer balance data, and the offer detail data is generated from the check-in data or the leave data through a queue of the non-relational database; and acquiring historical class sales balance data, and generating current class sales balance data according to the class sales detail data and the historical class sales residual amount data through a queue of the non-relational database.
Specifically, each piece of check-in data or leave data generates a piece of course detail data. If the students have consumable course remaining amount, the course detail data are associated with a piece of course remaining amount data, and if the students do not have the course remaining amount data, the bill remaining amount data record the actual consumable course of an order (subtracting refund course) and are associated with a plurality of pieces of course detail data. Wherein, the total number of the marketing course detail strips subtracted from the expendable course is the marketing course balance. And when the class sales list is generated, a piece of class sales amount data with balance is searched according to the course and students according to the time sequence to be correlated and deducted.
Specifically, the peak clipping queue of the non-relational database is used for processing the writing relation type database course marketing textlist operation, which comprises the following steps:
1. Taking 100 attendance records from the peak clipping queue each time, and inquiring whether a course sales class list has a course sales record or not; if yes, executing batch updating logic, and if not, executing batch saving logic;
2. batch updating and batch saving are performed asynchronously;
3. Batch storage, namely checking whether the same batch of data belongs to data violating the unique index, judging through 'attendance creation time' + 'student code' + 'course ID', and only keeping the latest attendance;
the asynchronous execution needs to improve the data consistency, when the sales class data is inserted, the existing records are found, the time is compared, and if the attendance creation time is greater than the attendance time of the sales class records, the attendance time is updated; otherwise, skipping processing to avoid dirty data.
In the embodiment, the marketing class data is generated according to the attendance data through the queue of the non-relational database, and the marketing class data is stored in the marketing class list of the relational database through the queue of the non-relational database, so that the data processing time can be prolonged, the marketing of courses can be more automated, the consistency of the data is improved, the working efficiency is improved, and the possibility of human errors is reduced.
Step S104, changing the number of the classes and the number of the leave-free classes of the key data in the read curriculum schedule according to the class selling data.
Specifically, the lecture details include a type field including a check-in type or an ask type.
In some embodiments, the data of the non-relational database is calculated incrementally, i.e., the number of sections in check-in is increased by one, the number of sections in check-in is decreased by one, the number of sections in check-out is increased by one, and the number of sections in check-out is decreased by one. Incremental calculations may have some error in the abnormal situation, so there is a process of synchronizing the on-reading curriculum schedule of the non-relational database from the on-reading curriculum schedule of the relational database once per day.
In some embodiments, the number of spent lessons and spent dummy lessons of the critical data in the read curriculum schedule is changed from the non-relational database to the non-relational database according to the marketing data.
Specifically, the background inserts a queue creation task in the course marketing processing queue, and the incremental change non-relational database reads the number of already-class knots (check-in plus one) and the number of already-asking knots (ask plus one) in the course table.
In the embodiment, the number of the classes and the number of the leave-free classes of the key data in the reading curriculum schedule of the non-relational database are changed according to the class selling data, so that the real-time performance and the accuracy of the data are improved.
Step S105, calculating the status of the student by the key data of the non-relational database in the course list reading.
Specifically, the status of the student includes at least one of unrendered, signed, lesson-forming, lesson-marketing completed, or arrears.
Optionally, determining the current student through the student code, and obtaining the current student's course reported node number, course returned node number, class on node number and leave node number through the student code.
In some embodiments, when the number of lessons reported is less than or equal to zero, determining that the current student status is not registered; the remaining lessons are calculated, and the calculation formula of the remaining lessons is as follows:
remaining lessons = number of lessons reported-number of lessons returned-number of lessons spent + number of dummy spent;
When the residual lessons are greater than zero, determining the current student status as the registered state; when the residual lessons are smaller than zero, determining the current student status as arrearage; when the number of reported courses is greater than zero and the number of remaining courses is equal to zero, determining that the current student status is that the marketing course is completed; and acquiring the course ending time according to the course codes, and determining the current student status as the course setting if the current time exceeds the course ending time.
In the embodiment, the status of the student is calculated by the key data of the non-relational database in the course list reading process, so that the user can know the status of the student.
In the steps S101 to S105 shown in the embodiment of the application, key data of the current learning period of the curriculum reading schedule of the relational database is synchronized to the curriculum reading schedule of the non-relational database, so that the curriculum reading schedule of the non-relational database can reflect the latest and most accurate curriculum conditions; acquiring attendance data; the class marketing data is generated according to the attendance data through the queue of the non-relational database, and is stored into the class marketing list of the relational database through the queue of the non-relational database, so that the data processing time can be prolonged, the verification of the classes is more efficient and automatic, the working efficiency is improved, and the possibility of human errors is reduced; the number of the classes and the number of the leave-free nodes of the key data in the curriculum reading schedule of the non-relational database are changed according to the class selling data, so that the real-time performance and the accuracy of the data are improved; the status of the student is calculated by the non-relational database through reading key data of the curriculum schedule, and the status of the student comprises at least one of non-registered, lesson-taking, lesson-selling completion or arrearage, so that the status of the student can be known to a user. The embodiment of the application can lengthen the data processing time, improve the real-time property and consistency of the data and promote the user experience.
Fig. 2 is another optional flowchart of a post-class business data processing method provided by an embodiment of the present application, where the method in fig. 2 may include, but is not limited to, steps S201 to S207.
Step S201, synchronizing the key data of the business system to the relation database reading curriculum schedule through the distributed publishing and subscribing message system.
The application does not limit the service system specifically, and can be flexibly selected in combination with the actual processing requirement. Illustratively, the business system may include an order system, and the business system may also include a course merchandise system.
It can be understood that, because the conditions of registering, lesson taking and fee renewing of the lesson submitted by the students are reflected in real time, the conditions of registering, lesson taking, fee renewing and fee owing of the students can be calculated through the operations of the registering, lesson taking, fee renewing and fee owing of the students.
In step S201 of some embodiments, each order payment and refund requires asynchronous notification of the number of reported lessons, the number of withdrawn lessons, the number of lessons submitted, and the number of false lessons in reading the curriculum schedule from the modified relational database. As an example, the order payment timing chart is shown in fig. 3, it can be understood that the method of the present application can be applied to an attendance and lesson selling system, and when the user succeeds in placing an order in the order system, the attendance and lesson selling system updates the number of reported lessons in the relation database in reading the lesson table.
Specifically, the student ID, the course ID and the school period are used as unique identifications, the number of the reported courses, the number of the returned courses, the number of the required courses and the number of the required lessons are used as key field attributes to construct an on-reading curriculum schedule, and the data change of the business system can inform the on-reading curriculum schedule of synchronous change in a kafka message mode.
In some embodiments, the relation database updates the reported number of courses, the returned number of courses, the reported number of lessons and the false number of lessons according to the marketing data through the timing task of data unification processing in the early morning every day.
In the embodiment, key data of the service system are synchronized to the relation database on-reading curriculum schedule through the distributed publishing and subscribing message system, so that the instantaneity and the accuracy of the data are ensured.
Step S202, synchronizing the key data of the current school stage of the relation database in the reading course schedule to the non-relation database in the reading course schedule.
In step S202 of some embodiments, a daily timed task is created by the distributed task scheduling system, the current learning period is acquired, and key data of the current learning period of the relational database on the read curriculum schedule is synchronized to the non-relational database on the read curriculum schedule. The data of the current learning period are read every morning, and the data of other learning periods are lazy loaded when the data are used.
Illustratively, XXL-Job is used as a distributed task scheduling system, timing tasks in the early morning are newly built, the current learning period is acquired, and 1000 pieces of data of the on-reading curriculum schedule are acquired through each page of the learning period. Key student codes and course IDs are reequipped with four different key prefixes to store four values of the number of reported courses, the number of returned courses and the number of submitted courses and the number of false notes:
key1: schoolStudentCourse: orderQuantity: { course ID }: { student code };
value1 { number of lessons reported };
key2: schoolStudentCourse: refundQuantity: { course ID }: { student code };
value2 { number of sections that course has been returned };
key3: schoolStudentCourse: doneQuantity: { course ID }: { student code };
value3 { number of lessons already in class };
key4: schoolStudentCourse: leaveQuantity: { course ID }: { student code };
value4 { number of requested nodes }.
In the embodiment, key data of the current learning period of the relation type database in the reading course table is synchronized to the non-relation type database in the reading course table, so that the real-time performance and accuracy of the data are ensured, and the reading performance is optimized.
Step S203, attendance data is obtained, class sales data is generated according to the attendance data through a queue of the non-relational database, and the attendance data is stored in an attendance check-in table of the relational database.
And step S204, changing the number of the classes and the number of the leave-free classes of the key data of the non-relational database in the course reading table according to the class selling data, and calculating the status of the student through the key data of the non-relational database in the course reading table.
Step S205, displaying the status of students, the number of to-be-sold and the number of owed fees through a class detail page, and displaying the number of reported fees, the number of on-lessons, the number of to-be-sold, the number of returned fees and the number of owed fees through a course reading detail page.
In step S205 of some embodiments, display data returned to parents and teachers is calculated by reading fields of the curriculum schedule.
Specifically, the status, the waiting sale node number and the arrearage node number of the students are displayed through the class detail page, and the reported node number, the on-lesson node number, the waiting sale node number, the refund node number and the arrearage node number of the lessons are displayed through the course reading detail page.
In the embodiment, the status, the waiting sale count and the arrearage count of the students are displayed through the class detail page, and the reported count, the on-lesson count, the waiting sale count, the refund count and the arrearage count of the lessons are displayed through the course reading detail page, so that visual data display is provided, and the class and course condition can be checked by a user.
Step S206, updating the relational database to read the curriculum schedule.
Specifically, the order data includes newly added order data and refund data.
In step S206 of some embodiments, order data and student codes are obtained, and the number of reported lessons and the number of withdrawn lessons for each student are counted in batches based on the order data and the student codes, and updated to the relational database in the reading curriculum schedule.
In some embodiments, the marketing data is regenerated daily based on all the day attendance data recorded, thereby generating the number of lessons spent, the number of false spent, and updating the number of lessons spent in the read curriculum schedule of the Mysql database.
Specifically, using XXL-Job as a distributed task scheduling system, creating a timing task in early morning time, traversing a school for carrying out business in the current school period to generate a task queue with a school ID, acquiring a student ID according to the school ID and change of current order data (including order data and refund data), counting the number of reported courses and the number of returned courses of the students in batches, and updating the latest number of reported courses and the number of returned courses to Mysql on-reading course schedule. Illustratively, a flow chart of the relational database update at the time of reading the curriculum is shown in FIG. 4.
In this embodiment, the relation database is updated to read the curriculum schedule, so that the consistency and accuracy of the data are ensured.
Step S207, updating the course marketing textbook of the relational database.
In step S207 of some embodiments, first attendance data is obtained from a relational database attendance check-in table according to the school period and school code; acquiring first lesson marketing data from a relational database lesson marketing textbook according to the academic period, school code, student code and attendance code; comparing whether the attendance type, the class number code and the class order code of the first attendance data and the first class order data are consistent; if not, updating the first lesson marketing data. Further, second marketing data is obtained from a course marketing class table of the relational database according to the learning period and school codes; acquiring second attendance data from the relational database attendance check-in table according to the school period, school code and time range; comparing whether the learning period, student code, class and attendance code of the second marketing class data and the second attendance data are consistent; and if the first marketing course data are inconsistent, updating the second marketing course data.
Specifically, XXL-Job is used as a distributed task scheduling system, a timing task in early morning time is newly established, a school for carrying out business in the current school is traversed to generate a task queue with a school ID (i.e. school code), latest updated attendance data is obtained according to the current school and school ID paging, and lecture marketing data is obtained according to the school+school+student ID (i.e. student code) +attendance ID (i.e. attendance code); and comparing the attendance types and the class times ID (i.e. class times code) one by one, and judging whether the class IDs (i.e. class codes) are consistent. Further, the latest updated marketing course data is obtained according to the current school stage and school ID paging, and attendance data is obtained according to the school stage + school + time range; and comparing student IDs in the learning period, class times and attendance IDs one by one, and re-synchronizing the compared abnormal data through a correction queue. Illustratively, a relational database curriculum inventory update flow chart is shown in FIG. 5.
In the embodiment, the relation type database course marketing textbook is updated, so that the consistency and accuracy of the data are ensured.
Referring to fig. 6, in some embodiments, step S103 may include, but is not limited to, the steps of:
taking the module according to the student ID, and putting the attendance information into a queue;
specifically, the queue may employ a pin peak queue. Modulo means that the student ID is divided by another number and the remainder is taken.
Judging whether the attendance is deleted or withdrawn, if so, deleting the lesson sales records in batches; otherwise, saving the lesson marketing records in batches;
And storing the sales records in batches, judging whether the sales records exist, if not, inserting the sales records in batches, filtering the sales records with the unique index conflict, storing the sales records in batches, if so, judging whether the attendance time is longer than the sales time, and if so, updating the sales records in batches.
Wherein the batch update is performed asynchronously with the batch save.
In some embodiments, 100 attendance records are taken from the peak clipping queue, and whether there are lecture records is queried; if yes, the batch update logic is carried out, and if not, the batch save logic is carried out.
Specifically, batch storage is performed, whether the same batch of data violates a unique index is checked, and only the latest piece of attendance data is reserved according to the judgment of 'attendance creation time' + 'student ID' + 'class time ID'.
It should be noted that, when data consistency is required to be ensured in asynchronous execution and the sales class data is inserted, the existing records are found, the time is compared, the attendance creation time is greater than the attendance time of the sales class records, and the attendance time is updated; otherwise, skipping processing to avoid dirty data.
The scheme of the embodiment of the invention is described and illustrated in detail below by combining a specific attendance and lesson-selling scene:
referring to fig. 7, fig. 7 shows a schematic diagram of data storage of a post-class business data processing method according to an embodiment of the present application; the method comprises the following steps:
synchronizing key data of the business system to the MySQL on-reading curriculum schedule through Kafka;
Specifically, student ID, course ID and school period are used as unique identification, and the number of reported courses, the number of returned courses, the number of required courses and the number of required courses are used as key field attributes to construct a course reading table.
The number of the class-loaded nodes and the number of the false nodes of the MySQL in the read curriculum schedule are changed according to the statistical redundant field of the MySQL curriculum marketing curriculum schedule in the early morning every day;
The key data of the current school period of the MySQL on-reading curriculum schedule is synchronized to the Redis on-reading curriculum schedule through a timing task every morning;
illustratively, a Redis on reading a curriculum synchronization flow chart is shown in FIG. 8.
The data of the MySQL class detail student list is synchronized to the Redis on-reading class detail student list through a timing task in the morning every day;
Specifically, the data of the class detail student list includes class information including a class name, the number of students, a time of class, and the like, and student list information including a name of each student, a class attendance condition, a case of taking a reimbursement for a class, and the like.
Attendance roll calling is carried out by a teacher, attendance data are generated according to attendance leave conditions, the attendance data are stored in a MySQL attendance check-in table, and the attendance data increment calculation change Redis is carried out on a reading curriculum schedule;
Generating class marketing detail data according to check-in data or leave request data through a Redis asynchronous queue;
Acquiring historical class sales balance data, and generating current class sales balance data according to class sales detail data and historical class sales residual amount data through an asynchronous queue of Redis;
checking whether the current course marketing data and the historical course marketing data of the MySQL course marketing textlist are repeated or not through a unique index, wherein the unique index consists of attendance checking creation time, student codes and course codes;
if the current marketing data is not repeated with the historical marketing data, storing the current marketing data to a MySQL marketing list through a Redis asynchronous queue;
And if the current marketing data and the historical marketing data are repeated, comparing the attendance creation time of the current marketing data with the attendance creation time of the historical marketing data, and if the attendance creation time of the current marketing data is later than the attendance creation time of the historical marketing data, updating the historical marketing data according to the current marketing data through a Redis asynchronous queue.
Specifically, the marketing course data is used for certifying a marketing course, and the marketing course data includes marketing course detail data and marketing course balance data.
Changing the number of the class-on knots and the number of the leave knots of key data in the read curriculum schedule according to the class-selling data;
When the number of the reported sections of the course is smaller than or equal to zero, determining that the current state of the student is not registered;
the remaining lessons are calculated, and the calculation formula of the remaining lessons is as follows:
remaining lessons = number of lessons reported-number of lessons returned-number of lessons spent + number of dummy spent;
when the residual class is greater than zero, determining the current student status as the registered state;
when the residual lessons are smaller than zero, determining the current student status as arrearage;
when the number of reported courses is greater than zero and the number of remaining courses is equal to zero, determining that the current student status is that the marketing course is completed;
acquiring course ending time according to course codes, if the current time exceeds the course ending time, determining the current student status as course setting,
The status of the student includes at least one of unrendered, signed, lesson-forming, lesson-marketing completed, or arrears.
Displaying the status, the waiting sale node number and the arrearage node number of the students through the class detail page;
The class detail page is shown in fig. 9, and lists the class information about the teacher about to take class and the students, and the students list is used for displaying the account and arrearage of each student, so that the teacher can know the class selling condition of the students in real time while checking in the roll call, and the business requirement is met.
The number of the spending accounts is determined by the number of the reported accounts, the number of the returned accounts, the number of the classes and the number of the leave accounts, and the number of the defaulting accounts is determined by the number of the reported accounts, the number of the returned accounts, the number of the classes and the number of the leave accounts.
Displaying the reported number of courses, the number of courses on the basis of the details page of the read courses, the number of accounts to be sold, the number of the returned courses and the number of arrearages;
an exemplary, as-read lesson detail page diagram is shown in fig. 10.
Acquiring order data and student codes, wherein the order data comprises newly added order data and refund data;
Counting the number of reported courses and the number of returned courses of each student in batches according to the order data and the student codes;
Updating the number of the reported lessons and the number of the withdrawn lessons to MySQL in a course reading table;
Acquiring first attendance data from a MySQL attendance check-in table according to the school date and school code;
acquiring first class marketing data from a MySQL class marketing textbook according to the school date, school code, student code and attendance code;
comparing whether the attendance type, the class number code and the class order code of the first attendance data and the first class order data are consistent; if the first marketing course data are inconsistent, updating the first marketing course data;
Acquiring second marketing data from the MySQL course marketing textbook according to the school period and the school code;
Acquiring second attendance data from the MySQL attendance check-in table according to the school period, school code and time range;
comparing whether the learning period, student code, class and attendance code of the second marketing class data and the second attendance data are consistent; and if the first marketing course data are inconsistent, updating the second marketing course data.
Referring to fig. 11, the embodiment of the present application further provides a post-class business data processing device, which can implement the post-class business data processing method, where the device includes:
the synchronization module 1101 is configured to synchronize key data of a current learning period of the curriculum schedule read by the relational database to the curriculum schedule read by the non-relational database, where the key data includes a number of reported nodes, a number of returned nodes, a number of reported nodes, and a number of pseudo nodes;
an attendance acquisition module 1102, configured to acquire attendance data;
The course marketing module 1103 is configured to generate course marketing data according to the attendance data through a queue of the non-relational database, and store the course marketing data to a course marketing list of the relational database through the queue of the non-relational database, where the course marketing data is used for verifying courses;
A changing module 1104, configured to change the number of classes and the number of leave-free nodes of the key data in the read curriculum schedule according to the marketing data;
The calculating module 1105 is configured to calculate, by using the non-relational database, a status of the student when the key data of the curriculum schedule is read, where the status of the student includes at least one of unrendered, registered, lesson-forming, lesson-marketing completed, or arrears.
It can be understood that the content in the above method embodiment is applicable to the embodiment of the present device, and the specific functions implemented by the embodiment of the present device are the same as those of the embodiment of the above method, and the achieved beneficial effects are the same as those of the embodiment of the above method.
The embodiment of the application also provides electronic equipment, which comprises a memory and a processor, wherein the memory stores a computer program, and the processor realizes the post-class business data processing method when executing the computer program. The electronic equipment can be any intelligent terminal including a tablet personal computer, a vehicle-mounted computer and the like.
It can be understood that the content in the above method embodiment is applicable to the embodiment of the present apparatus, and the specific functions implemented by the embodiment of the present apparatus are the same as those of the embodiment of the above method, and the achieved beneficial effects are the same as those of the embodiment of the above method.
Referring to fig. 12, fig. 12 illustrates a hardware structure of an electronic device according to another embodiment, the electronic device includes:
The processor 1201 may be implemented by a general-purpose CPU (central processing unit), a microprocessor, an application-specific integrated circuit (ApplicationSpecificIntegratedCircuit, ASIC), or one or more integrated circuits, etc. for executing related programs to implement the technical solution provided by the embodiments of the present application;
Memory 1202 may be implemented in the form of read-only memory (ReadOnlyMemory, ROM), static storage, dynamic storage, or random access memory (RandomAccessMemory, RAM), among others. Memory 1202 may store an operating system and other application programs, and when the technical solutions provided in the embodiments of the present disclosure are implemented in software or firmware, relevant program codes are stored in memory 1202, and the processor 1201 invokes a post-class business data processing method for executing the embodiments of the present disclosure;
an input/output interface 1203 for implementing information input and output;
The communication interface 1204 is configured to implement communication interaction between the device and other devices, and may implement communication in a wired manner (e.g., USB, network cable, etc.), or may implement communication in a wireless manner (e.g., mobile network, WIFI, bluetooth, etc.);
A bus 1205 for transferring information between various components of the device such as the processor 1201, memory 1202, input/output interface 1203, and communication interface 1204;
Wherein the processor 1201, the memory 1202, the input/output interface 1203 and the communication interface 1204 enable communication connection between each other inside the device via a bus 1205.
The embodiment of the application also provides a computer readable storage medium, wherein the computer readable storage medium stores a computer program which realizes the post-class business data processing method when being executed by a processor.
It can be understood that the content of the above method embodiment is applicable to the present storage medium embodiment, and the functions of the present storage medium embodiment are the same as those of the above method embodiment, and the achieved beneficial effects are the same as those of the above method embodiment.
The memory, as a non-transitory computer readable storage medium, may be used to store non-transitory software programs as well as non-transitory computer executable programs. In addition, the memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory remotely located relative to the processor, the remote memory being connectable to the processor 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 method for processing post-class business data, the device for processing post-class business data, the electronic equipment and the storage medium provided by the embodiment of the application synchronize key data of the current learning period of the relation type database in the course reading table to the non-relation type database in the course reading table, so that the latest and most accurate course conditions can be reflected by the non-relation type database in the course reading table; acquiring attendance data; the class marketing data is generated according to the attendance data through the queue of the non-relational database, and is stored into the class marketing list of the relational database through the queue of the non-relational database, so that the data processing time can be prolonged, the verification of the classes is more automatic, the working efficiency is improved, and the possibility of human errors is reduced; the number of the classes and the number of the leave-free nodes of the key data in the curriculum reading schedule of the non-relational database are changed according to the class selling data, so that the real-time performance and the accuracy of the data are improved; the status of the student is calculated by the non-relational database through reading key data of the curriculum schedule, and the status of the student comprises at least one of non-registered, lesson-taking, lesson-selling completion or arrearage, so that the status of the student can be known to a user. The embodiment of the application can lengthen the data processing time, improve the real-time property and consistency of the data and promote the user experience.
The embodiments described in the embodiments of the present application are for more clearly describing the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application, and those skilled in the art can know that, with the evolution of technology and the appearance of new application scenarios, the technical solutions provided by the embodiments of the present application are equally applicable to similar technical problems.
It will be appreciated by persons skilled in the art that the embodiments of the application are not limited by the illustrations, and that more or fewer steps than those shown may be included, or certain steps may be combined, or different steps may be included.
The above described apparatus embodiments are merely illustrative, wherein the units illustrated as separate components may or may not be physically separate, i.e. may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
Those of ordinary skill in the art will appreciate that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof.
The terms "first," "second," "third," "fourth," and the like in the description of the application and in the above figures, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged under appropriate circumstances such that the embodiments of the application described herein may be practiced otherwise than as illustrated or described. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus 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.
It should be understood that in the present application, "at least one (item)" means one or more, and "a plurality" means two or more. "and/or" for describing the association relationship of the association object, the representation may have three relationships, for example, "a and/or B" may represent: only a, only B, and both a and B states, where a, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of" or the like means any combination of these items, including any combination of single item(s) or plural items(s). For example, at least one (one) of a, b or c may represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", wherein a, b, c may be single or plural.
In the several embodiments provided by the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the above-described division of units is merely a logical function division, and there may be another division manner in actual implementation, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described above as separate components may or may not be physically separate, and components shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a storage medium, including multiple instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method of the various embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory RAM), a magnetic disk, or an optical disk, or other various media capable of storing a program.
The preferred embodiments of the present application have been described above with reference to the accompanying drawings, and are not thereby limiting the scope of the claims of the embodiments of the present application. Any modifications, equivalent substitutions and improvements made by those skilled in the art without departing from the scope and spirit of the embodiments of the present application shall fall within the scope of the claims of the embodiments of the present application.

Claims (10)

1. A method for processing post-class business data, the method comprising:
Synchronizing key data of the current learning period of the relation type database in the reading course table to the non-relation type database in the reading course table, wherein the key data comprise the number of reported nodes of the course, the number of withdrawn nodes of the course, the number of classes and the number of false nodes required;
Acquiring attendance data;
Generating class marketing data according to the attendance data through a queue of a non-relational database, and storing the class marketing data to a class marketing list of the relational database through the queue of the non-relational database, wherein the class marketing data is used for verifying a class;
Changing the number of the classes and the number of the leave-free classes of the key data in the reading curriculum schedule of the non-relational database according to the class selling data;
and calculating the state of the student according to the key data of the non-relational database in the course reading process, wherein the state of the student comprises at least one of non-registering, registered, course setting, course marketing completion or arrearage.
2. The method according to claim 1, wherein the method further comprises:
Synchronizing key data of the service system to a relation database on-reading curriculum schedule through a distributed publishing and subscribing message system;
Displaying the status of the students, the number of to-be-sold accounts and the number of owed accounts through a class detail page, wherein the number of to-be-sold accounts is determined through the number of reported accounts of the courses, the number of returned accounts of the courses, the number of on-lessons and the number of required false accounts, and the number of owed accounts is determined through the number of reported accounts of the courses, the number of returned accounts of the courses, the number of on-lessons and the number of required false accounts;
And displaying the reported number of the courses, the number of the on-lessons, the number of the to-be-sold, the number of the off-lessons and the number of the arrearages on the course detail page.
3. The method according to claim 1, wherein the method further comprises:
Updating the relational database on-reading curriculum schedule;
the updating the relational database on-reading curriculum schedule comprises:
acquiring order data and student codes, wherein the order data comprises newly added order data and refund data;
counting the number of the reported courses and the number of the returned courses of each student in batches according to the order data and the student codes;
And updating the reported number of courses and the returned number of courses to a relational database in a course reading table.
4. The method of claim 1, wherein the attendance data comprises check-in data and leave data, the offer data comprises offer detail data and offer residual data, and the generating the offer data from the attendance data by the queue of the non-relational database comprises:
Generating class marketing detail data according to the check-in data or the leave-out data through a queue of the non-relational database;
and acquiring historical class sales balance data, and generating current class sales balance data according to the class sales detail data and the historical class sales residual amount data through a queue of a non-relational database.
5. The method of claim 1, wherein the marketing data comprises attendance creation time, student code, and class time code, wherein the saving the marketing data to a relational database class marketing textbook via the queue of the non-relational database comprises:
Checking whether the current course marketing data and the historical course marketing data of the relation database course marketing textlist are repeated or not through a unique index, wherein the unique index consists of attendance checking creation time, student codes and class time codes;
if the current course marketing data is not repeated with the historical course marketing data, the current course marketing data is stored in the relational database course marketing list;
And if the current marketing course data is repeated with the historical marketing course data, comparing the attendance creation time of the current marketing course data with the attendance creation time of the historical marketing course data, and if the attendance creation time of the current marketing course data is later than the attendance creation time of the historical marketing course data, updating the historical marketing course data through the current marketing course data.
6. The method of claim 1, wherein the attendance data comprises a school date, a school code, an attendance type, a class number code, and a marketing course code, and wherein the marketing course data comprises a school date, a school code, a student code, an attendance type, a class number code, and a marketing course code, the method further comprising:
Storing the attendance data into a relational database attendance check-in table;
updating the relation database course marketing textbook;
the updating of the relational database course marketing textbook comprises the following steps:
acquiring first attendance data from the relational database attendance check-in table according to the school period and school code;
Acquiring first lesson marketing data from the relational database lesson marketing textbook according to the academic period, school code, student code and attendance code;
Comparing whether the first attendance data is consistent with the attendance type, the lesson taking time code and the lesson selling code of the first lesson selling data; if the first marketing course data are inconsistent, updating the first marketing course data;
Acquiring second lesson marketing data from the relation database lesson marketing textbook according to the learning period and school code;
Acquiring second attendance data from the relational database attendance check-in table according to the school period, school code and time range;
Comparing whether the learning period, student code, class and attendance code of the second marketing class data and the second attendance data are consistent; and if the second marketing class data are inconsistent, updating the second marketing class data.
7. The method of any one of claims 1 to 6, wherein the key data further includes a course code, and wherein the calculating the status of the student from the key data of the non-relational database at the time of reading the curriculum schedule includes:
when the number of the reported courses is less than or equal to zero, determining that the current student status is not registered;
calculating the remaining lessons, wherein the calculation formula of the remaining lessons is as follows:
remaining lessons = number of lessons reported-number of lessons returned-number of lessons spent + number of dummy spent;
when the residual lessons are greater than zero, determining the current student status as the registered state;
When the residual lessons are smaller than zero, determining that the current student status is arrearage;
When the number of reported courses is greater than zero and the number of remaining courses is equal to zero, determining that the current student status is that the marketing course is completed;
And acquiring the course ending time according to the course codes, and determining the current student status as a course setting if the current time exceeds the course ending time.
8. A post-class business data processing device, the device comprising:
the synchronous module is used for synchronizing the key data of the current learning period of the relation type database in the course reading table to the non-relation type database in the course reading table, wherein the key data comprises the number of reported nodes of the course, the number of withdrawn nodes of the course, the number of classes and the number of required false nodes;
the attendance acquisition module is used for acquiring attendance data;
The class marketing module is used for generating class marketing data according to the attendance data through a queue of the non-relational database, storing the class marketing data to a class marketing list of the relational database through the queue of the non-relational database, and the class marketing data is used for verifying the class marketing;
the changing module is used for changing the number of the classes and the number of the leave-in nodes of the key data of the non-relational database in the course reading list according to the course marketing data;
And the calculating module is used for calculating the state of the student according to the key data of the non-relational database in the course reading table, wherein the state of the student comprises at least one of non-registered, lesson-forming, lesson-marketing completion or arrearage.
9. An electronic device comprising a memory storing a computer program and a processor implementing the method of any of claims 1 to 7 when the computer program is executed by the processor.
10. A computer readable storage medium storing a computer program, characterized in that the computer program, when executed by a processor, implements the method of any one of claims 1 to 7.
CN202410133250.6A 2024-01-30 2024-01-30 Post-class business data processing method and device, electronic equipment and storage medium Pending CN117992542A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202410133250.6A CN117992542A (en) 2024-01-30 2024-01-30 Post-class business data processing method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202410133250.6A CN117992542A (en) 2024-01-30 2024-01-30 Post-class business data processing method and device, electronic equipment and storage medium

Publications (1)

Publication Number Publication Date
CN117992542A true CN117992542A (en) 2024-05-07

Family

ID=90891357

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202410133250.6A Pending CN117992542A (en) 2024-01-30 2024-01-30 Post-class business data processing method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN117992542A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170270137A1 (en) * 2016-03-17 2017-09-21 Wipro Limited Method and system for synchronization of relational database management system to non-structured query language database
CN109872262A (en) * 2019-01-31 2019-06-11 山大鲁能信息科技有限公司 A kind of attendance system and method
CN110378665A (en) * 2019-06-13 2019-10-25 平安科技(深圳)有限公司 Data processing method, device, medium and electronic equipment under a kind of with no paper scene
CN111104464A (en) * 2019-12-31 2020-05-05 成都校精灵科技有限公司 Data synchronous modification method, data synchronous reading method, data synchronous modification system and readable storage medium
CN114003614A (en) * 2021-11-02 2022-02-01 广州市创乐信息技术有限公司 Data synchronization device, method, online transaction system, computer equipment and storage medium
US20230134092A1 (en) * 2021-11-03 2023-05-04 International Business Machines Corporation Database synchronization employing parallel poll threads
CN117093367A (en) * 2023-08-22 2023-11-21 广州今之港教育咨询有限公司 Service data processing method, device and storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170270137A1 (en) * 2016-03-17 2017-09-21 Wipro Limited Method and system for synchronization of relational database management system to non-structured query language database
CN109872262A (en) * 2019-01-31 2019-06-11 山大鲁能信息科技有限公司 A kind of attendance system and method
CN110378665A (en) * 2019-06-13 2019-10-25 平安科技(深圳)有限公司 Data processing method, device, medium and electronic equipment under a kind of with no paper scene
CN111104464A (en) * 2019-12-31 2020-05-05 成都校精灵科技有限公司 Data synchronous modification method, data synchronous reading method, data synchronous modification system and readable storage medium
CN114003614A (en) * 2021-11-02 2022-02-01 广州市创乐信息技术有限公司 Data synchronization device, method, online transaction system, computer equipment and storage medium
US20230134092A1 (en) * 2021-11-03 2023-05-04 International Business Machines Corporation Database synchronization employing parallel poll threads
CN117093367A (en) * 2023-08-22 2023-11-21 广州今之港教育咨询有限公司 Service data processing method, device and storage medium

Similar Documents

Publication Publication Date Title
US6360188B1 (en) Time-based modeling
US20140095619A1 (en) System for synchronizing nodes on a network
US8924848B2 (en) Synchronizing a user interface area
CN104994219B (en) A kind of data processing method and system
CN110134689B (en) Target group screening method and system based on main body object label change and computer equipment
CN111694837A (en) Shared data storage method and device based on service data block chain
CN111737646A (en) Advertisement promotion effect evaluation data processing method, system and storage medium
CN114048217A (en) Incremental data synchronization method and device, electronic equipment and storage medium
US8375038B2 (en) Method to send a short message service (SMS) campaign to a related object by selecting the base object
CN117992542A (en) Post-class business data processing method and device, electronic equipment and storage medium
CN104166650B (en) Data storage device and date storage method
CN108363773A (en) A kind of method and device of registering based on binary operation
CN110267717B (en) Method and device for automatically generating automatic scaling call rules according to different independent tenants in multi-tenant environment
CN108537577B (en) Data validity query method and device, storage medium and server
CN113377604B (en) Data processing method, device, equipment and storage medium
CN115983902A (en) Information pushing method and system based on user real-time event
CN110046172A (en) In line computation data processing method and system
CN112799951B (en) Method and equipment for generating automatic test case for charging system
CN104881455B (en) A kind of architectural difference processing method and system based on MYSQL
CN114841651A (en) Schedule reminding method and device, electronic equipment and storage medium
CN115271835A (en) Invoice generation method and device, electronic equipment and storage medium
CN113778784B (en) Method and device for determining number of users of target application, electronic equipment and storage medium
CN113627996B (en) Transaction resource amount prediction method and device, computer equipment and storage medium
CN114721739A (en) Multidimensional account grade updating method, device, equipment and medium
CN116028513A (en) Data change processing method and processing device, computer device, and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination