CN111563197A - Data matching method, device, medium and electronic equipment - Google Patents

Data matching method, device, medium and electronic equipment Download PDF

Info

Publication number
CN111563197A
CN111563197A CN202010255012.4A CN202010255012A CN111563197A CN 111563197 A CN111563197 A CN 111563197A CN 202010255012 A CN202010255012 A CN 202010255012A CN 111563197 A CN111563197 A CN 111563197A
Authority
CN
China
Prior art keywords
matching
data
time
list
time length
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202010255012.4A
Other languages
Chinese (zh)
Other versions
CN111563197B (en
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.)
Beijing ByteDance Network Technology Co Ltd
Original Assignee
Beijing ByteDance Network Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing ByteDance Network Technology Co Ltd filed Critical Beijing ByteDance Network Technology Co Ltd
Priority to CN202010255012.4A priority Critical patent/CN111563197B/en
Publication of CN111563197A publication Critical patent/CN111563197A/en
Application granted granted Critical
Publication of CN111563197B publication Critical patent/CN111563197B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9535—Search customisation based on user profiles and personalisation
    • 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/24—Querying
    • G06F16/245—Query processing
    • G06F16/2457—Query processing with adaptation to user needs
    • G06F16/24578—Query processing with adaptation to user needs using ranking
    • 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/20—Education
    • G06Q50/205—Education administration or guidance
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Educational Technology (AREA)
  • Tourism & Hospitality (AREA)
  • General Engineering & Computer Science (AREA)
  • Educational Administration (AREA)
  • Data Mining & Analysis (AREA)
  • Strategic Management (AREA)
  • Health & Medical Sciences (AREA)
  • Computational Linguistics (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • General Business, Economics & Management (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The present disclosure provides a data matching method, apparatus, medium, and electronic device, wherein the data matching method includes: receiving request data, the request data including a start time; if the time length from the current time to the starting time meets the triggering condition, triggering data matching; wherein the data matching comprises: acquiring a matching condition and a matching object list; matching a target object from the matching object list according to the matching condition; and when the target object is successfully matched, sending matching information to the data request end and the data matching end. The method and the device can accurately and automatically match the request data of the user with the target object according to the preset conditions, can automatically generate the matching list, dynamically adjust the matching list, and feed the matching result back to the request user and the matching object, thereby realizing the intelligent matching of the request data and the matching object and improving the efficiency of data matching.

Description

Data matching method, device, medium and electronic equipment
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a data matching method, apparatus, medium, and electronic device.
Background
Various online courses exist on the website, and abundant online learning courses with different grades and different subjects can be provided for users, for example, a foreign language English learning course for students with different ages is provided. The user can browse the web pages and select the online courses which the user wants to learn by only registering the members on the online learning website.
In the prior art, an online learning website displays six-level vocabulary courses of all teachers in a preset time period on a website page according to a screening condition input by a user, for example, english learning content selected by the user is six-level vocabulary courses, and the selected time is the preset time period. The user selects six-level vocabulary courses meeting the requirements of the user within a preset time period by browsing detailed introduction of different courses, detailed information of teaching teachers and evaluation information of the students who have learned the courses in the past on the courses, and corresponding course arrangement information is given after the user determines the six-level vocabulary courses of the selected teachers.
The existing course screening and course arrangement information providing process is complicated, not intelligent, needs manual operation, consumes a large amount of selection time of a user, and the course selected by the user has randomness.
Disclosure of Invention
An object of the present disclosure is to provide a data matching method, apparatus, medium, and electronic device, which can solve at least one of the above-mentioned technical problems. The specific scheme is as follows:
according to a specific embodiment of the present disclosure, in a first aspect, the present disclosure provides a data matching method, including: receiving request data, the request data including a start time; if the time length from the current time to the starting time meets the triggering condition, triggering data matching; wherein the data matching comprises: acquiring a matching condition and a matching object list; matching a target object from the matching object list according to the matching condition; and when the target object is successfully matched, sending matching information to the data request end and the data matching end.
Optionally, the method further includes: acquiring a trigger moment; the triggering condition comprises triggering duration which is the duration between the triggering moment and the starting time; if the time length from the current time to the starting time meets the triggering condition, the method comprises the following steps: if the time length from the current time to the starting time is longer than the triggering time length, storing the request data into a waiting matching list; and if the time length from the current time to the starting time is less than or equal to the triggering time length, starting the data matching.
Optionally, the method further includes: acquiring a preset trigger time length; when the time length from the trigger moment to the starting time is longer than the preset trigger time length, the trigger time length is equal to the preset trigger time length; and when the time length of the trigger time from the starting time is less than or equal to the preset trigger time, the trigger time length is equal to the time length of the preset trigger time from the starting time.
Optionally, the method further includes: and for the request data in the waiting matching list, starting the data matching for the request data in the waiting matching list at the preset trigger moment.
Optionally, the method further includes: and when the target object fails to be matched, the request data enters a matching failure queue, and the data matching is started for the request data in the matching failure queue according to a preset time interval.
Optionally, the method further includes: and when the distance from the starting time to the target object is less than the preset time length, the target object still fails to be matched, and the data matching is stopped.
Optionally, the method further includes: and when the target object fails to be matched, the request data enters a matching failure queue, and matching failure alarm information is sent out.
Optionally, the matching object list includes a first matching object list, a second matching object list, and a third matching object list; the matching a target object from the matching object list according to the matching condition includes: according to the matching condition, firstly matching a target object from the first matching object list; matching a target object from the second matching object list after all matching objects in the first matching object list are completely matched; and when the matching objects in the first matching object list and/or the second matching object list are matched and not matched successfully after a certain time, moving the matching objects which are not matched successfully into the third matching object list.
According to a second aspect, the present disclosure provides a data matching apparatus, including: a receiving unit configured to receive request data, the request data including a start time; the trigger unit is used for triggering data matching if the time length from the current time to the starting time meets a trigger condition; wherein the data matching comprises: acquiring a matching condition and a matching object list; matching a target object from the matching object list according to the matching condition; and the sending unit is used for sending matching information to the data request end and the data matching end when the target object is successfully matched.
According to a third aspect, the present disclosure provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a data matching method as defined in any one of the above.
According to a fourth aspect thereof, the present disclosure provides an electronic device, comprising: one or more processors; a storage device to store one or more programs that, when executed by the one or more processors, cause the one or more processors to implement the data matching method as described in any one of the above.
Compared with the prior art, the scheme of the embodiment of the disclosure at least has the following beneficial effects: according to the data matching method, the device, the medium and the electronic equipment, not only can the request data of the user be accurately and automatically matched with the target object according to the preset conditions, but also the matching list can be automatically generated, dynamic adjustment is carried out on the matching list, the matching result can be fed back to the request user and the matching object, intelligent matching of the request data and the matching object is achieved, and the data matching efficiency is improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty. In the drawings:
fig. 1 illustrates an application scenario of a data matching method according to an embodiment of the present disclosure;
FIG. 2 illustrates a flow chart of an implementation method of a data matching method according to an embodiment of the present disclosure;
FIG. 3 shows a flow diagram of a data matching method according to an embodiment of the present disclosure;
FIG. 4 is a schematic diagram of a data matching apparatus according to an embodiment of the present disclosure;
fig. 5 shows an electronic device connection structure schematic according to an embodiment of the present disclosure.
Detailed Description
To make the objects, technical solutions and advantages of the present disclosure clearer, the present disclosure will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present disclosure, rather than all embodiments. All other embodiments, which can be derived by one of ordinary skill in the art from the embodiments disclosed herein without making any creative effort, shall fall within the scope of protection of the present disclosure.
The terminology used in the embodiments of the present disclosure is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used in the disclosed embodiments and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise, and "a plurality" typically includes at least two.
It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
It should be understood that although the terms first, second, third, etc. may be used in embodiments of the present disclosure to describe certain items, these certain items should not be limited to these terms. These terms are only used to distinguish one from another. For example, a first entity may also be referred to as a second entity, and similarly, a second entity may also be referred to as a first entity, without departing from the scope of embodiments of the present disclosure.
The words "if", as used herein, may be interpreted as "at … …" or "at … …" or "in response to a determination" or "in response to a detection", depending on the context. Similarly, the phrases "if determined" or "if detected (a stated condition or event)" may be interpreted as "when determined" or "in response to a determination" or "when detected (a stated condition or event)" or "in response to a detection (a stated condition or event)", depending on the context.
It is also noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that an article or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such article or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in the article or device in which the element is included.
Alternative embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.
As shown in fig. 1, an application scenario diagram of an embodiment of the present disclosure is shown, where a user operates a client, a web page, and the like installed on a terminal device through the terminal device such as a mobile phone, and performs data communication with a server through the internet while maintaining data communication with the server. The data matching method claimed in the present disclosure is illustrated as a specific application scenario, but the application scenario does not only limit the implementation. For example, after logging in an APP, a user submits personal information, selects a learning course, requests allocation of a teacher, and waits for a series of operations to start learning. The enterprise server receives the request information of the user, performs automatic and intelligent matching and monitoring by combining the target of the user request, and responds to the data request of the user under a series of conditions. It is anticipated that the application scenario is not limited to this only application scenario, and any scenario that can be applied to the present embodiment is included, such as a data matching process of shopping demand and shopping response, data interaction between enterprise request and service, and so on.
As shown in fig. 2, according to a specific embodiment of the present disclosure, the present disclosure provides a data matching method, including the following implementation steps, where the data matching method described in the following method steps is implemented by data communication between a computer server and a client, specifically as follows:
step S102: request data is received, the request data including a start time.
A user logs in a server port through a port such as an APP page, an H5 page and the like, logs in an account through an input port, and inputs request information, for example, as an implementation mode, lesson information is input, wherein the lesson information at least comprises at least one of corresponding lesson time information (for example, lessons begin in 3 months and 1 day), corresponding lesson grade information, corresponding lesson subject information, corresponding lesson selected teaching material version information and corresponding lesson place information; in addition, the input may be to screen at least one candidate teacher from the at least one candidate teacher for matching the class information.
The server performs matching by reading the current user course selection time data; wherein, the current user course selection time data at least comprises one of the following items: the data of the curriculum date selected by the current user, the data of the starting time of the curriculum selected by the current user, the data of the ending time of the curriculum selected by the current user and the data of the duration of the curriculum selected by the current user. In a specific application scene, the alternative teachers can be selected only from the teachers whose current user course selection time can be higher than the current user course selection time according to the read data of the current user course selection time, and therefore matching efficiency is improved.
Step S104: if the time length from the current time to the starting time meets the triggering condition, triggering data matching; wherein the data matching comprises: acquiring a matching condition and a matching object list; and matching the target object from the matching object list according to the matching condition.
In this step, the method comprises the following steps: acquiring a preset trigger time and a trigger time threshold; the triggering condition comprises a preset triggering time length which is the time length from a preset triggering moment to the starting time; calculating a trigger time length, wherein when the preset trigger time length is greater than a trigger set value, the trigger time length is equal to the trigger set value; and when the preset trigger time is less than or equal to the trigger set value, the trigger time is equal to the time between the preset trigger moment and the starting time.
Wherein the triggering time can be set by a system operator; the trigger duration threshold is the maximum duration for starting matching, and may be set by a system administrator. For example, if the system administrator empirically determines that the trigger data starting 28 days before the start time matches a reasonable trigger time, the trigger duration threshold may be set to 28 days; the operator can adjust the triggering time to be 20 days before the starting time according to the matching requirement; when the operator adjusts the trigger time to 35 days before the start time, the trigger time threshold is exceeded, which wastes system resources, so that the trigger time is still set to 28 days.
Specifically, for the convenience of understanding, a lesson-booking scenario is taken as an example for illustration, but the scenario should not be limited to the method implementation steps claimed in the present disclosure, and as shown in fig. 3, it is assumed that a lesson-booking system administrator sets a trigger duration threshold to be 28 days, that is, a trigger time is 28 days away from the beginning of a lesson. The server receives the number of trigger days X set by the operator. When X is more than 28 days, the teacher matching trigger time is 28 days; the lessons outside 28 days (for example, when X is 35, lessons from 35 th day to 28 th day) are saved for 28 days for batch matching, the specific time for matching can be selected from the idle time period of the system for matching, for example, 2-4 am, and the selection of the time period for matching does not affect the overall operation speed of the system and can improve the matching efficiency. When X is equal to or less than 28 days, for example, X is 26, the class attendance trigger time is 26 days. The system can judge each class time of each class contracted by each user, and trigger the classes of the time to match in batch.
If the time length from the current time to the starting time meets the triggering condition, the method comprises the following steps:
if the time length from the current time to the starting time is longer than the preset trigger time length, storing the request data into a waiting matching object list; and if the time length from the current time to the starting time is less than or equal to the preset trigger time length, starting the data matching.
Under different application scenarios, the content matching the trigger condition can be set. For example, in an online lesson-meeting application scenario, if the preset trigger duration corresponding to the matching trigger condition is configured to be 28 days, the matching trigger condition is configured to be: if the interval time from the current time of class is longer than the preset trigger time corresponding to the matching trigger condition for 28 days, the process of automatically matching teachers is not started, and only if the interval time is equal to or shorter than the preset trigger time for 28 days, the process of automatically matching teachers is started; therefore, the process of quickly matching teachers can be carried out, the resources of the teachers are saved, and the waste of matched resources caused by information change is avoided.
The above is merely an example, and the preset trigger duration corresponding to the matching trigger condition may be configured for different application scenarios, which is not described herein again.
In a further embodiment, the method further comprises the following implementation steps: and for the request data in the waiting matching object list, if the time length of the current time from the starting time is equal to the trigger time length, starting the data matching for the request data in the waiting matching object list at the trigger moment.
For example, in a specific application scenario, if a preset trigger duration corresponding to a matching trigger condition is configured to be 28 days, when a number of days X that a user login request matches is greater than 28, for example, X equals 40, information before the 28 th day is stored in a waiting queue, and the information is monitored in real time, and when the 28 th day is reached, a process of automatically matching teachers is started; therefore, the process of quickly matching teachers can be carried out, the resources of the teachers are saved, and the waste of matched resources caused by information change is avoided.
In step S104, the matching object list includes a first matching object list, a second matching object list, and a third matching object list.
The matching a target object from the matching object list according to the matching condition includes: according to the matching condition, firstly matching a target object from the first matching object list; matching a target object from the second matching object list after all matching objects in the first matching object list are completely matched; and when the matching objects in the first matching object list and/or the second matching object list are matched and not matched successfully after a certain time, moving the matching objects which are not matched successfully into the third matching object list.
As a specific embodiment, for convenience of understanding, a teacher matching scenario is taken as an example for description, but the scenario should not be limited to the method implementation steps claimed in the present disclosure. For example, all teachers can be divided, and each teacher is divided into three teacher lists to obtain three teacher lists, wherein the three teacher lists are a No. 1 white list teacher list, a No. 2 normal list teacher list and a No. 3 black list teacher list; the white list teacher list 1 is a teacher list with high teaching quality, for example, a super class teacher and a senior class teacher are divided into a white list teacher list 1, a normal teacher list 2 is a teacher list with a teacher with general teaching quality, and a black list 3 is a teacher list with poor teaching quality. And all teachers in the three teacher lists are subjected to grade division of data marks, machine data identification can be facilitated, and the division mode is not limited.
In order to improve the matching efficiency, the selection range of the candidate teacher is set within a preset range, for example, the selection range of the candidate teacher is set as follows: teachers in the No. 1 white list teacher list are preferentially matched, teachers in the No. 2 normal teacher list are used as supplements of the No. 1 white list teacher list, teachers in the No. 3 black list teacher list are not used as selection ranges of alternative teachers, however, teachers in the No. 1 and No. 2 lists are not successfully matched for a long time, the teachers can fall into the No. 3 black list, and teachers in the No. 3 black list can also enter the No. 2 or No. 1 teacher list through a retraining process. The lists of No. 1, No. 2 and No. 3 can be set to match accurate teachers for users to the maximum extent. The flow of teachers in each list can also promote the quality improvement of teachers in the lists, and the learning requirements of different users are met.
In practical application, if the pre-configured class teacher level is set as a special class teacher, the special class teacher is determined from at least one candidate teacher to be used as the class teacher. If a plurality of special teachers exist in the candidate teachers, responding to the touch instruction of the user, and selecting the special teachers which accord with the user preference degree as teaching teachers; one special class teacher can be randomly selected as a teaching teacher; in addition to the above-mentioned methods, a top-ranked super teacher may be selected from a plurality of candidate super teachers as a lecture teacher according to a result of the big data statistics, for example, ranking information of the super teacher counted by the big data. The above method for determining the teaching teacher is only an example, and other determination methods exist, and are not described herein again.
Optionally, the step of determining a class teacher matching a pre-configured class teacher level from the at least one candidate teacher includes the following steps:
step b1, in response to the touch instruction of the user, determining a class teaching teacher matched with a class of the pre-configured class teaching teacher from at least one candidate teacher; alternatively, the first and second electrodes may be,
and b2, randomly determining the class teacher matching with the class of the pre-configured class teacher from at least one candidate teacher.
Step S106: and when the target object is successfully matched, sending matching information to the data request end and the data matching end.
In this step, if the matching result is that the matching is successful, a course arrangement schedule including course arrangement information is automatically generated according to the corresponding teacher information of the teaching teacher and the pre-configured lesson information.
In this step, the course arrangement information in the course arrangement schedule at least includes one of the following items:
the teaching aid comprises teaching teacher information, user name information, user identification number information, teaching course content information, teaching course date information, teaching course duration information, teaching location information and teaching material information selected by teaching.
In this step, after the teaching teacher is determined, a course arrangement table including course arrangement information is automatically generated according to teacher information corresponding to the teaching teacher and pre-configured teaching information, for example, user name information, content information of the course, date information of the course, duration information of the course, and location information of the course. In practical applications, the course schedule may exist in an electronic form. The electronic version course scheduling table can be displayed on a terminal display screen of the current user client, and is convenient for a user to check. The current user can also print the electronic version of the course arrangement schedule.
Optionally, after automatically generating a course arrangement schedule including course arrangement information according to teacher information corresponding to the teaching teacher and pre-configured lesson information, the method further includes the following steps:
reading course arrangement information in a course arrangement schedule;
wherein, the course arrangement information at least comprises one of the following items (the following information is obtained after the user accepts the relevant privacy terms, and the relevant information is only used for the server matching data):
the teaching aid comprises teaching teacher information, user name information, user identification number information, teaching course content information, teaching course date information, teaching course duration information, teaching location information and teaching material information selected by teaching.
In this step, only the common course arrangement information is listed, and other customized course arrangement information may be added according to different requirements of the user, which is not described herein again.
In this step, the course arrangement lesson schedule also provides some course arrangement lesson schedule templates with different styles so as to be selected by users with different preference degrees, the course arrangement lesson schedule templates which accord with the preference degrees of the users are selected, and the course arrangement lesson schedules with different styles are automatically generated according to the course arrangement lesson schedule templates with different styles.
Optionally, the method further includes:
step S108: and when the target object fails to be matched, the request data enters a matching failure queue, and the data matching is started for the request data in the matching failure queue according to a preset time interval.
If the matching fails, entering a queue to be matched which fails, sorting according to the entering time, and entering the queue for preferential matching early; when a queue to be matched fails, automatically adding the queue of corresponding time, and triggering the matching of the queue of corresponding time; in practical application, for fairness, a first-come-first-obtained priority principle can be set; meanwhile, providing timing trigger, and gradually triggering the matching process once every 1 minute; in the case that the user does not set the timing trigger matching process, the automatic trigger matching process is performed according to a preset time interval, for example, the preset time interval is set to 1 minute, and the preset time interval may also be set to 2 minutes. Here, the duration of the preset time interval is not particularly limited.
Optionally, the method further includes: and when the target object fails to be matched, the request data enters a matching failure queue, and matching failure alarm information is sent out.
Optionally, the method further includes: and when the distance from the starting time to the target object is less than the preset time length, the target object still fails to be matched, and the data matching is stopped.
In an alternative embodiment, for example, in the case that the distance is less than 24 hours from the class time, matching needs to be performed according to a specific time interval, for example, the last matching process is performed with a delay of 30 seconds, and a matching result is obtained. And if the matching result shows that the matching fails, the matching is not continued, the teacher is displayed to cancel the course, and the course is cancelled according to the course cancelling flow.
When the matching is started, the operation is alarmed if the matching fails; the matched data is notified at intervals of 1 hour within 9:00-22:00 every day, and the specific content can be as follows: the number of successfully matched users and the number of failed matched users; and if the matching result is matching failure, providing a detailed matching failure list aiming at the failure matching result, wherein the matching failure list at least comprises the following contents (the following contents are obtained after the user agrees to accept the privacy provision, and do not distribute relevant information to the public): user name, user I D (Identity), course content, course date and specific time; in addition, in the case where the matching of teachers has not been successful within 24 hours from the class time or within 24 hours from the class time, and it is not the matching process of matching teachers for the last time, there is no need to provide a matching failure list of details.
According to the data matching method, the request data of the user and the target object can be accurately and automatically matched according to the preset conditions, the user requirement and the alternative target can be accurately matched under the limitation of a plurality of conditions, and a timely and accurate matching result is given. The matching list can be automatically generated, the matching list is dynamically adjusted, and the matching result can be fed back to the requesting user and the matching object, so that the intelligent matching of the requesting data and the matching object is realized, and the data matching efficiency is improved.
The embodiments of the present disclosure are carried out to implement the method steps described in the embodiments, and the explanation based on the same name and meaning is the same as the embodiments, and has the same technical effect as the embodiments, and is not repeated here. Referring to fig. 4, according to an embodiment of the present disclosure, the present disclosure provides a data matching apparatus, including: the receiving unit 402, the triggering unit 404, the sending unit 406, and the matching unit 408 are specifically as follows:
the receiving unit 402: request data is received, the request data including a start time.
The trigger unit 404: if the time length from the current time to the starting time meets the triggering condition, triggering data matching; wherein the data matching comprises: acquiring a matching condition and a matching object list; and matching the target object from the matching object list according to the matching condition.
The trigger unit 404 specifically includes: acquiring a trigger moment; the triggering condition comprises triggering duration which is the duration between the triggering moment and the starting time; if the time length from the current time to the starting time meets the triggering condition, the method comprises the following steps: if the time length from the current time to the starting time is longer than the triggering time length, storing the request data into a waiting matching list; and if the time length from the current time to the starting time is less than or equal to the triggering time length, starting the data matching.
The triggering unit 404 further includes: acquiring a preset trigger time length; when the time length from the trigger moment to the starting time is longer than the preset trigger time length, the trigger time length is equal to the preset trigger time length; and when the time length of the trigger time from the starting time is less than or equal to the preset trigger time, the trigger time length is equal to the time length of the preset trigger time from the starting time.
In further embodiments, further comprising: and for the request data in the waiting matching object list, if the time length of the current time from the starting time is equal to the trigger time length, starting the data matching for the request data in the waiting matching object list at the trigger moment.
The matching object list comprises a first matching object list, a second matching object list and a third matching object list;
the matching a target object from the matching object list according to the matching condition includes: according to the matching condition, firstly matching a target object from the first matching object list; matching a target object from the second matching object list after all matching objects in the first matching object list are completely matched; and when the matching objects in the first matching object list and/or the second matching object list are matched and not matched successfully after a certain time, moving the matching objects which are not matched successfully into the third matching object list.
The transmission unit 406: and when the target object is successfully matched, sending matching information to the data request end and the data matching end.
And if the matching result is that the matching is successful, automatically generating a course arrangement schedule comprising course arrangement information according to the corresponding teacher information of the teaching teacher and the preset course information.
Optionally, the method further includes:
the matching unit 408: and when the target object fails to be matched, the request data enters a matching failure queue, and the data matching is started for the request data in the matching failure queue according to a preset time interval.
Optionally, the method further includes: and when the target object fails to be matched, the request data enters a matching failure queue, and matching failure alarm information is sent out.
Optionally, the method further includes: and when the distance from the starting time to the target object is less than the preset time length, the target object still fails to be matched, and the data matching is stopped.
According to the data matching device, not only can automatic matching be accurately carried out on the request data of the user and the target object according to preset conditions, but also the matching list can be automatically generated, dynamic adjustment is carried out on the matching list, the matching result can be fed back to the request user and the matching object, intelligent matching of the request data and the matching object is achieved, and data matching efficiency is improved.
As shown in fig. 5, the present embodiment provides an electronic device, which is used in a data matching method, and the electronic device includes: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the one processor to cause the at least one processor to: the method and the system can accurately determine the teaching teacher from at least one alternative teacher, can automatically generate the course arrangement schedule comprising course arrangement information, and realize automatic course arrangement, thereby improving the course arrangement efficiency.
The disclosed embodiments provide a non-volatile computer storage medium having stored thereon computer-executable instructions that can perform the data matching method in any of the above method embodiments.
Referring now to FIG. 5, shown is a schematic diagram of an electronic device suitable for use in implementing embodiments of the present disclosure. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 5, the electronic device may include a processing means (e.g., central processing unit, graphics processor, etc.) 501 that may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage means 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data necessary for the operation of the electronic apparatus are also stored. The processing device 501, the ROM 502, and the RAM 503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
Generally, the following devices may be connected to the I/O interface 505: input devices 506 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 507 including, for example, a Liquid Crystal Display (LCD), speakers, vibrators, and the like; storage devices 508 including, for example, magnetic tape, hard disk, etc.; and a communication device 509. The communication means 509 may allow the electronic device to communicate with other devices wirelessly or by wire to exchange data. While fig. 5 illustrates an electronic device having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 509, or installed from the storage means 508, or installed from the ROM 502. The computer program performs the above-described functions defined in the methods of the embodiments of the present disclosure when executed by the processing device 501.
It should be noted that the computer readable medium in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: the method and the system can accurately determine the teaching teacher from at least one alternative teacher, can automatically generate the course arrangement schedule comprising course arrangement information, and realize automatic course arrangement, thereby improving the course arrangement efficiency.
Alternatively, the computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: the method and the system can accurately determine the teaching teacher from at least one alternative teacher, can automatically generate the course arrangement schedule comprising course arrangement information, and realize automatic course arrangement, thereby improving the course arrangement efficiency.
Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of an element does not in some cases constitute a limitation on the element itself.

Claims (11)

1. A method of data matching, comprising:
receiving request data, the request data including a start time;
if the time length from the current time to the starting time meets the triggering condition, triggering data matching; wherein the data matching comprises: acquiring a matching condition and a matching object list; matching a target object from the matching object list according to the matching condition;
and when the target object is successfully matched, sending matching information to the data request end and the data matching end.
2. The method of claim 1, further comprising:
acquiring a trigger moment;
the triggering condition comprises triggering duration which is the duration between the triggering moment and the starting time;
if the time length from the current time to the starting time meets the triggering condition, the method comprises the following steps:
if the time length from the current time to the starting time is longer than the triggering time length, storing the request data into a waiting matching list;
and if the time length from the current time to the starting time is less than or equal to the triggering time length, starting the data matching.
3. The method of claim 2, further comprising:
acquiring a preset trigger time length;
when the time length from the trigger moment to the starting time is longer than the preset trigger time length, the trigger time length is equal to the preset trigger time length; and when the time length of the trigger time from the starting time is less than or equal to the preset trigger time, the trigger time length is equal to the time length of the preset trigger time from the starting time.
4. A method according to claim 2 or 3, characterized in that the method further comprises:
and for the request data in the waiting matching list, starting the data matching for the request data in the waiting matching list at the preset trigger moment.
5. The method according to any one of claims 1-3, further comprising:
and when the target object fails to be matched, the request data enters a matching failure list, and the data matching is started for the request data in the matching failure list according to a preset time interval.
6. The method of claim 5, further comprising:
and when the distance from the starting time to the target object is less than the preset time length, the target object still fails to be matched, and the data matching is stopped.
7. The method of claim 1, further comprising:
and when the target object fails to be matched, the request data enters a matching failure list, and matching failure alarm information is sent out.
8. The method of claim 1, wherein the list of matching objects comprises a first list of matching objects, a second list of matching objects, and a third list of matching objects;
the matching a target object from the matching object list according to the matching condition includes:
according to the matching condition, firstly matching a target object from the first matching object list;
matching a target object from the second matching object list after all matching objects in the first matching object list are completely matched;
and when the matching objects in the first matching object list and/or the second matching object list are matched successfully after preset time, moving the matched objects which are not matched successfully into the third matching object list.
9. A data matching apparatus, comprising:
a receiving unit configured to receive request data, the request data including a start time;
the trigger unit is used for triggering data matching if the time length from the current time to the starting time meets a trigger condition; wherein the data matching comprises: acquiring a matching condition and a matching object list; matching a target object from the matching object list according to the matching condition;
and the sending unit is used for sending matching information to the data request end and the data matching end when the target object is successfully matched.
10. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, carries out the method according to any one of claims 1 to 8.
11. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to carry out the method of any one of claims 1 to 8.
CN202010255012.4A 2020-04-02 2020-04-02 Data matching method, device, medium and electronic equipment Active CN111563197B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010255012.4A CN111563197B (en) 2020-04-02 2020-04-02 Data matching method, device, medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010255012.4A CN111563197B (en) 2020-04-02 2020-04-02 Data matching method, device, medium and electronic equipment

Publications (2)

Publication Number Publication Date
CN111563197A true CN111563197A (en) 2020-08-21
CN111563197B CN111563197B (en) 2023-05-16

Family

ID=72071392

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010255012.4A Active CN111563197B (en) 2020-04-02 2020-04-02 Data matching method, device, medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN111563197B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105512739A (en) * 2015-12-25 2016-04-20 北京奇虎科技有限公司 Method and system for online ticket booking
US20170053338A1 (en) * 2015-08-21 2017-02-23 International Business Machines Corporation Enabling transactional ability for objects referred to in digital content
CN107766395A (en) * 2017-03-03 2018-03-06 平安医疗健康管理股份有限公司 Data matching method and device
CN108921034A (en) * 2018-06-05 2018-11-30 北京市商汤科技开发有限公司 Face matching process and device, storage medium
CN110503220A (en) * 2019-06-20 2019-11-26 北京大米科技有限公司 Cource arrangement method, device, electronic equipment and storage medium

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170053338A1 (en) * 2015-08-21 2017-02-23 International Business Machines Corporation Enabling transactional ability for objects referred to in digital content
CN105512739A (en) * 2015-12-25 2016-04-20 北京奇虎科技有限公司 Method and system for online ticket booking
CN107766395A (en) * 2017-03-03 2018-03-06 平安医疗健康管理股份有限公司 Data matching method and device
CN108921034A (en) * 2018-06-05 2018-11-30 北京市商汤科技开发有限公司 Face matching process and device, storage medium
CN110503220A (en) * 2019-06-20 2019-11-26 北京大米科技有限公司 Cource arrangement method, device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN111563197B (en) 2023-05-16

Similar Documents

Publication Publication Date Title
US11474779B2 (en) Method and apparatus for processing information
US10365962B2 (en) Automated testing error assessment system
US7016968B2 (en) Method and apparatus for facilitating the providing of content
US11102276B2 (en) System and method for providing more appropriate question/answer responses based upon profiles
CN105184520A (en) Evaluation method and device for professional abilities of teachers
CN110597610B (en) Online teaching method and device, storage medium and electronic equipment
CN109726390B (en) Document processing method, device, electronic equipment and storage medium
CN110084317B (en) Method and device for recognizing images
WO2023065825A1 (en) Information processing method and apparatus, device, and medium
CN113254139B (en) Online education course information display method, device, terminal and storage medium
KR102296966B1 (en) System for managing learning through preparation and review and method thereof
CN111223015B (en) Course recommendation method and device and terminal equipment
CN112541845B (en) Online training method and device, electronic equipment and storage medium
CN112884375A (en) Application method and device based on double recording system, electronic equipment and medium
WO2023056850A1 (en) Page display method and apparatus, and device and storage medium
CN111563197B (en) Data matching method, device, medium and electronic equipment
CN116912734A (en) Video abstract data set construction method, device, medium and electronic equipment
WO2016070591A1 (en) Method and system for processing teaching resource
CN111143740B (en) Information processing method and device and electronic equipment
CN114328999A (en) Interaction method, device, medium and electronic equipment for presentation
CN111597441A (en) Information processing method and device and electronic equipment
CN112308511A (en) Task plan generation method and device, electronic equipment and storage medium
US10264037B2 (en) Classroom messaging
CN112308744A (en) Learning management system, method and device for processing data
CN109033326B (en) Knowledge skill splitting and recombining method and device

Legal Events

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