CN116756443A - Link-based exit method, device, equipment and storage medium - Google Patents

Link-based exit method, device, equipment and storage medium Download PDF

Info

Publication number
CN116756443A
CN116756443A CN202310560904.9A CN202310560904A CN116756443A CN 116756443 A CN116756443 A CN 116756443A CN 202310560904 A CN202310560904 A CN 202310560904A CN 116756443 A CN116756443 A CN 116756443A
Authority
CN
China
Prior art keywords
link
invalid
links
detected
preset
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.)
Pending
Application number
CN202310560904.9A
Other languages
Chinese (zh)
Inventor
常德宝
刘晓庆
李书伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Baidu Netcom Science and Technology Co Ltd
Original Assignee
Beijing Baidu Netcom Science and Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Baidu Netcom Science and Technology Co Ltd filed Critical Beijing Baidu Netcom Science and Technology Co Ltd
Priority to CN202310560904.9A priority Critical patent/CN116756443A/en
Publication of CN116756443A publication Critical patent/CN116756443A/en
Pending legal-status Critical Current

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The disclosure provides a link-off method, a device, equipment and a storage medium, relates to the technical field of computers, in particular to the technical fields of data processing, link processing and the like, and can be applied to scenes such as website link-off and terminal application link-off. The specific implementation scheme comprises the following steps: acquiring a link to be detected; classifying the links to be detected according to preset categories to obtain links to be detected corresponding to each preset category, wherein the preset categories are divided according to a database where the links to be detected are located and page types corresponding to the links to be detected; detecting links to be detected corresponding to each preset category in parallel to obtain first invalid links corresponding to each preset category; and carrying out the refund on the first invalid links corresponding to each preset category. The present disclosure can improve link-off efficiency.

Description

