Detailed Description
The application is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not limiting of the application. It should be noted that, for convenience of description, only the portions related to the present application are shown in the drawings.
It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be combined with each other. The application will be described in detail below with reference to the drawings in connection with embodiments.
Fig. 1 shows an exemplary system architecture 100 of a method for pushing information or an apparatus for pushing information, to which embodiments of the present application may be applied.
As shown in fig. 1, a system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The terminal devices 101, 102, 103 interact with the server 105 via the network 104 to receive or send messages or the like. Various applications, such as shopping class applications, search class applications, instant messaging tools, mailbox clients, social platform software, text editing class applications, browser class applications, reading class applications, etc., may be installed on the terminal devices 101, 102, 103.
The terminal devices 101, 102, 103 may be hardware or software. When the terminal devices 101, 102, 103 are hardware, they may be various electronic devices including, but not limited to, smartphones, tablet computers, electronic book readers, laptop and desktop computers, and the like. When the terminal devices 101, 102, 103 are software, they can be installed in the above-listed electronic devices. Which may be implemented as multiple software or software modules (e.g., to provide shopping class services), or as a single software or software module. The present invention is not particularly limited herein.
The server 105 may be a server providing various services, such as a push information server for shopping class applications on the terminal devices 101, 102, 103. The push information server may receive a set of attribute values sent by the terminal device. Then, a bitmap value corresponding to the attribute value in the attribute value set is acquired from a pre-stored attribute value-bitmap value correspondence table. And generating result information based on the attribute value set and the acquired bitmap value set. And pushing prompt information associated with the result information to the terminal equipment.
It should be noted that, the method for pushing information provided by the embodiment of the present application is generally performed by the server 105, and accordingly, the device for pushing information is generally disposed in the server 105.
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.
With continued reference to fig. 2, a flow 200 of one embodiment of a method for pushing information in accordance with the present application is shown. The method for pushing information comprises the following steps:
step 201, a set of attribute values is received.
In the present embodiment, an execution subject of the method for pushing information (e.g., the server 105 shown in fig. 1) may receive the set of attribute values in various ways. For example, the executing body may receive the set of attribute values stored therein directly from a client of the communication connection (e.g., terminal devices 101, 102, 103 shown in fig. 1). For another example, the executing body may receive the set of attribute values stored therein from a database server (not shown in fig. 1) through a wired connection or a wireless connection.
In this embodiment, the attribute values may be various symbols, for example, kanji (white), and also, for example, letters (a). A set of attribute values, such as a set of attribute values (white, large, a) for a garment, wherein white is used to characterize the color of the garment, large is used to characterize the size of the garment, and a is used to characterize the model of the garment.
Step 202, obtaining bitmap values corresponding to attribute values in the attribute value set from a pre-stored attribute value-bitmap value correspondence table.
In this embodiment, the attribute value-bitmap value correspondence table may be stored in advance in the execution body, or may be stored in another storage location such as a designated database server. In the attribute value-bitmap value correspondence table, the attribute value and the bitmap value have a specified correspondence, for example, one-to-one correspondence. The bitmap value is a binary data. The attribute value-bitmap value correspondence table may be a correspondence table which is prepared in advance by a technician based on statistics of a large number of attribute values and bitmap values and in which correspondence between a plurality of attribute values and bitmap values is stored.
Optionally, the pre-stored attribute value-bitmap value correspondence table may be further obtained by:
First, an initial set of attribute values is obtained. The initial set of attribute values generally refers to a set of attribute values stored at a specified location. For example, stock information for product sales, { (red, large, a), (white, medium, B), (blue, small, C), (white, large, B) }.
Secondly, determining whether a bitmap value corresponding to the attribute value exists in an attribute value-bitmap value corresponding relation table for the attribute value in the attribute value set in the initial attribute value set group, generating a bitmap value matched with the attribute value in response to determining that the bitmap value corresponding to the attribute value does not exist in the attribute value-bitmap value corresponding relation table, and storing the generated bitmap value and the attribute value in the attribute value-bitmap value corresponding relation table; and modifying the bitmap value corresponding to the attribute value in response to determining that the bitmap value corresponding to the attribute value exists in the attribute value-bitmap value corresponding relation table.
In the second step, the method further includes: and marking the attribute value sets in the initial attribute value set group with serial numbers. The generating of the bitmap value in the second step described above refers to generating a bitmap value having a length equal to the number of elements in the initial attribute value set group. The position of the current sequence number of the bitmap value is set to be 1, and the bitmap value after setting is stored in the attribute value-bitmap value corresponding relation table. Modifying the bitmap value in response to determining that the bitmap value corresponding to the attribute value exists in the attribute value-bitmap value correspondence table, wherein the position of the current sequence number of the bitmap value is set to be 1
As an example, the initial attribute value set { (red, large, a), (white, medium, B), (blue, small, C), (white, large, B) } is subjected to the above steps, and finally an attribute value-bitmap value correspondence table { (red, 1000), (large, 1001), (a, 1000), (white, 0101), (medium, 0100), (B, 0101), (blue, 0010), (small, 0010), (C, 0010) } is obtained.
Step 203, generating result information based on the attribute value set and the acquired bitmap value set.
In some optional implementations of this embodiment, in response to determining that the number of elements of the attribute value set is the same as the number of elements of the bitmap value set, bitwise and processing bitmap values in the bitmap value set to generate result information characterizing a processing result.
The above bitwise and processing means bitwise and of bitmap values in the bitmap value set, and the bitmap value set is {1001,1010,0101}, and the bitwise and processing procedure is specifically 1001&1010&0101, i.e. 1001& 1010=1000, and then 1000& 0101=0, so that the processing result is 0. As yet another example, the bitmap value set is {1101,1110,0101}, the bitwise and process is specifically 1101&1110&0101, i.e. 1101& 1110=1100, then 1100& 0101=0100, so the result of the process is 0100. The processing result includes one of the following: 0, greater than 0. Wherein 0 indicates that the attribute value set does not exist, and a value greater than 0 indicates that the attribute value set exists. The result information includes one of: presence, absence.
In some optional implementations of the present embodiment, responsive to determining that the number of elements of the set of attribute values and the number of elements of the set of bitmap values are different, result information is generated that characterizes an absence of the set of attribute values. That is, if the number of elements is different, it is indicated that the attribute value set does not exist.
Step 204, pushing prompt information associated with the result information.
In this embodiment, the hint information associated with the result information may be hint information indicating whether the attribute value set exists in the initial attribute value set group, for example, hint information indicating that the attribute value set does not exist in the initial attribute value set group. The initial attribute set group is an initial attribute set group used to generate an attribute value-bitmap value correspondence table.
In some optional implementations of this embodiment, after step 202, the method may further include: in response to the acquisition failure, result information characterizing the acquisition failure is generated. The failure to acquire is also indicative of the absence of the set of attribute values from the set of initial sets of attribute values.
With further reference to fig. 3, fig. 3 is a schematic diagram of an application scenario 300 of the method for pushing information according to the present embodiment.
In the application scenario 300 of fig. 3, a server 302 providing background support for shopping class applications in a terminal device 301 may run a method for pushing information, comprising:
First, the server 302 may receive the attribute value set { white, large, a } transmitted by the terminal device 301. After that, the server 302 may acquire bitmap values corresponding to attribute values in the above-described attribute value sets { white, large, a } from the attribute value-bitmap value correspondence table { (white, 1001), (large, 1010), (a, 1100), (B, 1101) }. Wherein, the bitmap value corresponding to white is 1001, the bitmap value corresponding to large is 1010, and the bitmap value corresponding to a is 1100. Bitwise and processing is performed on bitmap values in the bitmap value set, namely 1001&1010& 1100=1000, the processing result is greater than 0, and the existence attribute value set { white, large, a } is pushed.
The method for pushing information in this embodiment receives the attribute value set through the server 302. After that, the server 302 may acquire bitmap values corresponding to the attribute values in the above-described attribute value set from the attribute value-bitmap value correspondence table stored in advance. Then, result information is generated based on the above-described attribute value set and the acquired bitmap value set. And finally, pushing prompt information associated with the result information. The method for pushing information in the embodiment enriches the judging modes of whether the information exists or not, generates the bitmap value through the bitmap algorithm, and then determines whether the designated attribute value set exists or not through the mode of searching the bitmap value, so that the complexity is reduced. Because the bit operation directly operates on the memory data, the memory data does not need to be converted into decimal, and the processing speed is very high. The attribute value-bitmap value corresponding relation table is generated through the initial attribute value set group, when whether a designated attribute value set exists in the initial attribute value set group is searched, whether the designated attribute value set exists or not can be determined only through searching the bitmap value and bit-wise AND processing, and the whole initial attribute value set group is not required to be traversed each time, so that the searching efficiency is improved. For the judgment scenario of the existence of a large number of attribute value sets, the resources and the memory space of a central processing unit (CPU, central Processing Unit) are saved. Contributing to lower hardware costs.
With further reference to fig. 4, a flow 400 of yet another embodiment of a method for pushing information is shown. The flow 400 of the method for pushing information comprises the steps of:
Step 401, a set of attribute values is received.
Step 402, obtaining a bitmap value corresponding to an attribute value in the attribute value set from a pre-stored attribute value-bitmap value correspondence table.
In step 403, in response to the acquisition failure, result information characterizing the acquisition failure is generated.
The failure to acquire characterizes that the set of attribute values does not exist in the initial set of attribute values.
Step 404, in response to determining that the number of elements of the attribute value set is the same as the number of elements of the bitmap value set, bitwise and processing the bitmap values in the bitmap value set to generate result information characterizing the processing result.
The bitwise and processing means bitwise and processing the bitmap values in the bitmap value set, for example, the bitmap value set is {1001,1010,0101}, and the bitwise and processing procedure is specifically 1001&1010&0101, that is, 1001& 1010=1000, and then 1000& 0101=0, so that the processing result is 0. For another example, the bitmap value set is {1101,1110,0101}, the bitwise and processing procedure is 1101&1110&0101, i.e. 1101& 1110=1100, and then 1100& 0101=0100, so that the processing result is 0100. The processing result can be known from the bitwise and processing procedure to include one of the following: 0, greater than 0. Wherein 0 indicates that the attribute value set does not exist, and a value greater than 0 indicates that the attribute value set exists. The result information includes one of: presence, absence.
Step 405, pushing prompt information associated with the result information.
In this embodiment, the specific operations of steps 401 to 402 and 405 are substantially the same as those of steps 201 to 202 and 204 in the embodiment shown in fig. 2, and will not be described herein.
Optionally, the pre-stored attribute value-bitmap value correspondence table may be further obtained by:
First, an initial set of attribute values is obtained. The initial set of attribute values generally refers to a set of attribute values stored at a specified location. May be stored locally on the executing entity or may be stored on a designated database server. For example, the initial set of attribute values is inventory information for product sales, { (red, large, A), (white, medium, B), (blue, small, C), (white, large, B) }.
Secondly, determining whether a bitmap value corresponding to the attribute value exists in an attribute value-bitmap value corresponding relation table for the attribute value in the attribute value set in the initial attribute value set group, generating a bitmap value matched with the attribute value in response to determining that the bitmap value corresponding to the attribute value does not exist in the attribute value-bitmap value corresponding relation table, and storing the generated bitmap value and the attribute value in the attribute value-bitmap value corresponding relation table; and modifying the bitmap value corresponding to the attribute value in response to determining that the bitmap value corresponding to the attribute value exists in the attribute value-bitmap value corresponding relation table.
In the second step, the method further includes: and marking the attribute value sets in the initial attribute value set group with serial numbers. The generating of the bitmap value in the second step described above refers to generating a bitmap value having a length equal to the number of elements in the initial attribute value set group. The position of the current sequence number of the bitmap value is set to be 1, and the bitmap value after setting is stored in the attribute value-bitmap value corresponding relation table. The modifying the bitmap value in response to determining that the bitmap value corresponding to the attribute value exists in the attribute value-bitmap value correspondence table refers to setting the position of the current sequence number of the bitmap value to 1. As an example, the initial attribute value set { (red, large, a), (white, medium, B), (blue, small, C), (white, large, B) } is subjected to the above steps, and finally an attribute value-bitmap value correspondence table { (red, 1000), (large, 1001), (a, 1000), (white, 0101), (medium, 0100), (B, 0101), (blue, 0010), (small, 0010), (C, 0010) } is obtained.
Optionally, if it is determined that the processing result of the bitwise and processing is greater than 0, that is, if the characterization result information exists, searching SKUs matched with the attribute value set from SKU (Stock Keeping Unit) corresponding to the initial attribute value set group, and outputting the searched SKUs in the minimum stock unit-initial attribute value list.
Here, SKU refers to the base unit of inventory in and out metering. SKU-the list of initial attribute values stores SKUs, attributes, and attribute values. The SKU corresponding to the set of attribute values may be obtained by traversing the SKU-initial list of attribute values. The SKU can then be sent to the communicatively coupled terminal for further processing by the terminal as desired.
As can be seen from fig. 4, compared with the embodiment corresponding to fig. 2, the flow 400 of the method for pushing information in this embodiment represents that when obtaining the bitmap value corresponding to the attribute value in the attribute value set fails, the result information indicating that the obtaining fails is generated. And a step of performing bitwise and processing on bitmap values in the bitmap value set to generate result information representing a processing result when the number of elements of the attribute value set is determined to be the same as the number of elements of the bitmap value set. Therefore, the scheme described in this embodiment can add the processing steps in the case of acquisition failure and the processing steps in the case of acquisition success on the basis of the embodiment shown in fig. 2, enrich the content of the result information, and thus help to improve the flexibility of information prompt.
With further reference to fig. 5, as an implementation of the method shown in the foregoing figures, the present application provides an embodiment of an apparatus for pushing information, where the embodiment of the apparatus corresponds to the embodiment of the method shown in fig. 2, and the apparatus may be specifically applied to various electronic devices.
As shown in fig. 5, the apparatus 500 for pushing information according to the present embodiment includes: a receiving unit 501 configured to receive a set of attribute values; an obtaining unit 502 configured to obtain bitmap values corresponding to attribute values in the attribute value set from a pre-stored attribute value-bitmap value correspondence table; a generating unit 503 configured to generate result information based on the above-described attribute value set and the acquired bitmap value set; and a pushing unit 504 configured to push the prompt information associated with the result information.
In some optional implementations of this embodiment, the generating unit includes: a generating subunit (not shown in fig. 5) configured to perform bitwise and processing on bitmap values in the bitmap value set in response to determining that the number of elements of the attribute value set is the same as the number of elements of the bitmap value set, and generate result information characterizing a result of the processing.
In some optional implementations of this embodiment, the apparatus further includes: a second generation unit (not shown in fig. 5) configured to generate, in response to the acquisition failure, result information characterizing the acquisition failure.
In some optional implementations of this embodiment, the pre-stored attribute value-bitmap value correspondence table is obtained by: acquiring an initial attribute value set group; for the attribute values in the attribute value set in the initial attribute value set group, determining whether a bitmap value corresponding to the attribute value exists in an attribute value-bitmap value corresponding relation table, generating a bitmap value matched with the attribute value in response to determining that the bitmap value corresponding to the attribute value does not exist in the attribute value-bitmap value corresponding relation table, and storing the generated bitmap value and the attribute value in the attribute value-bitmap value corresponding relation table; and modifying the bitmap value corresponding to the attribute value in response to determining that the bitmap value corresponding to the attribute value exists in the attribute value-bitmap value corresponding relation table.
The above-described embodiments of the present application provide an apparatus, the receiving unit 501 being configured to receive a set of attribute values. An obtaining unit 502 configured to obtain bitmap values corresponding to attribute values in the above-described attribute value set from a pre-stored attribute value-bitmap value correspondence table. The generating unit 503 is configured to generate result information based on the above-described attribute value set and the acquired bitmap value set. And a pushing unit 504 configured to push the prompt information associated with the result information. Thus, whether the designated attribute value set exists can be determined, and complexity is reduced. Because the bit operation directly operates on the memory data, the memory data does not need to be converted into decimal, and the processing speed is very high. Thereby contributing to an increase in the efficiency of the search.
Referring now to FIG. 6, there is illustrated a schematic diagram of a computer system 600 suitable for use with a server embodying embodiments of the present application. The server illustrated in fig. 6 is merely an example, and should not be construed as limiting the functionality and scope of use of embodiments of the present application.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU) 601, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other through a bus 604. An input/push (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, mouse, etc.; a push portion 607 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), etc., and a speaker, etc.; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The drive 610 is also connected to the I/O interface 605 as needed. Removable media 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed as needed on drive 610 so that a computer program read therefrom is installed as needed into storage section 608.
In particular, according to embodiments of the present disclosure, the processes described above with reference to 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 shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network through the communication portion 609, and/or installed from the removable medium 611. The above-described functions defined in the method of the present application are performed when the computer program is executed by a Central Processing Unit (CPU) 601.
The computer readable medium according to the present application may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any 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 context of this document, 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 the present application, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. 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: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowcharts 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 application. 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 involved in the embodiments of the present application may be implemented in software or in hardware. The described units may also be provided in a processor, for example, described as: a processor includes a receiving unit, an obtaining unit, a generating unit, and a pushing unit. Where the names of the units do not constitute a limitation of the unit itself in some cases, for example, a receiving unit may also be described as a "unit receiving a set of attribute values".
As another aspect, the present application also provides a computer-readable medium that may be contained in the server described in the above embodiment; or may exist alone without being assembled into the server. The computer readable medium carries one or more programs which, when executed by the server, cause the server to: receiving a set of attribute values; obtaining bitmap values corresponding to the attribute values in the attribute value set from a pre-stored attribute value-bitmap value correspondence table; generating result information based on the attribute value set and the obtained bitmap value set; pushing prompt information associated with the result information.
The above description is only illustrative of the preferred embodiments of the present application and of the principles of the technology employed. It will be appreciated by persons skilled in the art that the scope of the application referred to in the present application is not limited to the specific combinations of the technical features described above, but also covers other technical features formed by any combination of the technical features described above or their equivalents without departing from the inventive concept described above. Such as the above-mentioned features and the technical features disclosed in the present application (but not limited to) having similar functions are replaced with each other.