A method and device for processing access request

Abstract

The present invention discloses a method and device for processing access requests, and relates to the field of computer technology. A specific implementation of the method includes: receiving one or more access requests, wherein the access request indicates user information and access time; determining the number of accesses corresponding to the one or more access requests according to the user information; sorting the user information according to the user information, the number of accesses and / or the access time; and selecting access requests with the same number as the target number from the one or more access requests for processing according to the sorting result. This implementation can ensure that access requests with higher user levels, more recent access times and / or more access times can be processed first, which is conducive to improving user stickiness.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method and device for processing an access request. Background Art

[0002] In e-commerce systems, promotions are usually used to attract new users and maintain old users. Each promotional activity will inevitably lead to a surge in instantaneous access traffic and high concurrent access to the e-commerce system. When the traffic is about to reach the preset threshold, in order to control the access volume, user level restrictions and traffic control will be used to ensure the smooth operation of the e-commerce system.

[0003] In the case of controlling the access volume, the prior art generally determines the target access request that can be responded to according to the order in which the access requests are received within a preset time period.

[0004] In the process of implementing the present invention, the inventors found that there are at least the following problems in the prior art:

[0005] In order to buy a promotional product, a user visits the e-commerce platform several times before the promotion starts. However, due to network problems or limitations of the terminal device, the user's request is sent later in the preset time period and the purchase fails. This greatly reduces the user's enthusiasm for purchase and reduces user stickiness. Summary of the invention

[0006] In view of this, an embodiment of the present invention provides an access request processing method and device, which can determine the processing order of access requests based on factors such as user information, number of visits and / or access time when an e-commerce system has high concurrent requests, thereby ensuring that access requests with higher user levels, more recent access times and / or more access times can be processed first, thereby helping to improve user stickiness.

[0007] To achieve the above object, according to one aspect of an embodiment of the present invention, a method for processing an access request is provided, comprising:

[0008] receiving one or more access requests, wherein the access request indicates user information and access time;

[0009] Determine, according to the user information, the number of accesses corresponding to the one or more access requests;

[0010] Sorting the user information according to the user information, the number of visits and / or the visit time;

[0011] According to the sorting result, access requests having the same number as the target quantity are selected from the one or more access requests for processing.

[0012] Optionally, the sorting the user information includes:

[0013] storing each of the access requests in a first queue according to the access time, so that the access request with the latest access time is at the head of the first queue;

[0014] When the access times of the access requests in the first queue are greater than a preset threshold, the access requests whose access times are greater than the preset threshold are extracted from the first queue, and the extracted access requests are stored in the second queue.

[0015] Optionally,

[0016] When receiving the first current access request,

[0017] Determine whether there is a target access request in the second queue, and the target access request corresponds to the same user information as the first current access request; if so, place the first current access request at the head of the second queue and increment the access count of the first current access request.

[0018] Optionally, when the second queue does not include the target access request, the method further includes:

[0019] Determine whether the target access request exists in the first queue; if so, replace the target access request in the first queue with the first current access request, place the first current access request at the head of the first queue, and increment the access count of the first current access request.

[0020] Optionally, the other access requests except the head in the second queue are sorted according to access time and / or access count;

[0021] Optionally, other access requests except the head in the first queue are sorted according to access time and / or access count.

[0022] Optionally, the sorting the user information includes:

[0023] When receiving the second current access request,

[0024] determining, according to the user information corresponding to the second current access request, an access level corresponding to the user information;

[0025] Determine whether the access level meets a preset condition, if yes, process the second current access request, if no, store the second current access request in a third queue.

[0026] Optionally, storing the second current access request in a third queue comprises:

[0027] determining whether there is a target access request in the second queue, the target access request and the second current access request corresponding to the same user information;

[0028] If yes, determining a storage position of the second current access request in the third queue according to the access count of the second current access request, and storing the second current access request in the third queue according to the storage position, so that the access requests in the third queue are sorted according to the access count, wherein the access request with the largest access count is located at the head of the third queue;

[0029] If not, the second current access request is stored at the tail of the third queue.

[0030] Optionally, selecting access requests having the same number as the target number for processing includes:

[0031] From the third queue, access requests having the same number as the target quantity are selected for processing in order from the head to the tail.

[0032] Optionally, the method further comprises:

[0033] The target quantity is related to the inventory of the target item and / or the performance of a system for processing the access request.

[0034] According to a second aspect of an embodiment of the present invention, there is provided an access request processing device, comprising: a receiving module, a sorting module and a processing module; wherein:

[0035] The receiving module is used to receive one or more access requests, wherein the access request indicates user information and access time;

[0036] The sorting module is used to determine the number of accesses corresponding to the one or more access requests according to the user information; and sort the user information according to the user information, the number of accesses and / or the access time;

[0037] The processing module is used to select access requests with the same number as the target quantity from the one or more access requests for processing according to the sorting result.

[0038] According to a third aspect of an embodiment of the present invention, a server is provided, including:

[0039] one or more processors;

[0040] a storage device for storing one or more programs,

[0041] When the one or more programs are executed by the one or more processors, the one or more processors implement any method described in the access request processing method provided in the first aspect above.

[0042] According to a fourth aspect of an embodiment of the present invention, a computer-readable medium is provided, on which a computer program is stored. When the program is executed by a processor, any method in the access request processing method provided in the first aspect is implemented.

[0043] One embodiment of the above invention has the following advantages or beneficial effects: it can determine the processing order of access requests based on factors such as user information, number of visits and / or access time when the e-commerce system has high concurrent requests, ensuring that access requests with higher user levels, more recent access times and / or more access times can be processed first, which is beneficial to improving user stickiness.

[0044] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with the specific implementation manner. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.

[0046] Figure 1 is a schematic diagram of the main flow of the method for processing an access request according to an embodiment of the present invention;

[0047] Figure 2 It is a schematic diagram of the sorting of the first queue;

[0048] Figure 3 is a schematic diagram of the sorting of the second queue;

[0049] Figure 4 is a schematic diagram of the third queue sorting;

[0050] Figure 5 is a schematic diagram of main modules of an apparatus for processing access requests according to an embodiment of the present invention;

[0051] Figure 6 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;

[0052] Figure 7 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION

[0053] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0054] like Figure 1 As shown, according to an embodiment of the present invention, a method for processing an access request may include the following steps S101 to S104:

[0055] Step S101: receiving one or more access requests, wherein the access request indicates user information and access time;

[0056] Step S102: determining the number of accesses corresponding to the one or more access requests respectively according to the user information;

[0057] In one embodiment of the present invention, the user information includes a user identifier (such as a user name and a mobile phone number, etc.) and a user level. In the embodiment of the present invention, users can be divided into high-level users and low-level users. For example, high-level users are member users, and low-level users are non-member users; or, high-level users are those whose consumption amount in the past period of time (such as one month) reaches a certain limit, and low-level users are those whose consumption amount in the past period of time (such as one month) is less than a certain limit; for another example, high-level users are those whose number of visits in the past period of time (such as one month) exceeds a certain number of times, and low-level users are those whose number of visits in the past period of time (such as one month) is less than a certain number of times; of course, the above-mentioned level judgment conditions can also be used in combination, for example, when the consumption amount of a member user in the past period of time reaches a certain limit and the number of visits exceeds a certain number of times, he is determined to be a high-level user, otherwise he is a low-level user.

[0058] For example, in a certain rush-buying activity, the rush-buying platform stipulates that users who have spent 500 yuan in the past month or have visited the platform more than 15 times in the past month are considered high-level users. If a user is a member of the platform, then regardless of whether the user has spent 500 yuan in the past month or has visited the platform more than 15 times in the past month, the user will be considered a high-level user. For another example, if the user's information shows that the user is not a member of the platform, then if the user meets any one of the conditions of spending more than 500 yuan in the past month and visiting the platform more than 15 times in the past month, the user will be considered a high-level user, otherwise, the user will be considered a low-level user.

[0059] Specifically, when a second current access request is received, the access level corresponding to the user information is determined based on the user information corresponding to the second current access request; it is determined whether the access level meets the preset conditions, if so, the second current access request is processed, if not, the second current access request is stored in the third queue.

[0060] For example, when the access request is an order request for a promotion activity, the second current access request may be an order request received after the promotion activity starts (corresponding to the target time). Taking a certain access request of user A as an example, according to his user information, user A is a member user, is identified as a high-level user, and has priority access rights. Then the access request of user A is directly processed without entering the third queue for sorting.

[0061] For example, take a request from user B. According to his user information, user B is a non-member user, but he spent more than 500 yuan on the platform last month, and is also identified as a high-level user with priority access. Then the request is processed directly without entering the third queue for sorting.

[0062] For another example, take a certain access request of user C as an example. According to his user information, user C is a non-member user, and his purchase amount on the platform last month does not exceed 500 yuan, and the number of times he visited the platform last month does not exceed 15 times, so he is identified as a low-level user. User C needs to be placed in the third queue for sorting to determine whether C will obtain the right to purchase the snap-up product. The implementation method of sorting users in the third queue will be described in detail in the following embodiments.

[0063] Step S103: sorting the user information according to the user information, access times and / or access time;

[0064] In one embodiment of the present invention, the sorting of the user information includes: storing each of the access requests in a first queue according to the access time, so that the access request with the latest access time is at the head of the first queue, and the other access requests in the first queue except the head are sorted according to the access time and / or the number of accesses; when the number of accesses of the access requests in the first queue is greater than a preset threshold, extracting the access requests with the number of accesses greater than the preset threshold from the first queue, and storing the extracted access requests in a second queue. The lengths of the first queue and the second queue can be obtained according to the configuration file.

[0065] Specifically, during the sorting process, the most recent access request is placed at the head of the first queue, and the number of accesses (value) corresponding to the current user information (pin) is recorded as 1. If an old user who already exists in the first queue continues to access, the user is placed at the head of the first queue, and the value corresponding to the pin value of the user is increased by 1, thereby ensuring that the most recently accessed user in the first queue is always at the head. In addition, user information that exceeds the preset length of the first queue needs to be discarded, and users that exceed the preset value exit from the first queue and join the second queue.

[0066] For example, a sorting process such as Figure 2 As shown, the preset length of the first queue is 3, and the preset threshold (preset threshold) for entering the second queue is 3. When user A makes the first request, it is placed at the head of the queue and counted as 1. Subsequently, user B accesses. Since the access time of user B is closer to the current time, in order to make the access request with the latest access time at the head of the first queue, B's access request is placed at the head of the queue and counted as 1. At this time, A becomes the preceding node of B, and B becomes the following node of A. Then, user C accesses, and the operation is the same as the above. At this time, A has reached the end of the first queue. When user D requests, it is placed at the head of the first queue because its access time is the latest, and A needs to be discarded because it exceeds the length of the first queue. When C requests again, the value corresponding to C is increased by one, and it is placed at the head of the first queue, that is, C2 is placed at the head of the first queue. Similarly, when E requests, it is placed at the head, and the value corresponding to E is increased by 1. At this time, since B exceeds the queue length, B is discarded. When C requests for the third time, the value corresponding to C is increased by one. At this time, the number of accesses of C reaches the preset threshold of the second queue, that is, the number of accesses of C is greater than the preset threshold, and C is extracted from the first queue and moved to the second queue. Through the sorting method in the first queue, it can be ensured that each access request is restricted according to the access time, so as to ensure that the access request with the most recent access time is the one that is processed first.

[0067] In addition, the embodiment of the present invention can further determine the access request to be prioritized based on the number of access times. Specifically, when a first current access request is received, it is determined whether there is a target access request in the second queue, and the target access request corresponds to the same user information as the first current access request; if so, the first current access request is placed at the head of the second queue, and the number of access times of the first current access request is incremented.

[0068] For example, when the access request is an order request for a certain promotion activity, the first current access request may be an order request received before the promotion activity starts (corresponding to the target time). Thus, before the promotion activity starts, multiple access requests can be sorted according to the access time and access count of the access requests. After the promotion activity starts, the storage location of the access request in the third queue (hit queue) can be quickly determined according to the sorting result in the second queue, thereby facilitating improving the response speed of the access request.

[0069] Among them, the first current access request can also be an access request extracted from the first queue to be stored in the second queue. In one embodiment of the present invention, when the number of user accesses in the first queue is greater than a preset threshold, it will be moved into the second queue and sorted according to the sorting method of the second queue. Specifically, for the access request entering the second queue, the value of the current access request is compared from the head of the second queue. If the value corresponding to the current access request is greater than or equal to the value of the head node of the second queue, the current access request is inserted into the head of the second queue, and the head node of the original second queue is moved backward; if the value corresponding to the current access request is less than the value of the head node of the second queue, then the comparison is performed one by one from the head of the second queue downward until the position corresponding to the current access request is found in the second queue, so that the number of accesses of the node before the current access request in the second queue (the node near the tail of the second queue) is less than or equal to the number of accesses of the current access node, so that the other access requests except the head in the second queue are sorted according to the access time and / or the number of accesses. In addition, the access requests exceeding the length of the second queue need to be discarded.

[0070] The above sorting method ensures that the second queue can always put the user with the most recent visits (that is, the user with the largest value) at the head. When the value values ​​are the same, it can also ensure that the user with the earlier recent visit time is placed in the priority position.

[0071] For example, Figure 3As shown, when the number of visits of user C in the first queue reaches the threshold value and enters the second queue, he is placed at the head of the second queue. At this time, the value is 3, and his predecessor node is empty. At this time, when user F enters the second queue, his value is 3, but because F's recent visit time is higher than C, user F is inserted before user C. When user G enters the second queue, similarly, user G is inserted before user F, and user C is at the end of the second queue. When user H enters the second queue again, H becomes the head of the second queue, and user C is discarded because it does not meet the length of the second queue. When user G visits again, since the target access request G already exists in the second queue, the value of G is increased by 1, and user G is placed at the head of the second queue according to the sorting rule of the second queue. When user J enters the second queue for the first time, the corresponding value is 3. According to the principle of referring to the recent visit time when the number of recent visits is the same, user J is inserted before user H, and user F is discarded. Similarly, when user H visits again, the value corresponding to user H is increased by 1, and user H is placed before user G, that is, placed at the head of the second queue. At this time, when user M enters the second queue for the first time, according to the principle of priority for the most recent number of visits, M is placed before J, that is, M is placed at the end of the second queue, and J is discarded.

[0072] In addition, the first current access request may also be the latest access request received at the current time (the current time may be before the target time). In this case, first determine whether the second queue includes the target access request, which corresponds to the same user information as the current access request. For example, when the same user accesses multiple times, the access request previously sent by the user is already in the second queue. When the latest current access request is received again, the target access request can be determined from the second queue. At this time, according to Figure 3 In the manner shown, the first current access request is stored in the second queue.

[0073] When the target access request is not included in the second queue, determine whether the target access request exists in the first queue; if so, replace the target access request in the first queue with the first current access request, place the first current access request at the head of the first queue, and increment the access count of the first current access request.

[0074] That is to say, for a new first current access request, it is first searched from the second queue. If there is an access request corresponding to the same user information as the current access request in the second queue, it is sorted according to the sorting method of the second queue without entering the first queue. If there is no access request corresponding to the same user information as the first current access request in the second queue, the first current access request is first entered into the first queue and sorted according to the sorting method of the first queue. It can enter the second queue only after the access request corresponding to the user information meets a certain preset threshold value. In this way, each access request can be sorted according to the access time and the number of accesses, which is conducive to selecting access requests for processing according to the access time and the number of accesses.

[0075] Step S104: according to the sorting result, select access requests with the same number as the target quantity from the one or more access requests for processing.

[0076] In order to conveniently and quickly select target access requests with the same number as the target quantity, in an embodiment of the present invention, a third queue is used as a hit queue for access requests, so that when selecting target access requests, they can be directly selected from the third queue according to the order from head to tail, and the selected target access requests can be further processed.

[0077] Specifically, in one embodiment of the present invention, the third queue may be sorted in the following manner:

[0078] When a second current access request is received, the access level corresponding to the user information is determined based on the user information corresponding to the second current access request; whether the access level meets the preset conditions is determined, if so, the second current access request is processed, if not, the second current access request is stored in the third queue.

[0079] When the user level does not meet the preset conditions, determine whether there is a target access request in the second queue, and the target access request and the second current access request correspond to the same user information; if so, determine the storage position of the second current access request in the third queue according to the access count of the second current access request, and store the second current access request in the third queue according to the storage position, so that the access requests in the third queue are sorted according to the access count, wherein the access request with the largest access count is located at the head of the third queue; if not, store the second current access request at the tail of the third queue.

[0080] That is, when processing a new second current access request, such as processing a current access request received after the target time, first determine whether the second current access request is in the second queue. If not, directly store the second current access request at the end of the third queue, and then Figure 2 In the manner shown, it is stored in the first queue; if the user is in the second queue, the access count of the second current access request is compared with the access count of the head node of the third queue. If it is greater than the access count of the head node, the current access request is placed at the head of the third queue. If it is less than, a sorting method similar to the second queue is used to determine the position of the second current access request in the third queue.

[0081] For example, during a rush purchase, the situation of the third queue is as follows Figure 4 As shown, when user K visits for the first time, since he does not exist in the second queue and the first queue, he is directly placed at the end of the queue according to the sorting method of the third queue, and at the same time he is placed at the head of the first queue; similarly, when user L visits for the first time, since user L does not exist in the second queue and the first queue, user L is directly placed at the end of the third queue, and at the head of the first queue, that is, after user K; when user M initiates an access request again, since user M exists in the second queue and the number of recent visits of M is 3, M is compared with the current head node of the third queue, that is, compared with user K, and after comparison, M is placed after user K (close to the head of the third queue); when user H visits again, similarly, user H is placed after user M (close to the head of the third queue). In this way, each access request is sorted in the third queue.

[0082] By sorting the above three queues, the comprehensive access time and access count are sorted from the head to the tail in the third queue, that is, the access request at the head of the third queue is the optimal result after the comprehensive access time and access count. Therefore, the third queue is used as the hit queue of the target access request, so that when selecting the target access request from the third queue, according to the order from the head to the tail, the access request with the same number as the target is selected for processing, and the selected access request is the better result of the comprehensive access time and access count, thereby ensuring that the access request with the latest access time and the largest number of accesses can be processed first, which is conducive to improving user stickiness.

[0083] Wherein, the target quantity is related to the inventory of the target item and / or the system performance for processing the access request. For example, when the inventory of the target item is sufficient, such as when it is greater than or equal to the number of access requests that can be stored in the third queue, the target quantity can be determined as the number of access requests that can be stored in the third queue, that is, all access requests in the third queue can be processed. When the target inventory is small, such as when it is less than the number of access requests that can be stored in the third queue, the target quantity can be determined as the inventory of the item. In addition, the target quantity can also be related to the system performance. For example, the allowed concurrent quantity can be determined based on the system performance, and the concurrent quantity can be determined as the target quantity. Of course, the target quantity can also be determined by combining the concurrent quantity and the target inventory. For example, the smaller value of the concurrent quantity and the target inventory is used as the target quantity, or the weight values ​​of the concurrent quantity and the target inventory are set respectively, and the target quantity is calculated based on their weight values.

[0084] The access request processing method provided in an embodiment of the present invention can determine the processing order of access requests based on factors such as user information, number of accesses and / or access time when the e-commerce system has high concurrent requests, thereby ensuring that access requests with higher user levels, more recent access times and / or more access times are processed first, which is beneficial to improving user stickiness.

[0085] like Figure 5 As shown, the embodiment of the present invention provides an access request processing device 500, including: a receiving module 501, a sorting module 502 and a processing module 503; wherein,

[0086] The receiving module 501 is used to receive one or more access requests, where the access request indicates user information and access time;

[0087] The sorting module 502 is used to determine the number of accesses corresponding to the one or more access requests according to the user information; sort the user information according to the user information, the number of accesses and / or the access time;

[0088] The processing module 503 is used to select access requests with the same number as the target quantity from the one or more access requests for processing according to the sorting result.

[0089] In one embodiment of the present invention, the sorting module 502 is used to store each of the access requests in a first queue according to the access time, so that the access request with the most recent access time is located at the head of the first queue; when the number of access times of the access requests in the first queue is greater than a preset threshold, the access requests with the number of access times greater than the preset threshold are extracted from the first queue, and the extracted access requests are stored in a second queue.

[0090] In one embodiment of the present invention, the sorting module 502 is used to determine whether there is a target access request in the second queue when a first current access request is received, and the target access request corresponds to the same user information as the first current access request; if so, the first current access request is placed at the head of the second queue and the access count of the first current access request is incremented.

[0091] In one embodiment of the present invention, the sorting module 502 is used to determine whether the target access request exists in the first queue when the target access request is not included in the second queue; if so, replace the target access request in the first queue with the current access request, place the current access request at the head of the first queue, and increment the access count of the current access request.

[0092] In one embodiment of the present invention, the other access requests except the head in the second queue are sorted according to access time and / or access count.

[0093] In one embodiment of the present invention, the other access requests except the head in the first queue are sorted according to access time and / or access count.

[0094] In one embodiment of the present invention, the sorting module 502 is used to determine, when receiving a second current access request, an access level corresponding to the user information based on the user information corresponding to the second current access request; determine whether the access level meets a preset condition, if so, process the second current access request, if not, store the second current access request in a third queue.

[0095] In one embodiment of the present invention, the sorting module 502 is used to determine whether there is a target access request in the second queue, and the target access request and the second current access request correspond to the same user information; if so, determine the storage position of the second current access request in the third queue according to the access count of the second current access request, and store the second current access request in the third queue according to the storage position, so that the access requests in the third queue are sorted according to the access count, wherein the access request with the largest access count is located at the head of the third queue; if not, store the second current access request at the tail of the third queue.

[0096] In one embodiment of the present invention, the processing module 504 is used to select access requests with the same number as the target quantity from the third queue according to the order from the head to the tail for processing.

[0097] An embodiment of the present invention also provides a server, comprising: one or more processors; a storage device for storing one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement the access request processing method provided in any of the above embodiments.

[0098] An embodiment of the present invention further provides a computer-readable medium on which a computer program is stored. When the program is executed by a processor, the access request processing method provided in any of the above embodiments is implemented.

[0099] Figure 6 An exemplary system architecture 600 is shown to which the access request processing method or access request processing apparatus according to the embodiment of the present invention can be applied.

[0100] like Figure 6 As shown, system architecture 600 may include terminal devices 601, 602, 603, network 604 and server 605. Network 604 is used to provide a medium for communication links between terminal devices 601, 602, 603 and server 605. Network 604 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0101] Users can use terminal devices 601, 602, and 603 to interact with server 605 through network 604 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 601, 602, and 603, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only examples).

[0102] The terminal devices 601 , 602 , and 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers, etc.

[0103] The server 605 may be a server that provides various services, such as a backend management server (only an example) that provides support for shopping websites browsed by users using the terminal devices 601, 602, and 603. The backend management server may analyze and process the received data such as product information query requests, and feed back the processing results (such as target push information, product information - only an example) to the terminal device.

[0104] It should be noted that the access request processing method provided in the embodiment of the present invention is generally executed by the server 605 , and accordingly, the access request processing device is generally disposed in the server 605 .

[0105] It should be understood that Figure 6The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.

[0106] Reference below Figure 7 , which shows a schematic diagram of the structure of a computer system 700 of a terminal device suitable for implementing an embodiment of the present invention. Figure 7 The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0107] like Figure 7 As shown, the computer system 700 includes a central processing unit (CPU) 701, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 702 or a program loaded from a storage part 708 into a random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.

[0108] The following components are connected to the I / O interface 705: an input section 706 including a keyboard, a mouse, etc.; an output section 707 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 708 including a hard disk, etc.; and a communication section 709 including a network interface card such as a LAN card, a modem, etc. The communication section 709 performs communication processing via a network such as the Internet. A drive 710 is also connected to the I / O interface 705 as needed. A removable medium 711, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 710 as needed, so that a computer program read therefrom is installed into the storage section 708 as needed.

[0109] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 709, and / or installed from the removable medium 711. When the computer program is executed by the central processing unit (CPU) 701, the above-mentioned functions defined in the system of the present invention are executed.

[0110] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0111] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0112] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor. For example, they may be described as: a processor includes a receiving module, a sorting module, and a processing module. The names of these modules do not constitute limitations on the modules themselves in some cases. For example, the receiving module may also be described as a "module for receiving one or more access requests."

[0113] As another aspect, the present invention also provides a computer-readable medium, which may be included in the device described in the above embodiment; or may exist independently without being assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by a device, the device includes: receiving one or more access requests, the access request indicating user information and access time; determining the number of accesses corresponding to the one or more access requests respectively according to the user information; sorting the user information according to the user information, the number of accesses and / or the access time; and selecting the access requests with the same number as the target number from the one or more access requests for processing according to the sorting result.

[0114] According to the technical solution of the embodiment of the present invention, when the e-commerce system has high concurrent requests, the processing order of access requests can be determined based on factors such as user information, number of visits and / or access time, to ensure that access requests with higher user levels, more recent access times and / or more access times are processed first, which is beneficial to improving user stickiness.

[0115] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for processing an access request, characterized in that: include: receiving one or more access requests, wherein the access request indicates user information and access time; Determine, according to the user information, the number of accesses corresponding to the one or more access requests; Sorting the user information according to the user information, the number of visits and / or the visit time; According to the sorting result, selecting access requests having the same number as the target number from the one or more access requests for processing; The sorting of the user information includes: When receiving the second current access request, determining, according to the user information corresponding to the second current access request, an access level corresponding to the user information; determining whether the access level satisfies a preset condition, and if so, processing the second current access request, and if not, storing the second current access request in a third queue; The storing the second current access request in the third queue comprises: determining whether there is a target access request in the second queue, the target access request and the second current access request corresponding to the same user information; If yes, determining a storage position of the second current access request in the third queue according to the access count of the second current access request, and storing the second current access request in the third queue according to the storage position, so that the access requests in the third queue are sorted according to the access count, wherein the access request with the largest access count is located at the head of the third queue; If not, storing the second current access request at the tail of the third queue; The sorting of the user information further comprises: storing the access request in a first queue; When the access times of the access requests in the first queue are greater than a preset threshold, the access requests whose access times are greater than the preset threshold are extracted from the first queue, and the extracted access requests are stored in the second queue.

2. The method according to claim 1, characterized in that The step of storing the access request in a first queue comprises: Each of the access requests is stored in a first queue according to the access time, so that the access request with the latest access time is located at the head of the first queue.

3. The method according to claim 2, characterized in that When receiving the first current access request, determining whether there is a target access request in the second queue, the target access request and the first current access request corresponding to the same user information; If yes, the first current access request is placed at the head of the second queue, and the access count of the first current access request is incremented.

4. The method according to claim 3, characterized in that When the second queue does not include the target access request, the method further includes: Determine whether the target access request exists in the first queue; if so, replace the target access request in the first queue with the first current access request, place the first current access request at the head of the first queue, and increment the access count of the first current access request.

5. The method according to claim 3 or 4, characterized in that: The other access requests except the head in the second queue are sorted according to access time and / or access times; and / or, The other access requests in the first queue except the head are sorted according to access time and / or access times.

6. The method according to claim 1, characterized in that The selecting access requests having the same number as the target number for processing includes: From the third queue, access requests having the same number as the target quantity are selected for processing in order from the head to the tail.

7. The method according to any one of claims 1 to 4 and 6, characterized in that: The target quantity is related to the inventory of the target item and / or the performance of the system for processing the access request.

8. An access request processing device, characterized in that: include: Receiving module, sorting module, processing module; among them, The receiving module is used to receive one or more access requests, wherein the access request indicates user information and access time; The sorting module is used to determine the number of accesses corresponding to the one or more access requests according to the user information; and sort the user information according to the user information, the number of accesses and / or the access time; The processing module is used to select access requests having the same number as the target number from the one or more access requests for processing according to the sorting result; The sorting module is configured to, when receiving a second current access request, determine an access level corresponding to the user information according to the user information corresponding to the second current access request; determine whether the access level meets a preset condition, if yes, process the second current access request, and if no, store the second current access request in a third queue; The sorting module is used to determine whether there is a target access request in the second queue, and the target access request and the second current access request correspond to the same user information; if yes, determine the storage position of the second current access request in the third queue according to the access count of the second current access request, and store the second current access request in the third queue according to the storage position, so that the access requests in the third queue are sorted according to the access count, wherein the access request with the largest access count is located at the head of the third queue; if no, store the second current access request at the tail of the third queue; The sorting module is also used to store the access requests in a first queue; when the access times of the access requests in the first queue are greater than a preset threshold, the access requests whose access times are greater than the preset threshold are extracted from the first queue, and the extracted access requests are stored in a second queue.

9. An electronic device for access request processing, characterized in that: include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 7.

10. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Images