CN111767481B - Access processing method, device, equipment and storage medium - Google Patents
Access processing method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN111767481B CN111767481B CN201911060622.2A CN201911060622A CN111767481B CN 111767481 B CN111767481 B CN 111767481B CN 201911060622 A CN201911060622 A CN 201911060622A CN 111767481 B CN111767481 B CN 111767481B
- Authority
- CN
- China
- Prior art keywords
- link
- accessed
- target
- access
- short link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 26
- 238000012545 processing Methods 0.000 claims abstract description 18
- 230000004083 survival effect Effects 0.000 claims description 55
- 238000000034 method Methods 0.000 claims description 33
- 238000004590 computer program Methods 0.000 claims description 10
- 238000010586 diagram Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 230000000694 effects Effects 0.000 description 5
- 239000000284 extract Substances 0.000 description 4
- 230000004044 response Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
- G06F16/9558—Details of hyperlinks; Management of linked annotations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
- G06K17/0022—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisious for transferring data to distant stations, e.g. from a sensing device
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The embodiment of the invention provides an access processing method, an access processing device and a storage medium, wherein the access processing method comprises the following steps: responding to an access request of a target short link, and determining an item identifier corresponding to the target short link; and determining a target access link corresponding to the target short link from a plurality of links to be accessed corresponding to the item identification. According to the technical scheme provided by the embodiment of the invention, when the current link to be accessed corresponding to the target short link fails, the next link to be accessed can be automatically switched, so that the page pointed by the target short link can be automatically updated.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to an access processing method, apparatus, device, and storage medium.
Background
With the development of internet technology, more and more enterprises or merchants conduct marketing activities through the internet, and how to conveniently market goods or services through the internet has become a focus of attention.
In one approach, goods or services are promoted by links, such as text links or two-dimensional code links, to goods or services pages, for example, by sharing links to target goods pages across various websites, forums, or applications.
However, in this technical solution, since a fixed link is adopted, when the link is intended to be directed to another page, only the shared link can be manually updated, resulting in difficulty in automatically updating the page to which the link is directed.
Disclosure of Invention
The embodiment of the invention provides an access processing method, device, equipment and storage medium, which are used for solving the problem that pages pointed by links are difficult to automatically update due to the adoption of fixed links.
An embodiment of the present invention provides an access processing method, including: responding to an access request of a target short link, and determining an item identifier corresponding to the target short link; and determining a target access link corresponding to the target short link from a plurality of links to be accessed corresponding to the item identification.
In some embodiments of the present invention, based on the above-mentioned scheme, the determining, from the plurality of links to be accessed corresponding to the item identifier, a target access link corresponding to the target short link includes: sequentially acquiring each link to be accessed, and judging whether the acquired access times of the current link to be accessed are greater than or equal to preset access times; if the access times of the current link to be accessed is greater than or equal to the preset access times, marking the link state of the current link to be accessed as a failure state; and if the access times of the current link to be accessed is smaller than the preset access times, taking the current link to be accessed as the target access link corresponding to the target short link.
In some embodiments of the present invention, based on the above-mentioned scheme, the determining, from the plurality of links to be accessed corresponding to the item identifier, a target access link corresponding to the target short link includes: sequentially acquiring each link to be accessed, and judging whether the survival time of the acquired current link to be accessed is greater than or equal to a corresponding preset survival threshold value, wherein each link to be accessed in the plurality of links to be accessed is provided with the respective preset survival threshold value; if the survival time of the current link to be accessed is greater than or equal to the corresponding preset survival threshold value, marking the link state of the current link to be accessed as a failure state; and if the survival time of the current link to be accessed is smaller than the corresponding preset survival threshold value, taking the current link to be accessed as the target access link corresponding to the target short link.
In some embodiments of the present invention, based on the above scheme, the method further includes: determining a target link table corresponding to the target short link based on the item identification, wherein a plurality of links corresponding to the target short link are stored in the target link table; and determining the links to be accessed based on the link states of the links in the target link table, wherein the link states comprise a valid state and a failure state.
In some embodiments of the present invention, based on the above scheme, the method further includes: and recording the source page address and the corresponding source network address of the target short link in an access log table.
In some embodiments of the present invention, based on the above scheme, the method further includes: acquiring the access log table corresponding to the item identifier in a preset time period; determining a total access amount to the target short link based on the number of log records in the access log table; an independent amount of guests for the target short link is determined based on each of the source network addresses in the access log table.
In some embodiments of the present invention, based on the above scheme, the method further includes: acquiring the access log table corresponding to the item identifier in a preset time period; counting the access times from each source page address based on the access log table; and determining the access amount of each source page address to the target short link based on the statistical result.
In some embodiments of the present invention, based on the above scheme, the method further includes: acquiring the creation time of the link to be accessed; determining whether the survival time of the link to be accessed is greater than a preset survival threshold value according to the creation time; and if the survival time is greater than the preset survival threshold value, sending out alarm information.
In some embodiments of the present invention, based on the above scheme, the method further includes: acquiring the item identification of a target item, domain name information of a target domain name and a short link interface corresponding to the target short link; binding the item identifier, the domain name information and the short link interface to generate the target short link.
In some embodiments of the present invention, based on the above-mentioned scheme, the target short link is a uniform resource locator and the link to be accessed is a two-dimensional code to be accessed, or the target short link is a short link two-dimensional code and the link to be accessed is a uniform resource locator.
According to a second aspect of an embodiment of the present invention, there is provided an access processing apparatus including: the identification determining module is used for responding to an access request of a target short link and determining an item identification corresponding to the target short link; and the link determining module is used for determining a target access link corresponding to the target short link from a plurality of links to be accessed corresponding to the item identification.
In some embodiments of the present invention, based on the above-described scheme, the link determining module includes: the first judging unit is used for sequentially acquiring each link to be accessed and judging whether the acquired access times of the current link to be accessed are greater than or equal to the preset access times or not; the first marking unit is used for marking the link state of the current link to be accessed as a failure state if the access times of the current link to be accessed are greater than or equal to the preset access times; and the first determining unit is used for taking the current link to be accessed as the target access link corresponding to the target short link if the access times of the current link to be accessed are smaller than the preset access times.
In some embodiments of the present invention, based on the above-described scheme, the link determining module includes: the second judging unit is used for sequentially acquiring each link to be accessed and judging whether the survival time of the acquired current link to be accessed is greater than or equal to a corresponding preset survival threshold value, wherein each link to be accessed in the plurality of links to be accessed is provided with the corresponding preset survival threshold value; the second marking unit is used for marking the link state of the current link to be accessed as a failure state if the survival time of the current link to be accessed is greater than or equal to the corresponding preset survival threshold value; and the second determining unit is used for taking the current link to be accessed as the target access link corresponding to the target short link if the survival time of the current link to be accessed is smaller than the corresponding preset survival threshold value.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: the link table determining module is used for determining a target link table corresponding to the target short link based on the item identification, wherein a plurality of links corresponding to the target short link are stored in the target link table; and the link to be accessed determining module is used for determining the links to be accessed based on the link states of the links in the target link table, wherein the link states comprise a valid state and a failure state.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: and the log recording module is used for recording the source page address for accessing the target short link and the corresponding source network address in the access log table.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: a first log table obtaining module, configured to obtain the access log table corresponding to the item identifier in a predetermined period of time; a total access amount determining module, configured to determine a total access amount to the target short link based on the number of log records in the access log table; and the independent visitor volume determining module is used for determining the independent visitor volume of the target short link based on each source network address in the access log table.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: the second log table acquisition module is used for acquiring the access log table corresponding to the item identifier in a preset time period; the access times counting module is used for counting the access times from each source page address based on the access log table; and the access amount determining module is used for determining the access amount of each source page address to the target short link based on the statistical result.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: the creation time acquisition module is used for acquiring the creation time of the link to be accessed; a time judging module, configured to determine, according to the creation time, whether a survival time of the link to be accessed is greater than a predetermined survival threshold; and the alarm module is used for sending alarm information if the alarm information is larger than the preset survival threshold value.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: the data acquisition module is used for acquiring the item identification of the target item, domain name information of the target domain name and a short link interface corresponding to the target short link; and the target short link generation module is used for binding the item identifier, the domain name information and the short link interface to generate the target short link.
In some embodiments of the present invention, based on the above-mentioned scheme, the target short link is a uniform resource locator and the link to be accessed is a two-dimensional code to be accessed, or the target short link is a short link two-dimensional code and the link to be accessed is a uniform resource locator.
A third aspect of an embodiment of the present invention provides an access processing apparatus, including: a receiver, a processor, a memory, and a transmitter; the memory is used for storing computer programs and data, and the processor calls the computer programs stored in the memory to execute the access processing method provided by any embodiment of the first aspect.
A fourth aspect of the invention provides a computer readable storage medium comprising a computer program for performing the access processing method provided by any of the embodiments of the first aspect when being executed by a processor.
According to the access processing method, the device, the equipment and the storage medium provided by the embodiment of the invention, the corresponding item identification is obtained from the access request of the target short link, and the target access link corresponding to the target short link is determined from a plurality of links to be accessed corresponding to the item identification. On the one hand, by setting a corresponding item identifier in the target short link, the target short link can be associated with a plurality of links to be accessed through the item identifier; on the other hand, from a plurality of links to be accessed corresponding to the item identification, the target access link corresponding to the target short link is determined, and the next link to be accessed can be automatically switched to when the current link to be accessed fails, so that the page pointed by the target short link can be automatically updated.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions of the prior art, the drawings that are needed in the embodiments or the description of the prior art will be briefly described below, it will be obvious that the drawings in the following description are some embodiments of the present invention, and that other drawings can be obtained according to these drawings without inventive effort to a person skilled in the art.
Fig. 1 is a schematic diagram of an application scenario of an access processing method according to some embodiments of the present invention;
FIG. 2 is a flow chart of an access processing method according to some embodiments of the present invention;
FIG. 3 is a flow chart of statistics on access sources of target short links provided in accordance with some embodiments of the present invention;
FIG. 4 is a flow chart of an access processing method according to other embodiments of the present invention;
FIG. 5 is a schematic block diagram of an access processing apparatus provided in accordance with some embodiments of the present invention;
FIG. 6 is a schematic block diagram of a link determination module provided in accordance with some embodiments of the invention;
fig. 7 is a schematic block diagram of an embodiment of an access processing device provided in accordance with some embodiments of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The terms and the like referred to in this application are explained below:
linking: also referred to as hyperlinks, refer to a connection from an object to an object, which may be text, a picture, a web page, etc.
Short links: the long website is converted into a short website character string by means of compression or encryption operation and the like.
URL (Uniform Resource Locator ): is a string on the network that is used to describe information resources.
Short-link two-dimensional code: and generating a two-dimensional code through short links.
Total access amount PV (page view): i.e., page view or click through, is used to measure the total access to a web site or page.
Independent visitor volume UV (unique visitor): refers to the number of people who visit a site or click on a different IP address of a web page.
Fig. 1 is a schematic diagram of an application scenario of an access processing method according to some embodiments of the present invention. Referring to fig. 1, the application scenario includes at least one client 110 and a server 120. The client 110 communicates with the server 120 via a network 130. After clicking the target short link displayed on the website, forum or application page on the client 110, the client 110 sends an access request to the server 120 for the target short link, where the access request includes the item identifier of the target marketing item. After receiving the access request, the server 120 extracts the item identifier from the access request, and determines a target access link corresponding to the target short link from a plurality of links to be accessed corresponding to the item identifier.
It should be noted that, the client 110 may be a mobile phone, a tablet computer, a desktop computer, a portable notebook computer, a vehicle computer, or the like. The server 120 may be a physical server comprising a separate host, or a virtual server carried by a cluster of hosts, or a cloud server. The network 130 may be a wired network or a wireless network, for example, the network 130 may be a public switched telephone network (Public Switched Telephone Network, PSTN) or the internet.
An access processing method according to an exemplary embodiment of the present invention is described below with reference to the accompanying drawings in conjunction with the application scenario of fig. 1. It should be noted that the above application scenario is only shown for the convenience of understanding the spirit and principle of the present invention, and the embodiments of the present invention are not limited in any way. Rather, embodiments of the invention may be applied to any scenario where applicable.
Fig. 2 is a flow chart of an access processing method according to some embodiments of the present invention. The access processing method includes step S210 and step S220, and can be applied to the server side 120 shown in fig. 1. The following describes the access processing method in detail with reference to the accompanying drawings, taking the application of the access processing method to the server side 120 as an example.
Referring to fig. 2, in response to an access request to a target short link, an item identification corresponding to the target short link is determined in step S210.
In an example embodiment, the target short link is a short link for accessing a marketing page or a promotion page of the target item, for example, the promotion page of the target item is a target commodity page or a target service page, and the target short link may be a short link corresponding to the target commodity page or the target service page. Further, the target short link includes an item identifier of the target item.
In some embodiments, the target short link is a URL of a target page or interface, where the URL has a mapping relationship or a corresponding relationship with a plurality of two-dimensional code pictures set at the server 120, and the target short link includes an item identifier of a target popularization item. When the user clicks on the target short link on the client 110, the client 110 sends an access request to the server 120 for the target short link.
In other embodiments, the target short link is a short link two-dimensional code, where the short link two-dimensional code has a mapping relationship or a corresponding relationship with a plurality of links set at the server 120, and the target short link includes an item identifier of the target popularization item. When the user scans the short link two-dimensional code through the client 110, the client 110 sends an access request for the target short link to the server 120.
Further, after receiving the access request of the client 110 to the target short link, the server 120 extracts, in response to the access request, the item identifier corresponding to the target short link from the access request, for example, may extract, by using a regular expression, the item identifier corresponding to the target short link from the access request.
In step S220, a target access link corresponding to the target short link is determined from the plurality of links to be accessed corresponding to the item identification.
In an example embodiment, a plurality of links to be accessed corresponding to the item identifier are set at the server 120, the plurality of links to be accessed are set with corresponding predetermined access times or predetermined survival thresholds, and a target access link corresponding to the target short link is determined from the plurality of links to be accessed according to the access times or survival times of each link to be accessed.
For example, in some embodiments, each link to be accessed is sequentially acquired, for example, according to the ID (Identity) of each link to be accessed, and whether the acquired number of accesses of the current link to be accessed is greater than or equal to a predetermined number of accesses is determined; if the access times of the current link to be accessed is greater than or equal to the preset access times, marking the link state of the current link to be accessed as a failure state; and if the access times of the current link to be accessed is smaller than the preset access times, taking the current link to be accessed as a target access link corresponding to the target short link.
In other embodiments, each link to be accessed is sequentially acquired according to the ID sequence of each link to be accessed, and whether the survival time of the acquired current link to be accessed is greater than or equal to a corresponding predetermined survival threshold is determined, where each link to be accessed in the plurality of links to be accessed is provided with a respective predetermined survival threshold, for example, the corresponding predetermined survival threshold is set according to the popularization cost or popularization object of each link to be accessed; if the survival time of the current link to be accessed is greater than or equal to the corresponding preset survival threshold value, marking the link state of the current link to be accessed as a failure state; and if the survival time of the current link to be accessed is smaller than the corresponding preset survival threshold value, taking the current link to be accessed as a target access link corresponding to the target short link.
According to the access processing method in the example embodiment of fig. 2, on the one hand, by setting the corresponding item identifier in the target short link, the target short link can be associated with a plurality of links to be accessed through the item identifier; on the other hand, from a plurality of links to be accessed corresponding to the item identification, the target access link corresponding to the target short link is determined, and the next link to be accessed can be automatically switched to when the current link to be accessed fails, so that the page pointed by the target short link can be automatically updated.
In addition, in the exemplary embodiment, a target link table is set in the database of the server 120, where a plurality of links corresponding to the target short link are stored in the target link table, the target link table includes an item identification field, the target link table corresponding to the item identification can be determined by querying the item identification field, and the plurality of links in the determined target link table are used as a plurality of links to be accessed corresponding to the item identification.
Further, in some embodiments, link states of the links are also stored in the target link table, where the link states include a valid state and a invalid state, and a link in the valid state in the links is used as a plurality of links to be accessed corresponding to the target item identifier. The following table 1 shows a target link table in an example embodiment, in the example embodiment of table 1, the link to be accessed is a two-dimensional code picture, wherein the project_id field identifies a target item, i.e., a short link item, to which the target link table belongs, the Filepath field indicates a storage path of a standby two-dimensional code picture, and the finish_flag field indicates whether the two-dimensional code picture has failed.
TABLE 1 target link table
Further, in the example embodiment, when a target item, i.e., a short link item, is created, item information of the target item is stored in a short link item table, resulting in an item ID of the target item being, for example, $. Table 2 below shows a Short link entry table in an example embodiment, in an example embodiment of table 2, the link to be accessed is a two-dimensional code, where the short_link field is a target Short link, the change_number field is a predetermined number of accesses, and the alarm_time field is a predetermined survival threshold, where, for example, if the two-dimensional code is restricted to be invalid after 100 accesses, the change_number is configured to be a number of 98 or less, so that a user is prevented from accessing during the calculation, and thus accessing the invalid two-dimensional code.
TABLE 2 short link list
Further, to prevent the target short link from being masked or sealed, the short link is bound to the target domain name. Thus, in an example embodiment, an item identification of a target item, domain name information of a target domain name, and a short link interface corresponding to the target short link are obtained; binding the item identifier, domain name information and short link interface to generate the target short link. For example, let the domain name of the enterprise or merchant that promoted the target item, for example x.com, the short link interface is shortcode.php, bind the short link interface to the domain name, generate a bound link http:// x.com/shortcode.phpid= $id, generate a target short link based on the bound link, for example http:// x.com/abcefg, and update the target short link field to the short link item table.
FIG. 3 is a flow chart of statistics on access sources of target short links according to some embodiments of the present invention.
In step S310, an access log table corresponding to the item identification of the target item for a predetermined period of time is acquired.
In an exemplary embodiment, an access log table corresponding to each target item is set in the database of the server 120, where a source page address of the access target short link and a corresponding source network address, for example, a source network address is an IP (Internet Protocol, network protocol) address of the client 110 are recorded in the access log table. When the access source of the target short link corresponding to the target item needs to be counted, an access log table corresponding to the item identification of the target item is obtained for a preset time period, for example, 1 day. Further, each time the user accesses the target short link through the client 110, an access log record is generated in the access log table, and each access log record includes a source page address of the access target short link and a corresponding source network address. Table 3 below shows an access log table in an example embodiment, where the from_refer field indicates the source page address of the access request, the from_ip field indicates the source IP address of the access request, the pic_id field indicates the ID of the standby two-dimensional code picture, and the project_id field indicates the item ID of the short link item to which the access log table belongs.
TABLE 3 Access Log Table
In step S320, the total access amount to the target short link is determined based on the number of log records in the access log table.
In an example embodiment, the number of log records in the acquired access log table is summed to determine the total access amount, PV (Page View), of the target short link for the predetermined period of time. For example, all log records in the access log table in the predetermined period are acquired, the acquired log records are represented by an array variable listmarr, that is, each entry in the array represents a log record, and the array variable listmarr is traversed, for example, let pv= count (ListArr), and a count function is used to count the number of data in the array variable, so that the total access amount PV of the target short link in the predetermined period can be obtained.
In step S330, the individual amount of guests for the target short link is determined based on each source network address in the access log table.
In an example embodiment, the number of source network addresses, i.e., IP addresses, in the obtained access log table is summed to determine the independent amount of visitors, i.e., UV (Unique identifier), for the target short link for the predetermined period of time. For example, all log records in the access log table in the predetermined period are obtained, the obtained log records are represented by an array variable listmarr, that is, each item in the array represents one log record, the array variable listmarr is traversed, the source network address, that is, from_ip, in the log record currently traversed to is extracted From the array variable by a regular expression, the number of total source network addresses is counted by a source statistics array userrar, for example, let userrar [ from_ip ] =1, that is, the same IP is counted only once, after the traversing is completed, the number of source network addresses stored in the userrar variable is taken as an independent access to the target short link, for example, uv= count (userArr) may be made, and then the independent access to the target short link in the predetermined period may be obtained.
Further, in order to facilitate evaluation of the delivery effect of the target short links delivered to the respective channels, in an example embodiment, an access log table corresponding to the item identifier for a predetermined period of time is acquired; counting the access times from each source page address based on the access log table; and determining the access amount of each source page address to the target short link based on the statistical result. The effect of throwing in each source page can be evaluated through the access quantity of each source page, for example, the larger the access quantity of a certain source page is, the better the throwing effect of the source page is represented.
For example, in an exemplary embodiment, the source page address, from_refer, in the log record currently traversed is extracted From the array variable listmarr by a regular expression, the source page address is stored in the variable host, and the number of source page addresses is counted by the source statistics array refarar, for example, let refarar [ host ] = refarar [ host ] +1, i.e. the same source page is counted multiple times, and after the traversing is completed, the number of source page addresses stored in the refarar variable is used as the access amount of the target short link to the source page address.
Further, in order to more intuitively represent the statistics of the access amounts of the respective source pages, the obtained access amounts of the respective source page addresses are displayed by a pie chart, for example, the access amount of the source address aa.com is 2, the access amount of the source address bb.com is 4, the access amount of the source address cc.com is 5, the access amount of the source address aa.com is 22.22%, the access amount of the source address bb.com is 44.44%, and the access amount of the source cc.com is 33.33%.
Fig. 4 is a flow chart of an access processing method according to other embodiments of the present invention.
Referring to fig. 4, in step S410, an item ID accessed by a user is acquired.
In an example embodiment, when receiving an access request sent by the client 110 for a target short link, the server 120 extracts an item identifier corresponding to the target short link from the access request.
Next, in step S415, a predetermined number of accesses to automatically switch the two-dimensional code picture is determined from the short link item table.
In an example embodiment, a value of a change_number field, which is a predetermined number of accesses corresponding to an item identification, is queried from a short link item table according to the item identification.
In step S420, an initialization process is performed, for example, setting a variable getfile indicating whether or not a two-dimensional code picture is obtained to false, and setting a variable getPic indicating storing the obtained two-dimensional code picture to null.
In step S425, all the non-invalid two-dimensional code pictures corresponding to the item identifier are determined, and the determined two-dimensional code pictures are ordered according to the picture IDs.
In an example embodiment, a corresponding target link table is determined according to the item identifier, non-invalid two-dimensional code pictures are determined according to the link states of the two-dimensional code pictures in the target link table, and sorting is performed according to the IDs of the non-invalid two-dimensional code pictures in the target link table.
In step S430, traversing the ordered two-dimensional codes, determining whether the traversing is finished, and if the traversing is finished, performing a value step S460; if the traversal is not ended, the process proceeds to step S435.
In step S435, the access amount of the traversed current two-dimensional code is determined, for example, the access log amount of the current two-dimensional code is queried from the log access table.
In step S440, it is determined whether the current two-dimensional code access amount is greater than or equal to the predetermined access number change_num, and if so, the process proceeds to step S455; if it is smaller than the predetermined number of accesses, the process proceeds to step S445.
In step S445, the current two-dimensional code is used as the corresponding target two-dimensional code, that is, the value of the Filepath field in the target link table, which is the picture storage path of the current two-dimensional code, is assigned to the getPic variable, and the getFlag variable is set to true.
In step S450, the current access is recorded in the access log table, and then it is determined that the traversal is ended.
In step S455, the link state of the current two-dimensional code picture is marked as a failure state.
In step S460, it is determined whether a two-dimensional code picture is acquired, for example, a value of the variable getFlag is determined, if the value of the variable getFlag is true, it is determined that a two-dimensional code picture is acquired, and the process proceeds to step S465; if the value of the variable getFlag is false, it is determined that the two-dimensional code picture is not acquired, and the process proceeds to step S470.
In step S465, a path for acquiring a two-dimensional code picture from, for example, a getPic variable is displayed, and the two-dimensional code picture acquired from the path is displayed.
In step S470, alarm information is issued.
Further, in an example embodiment, the short link entry table and the target link table are scanned by an asynchronous program, such as an asynchronous snoop thread, to determine whether the survival time of each link, such as a two-dimensional code, in the target link table exceeds a predetermined survival threshold, and if so, to issue an alarm message.
Fig. 5 is a schematic block diagram of an access processing apparatus provided in accordance with some embodiments of the present invention. Referring to fig. 5, the access processing apparatus 500 includes an identification determination module 510 and a link determination module 520. The identifier determining module 510 is configured to determine, in response to an access request to a target short link, an item identifier corresponding to the target short link; a link determination module 520 for determining a target access link corresponding to the target short link from a plurality of links to be accessed corresponding to the item identification
In some embodiments of the present invention, based on the above-mentioned scheme, referring to fig. 6, the link determining module 520 includes: a first determining unit 610, configured to sequentially obtain each of the links to be accessed, and determine whether the number of accesses of the obtained current link to be accessed is greater than or equal to a predetermined number of accesses; a first marking unit 620, configured to mark a link state of the current link to be accessed as a failure state if the number of accesses of the current link to be accessed is greater than or equal to the predetermined number of accesses; the first determining unit 630 is configured to, if the number of accesses of the current link to be accessed is less than the predetermined number of accesses, use the current link to be accessed as the target access link corresponding to the target short link.
In some embodiments of the present invention, based on the above-described scheme, the link determining module includes: the second judging unit is used for sequentially acquiring each link to be accessed and judging whether the survival time of the acquired current link to be accessed is greater than or equal to a corresponding preset survival threshold value, wherein each link to be accessed in the plurality of links to be accessed is provided with the corresponding preset survival threshold value; the second marking unit is used for marking the link state of the current link to be accessed as a failure state if the survival time of the current link to be accessed is greater than or equal to the corresponding preset survival threshold value; and the second determining unit is used for taking the current link to be accessed as the target access link corresponding to the target short link if the survival time of the current link to be accessed is smaller than the corresponding preset survival threshold value.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: the link table determining module is used for determining a target link table corresponding to the target short link based on the item identification, wherein a plurality of links corresponding to the target short link are stored in the target link table; and the link to be accessed determining module is used for determining the links to be accessed based on the link states of the links in the target link table, wherein the link states comprise a valid state and a failure state.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: and the log recording module is used for recording the source page address for accessing the target short link and the corresponding source network address in the access log table.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: a first log table obtaining module, configured to obtain the access log table corresponding to the item identifier in a predetermined period of time; a total access amount determining module, configured to determine a total access amount to the target short link based on the number of log records in the access log table; and the independent visitor volume determining module is used for determining the independent visitor volume of the target short link based on each source network address in the access log table.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: the second log table acquisition module is used for acquiring the access log table corresponding to the item identifier in a preset time period; the access times counting module is used for counting the access times from each source page address based on the access log table; and the access amount determining module is used for determining the access amount of each source page address to the target short link based on the statistical result.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: the creation time acquisition module is used for acquiring the creation time of the link to be accessed; a time judging module, configured to determine, according to the creation time, whether a survival time of the link to be accessed is greater than a predetermined survival threshold; and the alarm module is used for sending alarm information if the alarm information is larger than the preset survival threshold value.
In some embodiments of the present invention, based on the above-mentioned scheme, the apparatus further includes: the data acquisition module is used for acquiring the item identification of the target item, domain name information of the target domain name and a short link interface corresponding to the target short link; and the target short link generation module is used for binding the item identifier, the domain name information and the short link interface to generate the target short link.
In some embodiments of the present invention, based on the above-mentioned scheme, the target short link is a uniform resource locator and the link to be accessed is a two-dimensional code to be accessed, or the target short link is a short link two-dimensional code and the link to be accessed is a uniform resource locator.
According to the access processing device in the example embodiment of fig. 5, on the one hand, by setting the corresponding item identifier in the target short link, the target short link can be associated with a plurality of links to be accessed through the item identifier; on the other hand, from a plurality of links to be accessed corresponding to the item identification, the target access link corresponding to the target short link is determined, and the next link to be accessed can be automatically switched to when the current link to be accessed fails, so that the page pointed by the target short link can be automatically updated.
The access processing device provided by the embodiment of the application can realize each process in the foregoing method embodiment and achieve the same function and effect, and is not repeated here.
Fig. 7 is a schematic structural diagram of an access processing device according to an embodiment one of the present invention, as shown in fig. 7, an access processing device 700 provided in this embodiment may include: receiver 710, memory 720, processor 730, and transmitter 740.
Optionally, the access processing device may further comprise a bus. Wherein the bus is used for realizing the connection between the elements.
The memory is used for storing computer programs and data, and the processor calls the computer programs stored in the memory to execute the technical scheme of the access processing method provided by any one of the method embodiments.
Wherein the memory and the processor are electrically connected directly or indirectly to each other for data transmission or interaction. For example, the elements may be electrically connected to each other via one or more communication buses or signal lines, such as through a bus connection. The memory stores computer-executable instructions for implementing the data access control method, including at least one software functional module that may be stored in the memory 201 in the form of software or firmware, and the processor executes various functional applications and data processing by running computer programs and modules stored in the memory.
The Memory may be, but is not limited to, random access Memory (Random Access Memory; RAM), read Only Memory (ROM), programmable Read Only Memory (Programmable Read-Only Memory; PROM), erasable Read Only Memory (Erasable Programmable Read-Only Memory; EPROM), electrically erasable Read Only Memory (Electric Erasable Programmable Read-Only Memory; EEPROM), etc. The memory is used for storing a program, and the processor executes the program after receiving the execution instruction. Further, the software programs and modules within the memory may also include an operating system, which may include various software components and/or drivers for managing system tasks (e.g., memory management, storage device control, power management, etc.), and may communicate with various hardware or software components to provide an operating environment for other software components.
The processor may be an integrated circuit chip with signal processing capabilities. The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, abbreviated as CPU), a network processor (Network Processor, abbreviated as NP), and the like. The disclosed methods, steps, and logic blocks in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. It will be appreciated that the configuration of fig. 7 is illustrative only and may include more or fewer components than shown in fig. 7 or have a different configuration than shown in fig. 7. The components shown in fig. 7 may be implemented in hardware and/or software.
The embodiment of the invention also provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor can implement the access processing method provided by any of the above method embodiments.
The computer readable storage medium in this embodiment may be any available medium that can be accessed by a computer or a data storage device such as a server, a data center, etc. that contains one or more available medium(s) integrated, and the available medium may be a magnetic medium, (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., an SSD), etc.
Those of ordinary skill in the art will appreciate that: all or part of the steps for implementing the method embodiments described above may be performed by hardware associated with program instructions. The foregoing program may be stored in a computer readable storage medium. The program, when executed, performs steps including the method embodiments described above; and the aforementioned storage medium includes: various media that can store program code, such as ROM, RAM, magnetic or optical disks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the invention.
Claims (12)
1. An access processing method, comprising:
responding to an access request of a target short link, and determining an item identifier corresponding to the target short link;
determining a target link table corresponding to the target short link based on the item identification, wherein a plurality of links corresponding to the target short link are stored in the target link table;
determining a plurality of links to be accessed based on link states of the links in the target link table, wherein the link states comprise a valid state and a failure state; the link states of the plurality of links to be accessed are valid states;
and determining a target access link corresponding to the target short link from a plurality of links to be accessed corresponding to the item identification.
2. The method of claim 1, wherein the determining a target access link corresponding to the target short link from the plurality of links to be accessed corresponding to the item identification comprises:
sequentially acquiring each link to be accessed, and judging whether the acquired access times of the current link to be accessed are greater than or equal to preset access times;
if the access times of the current link to be accessed is greater than or equal to the preset access times, marking the link state of the current link to be accessed as a failure state;
And if the access times of the current link to be accessed is smaller than the preset access times, taking the current link to be accessed as the target access link corresponding to the target short link.
3. The method of claim 1, wherein the determining a target access link corresponding to the target short link from the plurality of links to be accessed corresponding to the item identification comprises:
sequentially acquiring each link to be accessed, and judging whether the survival time of the acquired current link to be accessed is greater than or equal to a corresponding preset survival threshold value, wherein each link to be accessed in the plurality of links to be accessed is provided with the respective preset survival threshold value;
if the survival time of the current link to be accessed is greater than or equal to the corresponding preset survival threshold value, marking the link state of the current link to be accessed as a failure state;
and if the survival time of the current link to be accessed is smaller than the corresponding preset survival threshold value, taking the current link to be accessed as the target access link corresponding to the target short link.
4. The method according to claim 1, wherein the method further comprises:
And recording the source page address and the corresponding source network address of the target short link in an access log table.
5. The method according to claim 4, wherein the method further comprises:
acquiring the access log table corresponding to the item identifier in a preset time period;
determining a total access amount to the target short link based on the number of log records in the access log table;
an independent amount of guests for the target short link is determined based on each of the source network addresses in the access log table.
6. The method according to claim 4, wherein the method further comprises:
acquiring the access log table corresponding to the item identifier in a preset time period;
counting the access times from each source page address based on the access log table;
and determining the access amount of each source page address to the target short link based on the statistical result.
7. The method according to claim 1, wherein the method further comprises:
acquiring the creation time of the link to be accessed;
determining whether the survival time of the link to be accessed is greater than a preset survival threshold value according to the creation time;
And if the survival time is greater than the preset survival threshold value, sending out alarm information.
8. The method according to claim 1, wherein the method further comprises:
acquiring the item identification of a target item, domain name information of a target domain name and a short link interface corresponding to the target short link;
binding the item identifier, the domain name information and the short link interface to generate the target short link.
9. The method according to any of claims 1 to 8, wherein the target short link is a uniform resource locator and the link to be accessed is a two-dimensional code to be accessed, or wherein the target short link is a short link two-dimensional code and the link to be accessed is a uniform resource locator.
10. An access processing apparatus, comprising:
the identification determining module is used for responding to an access request of a target short link and determining an item identification corresponding to the target short link;
the link determining module is used for determining a target access link corresponding to the target short link from a plurality of links to be accessed corresponding to the item identification;
the link table determining module is used for determining a target link table corresponding to the target short link based on the item identification, wherein a plurality of links corresponding to the target short link are stored in the target link table;
The link to be accessed determining module is used for determining the links to be accessed based on the link states of the links in the target link table, wherein the link states comprise a valid state and a failure state; the link states of the plurality of links to be accessed are valid states.
11. An access processing device, comprising:
a receiver, a processor, a memory, and a transmitter;
the memory is used for storing a computer program and data, and the processor calls the computer program stored in the memory to execute the access processing method according to any one of claims 1 to 9.
12. A computer readable storage medium, characterized in that the computer readable storage medium comprises a computer program for performing the access processing method of any of claims 1 to 9 when being executed by a processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911060622.2A CN111767481B (en) | 2019-11-01 | 2019-11-01 | Access processing method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911060622.2A CN111767481B (en) | 2019-11-01 | 2019-11-01 | Access processing method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111767481A CN111767481A (en) | 2020-10-13 |
| CN111767481B true CN111767481B (en) | 2024-02-06 |
Family
ID=72718439
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911060622.2A Active CN111767481B (en) | 2019-11-01 | 2019-11-01 | Access processing method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111767481B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113886338B (en) * | 2021-12-07 | 2022-03-15 | 天津联想协同科技有限公司 | Method, device and storage medium for reverse tracing of outer link |
| CN115208890B (en) * | 2022-06-09 | 2024-04-30 | 北京达佳互联信息技术有限公司 | Information acquisition method and device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104680114A (en) * | 2015-03-03 | 2015-06-03 | 黄伟军 | Method for processing multiple requests via two-dimension code and system thereof |
| CN106528569A (en) * | 2015-09-11 | 2017-03-22 | 北京国双科技有限公司 | Method and device for calculating validity of site search |
| CN106933871A (en) * | 2015-12-30 | 2017-07-07 | 阿里巴巴集团控股有限公司 | Short linking processing method, device and short linked server |
| CN107679888A (en) * | 2017-09-07 | 2018-02-09 | 深圳市买买提乐购金融服务有限公司 | Marketing effectiveness appraisal procedure, server and computer-readable recording medium |
| CN109918586A (en) * | 2019-01-21 | 2019-06-21 | 广东万丈金数信息技术股份有限公司 | Short link jump method, device, short linked server and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7873537B2 (en) * | 2003-12-04 | 2011-01-18 | International Business Machines Corporation | Providing deep linking functions with digital rights management |
-
2019
- 2019-11-01 CN CN201911060622.2A patent/CN111767481B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104680114A (en) * | 2015-03-03 | 2015-06-03 | 黄伟军 | Method for processing multiple requests via two-dimension code and system thereof |
| CN106528569A (en) * | 2015-09-11 | 2017-03-22 | 北京国双科技有限公司 | Method and device for calculating validity of site search |
| CN106933871A (en) * | 2015-12-30 | 2017-07-07 | 阿里巴巴集团控股有限公司 | Short linking processing method, device and short linked server |
| CN107679888A (en) * | 2017-09-07 | 2018-02-09 | 深圳市买买提乐购金融服务有限公司 | Marketing effectiveness appraisal procedure, server and computer-readable recording medium |
| CN109918586A (en) * | 2019-01-21 | 2019-06-21 | 广东万丈金数信息技术股份有限公司 | Short link jump method, device, short linked server and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111767481A (en) | 2020-10-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108427705B (en) | Electronic device, distributed system log query method and storage medium | |
| CN108737325B (en) | Multi-tenant data isolation method, device and system | |
| CN107169094B (en) | Information aggregation method and device | |
| CN111198976B (en) | Cloud asset association analysis system, method, electronic equipment and medium | |
| CN111046237B (en) | User behavior data processing method and device, electronic equipment and readable medium | |
| CN111310061B (en) | Full-link multi-channel attribution method, device, server and storage medium | |
| CN105516368A (en) | Cloud desktop client, server and method and system for implementing cloud desktop | |
| CN109284321B (en) | Data loading method, device, computing equipment and computer readable storage medium | |
| CN109740129B (en) | Report generation method, device and equipment based on blockchain and readable storage medium | |
| CN105550175A (en) | Malicious account identification method and apparatus | |
| CN111767481B (en) | Access processing method, device, equipment and storage medium | |
| CN104579909A (en) | Method and equipment for classifying user information and acquiring user grouping information | |
| CN108154024B (en) | Data retrieval method and device and electronic equipment | |
| CN108684044A (en) | A kind of user behavior detecting system, method and device | |
| CN108319688A (en) | A kind of method and apparatus for user read prompting | |
| CN108040117A (en) | Information-pushing method and device | |
| CN107294905B (en) | Method and device for identifying user | |
| US20160283517A1 (en) | Real Estate Data Gathering System and Method | |
| CN113900907A (en) | Mapping construction method and system | |
| CN110209347B (en) | Traceable data storage method | |
| US20190286671A1 (en) | Algorithmic computation of entity information from ip address | |
| CN110020166A (en) | A kind of data analysing method and relevant device | |
| US20140115095A1 (en) | Content item type determination and selection | |
| CN115795100A (en) | User event processing method and device, electronic equipment and readable storage medium | |
| CN113434069A (en) | Menu configuration method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |