Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
The embodiment of the disclosure provides a message record query method and device. The method provides a uniform message query interface for a plurality of different message senders, acquires corresponding message records based on keywords in a message query request, analyzes and counts the message records, and returns the analyzed and counted message records to the message inquirer.
Fig. 1 schematically illustrates anexemplary system architecture 100 to which the message record query method, apparatus, and computer program product may be applied, according to an embodiment of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, thesystem architecture 100 according to this embodiment may includeterminal devices 101, 102, 103, anetwork 104 and aserver 105. Thenetwork 104 serves as a medium for providing communication links between theterminal devices 101, 102, 103 and theserver 105.Network 104 may include various connection types, such as wired and/or wireless communication links, and so forth.
The user may use theterminal devices 101, 102, 103 to interact with theserver 105 via thenetwork 104 to receive or send messages or the like. Theterminal devices 101, 102, 103 may have installed thereon various communication client applications, such as a shopping-like application, a web browser application, a search-like application, an instant messaging tool, a mailbox client, and/or social platform software, etc. (by way of example only).
Theterminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
Theserver 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using theterminal devices 101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.
It should be noted that the message record query method provided by the embodiment of the present disclosure may be generally executed by theserver 105. Accordingly, the message query device provided by the embodiment of the present disclosure may be generally disposed in theserver 105. The message record query method provided by the embodiment of the present disclosure may also be executed by a server or a server cluster that is different from theserver 105 and is capable of communicating with theterminal devices 101, 102, 103 and/or theserver 105. Correspondingly, the message record query device provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster that is different from theserver 105 and can communicate with theterminal devices 101, 102, 103 and/or theserver 105. Alternatively, the message record query method provided by the embodiment of the present disclosure may also be executed by theterminal device 101, 102, or 103, or may also be executed by another terminal device different from theterminal device 101, 102, or 103. Correspondingly, the message record query apparatus provided in the embodiment of the present disclosure may also be disposed in theterminal device 101, 102, or 103, or in another terminal device different from theterminal device 101, 102, or 103.
For example, the message record may be originally stored in any of theterminal devices 101, 102, or 103 (e.g., theterminal device 101, but not limited thereto), or stored on an external storage device and may be imported into theterminal device 101. Then, theterminal device 101 may locally execute the message record query method provided by the embodiment of the present disclosure, or send the message record to another terminal device, server, or server cluster, and execute the message record query method provided by the embodiment of the present disclosure by another terminal device, server, or server cluster that receives the message record.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Fig. 2 schematically shows an application scenario diagram to which the message record query method and apparatus of the present disclosure may be applied.
As shown in fig. 2, the banking system includes multiple APPs, and the functions are rich, and each APP pushes various types of services to customers through different channels such as APP information, short messages, mails, and the like. At present, all kinds of APPs and all function modules in the APPs are not unified to obtain a query entry, and if a client wants to query detailed records of push messages, the client needs to query the detailed records one by one, and because some APPs or function modules do not provide query entries, the client wants to obtain the message records very difficultly.
In the embodiment of the disclosure, a uniform query interface is provided, and the message records can be obtained from various different APPs through the query interface, so that the efficiency of querying the message records is improved.
Fig. 3 schematically shows a flow chart of a message record query method according to an embodiment of the present disclosure.
As shown in fig. 3, the present disclosure provides a message record query method including S310 to S340.
S310, receiving a message record inquiry request.
S320, a plurality of keywords included in the request are identified.
S330, based on the keywords, acquiring corresponding message records from a plurality of message senders.
S340, performing classified statistics on the message records, and returning the statistical result and the message records to the query requester.
In the embodiment of the present disclosure, a unified API interface is provided for all message push parties according to a standard message structure to receive a query request from a query request party (which may be a user of the message push party), where the query request at least includes identity information of the query request party, and the message push party may query a message record according to the identity information such as a mobile phone number, and then return the message record to the query request party. The message request is a request with a preset format, the preset format conforms to a communication protocol of an interface provided for a message pushing party, and the message request at least comprises keywords such as identity information and the like, and can also comprise keywords such as a query time interval and a query message type so as to mark the obtained message.
In the embodiment of the present disclosure, acquiring a corresponding message record from each message forwarding party only by using a keyword in a message request specifically includes: the method comprises the steps of matching keywords with message records of all message pushing parties without modifying original message storage forms of all message pushing parties by a client mobile phone number (or a client mailbox address), message sending time, message sending contents and message receiving modes (short messages, APP pushing, mails and the like).
Fig. 4 schematically shows a flow chart of a message record query method according to another embodiment of the present disclosure.
As shown in fig. 4, a message record query method according to another embodiment of the present disclosure includes S410 to S450.
And S410, receiving a message record inquiry request.
S420, a plurality of keywords included in the request are identified.
S430, authenticating the identity information of the inquiry requester.
S440, after the authentication is passed, acquiring corresponding message records from a plurality of message senders based on the plurality of keywords.
S450, the message records are classified and counted, and a counting result and the message records are returned to the inquiry request party.
In another embodiment of the present disclosure, after the interface acquires the query request, the interface performs identity authentication according to the identity information included in the query request, and after confirming that the identity of the message querying party is correct, the interface initiates API requests to all message push parties to query the message sending records, thereby ensuring the security of the message records.
Alternatively, the authentication may include querying whether the customer's mobile phone number passes real-name verification, is a valid mobile phone number, etc. by providing the customer's mobile phone number, identification number, etc. to the operator.
Fig. 5 schematically shows a flowchart of step S330 of the message record querying method according to an embodiment of the present disclosure.
As shown in fig. 5, step S330 includes steps S331 to S332.
S331, based on the plurality of keywords, obtaining a message record associated with the plurality of keywords from each of the message senders.
In the embodiment of the disclosure, the keyword is matched with the message record in each message sender to obtain the message record required by the message inquirer.
S332, checking whether the message record comprises a preset return field and meets the format requirement, and reserving the message record which is successfully checked.
After the message records corresponding to the keywords are obtained, the data availability is checked firstly, the data check includes whether the return fields meet the format standard or not, whether the data of the return fields (message contents and sending modes) required to be sent are not empty or not, and the invalid message records are prevented from being obtained.
Fig. 6 schematically shows a message record querying method step S340 according to an embodiment of the present disclosure.
As shown in fig. 6, S340 includes steps S341 to S343.
And S341, performing data statistics on the message records according to at least one preset statistical standard to obtain data images of the message records under the at least one preset statistical standard.
And S342, acquiring a return field from the message record, and storing the return field into a corresponding classification list according to the classification of each preset statistical standard.
And S343, returning the data image and the classification list to the query requester.
According to the embodiment of the disclosure, the message record is not only returned to the message inquiring party, but also the data imaging is carried out on the obtained message record so as to obtain the preference characteristic of the message receiving party for obtaining the message, thereby enabling the message inquiring party to more conveniently and intuitively know the habit and preference of the message receiving party for receiving the message.
Fig. 7 schematically shows a flowchart of step S341 of the message record querying method according to an embodiment of the present disclosure.
As shown in fig. 7, performing data rendering on a message record includes S3411 to S3413.
S3411, classifying and counting the message records based on the message sending channels of the message sending parties to obtain first data ratios of different message sending channels.
In daily life, some users can select message sending channels due to their own habits and preferences, and may shield some message sending channels in order to avoid disturbance, the first data proportion represents the proportion of the messages of each message channel received by the users, and the messages of which channels are preferred by the users are represented according to the proportion.
S3412, the message records are classified and counted based on the message types, and second data ratios of different message types are obtained.
In various APPs, the pushed messages have special properties, such as advertisement pushing, transaction reminding, identity authentication, timing reminding and the like, and classified statistics is performed according to the categories of the messages to obtain the occupation ratios of different types of messages, so that the preference degree of the user on various types of messages is reflected.
S3413, performing a data portrait on the message record based on the first data proportion and the second data proportion.
Based on the first data proportion and the second data proportion, user preference can be basically analyzed, a visual pie chart can be drawn based on the proportion, a data image of the message record is obtained, and the data image is pushed to a message record inquiring party, so that an inquiring result is more visual.
Fig. 8 schematically shows a flowchart of step S342 of the message record querying method according to an embodiment of the present disclosure.
As shown in fig. 8, step S342 may include S3421 to S3422 in addition to sorting the data into the sort list.
S3421, sorting the returned fields in each of the sorted lists according to time order.
S3422, the return fields in each classification list are subjected to de-duplication and desensitization processing.
According to the embodiment of the disclosure, after data is sorted into a table, the system desensitizes the message content recorded in the database (desensitization is to perform shielding processing on the customer identity information, the account information, the amount content and the like, for example, only the last four digits of the account information are displayed, the rest are displayed, and the amount information is displayed) so as to protect the privacy of the user.
According to the embodiment of the disclosure, a uniform query interface is provided for different message senders to realize quick query of message records of different message senders, all results are integrated together, and after analysis and desensitization, the results are returned to a client. The method fills the blank of the prior banking information query mechanism, provides help for quickly responding to the self-service query requirement of the client, does not need manual intervention in the process, and greatly reduces the operation cost.
Fig. 9 schematically shows a block diagram of a message record querying device according to an embodiment of the present disclosure.
As shown in fig. 9, a messagerecord query device 900 provided in the embodiment of the present disclosure includes: arequest receiving module 910, akeyword identifying module 920, arecord obtaining module 930, and arecord returning module 940.
Arequest receiving module 910, configured to receive a message record query request.
Akeyword identification module 920, configured to identify a plurality of keywords included in the request.
Arecord obtaining module 930, configured to obtain corresponding message records from multiple message senders based on the multiple keywords.
And arecord returning module 940, configured to perform classification statistics on the message records, and return a statistical result and the message records to the query requester.
Fig. 10 schematically shows a block diagram of a message record querying device according to another embodiment of the present disclosure.
As shown in fig. 10, a messagerecord query device 1000 provided in the embodiment of the present disclosure includes: the system comprises arequest receiving module 1010, akeyword recognition module 1020, anidentity authentication module 1030, arecord obtaining module 1040 and arecord returning module 1050.
Arequest receiving module 1010, configured to receive a message record query request.
Akeyword identification module 1020 for identifying a plurality of keywords included in the request.
And anidentity authentication module 1030 for authenticating the identity information of the query requester.
Therecord obtaining module 1040 is configured to, after the authentication is passed, obtain corresponding message records from multiple message senders based on the multiple keywords.
And arecord returning module 1050, configured to perform classified statistics on the message records, and return a statistical result and the message records to the query requester.
Wherein therequest receiving module 1010 provides a uniform query interface for the plurality of message senders to receive the query request; wherein the message request is a request with a preset format.
FIG. 11 schematically shows a block diagram of a record acquisition module according to an embodiment of the disclosure.
As shown in fig. 11, therecord acquisition module 1100 includes: arecord obtaining unit 1110 and arecord verifying unit 1120.
Arecord obtaining unit 1110, configured to obtain, from each of the message senders, a message record associated with the plurality of keywords based on the plurality of keywords;
therecord checking unit 1120 is configured to check whether the message record includes a preset return field and meets the format requirement, and retain the message record that is successfully checked.
FIG. 12 schematically shows a block diagram of a record return module according to an embodiment of the disclosure.
As shown in fig. 12, therecord returning module 1200 includes: astatistic unit 1210, astorage unit 1220, and areturn unit 1230.
Astatistical unit 1210, configured to perform data statistics on the message records according to at least one preset statistical standard, respectively, to obtain data images of the message records under the at least one preset statistical standard.
Thestorage unit 1220 is configured to obtain a return field from the message record, and store the return field into a corresponding classification list according to each classification of the preset statistical criteria.
Areturn unit 1230 for returning the data representation and the sorted list to the query requestor.
Thestorage unit 1220 is further configured to sort the return fields in the sorting list in chronological order; and performing deduplication and desensitization processing on the return fields in the classification list.
FIG. 13 schematically shows a block diagram of a statistics unit according to an embodiment of the present disclosure.
As shown in fig. 13, thestatistical unit 1300 includes: achannel statistics unit 1310, acategory statistics unit 1320, and amapping unit 1330.
Achannel counting unit 1310, configured to perform classified statistics on the message records based on the message sending channels of the message senders, so as to obtain first data ratios of different message sending channels.
Acategory statistics unit 1320, configured to perform category statistics on the message records based on the message categories, so as to obtain second data ratios of different message categories.
Animage unit 1330 configured to perform data image processing on the message record based on the first data comparison and the second data comparison.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, any plurality of therequest receiving module 910, thekeyword identifying module 920, therecord obtaining module 930, and therecord returning module 940 may be combined into one module/unit/sub-unit to be implemented, or any one of the modules/units/sub-units may be split into a plurality of modules/units/sub-units. Alternatively, at least part of the functionality of one or more of these modules/units/sub-units may be combined with at least part of the functionality of other modules/units/sub-units and implemented in one module/unit/sub-unit. According to an embodiment of the present disclosure, at least one of therequest receiving module 910, thekeyword identifying module 920, therecord obtaining module 930, and therecord returning module 940 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or implemented by any one of three implementations of software, hardware, and firmware, or implemented by a suitable combination of any several of them. Alternatively, at least one of therequest receiving module 910, thekeyword identifying module 920, therecord obtaining module 930, and therecord returning module 940 may be at least partially implemented as a computer program module, which may perform a corresponding function when executed.
It should be noted that, the message record query device portion in the embodiment of the present disclosure corresponds to the message record query method portion in the embodiment of the present disclosure, and the description of the message record query device portion specifically refers to the message record query method portion, which is not described herein again.
FIG. 14 schematically illustrates a block diagram of a computer system suitable for implementing the above-described method, according to an embodiment of the present disclosure. The computer system illustrated in FIG. 14 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the disclosure.
As shown in fig. 14, acomputer system 1400 according to an embodiment of the present disclosure includes aprocessor 1401, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)1402 or a program loaded from astorage portion 1408 into a Random Access Memory (RAM) 1403.Processor 1401 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. Theprocessor 1401 may also include onboard memory for caching purposes.Processor 1401 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the present disclosure.
In theRAM 1403, various programs and data necessary for the operation of thesystem 1400 are stored. Theprocessor 1401, theROM 1402, and theRAM 1403 are connected to each other by abus 1404. Theprocessor 1401 performs various operations of the method flow according to the embodiments of the present disclosure by executing programs in theROM 1402 and/or theRAM 1403. Note that the programs may also be stored in one or more memories other thanROM 1402 andRAM 1403. Theprocessor 1401 may also perform various operations of the method flows according to the embodiments of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the present disclosure,system 1400 may also include an input/output (I/O)interface 1405, which input/output (I/O)interface 1405 is also connected tobus 1404. Thesystem 1400 may also include one or more of the following components connected to the I/O interface 1405: aninput portion 1406 including a keyboard, a mouse, and the like; anoutput portion 1407 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker and the like; astorage portion 1408 including a hard disk and the like; and acommunication portion 1409 including a network interface card such as a LAN card, a modem, or the like. Thecommunication section 1409 performs communication processing via a network such as the internet. Thedriver 1410 is also connected to the I/O interface 1405 as necessary. A removable medium 1411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on thedrive 1410 as necessary, so that a computer program read out therefrom is installed into thestorage section 1408 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure 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 storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via thecommunication portion 1409 and/or installed from theremovable medium 1411. The computer program, when executed by theprocessor 1401, performs the above-described functions defined in the system of the embodiment of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. Examples may include, but are not limited to: 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), 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.
For example, according to embodiments of the present disclosure, a computer-readable storage medium may include one or more memories other thanROM 1402 and/orRAM 1403 and/orROM 1402 andRAM 1403 described above.
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 or flowchart illustration, and combinations of blocks in the block diagrams 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.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.