CN113420218A

Movatterモバイル変換

Info

Publication number: CN113420218A
Application number: CN202110735704.3A
Authority: CN
Inventors: 刘磊; 田奕; 张京; 刘枫
Original assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Current assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Priority date: 2021-06-30
Filing date: 2021-06-30
Publication date: 2021-09-21

Abstract

Translated fromChinese

本公开提供了一种信息匹配方法、装置、电子设备、计算机可读存储介质及计算机程序产品，涉及云平台、信息查询技术领域。该方法包括：响应于接收到新订单，确定新订单的发起方的身份信息；利用支持过期删除的位阵列数组查询器查询与身份信息对应的推广访问记录，位阵列数组查询器的每个位阵列采用值累加的方式表示被不同推广访问记录分别命中、采用值扣减的方式表示对应的推广访问记录被过期删除；响应于查询到与身份信息对应的推广访问记录，确定新订单匹配有相应的推广。该方法在订单‑推广匹配场景下借助支持过期删除的位阵列数组查询器来提升信息查询效率。

The present disclosure provides an information matching method, an apparatus, an electronic device, a computer-readable storage medium and a computer program product, and relates to the technical fields of cloud platforms and information query. The method includes: in response to receiving the new order, determining the identity information of the originator of the new order; querying the promotion access record corresponding to the identity information with a bit array array queryer that supports expired deletion, and each bit of the bit array array queryer The array adopts the value accumulation method to indicate that different promotion access records are hit respectively, and the value deduction method indicates that the corresponding promotion access records are expired and deleted; in response to the query of the promotion access records corresponding to the identity information, it is determined that the new order matches the corresponding promotion. In the order-promotion matching scenario, the method improves the information query efficiency with the help of a bit array queryer that supports expired deletion.

Description

Information matching method, device, equipment, storage medium and computer program product

Technical Field

The present disclosure relates to the field of data processing technologies, and in particular, to the field of cloud platforms and information query technologies, and in particular, to an information matching method and apparatus, an electronic device, a computer-readable storage medium, and a computer program product.

Background

In order to promote consumption, various commodities provide various online and offline sales channels, and various promotion ways exist in any sales channel, such as promotion by a specific salesperson, promotion by participation in a specific preferential event, and the like.

How to determine whether the actually initiated item order is generated by promotion is the basis for those skilled in the art to determine subsequent benefit allocation and adjust subsequent strategies, and is the focus of research.

Disclosure of Invention

The embodiment of the disclosure provides an information matching method, an information matching device, electronic equipment, a computer-readable storage medium and a computer program product.

In a first aspect, an embodiment of the present disclosure provides an information matching method, including: in response to receiving the new order, determining identity information of an initiator of the new order; inquiring popularization access records corresponding to the identity information by using a bit array querier supporting overdue deletion, wherein the bit array querier is composed of a plurality of different bits in an array form and corresponding values on each bit, each bit is respectively hit by different popularization access records in a value accumulation mode, and the corresponding popularization access records are deleted overdue in a value deduction mode; and responding to the inquiry of the promotion access record corresponding to the identity information, and determining that the new order is matched with the corresponding promotion.

In a second aspect, an embodiment of the present disclosure provides an information matching apparatus, including: an identity information determination unit configured to determine identity information of an originator of a new order in response to receiving the new order; the system comprises a promotion access record query unit, a data processing unit and a data processing unit, wherein the promotion access record query unit is configured to query a promotion access record corresponding to identity information by using a bit array querier supporting overdue deletion, the bit array querier is composed of a plurality of different bits in an array form and corresponding values on each bit, each bit represents that the promotion access record is hit by different promotion access records respectively in a value accumulation mode, and represents that the corresponding promotion access record is overdue deleted in a value deduction mode; the order matching promotion determining unit is configured to respond to the inquiry of the promotion access record corresponding to the identity information and determine that the new order matches the corresponding promotion.

In a third aspect, an embodiment of the present disclosure provides an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executable by the at least one processor to enable the at least one processor to implement the information matching method as described in any implementation manner of the first aspect when executed.

In a fourth aspect, the disclosed embodiments provide a non-transitory computer-readable storage medium storing computer instructions for enabling a computer to implement the information matching method as described in any implementation manner of the first aspect when executed.

In a fifth aspect, the present disclosure provides a computer program product including a computer program, which when executed by a processor is capable of implementing the information matching method as described in any implementation manner of the first aspect.

The information matching method provided by the embodiment of the disclosure includes the steps that firstly, when a new order is received, identity information of an initiator of the new order is determined; then, inquiring the promotion access records corresponding to the identity information by using a bit array querier supporting overdue deletion, wherein each bit array of the bit array querier represents that the promotion access records are hit by different promotion access records respectively in a value accumulation mode and represents that the corresponding promotion access records are overdue deleted in a value deduction mode; and finally, when the promotion access record corresponding to the identity information is inquired, determining that the new order is matched with corresponding promotion.

According to the method and the device, the promotion access information is recorded by utilizing the bit array querier, namely, the information query efficiency is improved by means of a bit array bitmap information recording mode provided by the bit array querier, and then a query result of whether an order hits promotion or not can be quickly obtained. Meanwhile, each bit array of the control bit array querier adopts a value accumulation mode to indicate that the control bit array querier is hit by different promotion access records respectively, and adopts a value deduction mode to indicate that the corresponding promotion access record is deleted due to overdue, so that the improved bit array querier supports the function of overdue deletion, and is more suitable for recording a large number of promotion access records which are determined whether to be associated with an order or not based on time effectiveness under an order-promotion matching scene.

It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.

Drawings

Other features, objects and advantages of the disclosure will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:

FIG. 1 is an exemplary system architecture to which the present disclosure may be applied;

fig. 2 is a flowchart of an information matching method provided in an embodiment of the present disclosure;

FIG. 3A, FIG. 3B, FIG. 3C, FIG. 3D are schematic diagrams illustrating the operation of a bit array interrogator supporting outdated erasure according to an embodiment of the present disclosure;

FIG. 4 is a flow chart of another information matching method provided by the embodiments of the present disclosure;

FIG. 5 is a flowchart of a method for adjusting allocation weights based on statistical results according to an embodiment of the present disclosure;

fig. 6 is a schematic flowchart of an order-promotion matching method according to an embodiment of the present disclosure;

fig. 7 is a block diagram of an information matching apparatus according to an embodiment of the present disclosure;

fig. 8 is a schematic structural diagram of an electronic device adapted to execute an information matching method according to an embodiment of the present disclosure.

Detailed Description

Exemplary embodiments of the present disclosure are described below with reference to the accompanying drawings, in which various details of the embodiments of the disclosure are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness. It should be noted that, in the present disclosure, the embodiments and features of the embodiments may be combined with each other without conflict.

In the technical scheme of the disclosure, the acquisition, storage, application and the like of the personal information of the related user all accord with the regulations of related laws and regulations, necessary security measures are taken, and the customs of the public order is not violated.

Fig. 1 illustrates anexemplary system architecture 100 to which embodiments of the information matching method, apparatus, electronic device, and computer-readable storage medium of the present disclosure may be applied.

As shown in fig. 1, thesystem architecture 100 may include

terminal devices

101, 102, 103, anetwork 104, and aserver 105. Thenetwork 104 serves as a medium for providing communication links between the

terminal devices

101, 102, 103 and theserver 105.Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use the

terminal devices

101, 102, 103 to interact with theserver 105 via thenetwork 104 to receive or send messages or the like. The

terminal devices

101, 102, 103 and theserver 105 may be installed with various applications for implementing information communication therebetween, such as an online shopping application, a promotion service hit application, an instant messaging application, and the like.

The

terminal apparatuses

101, 102, 103 and theserver 105 may be hardware or software. When the

terminal devices

101, 102, 103 are hardware, they may be various electronic devices with display screens, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like; when the

terminal devices

101, 102, and 103 are software, they may be installed in the electronic devices listed above, and they may be implemented as multiple software or software modules, or may be implemented as a single software or software module, and are not limited in this respect. When theserver 105 is hardware, it may be implemented as a distributed server cluster composed of multiple servers, or may be implemented as a single server; when the server is software, the server may be implemented as a plurality of software or software modules, or may be implemented as a single software or software module, which is not limited herein.

Theserver 105 may provide various services through various built-in applications, for example, a promotion service hit application that may provide analysis on whether an order hits a promotion may be provided, and when the promotion service hit application is run, theserver 105 may achieve the following effects: firstly, receiving a delivered new order from the

terminal equipment

101, 102 and 103 through thenetwork 104; then, determining identity information of an initiator of the new order; next, inquiring popularization access records corresponding to the identity information by using a bit array querier supporting overdue deletion, wherein each bit array of the bit array querier represents that the popularization access records are hit respectively by different popularization access records in a value accumulation mode, and represents that the corresponding popularization access records are overdue deleted in a value deduction mode; and finally, when the promotion access record corresponding to the identity information is inquired, determining that the new order is matched with corresponding promotion.

Note that the new order may be acquired from the

terminal apparatuses

101, 102, and 103 through thenetwork 104, or may be stored locally in theserver 105 in advance in various ways. Thus, when theserver 105 detects that such data is already stored locally (e.g., a pending order remaining before processing is started), it may choose to retrieve such data directly from locally, in which case theexemplary system architecture 100 may also not include the

terminal devices

101, 102, 103 and thenetwork 104.

Since the matching of the promotion access records requires that the historical promotion access records are recorded in advance, and at the same time, more computation resources and stronger computation capability are required to be occupied, the information matching method provided in the subsequent embodiments of the present disclosure is generally executed by theserver 105 which stores the promotion access records with history and has stronger computation capability and more computation resources, and accordingly, the information matching device is generally also disposed in theserver 105. However, it should be noted that when the

terminal devices

101, 102, and 103 also have computing capabilities and computing resources meeting the requirements, the

terminal devices

101, 102, and 103 may also complete the above-mentioned operations performed by theserver 105 through the promotion service hit application installed thereon, and then output the same result as theserver 105. Especially, when there are multiple terminal devices with different computation capabilities at the same time, but the terminal device where the promotion service hit application determines has stronger computation capability and more computation resources left, the terminal device may execute the above computation, so as to appropriately reduce the computation pressure of theserver 105, and accordingly, the information matching apparatus may also be disposed in the

terminal devices

101, 102, and 103. In such a case, theexemplary system architecture 100 may also not include theserver 105 and thenetwork 104.

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.

Referring to fig. 2, fig. 2 is a flowchart of an information matching method according to an embodiment of the disclosure, where theprocess 200 includes the following steps:

step 201: in response to receiving the new order, determining identity information of an initiator of the new order;

this step is intended to determine identity information of the originator of the received new order by the executing entity of the information matching method (e.g., theserver 105 shown in fig. 1).

Specifically, the identity information of the order initiator may be determined in a variety of ways, for example, an IP address used by the order initiator, a browser used by the order initiator, an application program, and a terminal device number may be used as the identity information of the order initiator, and at this time, the identity information represents not a specific user but a tool for completing order generation, that is, when such information is selected as the identity information, different users who respectively use the same tool may be used as candidate objects for receiving promotion; the account used by the user who creates the order to log in can also be used as the identity information of the initiator, and as one account can log in at different terminals and one account can also be used by a plurality of users to log in respectively, that is to say, the information is selected as the identity information, different users who use the same and good terminal tools and can be used as candidate objects for receiving popularization.

Step 202: inquiring a promotion access record corresponding to the identity information by using a bit array querier supporting overdue deletion;

the promotion access record is used for representing that the account or the terminal corresponding to the identity information accesses the information for promoting the articles in the new order at a certain historical time point, and the promotion access record is stored into a bit array forming a bit array querier, so that a bit array-based bitmap record querying mode is provided through the bit array querier.

In daily life, including when designing computer software, it is often determined whether an element is in a collection. For example, in word processing software, it is necessary to check whether an english word is spelled correctly (i.e., to determine whether it is in a known dictionary). The most straightforward approach is to store all the elements in the set in the computer and, when a new element is encountered, compare it directly with the elements in the set. Generally, collections in a computer are stored using a hash table (hash table). Its advantages are high speed and accuracy, and low cost of storage space. This problem is not significant when the set is small, but when the set is large, the problem of hash table storage inefficiency is manifested.

The bit array querier comprises a long binary vector and a series of random mapping functions, and is composed of a plurality of bits arranged according to an array and values on the bits, the values on the bits can form corresponding arrays according to the array arrangement mode of the bits, and the bit array querier can be used for searching whether an element is in a set or not, namely, the data storage mode of the bitmap is utilized to provide space efficiency and query time far exceeding those of a common algorithm.

In the order-promotion scenario addressed by the present application, a large amount of promotion access records and order information are to be stored, so the hash table is no longer suitable. Although the standard bit array querier provides space efficiency and query time far exceeding those of a general algorithm, the deletion of the standard bit array querier is difficult because in the standard bit array querier, although a plurality of information is allowed to hit a same bit array, each bit array has only two states of 0 or 1, wherein 0 represents that the value is null, and 1 represents that the value is not null, so that the standard bit array querier still causes the value of the same bit array to be 1 when a plurality of information hit the same bit array at the same time, and once some information is deleted, the deletion of the information causes the privately set value to be 0, thereby affecting the query of other information. Therefore, the standard bit array querier does not support deletion, and the information cannot be deleted in a scene in which massive data needs to be stored, so that the bit array querier needs to have more and more bits to sparsely store values of different information, the complexity of the querier is further improved, and the querier is not suitable for a scene with timeliness.

Aiming at the defects of the standard bit array querier and the timeliness scene of the application which needs to store massive historical access records, the bit array querier supporting overdue deletion is adopted, namely, on the basis of the standard bit array querier, each bit array is controlled to adopt a value accumulation mode to indicate that the corresponding promotion access record is hit by different promotion access records respectively and adopt a value deduction mode to indicate that the corresponding promotion access record is overdue deleted.

To further the understanding of the principles of how outdated deletes may be implemented,the application also shows the promotion access record D in four steps through figures 3A, 3B, 3C and 3D₁、D₂And D₃To demonstrate the working principle of the bit array interrogator through the processes of:

as shown in FIG. 3A, when promoted, access record D₁At the time of reporting, according to a random mapping function H₁、 H₂、H₃、H₄Bit B to be set in the bit array querier in the cache₁、B₃、B₅、B₈Setting the task to be 1, and simultaneously adding an overdue task with effective time of T into a scheduling system; as shown in FIG. 3B, when promoted, access record D₂At the time of reporting, according to a random mapping function H₁、H₂、H₃、H₄Bit B of bit array querier to be set in cache₁、B₃、B₄、B₆Is set to 1 due to B₁、 B₃The existing value is added with 1 (i.e. the step size of each accumulation is 1 for example) on the basis of the original value; similarly, as shown in FIG. 3C, when the record D is accessed for promotion₃When reporting, updating B in the cache₃、B₅、B₆、 B₈A value; as shown in FIG. 3D, after a time T has elapsed, a promotion access record D is generated₁Expired, dispatch system notifies D by calling a promotion service₁When the data is overdue, the popularization system calculates the corresponding position B according to the random mapping function₁、B₃、B₅、B₈And the value in these bits is decremented by 1.

On the basis ofstep 201, this step aims to implement, by the execution subject, a query on a promotion access record corresponding to identity information through a bit array querier supporting outdated deletion.

An implementation, including and not limited to, may be disassembled into:

calculating a target index value corresponding to the target identity information by using a bit array querier;

the value of the position indicated by the target index value is searched from the bit array of the bit array querier.

Step 203: and responding to the inquiry of the promotion access record corresponding to the identity information, and determining that the new order is matched with the corresponding promotion.

On the basis ofstep 202, in this step, the executing entity determines that the new order matches the corresponding promotion on the basis of querying the promotion access record corresponding to the identity information, or the new order hits the promotion. It can be understood that: the reason for the new order being generated is associated with the receipt of the promotion before the order originator.

In the example provided in fig. 3A, 3B, 3C, 3D, this step may be embodied as: and in response to the value of the position indicated by the target index value being not less than 1, determining that the new order is matched with the corresponding promotion. This is because in the bit array querier supporting outdated deletion adopted in the present application, a certain bit will be continuously accumulated with 1 as a fixed step length because of being hit by different promotion access records respectively, and generally, one promotion access record determines whether the certain bit exists or not by querying the values of a plurality of bits, so as long as the values of all the corresponding bits are not less than 1, the promotion access information can be determined to exist from the values in the certain bit that are certainly different from the values in the certain bit constituting other promotion access records.

According to the information matching method provided by the embodiment of the disclosure, the promotion access information is recorded by using the bit array interrogator, namely, by means of a bit array bitmap information recording mode provided by the bit array interrogator, the information query efficiency is improved, and then a query result of whether an order hits promotion or not can be quickly obtained. Meanwhile, each bit array of the control bit array querier adopts a value accumulation mode to indicate that the control bit array querier is hit by different promotion access records respectively, and adopts a value deduction mode to indicate that the corresponding promotion access record is deleted due to overdue, so that the improved bit array querier supports the function of overdue deletion, and is more suitable for recording a large number of promotion access records which are determined whether to be associated with an order or not based on time effectiveness under an order-promotion matching scene.

Referring to fig. 4, fig. 4 is a flowchart of another information matching method according to an embodiment of the disclosure, where theprocess 400 includes the following steps:

step 401: determining a creation terminal of the new order according to the creation information of the new order;

step 402: taking terminal identity information of the created terminal as identity information of an initiator;

in this embodiment, throughsteps 401 to 402, an implementation manner is specifically provided in which the terminal identity information of the creation terminal of the new order is used as the identity information of the initiator, and then the promotion sent to the creation terminal is associated and matched with the order generated by the creation terminal later.

Step 403: querying a promotion access record corresponding to the identity information by using a first bit array querier;

the first bit array querier is a bit array querier supporting outdated deletes set in a cache.

Step 404: judging whether a corresponding promotion access record is inquired by the first bit array querier, if so, executingstep 407, otherwise, executingstep 405;

step 405: querying a promotion access record corresponding to the identity information by using a second bit array querier;

the second bit array querier is a bit array querier disposed in persistent storage that supports outdated deletes, such as a bit array querier disposed in a database.

Step 406: judging whether a corresponding promotion access record is inquired through a second bit array querier, if so, executingstep 407, otherwise, executingstep 408;

step 407: determining that the new order is matched with corresponding promotion;

this step is established on the basis that the query result ofstep 403 is the query result or the query result ofstep 406 is the query result, that is, the promotion access record corresponding to the identity information is actually queried in the first bit array querier or the second bit array querier, so that it can be determined that the new order matches with the corresponding promotion. It should be noted that, if the first bit array interrogator does not query in the first bit array interrogator and the second bit array interrogator queries in the second bit array interrogator, it is indicated that the promotion access record of the first bit array interrogator, which is initially stored in the cache, is no longer recorded in the cache due to the fact that the cache storage term is exceeded or the cache is cleared due to power failure.

Step 408: and determining that the new order does not match the corresponding promotion.

This step is based on the result of the query instep 406 being not queried, i.e. not only not queried in the first bit array querier set in the cache, but also not queried in the second bit array querier set in the persistent storage, so that it can be determined that the new order is not matched with the corresponding promotion. I.e., the new order was generated without having contacted the promotion for the corresponding order item, or the corresponding promotion was received far beyond the time limit associated with the time limit at which the promotion was deemed to have resulted in the order being generated, e.g., 15 or 30 days.

On the basis of the embodiment shown in theflow 200, the embodiment provides a specific implementation manner that the identity information of the creation terminal is used as the identity information of the initiator throughsteps 401 to 402 forstep 201; the query mode sequentially performed in the cache and the persistent storage is given throughsteps 403 to 408 forsteps 202 to 203, so that the query efficiency is improved as much as possible.

It should be understood that there is no dependency or causal relationship between the specific implementations provided insteps 401 to 402 andsteps 403 to 408, that is, the application of each specific implementation does not need to depend on or require another part to also use the corresponding specific implementation, and the two parts of specific implementations may be completely and separately combined with theprocess 200 to form different embodiments in a manner of replacing the upper implementation in theprocess 200, and this embodiment exists only as a preferred embodiment that includes both parts of specific implementations.

In some embodiments of the present application, the identity information of the initiator may also be determined by:

determining a user account for creating the new order according to the creation information of the new order;

and taking account identity information corresponding to the user account as identity information of the initiator.

That is, the above implementation manner is another scheme that differs from theprocess 400, in which the identity of the creation terminal is used as the identity information, that is, account information used for login is used as the identity information of the initiator.

The specific choice of the material is flexibly selected according to the actual situation, and is not specifically limited herein.

On the basis of any of the above embodiments, the present embodiment provides a method for adjusting distribution proportion based on statistical results through fig. 5 for an order determined to have matching promotion, where theprocess 500 includes the following steps:

step 501: determining a promotion mode to which promotion matched with the order belongs;

the promotion mode can include: the method comprises the following steps of character popularization, video popularization, activity popularization and introduction popularization, wherein each analogy of the popularization mode is combined with a specific implementation mode, the popularization mode can be subdivided into a plurality of subclasses, the video popularization is taken as an example, the popularization mode can be subdivided into popular science video popularization, entertainment video popularization, activity video popularization and the like.

Step 502: counting the distribution conditions of different promotion modes corresponding to the same article according to a period;

i.e. to determine by statistical means which promotional ways are most effective in generating an order for the item.

Step 503: and adjusting the distribution proportion of different popularization modes of the same type of articles according to the distribution condition.

On the basis ofstep 502, in this step, the execution main body adjusts the distribution proportion of different promotion modes of the same type of articles according to the distribution condition, so as to obtain more orders by adjusting the subsequent distribution proportion, and improve the conversion ratio between promotion and orders.

In order to deepen understanding, the present disclosure is further combined with a specific application scenario shown in fig. 6, based on an improved bit array querier supporting overdue deletion, the present embodiment provides an order hit promotion detection scheme, so that effective resources are efficiently and reasonably utilized by the scheme, whether an order hits promotion is rapidly detected by combining a cache and a database, and when an order hits promotion, promotion information can be transmitted back to a downstream system, which is specifically applied to calculating a delivery condition of a traffic master.

Next, a bringing process in a bringing scene according to the present embodiment will be described first, a storage manner and an update process of promotion information in a cache will be described, and finally an order hit promotion and promotion information return process will be described.

As shown in fig. 6, the data flow direction in the whole cargo carrying process is mainly divided into two steps, namely, reporting of promotion information and checking whether an order hits the promotion process; when browsing the contents such as pictures, texts, videos and the like, the user skips to the corresponding commodity detail page through guidance, and reports the promotion access record to the promotion service based on the small program dynamic library, and the promotion service updates the cache and the database; after the user finishes purchasing on the commodity detail page, the order system inquires the promotion service to determine whether the order hits promotion, the promotion service determines whether the order hits promotion through inquiring the cache, and if yes, corresponding promotion data are obtained from the database and returned to the order service.

The promotion access records are stored in the cache and updated as follows:

when the dynamic library reports the promotion record, based on the improved bit array querier, the promotion information is stored in a plurality of bits in the cache by using a series of random mapping functions, as shown in fig. 3A, when the promotion access record D₁At the time of reporting, according to a random mapping function H₁、H₂、H₃、H₄Bit B to be set in the bit array querier in the cache₁、B₃、B₅、B₈Setting the task to be 1, and simultaneously adding an overdue task with effective time of T into a scheduling system; as shown in FIG. 3B, when promoted, access record D₂At the time of reporting, according to a random mapping function H₁、H₂、H₃、H₄Bit B of bit array querier to be set in cache₁、B₃、B₄、B₆Is set to 1 due to B₁、B₃The existing value is in theoriginalIncreasing 1 on the basis of the value (i.e. taking the step size of each accumulation as 1 as an example); similarly, as shown in FIG. 3C, when the record D is accessed for promotion₃When reporting, updating B in the cache₃、B₅、B₆、B₈A value; as shown in FIG. 3D, after a time T has elapsed, a promotion access record D is generated₁Expired, dispatch system notifies D by calling a promotion service₁When the data is overdue, the popularization system calculates the corresponding position B according to the random mapping function₁、B₃、 B₅、B₈And the value in these bits is decremented by 1.

Order hit promotion and promotion information return flow:

when the order service calls a promotion service to obtain order promotion information, the promotion service firstly obtains the position of the order corresponding to the promotion information according to a random mapping function, and inquires whether the position of the position has a value or not in a cache, if all the positions have values not less than 1, the order is shown to be promoted, and then the corresponding promotion information is obtained from a database according to corresponding information and the order service is returned; if no value exists, the order is not hit for promotion, and the order is directly returned to the order service.

With further reference to fig. 7, as an implementation of the methods shown in the above-mentioned figures, the present disclosure provides an embodiment of an information matching apparatus, which corresponds to the method embodiment shown in fig. 2, and which can be applied in various electronic devices.

As shown in fig. 7, theinformation matching apparatus 700 of the present embodiment may include: an identityinformation determining unit 701, a promotion accessrecord inquiring unit 702 and an order matchingpromotion determining unit 703. Wherein, the identityinformation determining unit 701 is configured to determine, in response to receiving a new order, identity information of an initiator of the new order; a promotion accessrecord query unit 702 configured to query a promotion access record corresponding to the identity information by using a bit array interrogator supporting overdue deletion, where the bit array interrogator is composed of a plurality of different bits in an array form and corresponding values on each bit, and each bit represents that the promotion access record is hit by different promotion access records respectively in a value accumulation manner and represents that the corresponding promotion access record is overdue deleted in a value deduction manner; the order matchingpromotion determination unit 703 is configured to determine that the new order matches a corresponding promotion in response to querying the promotion access record corresponding to the identity information.

In the present embodiment, in the information matching apparatus 700: the specific processing and the technical effects thereof performed by the identityinformation determining unit 701, the promotion accessrecord querying unit 702, and the order matchingpromotion determining unit 703 can refer to the related descriptions ofstep 201 and step 203 in the corresponding embodiment of fig. 2, which are not described herein again.

In some optional implementations of this embodiment, the identityinformation determining unit 701 may be further configured to:

determining a creation terminal of the new order according to the creation information of the new order;

and taking the terminal identity information of the created terminal as the identity information of the initiator.

In some optional implementations of this embodiment, the promotional accessrecord querying unit 702 may be further configured to:

inquiring a promotion access record corresponding to the identity information by using a first bit array querier, wherein the first bit array querier is a bit array querier which is arranged in a cache and supports overdue deletion;

responding to the situation that the promotion access record corresponding to the identity information is not inquired by the first bit array querier, and inquiring the promotion access record corresponding to the identity information by using a second bit array querier, wherein the second bit array querier is a bit array querier which is arranged in persistent storage and supports overdue deletion;

correspondingly, the order matchingpromotion determination unit 703 may be further configured to:

and responding to the promotion access record corresponding to the identity information inquired by the first bit array querier or the second bit array querier, and determining that the new order is matched with the corresponding promotion.

searching a value of a position indicated by a target index value from a bit array of a bit array querier;

and in response to the value of the position indicated by the target index value being not less than 1, determining that the new order is matched with the corresponding promotion.

In some optional implementations of this embodiment, theinformation matching apparatus 700 may further include:

a promotion mode determination unit configured to determine a promotion mode to which a promotion matched with the order belongs;

the popularization mode distribution statistical unit is configured to periodically count distribution conditions of different popularization modes corresponding to the same article;

and the distribution proportion adjusting unit is configured to adjust the distribution proportions of different promotion modes of the same type of articles according to the distribution condition.

The information matching device provided in this embodiment records promotion access information by using the bit array querier, that is, by using the bit array bitmap information recording manner provided by the bit array querier, the information querying efficiency is improved, and further, the querying result of whether the order hits the promotion can be quickly obtained. Meanwhile, each bit array of the control bit array querier adopts a value accumulation mode to indicate that the control bit array querier is hit by different promotion access records respectively, and adopts a value deduction mode to indicate that the corresponding promotion access record is deleted due to overdue, so that the improved bit array querier supports the function of overdue deletion, and is more suitable for recording a large number of promotion access records which are determined whether to be associated with an order or not based on time effectiveness under an order-promotion matching scene.

According to an embodiment of the present disclosure, the present disclosure also provides an electronic device including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executable by the at least one processor to enable the at least one processor to implement the information matching method described in any of the above embodiments when executed.

According to an embodiment of the present disclosure, the present disclosure further provides a readable storage medium storing computer instructions for enabling a computer to implement the information matching method described in any of the above embodiments when executed.

The embodiments of the present disclosure provide a computer program product, which when executed by a processor can implement the information matching method described in any of the embodiments above.

FIG. 8 illustrates a schematic block diagram of an exampleelectronic device 800 that can be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the disclosure described and/or claimed herein.

As shown in fig. 8, theapparatus 800 includes acomputing unit 801 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM)802 or a computer program loaded from astorage unit 808 into a Random Access Memory (RAM) 803. In theRAM 803, various programs and data required for the operation of thedevice 800 can also be stored. Thecalculation unit 801, theROM 802, and theRAM 803 are connected to each other by abus 804. An input/output (I/O)interface 805 is also connected tobus 804.

A number of components in thedevice 800 are connected to the I/O interface 805, including: aninput unit 806, such as a keyboard, a mouse, or the like; anoutput unit 807 such as various types of displays, speakers, and the like; astorage unit 808, such as a magnetic disk, optical disk, or the like; and acommunication unit 809 such as a network card, modem, wireless communication transceiver, etc. Thecommunication unit 809 allows thedevice 800 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.

Computing unit 801 may be a variety of general and/or special purpose processing components with processing and computing capabilities. Some examples of thecomputing unit 801 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, and the like. Thecalculation unit 801 executes the respective methods and processes described above, such as the information matching method. For example, in some embodiments, the information matching method may be implemented as a computer software program tangibly embodied in a machine-readable medium, such asstorage unit 808. In some embodiments, part or all of the computer program can be loaded and/or installed ontodevice 800 viaROM 802 and/orcommunications unit 809. When loaded intoRAM 803 and executed by computingunit 801, a computer program may perform one or more of the steps of the information matching method described above. Alternatively, in other embodiments, thecomputing unit 801 may be configured to perform the information matching method in any other suitable manner (e.g., by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), system on a chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

Program code for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by the processor or controller, cause the functions/operations specified in the flowchart and/or block diagram to be performed. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on 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.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.

The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The Server may be a cloud Server, which is also called a cloud computing Server or a cloud host, and is a host product in a cloud computing service system, so as to solve the defects of high management difficulty and weak service extensibility in the conventional physical host and Virtual Private Server (VPS) service.

According to the technical scheme of the embodiment of the disclosure, the promotion access information is recorded by using the bit array querier, namely, the information query efficiency is improved by means of a bit array bitmap information recording mode provided by the bit array querier, and then a query result of whether an order hits promotion or not can be quickly obtained. Meanwhile, each bit array of the control bit array querier adopts a value accumulation mode to indicate that the control bit array querier is hit by different promotion access records respectively, and adopts a value deduction mode to indicate that the corresponding promotion access record is deleted due to overdue, so that the improved bit array querier supports the function of overdue deletion, and is more suitable for recording a large number of promotion access records which are determined whether to be associated with an order or not based on time effectiveness under an order-promotion matching scene.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present disclosure may be executed in parallel, sequentially, or in different orders, as long as the desired results of the technical solutions disclosed in the present disclosure can be achieved, and the present disclosure is not limited herein.

The above detailed description should not be construed as limiting the scope of the disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present disclosure should be included in the scope of protection of the present disclosure.

Claims

1. An information matching method, comprising:

in response to receiving a new order, determining identity information of an initiator of the new order;

inquiring the promotion access record corresponding to the identity information by using a bit array querier supporting overdue deletion, wherein the bit array querier is composed of a plurality of different bits in an array form and corresponding values on each bit, and each bit represents that the promotion access record is hit by different promotion access records respectively in a value accumulation mode and represents that the corresponding promotion access record is overdue deleted in a value deduction mode;

and responding to the inquiry of the promotion access record corresponding to the identity information, and determining that the new order is matched with corresponding promotion.

2. The method of claim 1, wherein the determining identity information of the originator of the new order comprises:

and taking the terminal identity information of the creation terminal as the identity information of the initiator.

3. The method of claim 1, wherein the determining identity information of the originator of the new order comprises:

4. The method of claim 1, wherein the querying, with a bit array querier supporting stale deletion, for a promotional access record corresponding to the identity information comprises:

responding to the situation that a promotion access record corresponding to the identity information is not inquired by the first bit array querier, and inquiring the promotion access record corresponding to the identity information by using a second bit array querier, wherein the second bit array querier is a bit array querier which is arranged in persistent storage and supports outdated deletion;

correspondingly, the responding to the inquiry of the promotion access record corresponding to the identity information and determining that the new order matches with the corresponding promotion comprises:

and responding to the promotion access record corresponding to the identity information queried by the first bit array querier or the second bit array querier, and determining that the new order is matched with corresponding promotion.

5. The method of claim 1, wherein the querying, with a bit array querier supporting stale deletion, for a promotional access record corresponding to the identity information comprises:

calculating a target index value corresponding to the target identity information by using the bit array querier;

searching a bit array of the bit array querier for a value of a location indicated by the target index value;

and determining that the new order is matched with corresponding promotion in response to the fact that the value of the position indicated by the target index value is not less than 1.

6. The method of any of claims 1-5, further comprising:

determining a promotion mode to which promotion matched with the order belongs;

counting the distribution conditions of different promotion modes corresponding to the same article according to a period;

and adjusting the distribution proportion of different popularization modes of the same type of articles according to the distribution condition.

7. An information matching apparatus comprising:

an identity information determination unit configured to determine identity information of an initiator of a new order in response to receiving the new order;

the system comprises a promotion access record query unit, a promotion access record processing unit and a promotion access record processing unit, wherein the promotion access record query unit is configured to query a promotion access record corresponding to the identity information by using a bit array querier supporting overdue deletion, the bit array querier is composed of a plurality of different bits in an array form and corresponding values on each bit, each bit represents that the promotion access record is hit by different promotion access records respectively in a value accumulation mode, and represents that the corresponding promotion access record is overdue deleted in a value deduction mode;

and the order matching promotion determining unit is configured to respond to the inquiry of the promotion access record corresponding to the identity information and determine that the new order matches the corresponding promotion.

8. The apparatus of claim 7, wherein the identity information determination unit is further configured to:

9. The apparatus of claim 7, wherein the identity information determination unit is further configured to:

10. The apparatus of claim 7, wherein the promotional access record querying unit is further configured to:

correspondingly, the order matching promotion determination unit is further configured to:

11. The apparatus of claim 7, wherein the promotional access record querying unit is further configured to:

12. The apparatus of any of claims 7-11, further comprising:

13. An electronic device, comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the information matching method of any one of claims 1-6.

14. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to execute the information matching method of any one of claims 1 to 6.

15. A computer program product comprising a computer program which, when executed by a processor, implements an information matching method according to any one of claims 1-6.