CN108230218B - Multi-user-value machine pushing method and system, storage medium and electronic equipment - Google Patents
Multi-user-value machine pushing method and system, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN108230218B CN108230218B CN201810102401.6A CN201810102401A CN108230218B CN 108230218 B CN108230218 B CN 108230218B CN 201810102401 A CN201810102401 A CN 201810102401A CN 108230218 B CN108230218 B CN 108230218B
- Authority
- CN
- China
- Prior art keywords
- check
- passengers
- same row
- request
- identity information
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000013507 mapping Methods 0.000 claims abstract description 84
- 238000012545 processing Methods 0.000 claims description 10
- 238000012216 screening Methods 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 11
- 230000003287 optical effect Effects 0.000 description 3
- 101100400452 Caenorhabditis elegans map-2 gene Proteins 0.000 description 2
- RWSOTUBLDIXVET-UHFFFAOYSA-N Dihydrogen sulfide Chemical compound S RWSOTUBLDIXVET-UHFFFAOYSA-N 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000026676 system process Effects 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Images
Classifications
-
- G06Q50/40—
Abstract
The invention provides a pushing method, a pushing system, a storage medium and electronic equipment of a multi-user-on-duty machine, wherein the method comprises the following steps: when a user establishes an air ticket order containing a plurality of passengers in the same row, generating a value-machine relation mapping table corresponding to the air ticket order; receiving a check-in request, and judging whether the identity information of the user sending the check-in request hits the identity information of any passenger in the same row in a check-in relational mapping table; if yes, obtaining and pushing the hit same-row passengers without value machines in the value machine relation mapping table to the user sending the value machine request; acquiring a flight seat list according to flight information of the air ticket order corresponding to the check-in relation mapping list; and updating the flight seat table according to seats selected by the user sending the check-in request for all passengers in the same row without check-in based on the flight seat table, and finishing the multi-check-in operation of the passengers in the same row with all the passengers without check-in. The invention finishes the simultaneous check-in of a plurality of passengers on the same order through one check-in request, reduces the request times and improves the check-in efficiency.
Description
Technical Field
The invention relates to the technical field of internet, in particular to a pushing method and system of a multi-user-on-duty machine, a storage medium and electronic equipment.
Background
With the vigorous development of civil aviation industry in China, airlines and airports are dedicated to improving the service quality, improving the working efficiency of each link and improving the passenger experience of riding the airplane. For example, in order to simplify the flow of passengers arriving at an airport and reduce queuing time, a method of online check-in at a client and self-help check-in at an airport check-in station is developed in the industry to avoid slow efficiency of manual check-in and excessive time for queuing.
However, in the prior art, either the client-side online check-in mode or the airport check-in station self-help check-in mode can only realize single-person single check-in. When a plurality of passengers in the same row exist, the check-in needs to be carried out for each passenger for a plurality of times, so that the operation times of the user are increased, the check-in efficiency of the user is reduced, the system pressure is increased, the system continuously obtains updated data, and the operation burden is increased.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
In view of the above problems, the present invention aims to provide a solution for completing multi-person synchronous check-in by one request, so as to solve the defect of single person single check-in the prior art.
According to one aspect of the invention, a push method of a multi-user-valued machine, the method comprises:
when a user establishes an air ticket order containing a plurality of passengers in the same row, generating a check-in relation mapping table corresponding to the air ticket order, wherein the check-in relation mapping table contains identity information of all passengers in the same row placed by the air ticket order and flight information of the air ticket order;
receiving a check-in request, and judging whether the identity information of a user sending the check-in request hits the identity information of any passenger in the same row in a check-in relational mapping table;
when the identity information of the user sending the check-in request hits the identity information of any one of the passengers in the check-in relational mapping table, acquiring all the passengers in the same row who do not have check-in the check-in relational mapping table, and pushing the passengers to the user sending the check-in request;
acquiring a flight seat list according to flight information of the air ticket order corresponding to the check-in relation mapping table, and pushing the flight seat list to a user sending the check-in request; and
and updating the flight seat table according to seats selected by the user sending the check-in request for all the passengers in the same row without check-in based on the flight seat table, and finishing the multi-person check-in operation of the passengers in the same row with all the passengers without check-in.
Preferably, in the above pushing method for a multi-attendant computer, after updating the flight seat list, the method further includes: and pushing check-in completion information to all the passengers in the same row who finish the check-in operation, wherein the check-in completion information comprises flight information and seat information.
Preferably, in the above pushing method for multiple check-in machines, the check-in completion information is pushed to all the passengers in the same row who have finished the check-in machine operation at least through the telephone numbers or the electronic mailboxes in the identity information of all the passengers in the same row who have finished the check-in machine operation.
Preferably, in the above pushing method for multiple valets, the step of obtaining all hit fellow passengers who are not valued in the value-machine relationship mapping table includes:
acquiring the check-in relation mapping table hit by the user sending the check-in request;
obtaining information whether each fellow passenger finishes check-in the check-in relation mapping table; and
and screening all passengers in the same row who do not check in the check-in relation mapping table.
Preferably, in the above pushing method for multiple value machines, after screening out all passengers in the same row who have not yet been checked in the value machine relationship mapping table, the method further includes:
verifying the identity information of the screened passengers in the same row who are not on-duty; and
and pushing the checked-in fellow passenger who is not checked in to the user who sends the check-in request.
Preferably, in the above pushing method for multiple check-in machines, the verifying the identity information of the co-passenger who has screened out each check-in machine at least includes verifying certificate information that can uniquely identify the co-passenger who has screened out each check-in machine.
Preferably, in the above method for pushing a multi-operator, the step of determining whether the identity information of the user who sends the operator request hits the identity information of any passenger in the same row in an operator map includes:
obtaining identity information of a user sending the check-in request;
obtaining a corresponding air ticket order according to the identity information of the user sending the check-in request;
and judging whether the air ticket order has a corresponding check-in relation mapping table, if so, continuously judging whether the identity information of the user sending the check-in request hits the identity information of any passenger in the same row in the check-in relation mapping table.
According to another aspect of the present invention, there is provided a push system of a multi-attendant, the system comprising:
the system comprises a check-in relation mapping module, a check-in relation mapping module and a check-in relation mapping module, wherein the check-in relation mapping module is used for generating a check-in relation mapping table corresponding to an air ticket order when a user establishes the air ticket order containing a plurality of passengers in the same row, and the check-in relation mapping table contains identity information of all passengers in the same row under the air ticket order and flight information of the air ticket order;
the check-in request receiving module is used for receiving a check-in request and judging whether the identity information of the user sending the check-in request hits the identity information of any passenger in the same row in a check-in relation mapping table or not;
the passenger in the same row obtains the module, when the identity information of the user sending the check-in request hits the identity information of any passenger in the same row in the check-in relational mapping table, obtains all passengers in the same row who have no check-in the check-in relational mapping table, and pushes the obtained passenger to the user sending the check-in request;
the check-in passenger pushing module is used for acquiring a flight seat list according to flight information of the air ticket order corresponding to the check-in relation mapping table and pushing the flight seat list to a user sending the check-in request; and
and the check-in operation processing module updates the flight seat table according to seats selected by the user sending the check-in request for all passengers in the same row without check-in based on the flight seat table, and completes multi-person check-in operation of the passengers in the same row with check-in.
According to another aspect of the present invention, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the above-described push method for a multi-human machine.
According to another aspect of the present invention, there is provided an electronic apparatus comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the steps of the above-mentioned push method of the multi-attendant via execution of the executable instructions.
In view of this, compared with the prior art, the invention has the following beneficial effects:
the invention establishes a check-in relation mapping table for the air ticket order at the beginning of the establishment of the air ticket order containing a plurality of passengers in the same row, matches and associates the information of the passengers in the same row to the same check-in relation mapping table, and when any passenger in the check-in relation mapping table initiates a check-in request, the information of all passengers who do not check in the air ticket order can be called, and the operation of multi-person check-in can be completed at one time. Therefore, the user can acquire the information and the check-in condition of all the passengers in the same row only through one check-in request, the aim of checking in by multiple persons at the same time is fulfilled, and the check-in efficiency is improved. Meanwhile, when the system processes the check-in operation for a plurality of passengers in the same row, only one flight data request is needed to be updated, so that the operation burden of the system is reduced, and the operation efficiency is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application. 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.
FIG. 1 is a diagram illustrating steps of a push method for a multi-user machine according to an embodiment;
FIG. 2 is a schematic diagram of a page of multiple fellow passengers pushing the same ticket order to the check-in requesting user to place the check-in the embodiment;
FIG. 3 is a schematic diagram of a page for pushing flight seat lists to a user making an check-in request in an embodiment;
FIG. 4 is a schematic diagram illustrating an embodiment of pushing a page for completing a multi-check-in operation to a user issuing a check-in request;
FIG. 5 is a schematic diagram of a computer-readable storage medium in an embodiment;
fig. 6 shows a schematic diagram of an electronic device in an embodiment.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Furthermore, the drawings are merely schematic illustrations of the invention and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
Fig. 1 is a schematic step diagram illustrating a method for pushing a multi-user-on-duty machine, and referring to fig. 1, the method for pushing a multi-user-on-duty machine in this embodiment includes:
step S101, when a user establishes an air ticket order containing a plurality of passengers in the same row, a check-in relation mapping table corresponding to the air ticket order is generated, wherein the check-in relation mapping table contains identity information of all passengers in the same row placed by the air ticket order and flight information of the air ticket order. Wherein the passengers in the same row are all associated passengers in the same row including the users who establish the air ticket orders.
When a user establishes a ticket order, and the ticket order contains a plurality of passengers in the same row, the airline department system can generate corresponding electronic tickets for each passenger in the same row, and the electronic tickets of the passengers in the same row have mutual relevance, specifically, the airline department codes in the electronic tickets of each passenger in the same row in the ticket order are the same. In the embodiment, when the user establishes the air ticket order, all passengers in the same row are associated into the same check-in relation mapping table, so that the identity information and flight information of the passengers in the same row can be uniformly called in the subsequent check-in process. The identity information of all passengers in the same row can be input when the user establishes the air ticket order, and the airline department system can generate corresponding flight information when the electronic air ticket is generated for each passenger in the same row, so that the value-airplane relation mapping table comprises the identity information of all passengers in the same row under the air ticket order and the flight information of the air ticket order, and therefore the identity information of all passengers in the same row and the flight information of the air ticket order can be obtained only by calling the value-airplane relation mapping table during the subsequent value-airplane operation.
The identity information at least comprises certificate information capable of uniquely identifying the user, such as an identity card and a passport number, and contact information of each fellow passenger, such as a telephone number, an electronic mailbox and the like, so that related information can be pushed later.
Step S102, receiving a check-in request, and judging whether the identity information of the user sending the check-in request hits the identity information of any passenger in the same row in a check-in relational mapping table. Specifically, when a check-in request is received, firstly, the identity information of a user sending the check-in request is obtained, then, a corresponding air ticket order is obtained according to the identity information of the user sending the check-in request, whether the corresponding air ticket order has a corresponding check-in relational mapping table is judged, and if yes, whether the identity information of the user sending the check-in request hits the identity information of any one passenger in the same row in the corresponding check-in relational mapping table is continuously judged.
Step S103, when the identity information of the user sending the check-in request hits the identity information of any one of the passengers in the same row in a check-in relational mapping table, all the passengers in the same row who do not have check-in the hit check-in relational mapping table are obtained and pushed to the user sending the check-in request. When the identity information of the user sending the check-in request hits the identity information of any one of the passengers in the same row in the check-in relation mapping table, the fact that the user sending the check-in request has the associated passenger in the same row is indicated, namely, a plurality of passengers in the same row exist in the air ticket order corresponding to the user sending the check-in request, and the check-in relation mapping table containing all the passengers in the same row exists in the system corresponding to the air ticket order.
Specifically, a check-in relation mapping table hit by a user who sends a check-in request is obtained, then information whether check-in is completed by each passenger in the check-in relation mapping table is obtained, all passengers in the same row who do not have check-in are screened out, identity information of the passengers in the same row who do not have check-in is verified, and the passengers in the same row who pass verification are pushed to the user who sends the check-in request. Wherein, the identity verification information at least comprises certificate information which can uniquely identify the passengers in the same row who are screened out without check-in.
Referring to fig. 2, a page schematic diagram of multiple fellow passengers placing an unsettled order for the same airline ticket is pushed to the user making the check-in request. Here, taking an example that a user sends a check-in request at the mobile terminal 1 of the mobile phone, when the system determines that a check-in mapping table exists under an air ticket order corresponding to the user who sends the check-in request, as shown in the figure, the check-in mapping table 2 is obtained, and the identity information of all passengers in the same row and the flight information of the air ticket order are stored in the check-in mapping table 2. Specifically, in the check-in relationship mapping table 2, the area 21 is flight information of the air ticket order, where the figure shows the flight number "MU 5305", and may further include other flight information, such as the time of departure and landing, which is not all indicated in the figure. The area 22 is identity information and check-in information for all fellow passengers. The check-in map 2 includes 4 passengers in the same row, which are respectively denoted as passenger P1, passenger P2, passenger P3 and passenger P4, where passenger P1 corresponds to the user issuing the check-in request, that is, the identity information of the user issuing the check-in request matches with the identity information of passenger P1. Identity information (in the figure, "identity information xxx" is used for marking the identity information of each passenger) and check-in information are correspondingly stored in each passenger in the same row. Taking an example as shown in the figure, among the 4 passengers in the same row in the check-in map 2, passenger P1, passenger P2, passenger P3 are not checked in, and passenger P4 is checked in, so that passenger P1, passenger P2, passenger P3 and their respective identity information are pushed to mobile phone terminal 1 of the user who issued the check-in request.
Further, at the mobile phone terminal 1 of the user who issued the check-in request, the area 11 indicates flight information of the air ticket order corresponding to the user who issued the check-in request, for example, the flight number "MU 5305" is indicated. Zone 12 places all fellow passengers for the acquired ticket order, including passenger P1, passenger P2, and passenger P3. Each fellow passenger column also comprises a check-in button, and the user sending the check-in request can select whether to transact the check-in for each fellow passenger in a unified way through the check-in button. In the illustrated embodiment, the check buttons for passenger P1, passenger P2, and passenger P3 are all selected (i.e., labeled as √), and the user making the check-in request transacts check-in operations for passenger P1, passenger P2, and passenger P3 at the same time. The area 13 is a check-in button, and when the check-in button is clicked, the check-in page is entered.
When the user clicks the check-in button, step S104 is executed, and the flight seat table is obtained according to the flight information of the air ticket order corresponding to the check-in relationship mapping table, and is pushed to the user who sends the check-in request. Referring to fig. 3, a schematic page diagram of a flight seat list is pushed to a user who sends an attendance request, in the mobile phone mobile terminal 1 of the user who sends the attendance request, the area 11 still displays flight information of an air ticket order, and the area 12 is the pushed flight seat list. In this embodiment the user issuing the check-in request transacts check-in operations for 3 passengers in the same row at the same time, so passenger P1, passenger P2 and passenger P3, which need to transact check-in operations at the same time, are marked at the top of zone 12, and the rest of zone 12 is marked with the flight seat list, where the shaded boxes are seats that have been selected and the blank boxes are seats that have been selected. When selecting, each passenger in the same row can only correspondingly select one blank seat. When the three passengers in the same row select their own seats (the corresponding seats of passenger P1, passenger P2 and passenger P3 are indicated by arrows in the figure), the check button of area 13 is clicked to complete the boarding operation of the three passengers in the same row.
Further, referring to fig. 4, a schematic page diagram of completing the operation of multiple operators is pushed to the user who sends the operator request. After the check-in operation is completed, step S105 is executed, the flight seat table is updated and fed back to the driver according to the seats selected by the check-in user for all passengers in the same row who do not check in based on the flight seat table, and check-in information (mainly referring to seat information) corresponding to each passenger in the same row is pushed to the mobile phone mobile terminal 1 of the check-in user, so as to complete the multi-person check-in operation of the passengers in the same row including all the passengers in the check-in.
In fig. 4, the area 11 of the mobile terminal 1 indicates flight information, and the area 12 indicates boarding information corresponding to passengers in the same row, including seat information xxx corresponding to passenger P1, seat information xxx corresponding to passenger P2, and seat information xxx corresponding to passenger P3. The area 13 is a notification button, and when the notification button is clicked, check-in completion information including flight information and seat information can be pushed to all the fellow passengers who are finished with check-in operation. Based on the contact information corresponding to each fellow passenger stored in the check-in relation mapping table, the short message notification can be adopted to the telephone number, or the mail notification can be adopted to the electronic mailbox, and check-in completion information can be pushed to all fellow passengers who are finished check-in operation. That is, the user clicks the notification button, and the check-in completion information is pushed to passenger P1, passenger P2, and passenger P3, respectively, to notify the corresponding passengers.
Based on the above steps, in this embodiment, a value-machine relationship mapping table is established for the air ticket order at the beginning of creating the air ticket order including multiple passengers in the same row, and the identity information of the multiple passengers in the same row and the flight information of the air ticket order are matched and associated in the same value-machine relationship mapping table. When any passenger in the check-in relation mapping table initiates a check-in request, the identity information of all passengers who are not checked in the air ticket order can be called, and multi-person check-in operation can be completed at one time. Therefore, the user can acquire the identity information and the check-in condition of all the passengers in the same row only through one check-in request, the aim of checking in by multiple persons at the same time is fulfilled, and the check-in efficiency is improved. Meanwhile, when the system processes the check-in operation for a plurality of passengers in the same row, only one flight data request is needed to be updated, so that the operation burden of the system is reduced, and the operation efficiency is improved.
The invention also provides a pushing system of the multi-user-on-duty machine, which comprises:
the system comprises a check-in relation mapping module, a check-in relation mapping module and a check-in relation mapping module, wherein when a user establishes a ticket order containing a plurality of passengers in the same row, the check-in relation mapping module generates a check-in relation mapping table corresponding to the ticket order, and the check-in relation mapping table contains identity information of all passengers in the same row placed by the ticket order and flight information of the ticket order;
the check-in request receiving module is used for receiving a check-in request and judging whether the identity information of the user sending the check-in request hits the identity information of any passenger in the same row in a check-in relation mapping table or not;
the passenger in the same row obtains the module, when the identity information of users who send out the check-in request hits the identity information of any passenger in the same row in a check-in relational mapping table, obtain all passengers in the same row who do not have check-in the check-in relational mapping table hit, push to the user who sends out the check-in request;
the check-in passenger pushing module is used for acquiring a flight seat list according to flight information of the air ticket order corresponding to the check-in relation mapping table and pushing the flight seat list to a user sending the check-in request; and
and the check-in operation processing module updates the flight seat list according to seats selected by the user sending the check-in request for all passengers in the same row without check-in based on the flight seat list, and completes multi-person check-in operation of the passengers in the same row with all the passengers without check-in.
The working principle of each module has already been explained in the above method embodiments, and therefore, the description is omitted.
In an exemplary embodiment of the present invention, a computer-readable storage medium is also provided, on which a computer program is stored, which when executed by, for example, a processor, may implement the steps of the push method of the multi-valet machine described in any one of the above embodiments. In some possible embodiments, aspects of the present invention may also be implemented in the form of a program product comprising program code for causing a terminal device to perform the steps according to various exemplary embodiments of the present invention described in the above-mentioned push method for a multi-valet in this specification, when the program product is run on the terminal device.
Referring to fig. 5, a program product 500 for implementing the above method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a 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.
The program product 500 may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A 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 (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, 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.
The computer readable storage medium may include a propagated data signal with readable program code embodied therein, for example, 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 readable storage medium may also be any readable medium that is not a 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 readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like 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 computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
In an exemplary embodiment of the invention, there is also provided an electronic device that may include a processor and a memory for storing executable instructions of the processor. Wherein the processor is configured to perform the steps of the push method of the multi-attendant in any of the above embodiments by executing the executable instructions.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 600 according to this embodiment of the invention is described below with reference to fig. 6. The electronic device 600 shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 6, the electronic device 600 is embodied in the form of a general purpose computing device. The components of the electronic device 600 may include, but are not limited to: at least one processing unit 610, at least one storage unit 620, a bus 630 that connects the various system components (including the storage unit 620 and the processing unit 610), a display unit 640, and the like.
Wherein the storage unit stores program code executable by the processing unit 610 to cause the processing unit 610 to perform steps according to various exemplary embodiments of the present invention described in the above-mentioned push method section of the multi-attendant machine of the present specification. For example, the processing unit 610 may perform the steps as shown in fig. 1.
The storage unit 620 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)6201 and/or a cache memory unit 6202, and may further include a read-only memory unit (ROM) 6203.
The memory unit 620 may also include a program/utility 6204 having a set (at least one) of program modules 6205, such program modules 6205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The electronic device 600 may also communicate with one or more external devices 700 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 600, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 600 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 650. Also, the electronic device 600 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via the network adapter 660. The network adapter 660 may communicate with other modules of the electronic device 600 via the bus 630. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiment of the present invention may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, or a network device, etc.) to execute the above-mentioned push method of the multi-user computer according to the embodiment of the present invention.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
Claims (10)
1. A push method for multiple attendees, the method comprising:
when a user establishes an air ticket order containing a plurality of passengers in the same row, generating a check-in relation mapping table corresponding to the air ticket order, wherein the check-in relation mapping table contains identity information of all passengers in the same row placed by the air ticket order and flight information of the air ticket order;
receiving a check-in request, and judging whether the identity information of a user sending the check-in request hits the identity information of any passenger in the same row in a check-in relational mapping table;
when the identity information of the user sending the check-in request hits the identity information of any one of the passengers in the check-in relational mapping table, acquiring all the passengers in the same row who do not have check-in the check-in relational mapping table, and pushing the passengers to the user sending the check-in request;
acquiring a flight seat list according to flight information of the air ticket order corresponding to the check-in relation mapping table, and pushing the flight seat list to a user sending the check-in request; and
and updating the flight seat table according to seats selected by the user sending the check-in request for all the passengers in the same row without check-in based on the flight seat table, and finishing the multi-person check-in operation of the passengers in the same row with all the passengers without check-in.
2. The method of claim 1, wherein after updating the flight seat list, the method further comprises:
and pushing check-in completion information to all the passengers in the same row who finish the check-in operation, wherein the check-in completion information comprises flight information and seat information.
3. The method as claimed in claim 2, wherein the check-in completion information is pushed to all the fellow passengers who completed the check-in operation at least through the phone number or the e-mail box in the identity information of all the fellow passengers who completed the check-in operation.
4. The method of claim 1, wherein the step of obtaining the hit fellow passenger with all unsettled machines in the value-machine map comprises:
acquiring the check-in relation mapping table hit by the user sending the check-in request;
obtaining information whether each fellow passenger finishes check-in the check-in relation mapping table; and
and screening all passengers in the same row who do not check in the check-in relation mapping table.
5. The method as claimed in claim 4, wherein screening out all passengers in the same row who have no value in the value-machine map table further comprises:
verifying the identity information of the screened passengers in the same row who are not on-duty; and
and pushing the checked-in fellow passenger who is not checked in to the user who sends the check-in request.
6. The method of claim 5, wherein the verifying the identity information of the passengers in the same row of each screened unwatched passenger comprises verifying at least certificate information that uniquely identifies the passengers in the same row of each screened unwatched passenger.
7. The method as claimed in claim 1, wherein the step of determining whether the identity information of the user issuing the check-in request hits the identity information of any fellow passenger in a check-in map comprises:
obtaining identity information of a user sending the check-in request;
obtaining a corresponding air ticket order according to the identity information of the user sending the check-in request;
and judging whether the air ticket order has a corresponding check-in relation mapping table, if so, continuously judging whether the identity information of the user sending the check-in request hits the identity information of any passenger in the same row in the check-in relation mapping table.
8. A push system for a multi-attendant, the system comprising:
the system comprises a check-in relation mapping module, a check-in relation mapping module and a check-in relation mapping module, wherein the check-in relation mapping module is used for generating a check-in relation mapping table corresponding to an air ticket order when a user establishes the air ticket order containing a plurality of passengers in the same row, and the check-in relation mapping table contains identity information of all passengers in the same row under the air ticket order and flight information of the air ticket order;
the check-in request receiving module is used for receiving a check-in request and judging whether the identity information of the user sending the check-in request hits the identity information of any passenger in the same row in a check-in relation mapping table or not;
the passenger in the same row obtains the module, when the identity information of the user sending the check-in request hits the identity information of any passenger in the same row in the check-in relational mapping table, obtains all passengers in the same row who have no check-in the check-in relational mapping table, and pushes the obtained passenger to the user sending the check-in request;
the check-in passenger pushing module is used for acquiring a flight seat list according to flight information of the air ticket order corresponding to the check-in relation mapping table and pushing the flight seat list to a user sending the check-in request; and
and the check-in operation processing module updates the flight seat table according to seats selected by the user sending the check-in request for all passengers in the same row without check-in based on the flight seat table, and completes multi-person check-in operation of the passengers in the same row with check-in.
9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method for pushing by a multi-attendant machine according to any one of claims 1 to 7.
10. An electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the steps of the multi-user on-boarding push method of any of claims 1 to 7 via execution of the executable instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810102401.6A CN108230218B (en) | 2018-02-01 | 2018-02-01 | Multi-user-value machine pushing method and system, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810102401.6A CN108230218B (en) | 2018-02-01 | 2018-02-01 | Multi-user-value machine pushing method and system, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108230218A CN108230218A (en) | 2018-06-29 |
| CN108230218B true CN108230218B (en) | 2020-11-03 |
Family
ID=62670095
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810102401.6A Active CN108230218B (en) | 2018-02-01 | 2018-02-01 | Multi-user-value machine pushing method and system, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108230218B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110874676B (en) * | 2018-08-29 | 2023-04-18 | 阿里巴巴集团控股有限公司 | Resource allocation method, device and system |
| CN112330380B (en) * | 2019-07-17 | 2023-12-12 | 腾讯科技（深圳）有限公司 | Order creation method, order creation device, computer equipment and computer readable storage medium |
| CN111445373B (en) * | 2020-04-13 | 2023-11-10 | 佛山职业技术学院 | Travel control method, system and computer equipment based on high-speed rail |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105590168A (en) * | 2015-12-20 | 2016-05-18 | 北京民航信息科技有限公司 | Passenger check-in method and system based on mobile device |
| CN106022984A (en) * | 2016-05-19 | 2016-10-12 | 成都零线科技有限公司 | Method for realizing airport check-in simulation system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8589195B2 (en) * | 2006-01-18 | 2013-11-19 | Google Inc. | Multi-passenger multi-route travel planning |
-
2018
- 2018-02-01 CN CN201810102401.6A patent/CN108230218B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105590168A (en) * | 2015-12-20 | 2016-05-18 | 北京民航信息科技有限公司 | Passenger check-in method and system based on mobile device |
| CN106022984A (en) * | 2016-05-19 | 2016-10-12 | 成都零线科技有限公司 | Method for realizing airport check-in simulation system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108230218A (en) | 2018-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108230218B (en) | Multi-user-value machine pushing method and system, storage medium and electronic equipment | |
| CN105959318B (en) | Service processing method based on robot | |
| CN106027614A (en) | Information pushing method, device and system | |
| US20160180257A1 (en) | Automatic conversion of formatted travel information | |
| AU2014230474B2 (en) | Portable communication device and system and method therefor | |
| CN105577832B (en) | Establish the method and device of network communication | |
| JP2017010269A (en) | Screen display device | |
| CN107944578A (en) | Seat method, apparatus, electronic equipment, storage medium are selected in online check-in with tourist site | |
| CN113139667B (en) | Hotel room recommending method, device, equipment and storage medium based on artificial intelligence | |
| CN106204190A (en) | Information processing method, terminal and server | |
| CN114265969A (en) | Ticket information processing method and device combining RPA and AI, electronic equipment and storage medium | |
| JP6899797B2 (en) | Inquiry device identification system, inquiry device identification method | |
| CN107767225B (en) | Service recommendation system and method | |
| CN109614549A (en) | Method and apparatus for pushed information | |
| CN106919613A (en) | Pictorial information searching method and device | |
| JP6865712B2 (en) | Interactive kiosk | |
| CN111694751A (en) | Automatic testing method and system | |
| CN112950336B (en) | Air ticket order checking method and system, electronic equipment and storage medium | |
| CN111698195B (en) | Information interaction method and device | |
| US11049200B2 (en) | User detection based on locator-embedded identifier | |
| US11178210B2 (en) | Transmission of visual content to display devices based on location detection | |
| CN107205229A (en) | Method and apparatus for being released news at wireless routing device end | |
| KR20210145509A (en) | Methods of Provide Manpower for Car Washing Service | |
| CN111400588A (en) | Hotel searching and information management method and device, electronic equipment and storage medium | |
| KR102388974B1 (en) | Method and computer readable storage medium for managing work information of flight attendant |
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 |