Link-based exit method, device, equipment and storage medium
Technical Field
The disclosure relates to the technical field of computers, in particular to the technical fields of data processing, link processing and the like, and can be applied to the scenes of website link refund, terminal application link refund and the like, in particular to a link refund method, a device, equipment and a storage medium.
Background
An invalid link refers to a Web link in a path unreachable state in a Web site, which is one of the important causes of the degradation of the Web site performance. In addition, in order to improve the searching efficiency of users and the quality of search results, the search engine rarely displays sites with a large number of invalid links preferentially, so that the websites are reduced in weight by the search engine. Therefore, various invalid links in the website need to be subjected to a refund process to maintain the performance of the website and keep the content of the website intact.
At present, when links are to be retired, invalidation detection is sequentially performed on the links in a serial manner, and then the links detected as invalid links are subjected to a refund process.
However, this link-off approach is currently inefficient.
Disclosure of Invention
The present disclosure provides a link-off method, device, apparatus, and storage medium, which can improve link-off efficiency.
According to a first aspect of the present disclosure, there is provided a link-demagnetizing method, including:
acquiring a link to be detected; classifying links to be detected according to preset categories to obtain links to be detected corresponding to each preset category, wherein the preset categories are divided according to a database where the links to be detected are located and page types corresponding to the links to be detected; detecting links to be detected corresponding to each preset category in parallel to obtain first invalid links corresponding to each preset category; and carrying out the refund on the first invalid link corresponding to each preset category.
According to a second aspect of the present disclosure, there is provided a linked-demagnetizing device comprising: the system comprises a dividing module and a processing module.
The dividing module is used for acquiring a link to be detected; classifying links to be detected according to preset categories to obtain links to be detected corresponding to each preset category, wherein the preset categories are divided according to a database where the links to be detected are located and page types corresponding to the links to be detected.
The processing module is used for detecting the links to be detected corresponding to each preset category in parallel to obtain first invalid links corresponding to each preset category; and carrying out the refund on the first invalid link corresponding to each preset category.
According to a third aspect of the present disclosure, there is provided an electronic device comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method as in the first aspect.
According to a fourth aspect of the present disclosure, there is provided a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method according to the first aspect.
According to a fifth aspect of the present disclosure, there is provided a computer program product comprising a computer program which, when executed by a processor, implements the method according to the first aspect.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the disclosure, nor is it intended to be used to limit the scope of the disclosure. Other features of the present disclosure will become apparent from the following specification.
Drawings
The drawings are for a better understanding of the present solution and are not to be construed as limiting the present disclosure. Wherein:
fig. 1 is a flow chart of a link-to-exit method according to an embodiment of the disclosure;
fig. 2 is a schematic flow chart of S101 in fig. 1 according to an embodiment of the disclosure;
fig. 3 is a schematic flow chart of S104 in fig. 1 according to an embodiment of the disclosure;
fig. 4 is another flow chart of a link-to-exit method according to an embodiment of the disclosure;
fig. 5 is a schematic flow chart of a link-to-exit method according to an embodiment of the disclosure;
FIG. 6 is a schematic diagram of a linked-out system provided by an embodiment of the present disclosure;
fig. 7 is a schematic diagram of a linked-out device according to an embodiment of the disclosure;
fig. 8 is a schematic diagram of the composition of an electronic device according to an embodiment of the disclosure.
Detailed Description
Exemplary embodiments of the present disclosure are described below in conjunction with the accompanying drawings, which include various details of the embodiments of the present disclosure to facilitate understanding, and should be considered as merely exemplary. Accordingly, one of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
It should be appreciated that in embodiments of the present disclosure, the character "/" generally indicates that the context associated object is an "or" relationship. The terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated.
An invalid link refers to a Web link in a path unreachable state in a Web site, which is one of the important causes of the degradation of the Web site performance. In addition, in order to improve the searching efficiency of users and the quality of search results, the search engine rarely displays sites with a large number of invalid links preferentially, so that the websites are reduced in weight by the search engine. Therefore, various invalid links in the website need to be subjected to a refund process to maintain the performance of the website and keep the content of the website intact.
The invalidation links may include protocol invalidation links and content invalidation links by type. The protocol invalidation links may include invalidation links explicitly represented by TCP protocol states or HTTP protocol states, such as invalidation links that occur 404, 403, 503, etc. The content invalidation link may include a link in which the return state of the server is normal, but the linked content has been changed to content that does not exist, has been deleted, or needs rights, etc., irrespective of the original content.
At present, when links are to be retired, invalidation detection is sequentially performed on the links in a serial manner, and then the links detected as invalid links are subjected to a refund process.
For example, when the 10 links are to be retired, it is necessary to first perform invalidation detection on the first link, then perform invalidation detection on the second link until all of the 10 links are subjected to invalidation detection, and then retire the link detected as the invalid link from the 10 links.
However, this link-off approach is currently inefficient.
Since the invalid links can be sequentially detected in a serial manner, the efficiency of detecting the invalid links is not high, and thus the efficiency of link departure is low.
Under the background technology, the present disclosure provides a link-off method, which can improve link-off efficiency.
The execution subject of the link-off method provided by the embodiment of the disclosure may be a computer or a server, or may also be other electronic devices with data processing capability; alternatively, the execution subject of the method may be a processor (e.g., a central processing unit (central processing unit, CPU)) in the above-described electronic device; still alternatively, the execution subject of the method may be an Application (APP) installed in the electronic device and capable of implementing the function of the method; alternatively, the execution subject of the method may be a functional module, a unit, or the like having the function of the method in the electronic device. The subject of execution of the method is not limited herein.
The link-demagnetizing method will be exemplarily described with reference to the accompanying drawings.
Fig. 1 is a flowchart of a link-to-exit method according to an embodiment of the disclosure. As shown in fig. 1, the method may include:
s101, acquiring a link to be detected.
The links to be detected may be all links in the databases, or may be part of links in each database or all or part of links in any database specified by human beings.
For example, according to the capability of the existing hardware resource for processing the link to be detected, which can be processed by the existing hardware resource every day, can be obtained in a window sliding manner, so as to ensure the stability of the existing hardware resource for processing the link to be detected.
S102, classifying the links to be detected according to preset categories to obtain the links to be detected corresponding to each preset category.
The preset categories are divided according to a database where the links to be detected are located and page types corresponding to the links to be detected.
Illustratively, the databases may include high-and low-equity databases classified by processing priorities, commodity databases classified according to data functions, advertisement databases, user information databases, etc., and the page types may include content page types, search page types, etc.
For example, taking the example that the database includes A, B and the page types include a and B, the preset categories may include four types a-a, a-B, B-a and B-B, and correspondingly, the links to be detected are also divided into four types a-a, a-B, B-a and B-B.
S103, detecting the links to be detected corresponding to each preset category in parallel to obtain first invalid links corresponding to each preset category.
For example, a link detection rule may be established for each preset category of features, and the links to be detected in each preset category may be detected simultaneously.
S104, carrying out the departure of the first invalid link corresponding to each preset category.
For example, the first invalid link may be deleted directly, or the page and the corresponding relationship corresponding to the first invalid link may be deleted.
According to the method and the device for detecting the links to be detected, the links to be detected are obtained and classified according to the preset categories, invalid link detection can be conducted on the links to be detected corresponding to each preset category in a parallel mode, the first invalid links corresponding to each preset category are obtained, the time period for detecting the links to be detected to obtain the first invalid links can be reduced, and the link departure efficiency is improved.
Fig. 2 is a schematic flow chart of S101 in fig. 1 according to an embodiment of the disclosure. As shown in fig. 2, the above-described acquisition of the link to be detected may include the following S201 to S203.
S201, acquiring a target link set, wherein the target link set comprises at least one target link.
Illustratively, the target links may be all links in the database, may be manually specified partial links, and are not limited herein. For example, a link whose date of generation is smaller than a certain date may be taken as the target link.
S202, determining invalid target links in a target link set according to a preset invalid link set, wherein the preset invalid link set comprises at least one invalid link.
Wherein, the invalid links in the preset invalid link set are links which are determined to be invalid links.
For example, the target links in the target link set may be directly compared with the invalid links in the preset no-link set, and the target links consistent with the invalid links in the preset no-link set are the invalid target links. Or, by calculating the hash value or other parameters of the target links in the target link set, and comparing the hash value or other parameters of the invalid links in the preset invalid link set, the target links with the hash values consistent with the hash values of the invalid links are the invalid target links.
S203, determining target links except invalid target links in the target link set as links to be detected.
For example, taking the example that the target link set includes the link a, the link B and the link C, and the determined invalid target link is the link C, the target links except the invalid target link in the target link set are the link a and the link B, that is, the links to be detected are the link a and the link B.
The method may further comprise:
s105, carrying out the refund on the invalid target link.
Illustratively, the step sequence in the method of S105 above is just after S101 above, and there is no other execution sequence limitation.
According to the method, the device and the system, the target link set containing the target links is obtained, the invalid target links in the target link set are determined according to the invalid links in the preset invalid link set, the target links except the invalid target links in the target link set are used as links to be detected, the target links in the target link set can be subjected to preliminary filtering according to the preset invalid link set, and the fewer links to be detected are determined, so that the number of the links to be detected is smaller than that of the target links in the target link set, and the departure efficiency of the links to be detected is further improved.
In one possible embodiment, the method may further comprise:
and updating the preset invalid link set according to the first invalid links corresponding to each preset category.
For example, the first invalid link corresponding to each preset category may be added to the preset invalid link set after each obtaining the first invalid link corresponding to each preset category.
According to the method and the device, the preset invalid link sets are updated according to the invalid links corresponding to each preset category, so that the number of the invalid links in the preset invalid link sets can be increased, more links can be determined to be invalid links in advance when links to be detected are acquired later, the number of links actually detected is reduced, and the link departure efficiency is further improved.
Fig. 3 is a schematic flow chart of S104 in fig. 1 according to an embodiment of the disclosure. As shown in fig. 3, the foregoing performing the refund on the invalid links corresponding to each preset category may include:
s301, obtaining the confidence coefficient of the first invalid link corresponding to each preset category.
Where the confidence may characterize the likelihood that a link is an invalid link.
For example, a plurality of links may be obtained as training samples, and a label of whether the link corresponding to the sample is an invalid link may be added to each sample, so as to obtain a training sample set. And training the initial neural network through the training sample set to obtain a trained neural network. And obtaining the confidence coefficient corresponding to the invalid links through the training network by using the invalid links corresponding to each preset category.
S302, determining that the first invalid link with the confidence meeting the requirement is a target invalid link according to the confidence of the first invalid link corresponding to each preset category.
For example, the target invalid link may be a first invalid link having a confidence level greater than a first threshold. The first threshold corresponding to the confidence level of the first invalid link corresponding to each preset category may be the same or different, and is not limited herein.
S303, carrying out the departure on the target invalid link.
According to the embodiment, the confidence coefficient of the invalid link corresponding to each preset category is obtained, the invalid link with the confidence coefficient meeting the requirement is used as the target invalid link, the target invalid link is subjected to the refund, the target invalid link can be accurately determined through the confidence coefficient, and the accuracy of the link refund is improved.
Fig. 4 is another flow chart of a link-to-exit method according to an embodiment of the disclosure. As shown in fig. 4, after acquiring the link to be detected, the method further includes:
s401, obtaining an access log of a link to be detected.
For example, the access log of the link to be detected may include access return parameters obtained each time the link to be detected is accessed, which may be used to characterize the link state of the corresponding link.
For example, after the access log of the link to be detected is updated each time, the access log may be obtained, and the connection state of the link to be detected may be timely obtained; the access log may be periodically acquired, so that the corresponding hardware resource cost may be reduced.
The access log may be obtained, for example, by the kafka messaging system. For example, the database where the link to be detected is located generates an access log of the link to be detected, pushes the access log to the kafka message cluster, and the electronic device can acquire the access log from the kafka message cluster.
S402, obtaining the state of each link to be detected when each link is accessed according to the access log, wherein the state comprises a valid state and an invalid state.
The valid state representation link is in a state that the corresponding content can be normally accessed, and the invalid state representation link is in a state that the corresponding content can not be normally accessed.
Illustratively, the access return parameters in the access log may be parsed to obtain the state of each link to be detected each time it is accessed.
S403, determining that the link to be detected with the invalid state when the link is accessed last time is a second invalid link.
For example, a link to be detected whose state is an invalid state at the last time it was accessed may be taken as a second invalid link.
S404, the second invalid link is subjected to the departure.
According to the embodiment, by acquiring the access log of the links to be detected, according to the state of each link to be detected, which is obtained by the access log, when each link to be detected is accessed, whether each link to be detected is a second invalid link can be determined in real time, and the second invalid link is subjected to the refund, so that the links which are in the invalid state can be subjected to the refund in real time, and the link refund efficiency is improved.
In a possible embodiment, the foregoing refunding the second invalid link may include:
and when the last accessed state of the second invalid link is the valid state or the state is empty, carrying out the refund on the second invalid link.
Illustratively, when the last accessed state of the link a to be detected has been an invalid state, the link a to be detected has been currently determined as a second invalid link requiring a refund, and is in the process of being refunded, without performing refund processing on it again.
According to the embodiment, the second invalid link which is accessed last time and has the valid state or the empty state is subjected to the refund, so that the second invalid link which is already in the refund process is prevented from being subjected to the refund process again, and machine resources are saved.
In a possible embodiment, the method in fig. 4 may further include:
and updating the preset invalid link set according to the second invalid link.
For example, the second invalid link may be added to the preset invalid link set after each time the second invalid link is obtained.
According to the embodiment, the preset invalid link set is updated according to the second invalid link, so that the number of invalid links in the preset invalid link set can be increased, more links can be determined as invalid links in advance when links to be detected are acquired later, the number of links actually detected is reduced, and the link departure efficiency is further improved.
Fig. 5 is a schematic flow chart of a link-to-exit method according to an embodiment of the disclosure. As shown in fig. 5, the method may further include:
s501, a time interval between a time when each link to be detected is determined as an invalid link and a time when the departure is completed is acquired.
S502, outputting alarm information when the time interval corresponding to any link to be detected is greater than the preset duration.
For example, the preset time period may be set according to hardware performance of the electronic device (an empirical value), for example, 1 minute, 30 minutes, 1 hour, etc., and the size of the preset time period is not limited.
For example, the alarm signal may be output to remind a maintainer of the electronic device to perform manual intervention, or the alarm signal may be output to a module capable of processing the corresponding problem, so as to notify the module to perform processing according to a preset rule.
For example, the alarm information may display alarm text information for the maintainer through a display provided on the electronic device, or may play alarm voice for the maintainer through an audio output device (such as a speaker, an earphone, etc.) provided on the electronic device, or may alert and remind the maintainer by lighting an alarm lamp provided on the electronic device.
According to the embodiment, the time interval between the moment when each link to be detected is determined to be the invalid link and the moment when the link to be detected is completed to be the exit is acquired, and when the time interval corresponding to any one link to be detected is longer than the preset duration, the alarm information is output, so that the links with abnormal exit can be timely processed, and the efficiency of link exit is further improved.
The above embodiments introduce the link-exit method provided by the embodiments of the present disclosure, and the link-exit method is described in more detail below by way of a specific example with reference to fig. 6. Fig. 6 is a schematic diagram of a link-based system according to an embodiment of the disclosure. The link-off method can be implemented by the link-off system shown in fig. 6.
As shown in fig. 6, the linked-out system 600 may include: an acquisition unit 601, a division unit 602, a detection unit 603, a confidence unit 604, a kafka message unit 605, an execution unit 606, and a monitoring unit 607.
The obtaining unit may obtain the link to be detected and send the link to be detected to the dividing unit through the embodiment of fig. 2.
The dividing unit can divide the links to be detected according to preset categories and send the divided links to be detected to the detecting unit.
The detection unit can respectively establish a detection mechanism for each preset category, and perform parallel detection on links to be detected of different preset categories to obtain invalid links corresponding to each preset category and send the invalid links to the confidence unit; and updating the preset invalid link set according to the invalid links corresponding to each preset category.
The confidence unit may determine, by the method of fig. 3, an invalid link that meets the confidence requirement as a target invalid link and send it to the execution unit.
The kafka message unit may determine an invalid link according to the state of each link to be detected when each link is accessed by the method of fig. 4, and send the invalid link to the execution unit; and updating a preset invalid link set according to the invalid link.
The execution unit may delete the received invalid links and store them separately, thereby supporting the delete query.
The monitoring unit may monitor the execution unit and alert the links when the departure exception occurs by the method of fig. 5.
The foregoing description of the embodiments of the present disclosure has been presented primarily in terms of methods. To achieve the above functions, it includes corresponding hardware structures and/or software modules that perform the respective functions. Those of skill in the art will readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. The technical aim may be to use different methods to implement the described functions for each particular application, but such implementation should not be considered beyond the scope of the present disclosure.
In an exemplary embodiment, the present disclosure further provides a link-demagnetizing system that may be used to implement the link-demagnetizing method as in the foregoing embodiment.
The link-demagnetizing system may include a first electronic device and a second electronic device, where the first electronic device is configured to determine an invalid link based on the link-demagnetizing method provided in the foregoing embodiment, and push the invalid link that needs to be demagnetized to the second electronic device. For example, the first electronic device may be a computer, a mobile terminal, or the like.
Correspondingly, the second electronic device is used for storing the links and related data. For example, the second electronic device may be a server.
Based on the link-off method in the foregoing embodiment, the obtaining the target link set may specifically be that the first electronic device obtains, from the second electronic device, each link stored by the second electronic device. The first electronic device can determine the invalid link based on the link-out method of the previous embodiment. The first electronic device may push the determined invalid link to the second electronic device, so that the second electronic device refunds the corresponding invalid link. For example, the first electronic device generates a corresponding refund instruction according to the invalid link, so that the second electronic device refunds the corresponding invalid link according to the refund instruction. For another example, the first electronic device may directly push the determined invalid link to the second electronic device, so that the second electronic device may refund the corresponding invalid link according to the received invalid link.
In an exemplary embodiment, the present disclosure further provides a link-demagnetizing apparatus that may be used to implement the link-demagnetizing method as in the foregoing embodiment.
Fig. 7 is a schematic diagram of a linked-out device according to an embodiment of the disclosure. As shown in fig. 7, the apparatus may include: a partitioning module 701 and a processing module 702.
A dividing module 701, configured to obtain a link to be detected; classifying links to be detected according to preset categories to obtain links to be detected corresponding to each preset category, wherein the preset categories are divided according to a database where the links to be detected are located and page types corresponding to the links to be detected.
The processing module 702 is configured to detect links to be detected corresponding to each preset category in parallel, so as to obtain a first invalid link corresponding to each preset category; and carrying out the refund on the first invalid link corresponding to each preset category.
In some possible embodiments, the partitioning module 701 is specifically configured to:
acquiring a target link set, wherein the target link set comprises at least one target link; determining invalid target links in the target link set according to a preset invalid link set, wherein the preset invalid link set comprises at least one invalid link; and determining target links except the invalid target link in the target link set as links to be detected.
The processing module 702 is further configured to:
and carrying out the refund on the invalid target link.
In some possible implementations, the processing module 702 is further configured to:
and updating the preset invalid link set according to the first invalid links corresponding to each preset category.
In some possible embodiments, the processing module 702 is specifically configured to:
acquiring the confidence coefficient of a first invalid link corresponding to each preset category; determining the first invalid link with the confidence meeting the requirements as a target invalid link according to the confidence of the first invalid link corresponding to each preset category; and carrying out the refund on the target invalid link.
In some possible implementations, the partitioning module 701 is further configured to:
after acquiring a link to be detected, acquiring an access log of the link to be detected; according to the access log, obtaining the state of each link to be detected when each link is accessed, wherein the states comprise an effective state and an invalid state; determining that the link to be detected, the state of which is invalid when the link is accessed last time, is a second invalid link; and carrying out the refund on the second invalid link.
In some possible embodiments, the partitioning module 701 is specifically configured to:
and when the last accessed state of the second invalid link is the valid state or the state is empty, carrying out the refund on the second invalid link.
In some possible implementations, the processing module 702 is further configured to:
and updating the preset invalid link set according to the second invalid link.
In some possible implementations, the processing module 702 is further configured to:
acquiring a time interval between the moment when each link to be detected is determined to be an invalid link and the moment when the departure is completed; and outputting alarm information when the time interval corresponding to any link to be detected is greater than the preset duration.
It should be noted that the division of the modules in fig. 7 is schematic, and is merely a logic function division, and other division manners may be implemented in practice. For example, two or more functions may also be integrated in one processing module. The embodiments of the present disclosure are not limited in this regard. The integrated modules may be implemented in hardware or in software functional modules.
In the technical scheme of the disclosure, the acquisition, storage, application and the like of the related user personal information all conform to the regulations of related laws and regulations, and the public sequence is not violated.
According to embodiments of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.
In an exemplary embodiment, an electronic device includes: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method as described in the above embodiments. The electronic device may be the computer or server described above.
In an exemplary embodiment, the readable storage medium may be a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method according to the above embodiment.
In an exemplary embodiment, the computer program product comprises a computer program which, when executed by a processor, implements the method according to the above embodiments.
Fig. 8 illustrates a schematic block diagram of an example electronic device 800 that may be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.
As shown in fig. 8, the electronic device 800 includes a computing unit 801 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 802 or a computer program loaded from a storage unit 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the electronic device 800 can also be stored. The computing unit 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.
Various components in electronic device 800 are connected to I/O interface 805, including: an input unit 806 such as a keyboard, mouse, etc.; an output unit 807 such as various types of displays, speakers, and the like; a storage unit 808, such as a magnetic disk, optical disk, etc.; and a communication unit 809, such as a network card, modem, wireless communication transceiver, or the like. The communication unit 809 allows the electronic device 800 to exchange information/data with other devices through a computer network such as the internet and/or various telecommunication networks.
The computing unit 801 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 801 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 801 performs the various methods and processes described above, such as the linked-out approach. For example, in some embodiments, the linked-out method may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as the storage unit 808. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 800 via the ROM 802 and/or the communication unit 809. When the computer program is loaded into RAM 803 and executed by computing unit 801, one or more steps of the linked-out method described above may be performed. Alternatively, in other embodiments, the computing unit 801 may be configured to perform the linked-out method in any other suitable manner (e.g., by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server incorporating a blockchain.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps recited in the present disclosure may be performed in parallel, sequentially, or in a different order, provided that the desired results of the disclosed aspects are achieved, and are not limited herein.
The above detailed description should not be taken as limiting the scope of the present disclosure. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present disclosure are intended to be included within the scope of the present disclosure.

Claims (19)

1. A link-demagnetizing method, the method comprising:
acquiring a link to be detected;
classifying the links to be detected according to preset categories to obtain links to be detected corresponding to each preset category, wherein the preset categories are divided according to a database where the links to be detected are located and page types corresponding to the links to be detected;
detecting links to be detected corresponding to each preset category in parallel to obtain first invalid links corresponding to each preset category;
and carrying out the refund on the first invalid links corresponding to each preset category.
2. The method of claim 1, the obtaining a link to be detected, comprising:
acquiring a target link set, wherein the target link set comprises at least one target link;
determining invalid target links in the target link set according to a preset invalid link set, wherein the preset invalid link set comprises at least one invalid link;
determining target links except the invalid target link in the target link set as the links to be detected;
the method further comprises the steps of:
and carrying out the refund on the invalid target link.
3. The method of claim 1 or 2, the method further comprising:
and updating the preset invalid link set according to the first invalid links corresponding to each preset category.
4. A method according to any one of claims 1-3, wherein said refunding the first invalid link corresponding to each of said preset categories comprises:
acquiring the confidence coefficient of the first invalid link corresponding to each preset category;
according to the confidence coefficient of the first invalid link corresponding to each preset category, determining the first invalid link with the confidence coefficient meeting the requirement as a target invalid link;
and carrying out the refund on the target invalid link.
5. The method of claim 2, after the obtaining the link to be detected, the method further comprising:
acquiring an access log of the link to be detected;
according to the access log, obtaining the state of each link to be detected when each link is accessed, wherein the states comprise an effective state and an invalid state;
determining that the link to be detected, the state of which is invalid when the link is accessed last time, is a second invalid link;
and carrying out the refund on the second invalid link.
6. The method of claim 5, the refunding the second invalid link comprising:
and when the last accessed state of the second invalid link is a valid state or the state is empty, carrying out the refund on the second invalid link.
7. The method of claim 5 or 6, the method further comprising:
and updating the preset invalid link set according to the second invalid link.
8. The method of any one of claims 1-7, further comprising:
acquiring a time interval between the moment when each link to be detected is determined to be an invalid link and the moment when the departure is completed;
and outputting alarm information when the time interval corresponding to any link to be detected is greater than a preset duration.
9. A linked-demagnetizing device, the device comprising:
the dividing module is used for acquiring a link to be detected; classifying the links to be detected according to preset categories to obtain links to be detected corresponding to each preset category, wherein the preset categories are divided according to a database where the links to be detected are located and page types corresponding to the links to be detected;
the processing module is used for detecting the links to be detected corresponding to each preset category in parallel to obtain first invalid links corresponding to each preset category; and carrying out the refund on the first invalid links corresponding to each preset category.
10. The apparatus of claim 9, the partitioning module being specifically configured to:
acquiring a target link set, wherein the target link set comprises at least one target link;
determining invalid target links in the target link set according to a preset invalid link set, wherein the preset invalid link set comprises at least one invalid link;
determining target links except the invalid target link in the target link set as the links to be detected;
the processing module is further configured to:
and carrying out the refund on the invalid target link.
11. The apparatus of claim 9 or 10, the processing module further to:
and updating the preset invalid link set according to the first invalid links corresponding to each preset category.
12. The apparatus according to any of claims 9-11, the processing module being specifically configured to:
acquiring the confidence coefficient of the first invalid link corresponding to each preset category;
according to the confidence coefficient of the first invalid link corresponding to each preset category, determining the first invalid link with the confidence coefficient meeting the requirement as a target invalid link;
and carrying out the refund on the target invalid link.
13. The apparatus of claim 10, the partitioning module further to:
after the links to be detected are acquired, acquiring access logs of the links to be detected;
according to the access log, obtaining the state of each link to be detected when each link is accessed, wherein the states comprise an effective state and an invalid state;
determining that the link to be detected, the state of which is invalid when the link is accessed last time, is a second invalid link;
and carrying out the refund on the second invalid link.
14. The apparatus of claim 13, the partitioning module being specifically configured to:
and when the last accessed state of the second invalid link is a valid state or the state is empty, carrying out the refund on the second invalid link.
15. The apparatus of claim 13 or 14, the processing module further to:
and updating the preset invalid link set according to the second invalid link.
16. The apparatus of any of claims 9-15, the processing module further to:
acquiring a time interval between the moment when each link to be detected is determined to be an invalid link and the moment when the departure is completed;
and outputting alarm information when the time interval corresponding to any link to be detected is greater than a preset duration.
17. An electronic device, comprising: at least one processor; and a memory communicatively coupled to the at least one processor;
wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-8.
18. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1-8.
19. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any of claims 1-8.
CN202310560904.9A 2023-05-17 2023-05-17 Link-based exit method, device, equipment and storage medium Pending CN116756443A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310560904.9A CN116756443A (en) 2023-05-17 2023-05-17 Link-based exit method, device, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310560904.9A CN116756443A (en) 2023-05-17 2023-05-17 Link-based exit method, device, equipment and storage medium

Publications (1)

Publication Number Publication Date
CN116756443A true CN116756443A (en) 2023-09-15

Family

ID=87956165

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310560904.9A Pending CN116756443A (en) 2023-05-17 2023-05-17 Link-based exit method, device, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN116756443A (en)

Similar Documents

Publication Publication Date Title
CN107291835B (en) Search term recommendation method and device
CN116611411A (en) Business system report generation method, device, equipment and storage medium
CN114297278A (en) Method, system and device for quickly writing batch data
CN114417118A (en) Abnormal data processing method, device, equipment and storage medium
CN113656239A (en) Monitoring method and device for middleware and computer program product
CN113495825A (en) Line alarm processing method and device, electronic equipment and readable storage medium
CN117093627A (en) Information mining method, device, electronic equipment and storage medium
CN116545905A (en) Service health detection method and device, electronic equipment and storage medium
CN115994534A (en) Government scene hot word mining method, device, equipment and storage medium
CN114697247B (en) Fault detection method, device, equipment and storage medium of streaming media system
CN112887426B (en) Information stream pushing method and device, electronic equipment and storage medium
CN116756443A (en) Link-based exit method, device, equipment and storage medium
CN114116924A (en) Data query method based on map data, map data construction method and device
CN114661562A (en) Data warning method, device, equipment and medium
CN115187364A (en) Method and device for monitoring deposit risk under bank distributed scene
CN114138358A (en) Application program starting optimization method, device, equipment and storage medium
CN114186123A (en) Processing method, device and equipment for hotspot event and storage medium
CN113449230A (en) Method and system for determining exposure element, client and server
CN113590447B (en) Buried point processing method and device
CN113779098B (en) Data processing method, device, electronic equipment and storage medium
CN111930704B (en) Service alarm equipment control method, device, equipment and computer readable medium
CN114089712B (en) Data processing method and device
CN114065001B (en) Data processing method, device, equipment and storage medium
CN113468053B (en) Application system testing method and device
CN113515568A (en) Graph relation network construction method, graph neural network model training method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication