CN117216427A - Method, device, equipment and medium for loading short links and acquiring short links - Google Patents

Abstract

The disclosure relates to a method, a device, equipment and a medium for loading short links and acquiring short links, and relates to the technical field of computers, wherein the method comprises the following steps: the method comprises the steps of locking a target short-chain batch number, and downloading a batch number file corresponding to the target short-chain batch number from a preset file server based on the target short-chain batch number; acquiring a short link offset in the target short link batch number, and determining the number of short links to be loaded, which is included in the batch number file, based on the short link offset; determining the target loading quantity which can be loaded by the short link storage channel queue according to the current residual short link quantity in the short link storage channel queue and the short link quantity to be loaded; and loading the short link to be loaded into the short link storage channel queue based on the target loading quantity. The present disclosure enables adaptive loading of short links.

Description

Method, device, equipment and medium for loading short links and acquiring short links

Technical Field

The embodiment of the disclosure relates to the technical field of computers, in particular to a short link loading method, a short link loading device, a short link acquisition method, a short link acquisition device, a computer readable storage medium and electronic equipment.

Background

In the existing short link loading method, the short link is generated in real time and loaded into a short link storage channel queue. However, this method does not exclude the repeatability of the loaded short links, so that there is often a repetition of the loaded short links, resulting in lower accuracy of the loaded short links.

It should be noted that, in the above background section, the information of the invention is only for enhancing understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.

Disclosure of Invention

The present disclosure is directed to a method for loading a short link, a device for loading a short link, a method for acquiring a short link, a device for acquiring a short link, a computer-readable storage medium, and an electronic device, and thus, at least to some extent, overcome the problem of low accuracy of the loaded short link due to limitations and drawbacks of the related art.

According to one aspect of the present disclosure, there is provided a loading method of a short link, including:

the method comprises the steps of locking a target short-chain batch number, and downloading a batch number file corresponding to the target short-chain batch number from a preset file server based on the target short-chain batch number;

Acquiring a short link offset in the target short link batch number, and determining the number of short links to be loaded, which is included in the batch number file, based on the short link offset;

determining the target loading quantity which can be loaded by the short link storage channel queue according to the current residual short link quantity in the short link storage channel queue and the short link quantity to be loaded;

and loading the short link to be loaded into the short link storage channel queue based on the target loading quantity.

In one exemplary embodiment of the present disclosure, locking the target short chain lot number includes:

locking an unused current short-chain batch number in a preset short-chain connection batch number list, and judging whether the current short-chain batch number is in an occupied state or not;

when the current short-chain batch number is determined to be in an idle state, taking the current short-chain batch number as a target short-chain batch number;

when the current short-chain batch number is determined to be in an occupied state, one unused current short-chain batch number is locked in a preset short-chain connection batch number list again until the current short-chain batch number is in an idle state, and the current short-chain batch number in the idle state is taken as a target short-chain batch number.

In an exemplary embodiment of the present disclosure, determining the number of short links to be loaded included in the lot number file based on the short link offset includes:

determining a target initial loading position of a short link to be loaded in the batch number file based on the short link offset; the short link offset is set according to the number of loaded short links in the batch number file;

determining the number of loaded short chains in the batch number file according to the original initial loading position of the batch number file and the target initial loading position;

and determining the short link number to be loaded according to the loaded number and all the short link numbers in the batch number file.

In an exemplary embodiment of the present disclosure, determining, according to a current remaining number of short links in a short link storage channel queue and a number of short links to be loaded, a target load number that the short link storage channel queue can load includes:

acquiring the current residual short link number in a short link storage channel queue, and determining the minimum short link number which can be loaded by the short link storage channel queue according to the current residual short link number and the standard short link number which can be loaded by the short link storage channel queue;

And determining the target loading quantity which can be loaded by the short link storage channel queue according to the quantity relation between the short link quantity to be loaded and the minimum short link quantity which can be loaded by the short link storage channel queue.

In one exemplary embodiment of the present disclosure, the short link storage channel queue includes a sub-channel queue having a plurality of different data volume levels;

the sub-channel queues comprise a plurality of first sub-channel queues, second sub-channel queues, third sub-channel queues and fourth sub-channel queues;

the first data volume level of the first sub-channel queue, the second data volume level of the second sub-channel queue, the third data volume level of the third sub-channel queue and the fourth data volume level of the fourth sub-channel queue are sequentially increased;

the current remaining short link number includes a plurality of first remaining short link number corresponding to the first subchannel queue, second remaining short link number corresponding to the second subchannel, third remaining short link number corresponding to the third subchannel, and fourth remaining short link number corresponding to the fourth subchannel.

In an exemplary embodiment of the present disclosure, obtaining a current remaining short link number in a short link storage channel queue, and determining a minimum short link number that can be loaded by the short link storage channel queue according to the current remaining short link number and a standard short link number that can be loaded by the short link storage channel queue, including:

Acquiring a first residual short link number corresponding to a first subchannel queue, a second residual short link number corresponding to a second subchannel queue, a third residual short link number corresponding to a third subchannel queue and a fourth current residual short link number corresponding to a fourth subchannel queue;

determining a first minimum short link number which can be loaded by the first sub-channel queue according to the first residual short link number and the first standard short link number which can be loaded by the first sub-channel queue; and

determining a second minimum short link number which can be loaded by the second sub-channel queue according to the second residual short link number and a second standard short link number which can be loaded by the second sub-channel queue; and

determining a third minimum short link number which can be loaded by the third sub-channel queue according to the third residual short link number and a third standard short link number which can be loaded by the third sub-channel queue; and

determining a fourth minimum short link number which can be loaded by the fourth sub-channel queue according to the fourth residual short link number and a fourth standard short link number which can be loaded by the fourth sub-channel queue;

And determining the minimum short link number which can be loaded by the short link storage channel queue according to the first minimum short link number, the second minimum short link number, the third minimum short link number and the fourth minimum short link number.

In an exemplary embodiment of the present disclosure, determining, according to a number relationship between the number of short links to be loaded and a minimum number of short links that can be loaded by a short link storage channel queue, a target load number that can be loaded by the short link storage channel queue includes:

judging whether the short link number to be loaded is larger than a first preset threshold value, and taking the short link number to be loaded as a first target loading number which can be loaded by the first subchannel queue when the short link number to be loaded is determined to be smaller than the first preset threshold value;

when the short link number to be loaded is determined to be greater than or equal to a first preset threshold, judging the relation between the short link number to be loaded and the minimum short link number;

when the short link number to be loaded is smaller than or equal to the minimum short link number, determining the target loading number which can be loaded by the short link storage channel queue according to the data size level of the short link storage channel queue;

And when the short link number to be loaded is determined to be larger than the minimum short link number, determining the target loading number which can be loaded by the short link storage channel queue according to the current residual short link number.

In an exemplary embodiment of the present disclosure, determining, according to a data volume level of the short link storage channel queue, a target load number that the short link storage channel queue can load includes:

and determining the loading sequence of the short link to be loaded by the short link storage channel queue according to the data volume level of the short link storage channel queue, and determining the target loading quantity which can be loaded by the short link storage channel queue based on the loading sequence.

In an exemplary embodiment of the present disclosure, determining, according to a current remaining short link number, a target load number that the short link storage channel queue can load includes:

determining a first target loading quantity which can be loaded by the first subchannel queue according to the first standard short link quantity and the first residual short link quantity; and

determining a second target loading quantity which can be loaded by the second sub-channel queue according to the second standard short link quantity and the second residual short link quantity; and

Determining a third target loading quantity which can be loaded by the third sub-channel queue according to the third standard short link quantity and the third residual short link quantity; and

and determining a fourth target loading quantity which can be loaded by the fourth sub-channel queue according to the fourth standard short link quantity and the fourth residual short link quantity.

In an exemplary embodiment of the present disclosure, the loading method of the short link further includes:

generating a current short-chain batch number, and writing the current short-chain batch number into a preset short-chain connection batch number list;

generating a short chain suffix corresponding to the current short chain batch number, and writing the short chain suffix into a short chain storage set;

deleting repeated short chain suffixes in the short chain storage set, and judging whether the number of short chain suffixes in the short chain storage set after the repeated short chain suffixes are removed reaches the preset number of suffixes or not;

when the number of short chain suffixes in the short chain storage set is determined to reach the preset number of suffixes, the current short chain batch number is used as a file name, and the short chain suffixes in the short chain storage set are stored into a file taking the current short chain batch number as the file name in the preset file server.

In one exemplary embodiment of the present disclosure, generating the current short-chain batch number includes:

responding to a short-link batch generation task, acquiring a batch code in the batch generation task, and judging whether the batch code is larger than a preset batch quantity maximum value or not;

randomly selecting target characters with preset character digits from a preset short-chain character set when the batch code is determined to be smaller than or equal to the preset batch quantity maximum value;

combining the target characters based on the selection sequence of the target characters to obtain current short-chain batch numbers, traversing a preset short-chain connection batch number list, and judging whether batch numbers which are repeated with the current short-chain batch numbers exist in the preset short-chain connection batch number list or not;

if the batch number which is repeated with the current short-chain batch number exists, the selecting step and the combining step of the target character are repeated until the batch number which is repeated with the current short-chain batch number does not exist.

According to one aspect of the present disclosure, there is provided a method for acquiring a short link, including:

receiving a short-chain acquisition request sent by an application program client arranged in terminal equipment;

determining the short link number required by the application program client in response to the short link acquisition request;

Based on the short link number required by the application program client, acquiring short links to be sent from a short link storage channel queue; the short link to be sent is loaded into the short link storage channel queue based on the short link loading method described in any one of the above;

and feeding the short link to be sent back to an application program client in the terminal equipment.

In an exemplary embodiment of the present disclosure, based on the number of short links required by the application client, obtaining the short link to be sent from the short link storage channel queue includes:

if the number of short links required by the application program client is smaller than a first preset threshold, acquiring short links to be sent from a first subchannel queue;

if the number of short links required by the application program client is greater than or equal to a first preset threshold and less than a second preset threshold, acquiring short links to be transmitted from a first sub-channel queue and a second sub-channel queue;

if the number of short links required by the application program client is greater than or equal to a second preset threshold and less than a third preset threshold, acquiring short links to be transmitted from a first sub-channel queue, a second sub-channel queue and a third sub-channel queue;

And if the number of short links required by the application program client is greater than or equal to a third preset threshold, acquiring short links to be transmitted from the first sub-channel queue, the second sub-channel queue, the third sub-channel queue and the fourth sub-channel queue.

According to one aspect of the present disclosure, there is provided a short link loading device, including:

the batch number file downloading module is used for locking a target short-chain batch number and downloading a batch number file corresponding to the target short-chain batch number from a preset file server based on the target short-chain batch number;

the short link quantity to be loaded determining module is used for acquiring the short link offset in the target short link batch number and determining the short link quantity to be loaded, which is included in the batch number file, based on the short link offset;

the target loading quantity determining module is used for determining the target loading quantity which can be loaded by the short link storage channel queue according to the current residual short link quantity in the short link storage channel queue and the short link quantity to be loaded;

and the short link loading module is used for loading the short link to be loaded into the short link storage channel queue based on the target loading quantity.

According to an aspect of the present disclosure, there is provided a short link acquiring apparatus, including:

the short-chain acquisition request receiving module is used for receiving a short-chain acquisition request sent by an application program client side arranged in the terminal equipment;

a short link number determining module, configured to determine, in response to the short link acquisition request, a short link number required by the application client;

the short link acquisition module is used for acquiring short links to be sent from a short link storage channel queue based on the short link number required by the application program client; the short link to be sent is loaded into the short link storage channel queue based on the short link loading method described in any one of the above;

and the short link feedback module is used for feeding the short link to be sent back to the application program client in the terminal equipment.

According to an aspect of the present disclosure, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method for loading a short link as described in any one of the above, and the method for acquiring a short link as described in any one of the above.

According to one aspect of the present disclosure, there is provided an electronic device including:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to execute the method for loading a short link according to any one of the above and the method for acquiring a short link according to any one of the above via execution of the executable instructions.

According to the short link loading method provided by the embodiment of the disclosure, on one hand, the number of short links to be loaded can be determined through the short link offset, and then the target loading number which can be loaded by the short link storage channel queue is determined according to the current residual short link number in the short link storage channel queue and the short link number to be loaded, so that the problem that the accuracy of the loaded short links is lower due to the fact that the loaded short links are not removed repeatedly can be avoided; meanwhile, the problem of repeatability of the loaded short link can be avoided, so that the loaded short link is ensured to be unique, and the problem of short link collision of the loaded short link in the storage channel queue can be avoided; wherein, the short link collision avoidance described herein means that the short link collision caused by loading two different application program clients to the same short link can be avoided; on the other hand, the target loading quantity which can be loaded by the short link storage channel queue can be determined according to the current residual short link quantity in the short link storage channel queue and the short link quantity to be loaded; and loading the short links to be loaded into the short link storage channel queues based on the target loading quantity, so that the corresponding quantity of short links can be loaded according to the actual needs of the short link storage channel queues, and the self-adaptive loading of the short link quantity in the short link storage channel queues can be further realized based on the short link loading quantity.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure. It will be apparent to those of ordinary skill in the art that the drawings in the following description are merely examples of the disclosure and that other drawings may be derived from them without undue effort.

Fig. 1 schematically illustrates a flowchart of a method of loading short links according to an example embodiment of the present disclosure.

FIG. 2 schematically illustrates a block diagram of a short link loading system according to an example embodiment of the present disclosure.

Fig. 3 schematically illustrates a flow chart of a process for storing a lot number file according to an example embodiment of the present disclosure.

Fig. 4 schematically illustrates an example diagram of a short link lot number list according to an example embodiment of the present disclosure.

Fig. 5 schematically illustrates an example diagram of a lot number file corresponding to a target short chain lot number, according to an example embodiment of the disclosure.

Fig. 6 schematically illustrates a specific example diagram of a sub-channel queue according to an example embodiment of the present disclosure.

Fig. 7 schematically illustrates a flowchart of a method of acquiring a short link according to an example embodiment of the present disclosure.

Fig. 8 schematically illustrates a block diagram of a short link loading apparatus according to an example embodiment of the present disclosure.

Fig. 9 schematically illustrates a block diagram of a short link acquisition device according to an example embodiment of the present disclosure.

Fig. 10 schematically illustrates an electronic device for implementing the above-described loading method of the short link and the acquisition method of the short link according to an exemplary embodiment of the present disclosure.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the present disclosure. One skilled in the relevant art will recognize, however, that the aspects of the disclosure may be practiced without one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.

Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software or in one or more hardware modules or integrated circuits or in different networks and/or processor devices and/or microcontroller devices.

With the rapid development of internet technology, various fields, especially financial technology, have made tremendous progress in recent years. In the practical application process, the financial science and technology already covers a plurality of fields such as payment, lending, investment, artificial intelligence financial analysis, digital marketing and the like; in the above-described scenario, however, long links are often required. Because long links often contain a large number of characters, are lengthy and complex, are inconvenient to share, and are more inconvenient to use especially under the condition that social media, short messages and the like have character limitations. To solve this problem, short link technology has been developed, which plays a positive role in improving the information security of long link URLs (Uniform Resource Locator, uniform resource locators), reducing the occupation of media space resources, and improving the user experience.

The existing short link loading method mainly comprises the following two implementation modes:

firstly, generating a plurality of short links in an off-line mode, and storing the plurality of short links into a distributed database; meanwhile, when a long link-to-short link conversion request is received, selecting a short link from the distributed database according to the long link-to-short link conversion request, and establishing a mapping relation between the short link and the long link, so that the application of the short link is realized; firstly, carrying out Base62 random coding on each bit of the 6-bit short URL to form a 6-bit random code; and secondly, judging whether the random code conflicts with the generated code, and if not, applying the random code as a short link.

However, the above scheme has the following drawbacks: on one hand, the process of generating the needed short chain in advance is time-consuming, and occupies a lot of database/file resources in advance, so that the use is improper and the larger resource waste is easily caused; on the other hand, the scheme is used for preloading a batch of short chains into a memory, and obtaining the next batch after the use is finished, so that the performance can be improved to a certain extent, however, performance bottleneck problems can exist when large-scale application and high concurrency requests are faced; on the other hand, if the short chain length is changed (for example, the short chain length is updated from 6 bits to 7 bits), offset is easily disordered, and the pre-generated record cannot be read correctly; in the second scheme, when a request arrives, an unmapped short-chain record needs to be queried and then a writing operation is performed, which may cause a reading and writing bottleneck to a database and may cause the same short-chain record to be read, so that the accuracy of the short-chain link is reduced.

Based on this, the exemplary embodiments of the present disclosure first provide a loading method of a short link, which may run on a server, a server cluster, or a cloud server, etc.; of course, those skilled in the art may also operate the methods of the present disclosure on other platforms as desired, which is not particularly limited in the present exemplary embodiment. Specifically, referring to fig. 1, the loading method of the short link may include the following steps:

s110, locking a target short-chain batch number, and downloading a batch number file corresponding to the target short-chain batch number from a preset file server based on the target short-chain batch number;

s120, acquiring a short link offset in the target short link batch number, and determining the short link number to be loaded, which is included in the batch number file, based on the short link offset;

s130, determining the target loading quantity which can be loaded by the short link storage channel queue according to the current residual short link quantity in the short link storage channel queue and the short link quantity to be loaded;

and S140, loading the short link to be loaded into the short link storage channel queue based on the target loading quantity.

In the loading method of the short link, on one hand, the number of short links to be loaded can be determined through the short link offset, and then the target loading number which can be loaded by the short link storage channel queue is determined according to the current residual short link number in the short link storage channel queue and the short link number to be loaded, so that the problem that the accuracy of the loaded short link is lower due to the fact that the loaded short link is not removed repeatedly can be avoided; meanwhile, the problem of repeatability of the loaded short link can be avoided, so that the loaded short link is ensured to be unique, and the problem of short link collision of the loaded short link in the storage channel queue can be avoided; wherein, the short link collision avoidance described herein means that the short link collision caused by loading two different application program clients to the same short link can be avoided; on the other hand, the target loading quantity which can be loaded by the short link storage channel queue can be determined according to the current residual short link quantity in the short link storage channel queue and the short link quantity to be loaded; and loading the short links to be loaded into the short link storage channel queues based on the target loading quantity, so that the corresponding quantity of short links can be loaded according to the actual needs of the short link storage channel queues, and the self-adaptive loading of the short link quantity in the short link storage channel queues can be further realized based on the short link loading quantity.

Hereinafter, a short link loading method described in example embodiments of the present disclosure will be explained and illustrated in detail with reference to the accompanying drawings.

First, an explanation and a description will be made of an implementation principle of a short link loading method described in an exemplary embodiment of the present disclosure. Specifically, according to the short link loading method described in the exemplary embodiment of the present disclosure, before short link loading, a global unique short link is generated in batch in advance and stored in a distributed file server; meanwhile, in the loading process, the short chain batch is preloaded into a multi-channel queue (the multi-channel queue is a plurality of different short chain connection storage channel queues, namely a first sub-channel queue, a second sub-channel queue, a third sub-channel queue, a fourth sub-channel queue and the like used later) in a proportion dynamic balance manner, so that a calling party can obtain the short chain batch and use the short chain batch; further, in actual loading, after detecting that batch short chains in the memory are consumed to a certain threshold value, automatically loading the short chains into a multi-channel queue; in the process of obtaining the short links, according to the different-size batch short chains requested by a calling party, obtaining the batch short chains from different channel queues according to a certain selection algorithm; furthermore, in the practical application process, the expired batch number record table and the batch file can be deleted through a timing task for subsequent multiplexing and supplementing; meanwhile, the configuration of the maximum daily batch quantity, the loading threshold value, the short-chain prefix N bit (the short-chain prefix is short-chain connection batch number), the short-chain suffix M bit, the maximum line number of short-chain batch files, the short-chain loading proportion of the multi-channel queue and the like, which are set by the system, can be realized in real time through pushing of the configuration center.

Next, a description will be given of a short link loading system according to an exemplary embodiment of the present disclosure. Specifically, referring to FIG. 2, the short link loading system may include a short link storage channel queue 210, a short link batch number list 220, a file server 230, and a processor 240; the processor is respectively in communication connection with the short-chain storage channel queue, the short-chain batch number list and the file server; meanwhile, in the practical application process, the short link storage channel queue is used for storing the loaded short links, the short link batch number list is used for storing the current short link batch number, the file server is used for storing the batch number file, and the central processing unit is used for realizing the loading method of the short links recorded in the example embodiments of the present disclosure and also can be used for realizing the obtaining method of the short links recorded in the example embodiments of the present disclosure; wherein, the short link batch number list is used for storing short link batch numbers; the batch number file is used for storing short chain suffixes corresponding to short chain connection batch numbers; that is, the lot number file includes a plurality of different short chain suffixes, each short chain lot number has a corresponding lot number file, and a plurality of different short links can be formed based on the short chain lot number and the short chain suffixes in the lot number file.

Further, the storing process of the lot number file described in the exemplary embodiment of the present disclosure is explained and explained. Specifically, referring to fig. 3, the storing process of the lot number file may include the following steps:

step S310, generating a current short-chain batch number, and writing the current short-chain batch number into a preset short-chain link batch number list;

step S320, generating a short chain suffix corresponding to the current short chain batch number, and writing the short chain suffix into a short chain storage set;

step S330, deleting the repeated short chain suffixes in the short chain storage set, and judging whether the number of short chain suffixes after the repeated short chain suffixes are removed in the short chain storage set reaches the preset number of suffixes or not;

step S340, when it is determined that the number of short chain suffixes in the short chain storage set reaches the preset number of suffixes, the current short chain batch number is used as a file name, and the short chain suffixes in the short chain storage set are stored in a file with the current short chain batch number as the file name in the preset file server.

In one example embodiment, generating the current short-chain lot number may be accomplished by: firstly, responding to a short-link batch generation task, acquiring a batch code in the batch generation task, and judging whether the batch code is larger than a preset batch quantity maximum value or not; secondly, randomly selecting target characters with preset character digits from a preset short-chain character set when the batch code is determined to be smaller than or equal to the preset batch quantity maximum value; then, combining the target characters based on the selection sequence of the target characters to obtain a current short-chain batch number, traversing a preset short-chain connection batch number list, and judging whether batch numbers which are repeated with the current short-chain batch number exist in the preset short-chain connection batch number list; further, if there is a lot number that is repeated with the current short-chain lot number, the selecting step and the combining step of the target character are repeated until there is no lot number that is repeated with the current short-chain lot number.

Hereinafter, step S310 to step S340 will be explained and explained. Specifically, in the actual application process, firstly, batch generation short-chain tasks can be executed at intervals in a timed task mode, and whether short-chain generation is finished or not is judged according to the maximum daily batch quantity in the configuration item; that is, in the process of generating short links by a timed task, the number of times of short links that can be generated per day (or per week, etc., where the time may be set according to actual needs) is limited; terminating the generation of the short link if the batch code is greater than the batch size maximum; if not, the short link batch number can be generated first; in the generation process of short link batch numbers, firstly, randomly selecting target characters with preset character digits from a short link character set in sequence; the preset character bit number recorded herein is used for representing the bit number of the short-link batch number, and the bit number of the current short-link batch number can include 3 bits, 4 bits, 5 bits or the like, and can be selected according to actual needs in the actual application process, which is not particularly limited in this example; secondly, splicing the selected target characters to obtain the current short-chain batch number; meanwhile, in order to ensure global uniqueness of short-chain batch numbers, whether the current short-chain batch number exists in a historical short-chain batch number which is the same as the current short-chain batch number or not needs to be checked in a short-chain connection batch number list, and if so, regeneration is needed until a database batch number list does not exist; if not, short chain suffixes with preset suffix quantity can be generated in the memory; the number of short-chain suffixes of the preset suffix described herein may be, for example, 20w, or 30w, etc., and may be determined according to the number of characters included in the short-chain character set, or may be determined according to actual needs, which is not particularly limited in this example. Furthermore, in the practical application process, the repeated short chain suffixes in the short chain storage set are required to be deleted, the number of the short chain suffixes in the short chain storage set is ensured to reach the requirement, and the short chain suffixes can be continuously generated if the requirement is not met; further, after the number of short chain suffixes reaches the above requirement, the current short chain batch number can be used as a file name, and the short chain suffixes in the short chain storage set are stored into a file taking the current short chain batch number as the file name in the preset file server.

It should be noted that the above-mentioned short-chain character set may be composed of the letters a-Z, a-Z and the numbers 0-9 together 62, and of course, the short-chain character set may also include symbols or roman characters, etc., which is not particularly limited in this example; further, the short-chain suffix described above may also be randomly extracted from a short-chain character set, and the number of characters of the short-chain suffix may include 3, 4, or 5, etc., which is not particularly limited in this example. It can be inferred therefrom that the short links involved in the exemplary embodiments of the present disclosure may consist of 2 parts, namely an N-bit short-chain lot number+m-bit short-chain suffix; meanwhile, the short chain suffix of M bits is stored in the batch file, so that the total storage capacity of the batch file can be effectively saved.

Further, it should be further described that, the number of characters included in the short-chain batch number and the number of characters included in the short-chain suffix described in the exemplary embodiment of the present disclosure may be set according to actual needs; the number of characters included in the short-chain batch number and the number of characters included in the short-chain suffix may be the same or different, and this example is not particularly limited.

The method of loading the short link shown in fig. 1 will be further explained and described below in conjunction with fig. 2 and 3. Specific:

in step S110, a target short-chain lot number is locked, and a lot number file corresponding to the target short-chain lot number is downloaded from a preset file server based on the target short-chain lot number.

Specifically, in the actual application process, if the short link in the file server needs to be loaded into the short link storage channel queue, the loading can be realized by a mode of proportional dynamic balanced loading; for example, batches of short links may be preloaded into the short link storage channel queue during program start-up, or short links in the file server may be loaded into the short link storage channel queue by way of asynchronous threads when consumption of short links in the short link storage channel queue is detected to be below a configured short link threshold (e.g., below 20%).

Based on this, in order to enable loading of short links, it is first necessary to lock the target short chain lot number; specifically, the specific locking process of the target short-chain batch number can be realized by the following modes: firstly, locking an unused current short-chain batch number in a preset short-chain connection batch number list, and judging whether the current short-chain batch number is in an occupied state or not; secondly, when the current short-chain batch number is determined to be in an idle state, taking the current short-chain batch number as a target short-chain batch number; and then, when the current short-chain batch number is determined to be in an occupied state, locking an unused current short-chain batch number in a preset short-chain connection batch number list again until the current short-chain batch number is in an idle state, and taking the current short-chain batch number in the idle state as a target short-chain batch number. That is, in the practical application process, if the short link needs to be loaded, firstly, one unused current short-chain batch number needs to be locked from the short-chain batch number list; wherein, the short link batch number list may be shown with reference to fig. 4; meanwhile, in the current short-chain batch number locking process, the method can be realized in a database pessimistic lock mode or in a database optimistic lock mode; meanwhile, in the process of locking the current short-chain batch number, if the locking fails, the locking step can be repeated until the current short-chain batch number is successfully locked; meanwhile, in order to reduce the collision situation of the locked current short-chain batch number, the unlocked current short-chain batch number can be obtained by means of randomly shifting the batch number each time, and then the target short-chain batch number is obtained; the method of randomly shifting the short-chain batch number by one batch number at a time described herein refers to that the target short-chain batch number is connected based on the position of the short-chain batch number in the short-chain batch number list, and shifting the short-chain batch number by one table unit at a time based on the position of the short-chain batch number which has been locked in the history.

Further, after the target short-chain batch number is obtained, a folder corresponding to the target short-chain batch number can be searched from the file server, and a batch number file in the folder is downloaded to the local disk. The lot number file corresponding to the target short-chain lot number described here may be specifically shown in fig. 5.

In step S120, a short link offset in the target short link batch number is obtained, and the number of short links to be loaded included in the batch number file is determined based on the short link offset.

Specifically, the short link offset described herein may be used to characterize that the short link suffix under the target short link lot number has been loaded; that is, in the case that some systems are not operating normally or cannot load all batch number files in the same target short-chain batch number at one time, the short-chain link offset needs to be set manually according to the loaded short-chain suffix, and the system can also set the short-chain link offset automatically according to the loaded short-chain suffix; in addition, if the short link suffix under the target short link batch number does not have a loaded condition, the short link offset may be set to 0; that is, the specific value of the short link offset may be from 0 to the number of short link suffixes included in the lot number file, for example, 0 to 20w, 0 to 30w, or the like.

Further, after the short link offset is obtained, the number of short links to be loaded included in the lot number file may be determined based on the short link offset. The specific determining process of the short link number to be loaded can be realized by the following steps: firstly, determining a target initial loading position of a short link to be loaded in the batch number file based on the short link offset; the short link offset is set according to the number of loaded short links in the batch number file; secondly, determining the number of loaded short chains in the batch number file according to the original initial loading position of the batch number file and the target initial loading position; and determining the short link number to be loaded according to the loaded number and all the short link numbers in the batch number file. That is, in the practical application process, the starting position of the unused short chain suffix in the batch number file can be determined through the short chain deviation amount, and the short chain number to be loaded can be obtained based on the starting position.

In step S130, the target load number that can be loaded by the short link storage channel queue is determined according to the current remaining short link number in the short link storage channel queue and the short link number to be loaded.

Specifically, according to the current number of the remaining short links in the short link storage channel queue and the number of the short links to be loaded, the target loading number which can be loaded by the short link storage channel queue is determined by the following manner: firstly, obtaining the current residual short link quantity in a short link storage channel queue, and determining the minimum short link quantity which can be loaded by the short link storage channel queue according to the current residual short link quantity and the standard short link quantity which can be loaded by the short link storage channel queue; secondly, determining the target loading quantity which can be loaded by the short link storage channel queue according to the quantity relation between the short link quantity to be loaded and the minimum short link quantity which can be loaded by the short link storage channel queue; wherein the short link storage channel queues described herein include sub-channel queues having a plurality of different data volume levels; the subchannel queues may include a first subchannel queue, a second subchannel queue, a third subchannel queue, a fourth subchannel queue, and so on; the first data volume level of the first sub-channel queue, the second data volume level of the second sub-channel queue, the third data volume level of the third sub-channel queue, and the fourth data volume level of the fourth sub-channel queue described herein are sequentially increased; that is, the first data volume level, the second data volume level, the third data volume level, and the fourth data volume level may be sequentially incremented; further, the current remaining short link number described herein includes a first remaining short link number corresponding to the first subchannel queue, a second remaining short link number corresponding to the second subchannel, a third remaining short link number corresponding to the third subchannel, and a fourth remaining short link number corresponding to the fourth subchannel; the current remaining short link number described herein refers to the number of unused short links remaining in each of the different sub-channel queues.

In an example embodiment, the current remaining short link number in the short link storage channel queue is obtained, and the minimum short link number that can be loaded by the short link storage channel queue is determined according to the current remaining short link number and the standard short link number that can be loaded by the short link storage channel queue, which can be achieved by: firstly, acquiring a first residual short link number corresponding to a first subchannel queue, a second residual short link number corresponding to a second subchannel queue, a third residual short link number corresponding to a third subchannel queue and a fourth residual short link number corresponding to a fourth subchannel queue; secondly, determining a first minimum short link number which can be loaded by the first sub-channel queue according to the first residual short link number and the first standard short link number which can be loaded by the first sub-channel queue; then, determining a second minimum short link number which can be loaded by the second sub-channel queue according to the second residual short link number and a second standard short link number which can be loaded by the second sub-channel queue; further, determining a third minimum short link number loadable by the third sub-channel queue according to the third remaining short link number and a third standard short link number loadable by the third sub-channel queue; further, determining a fourth minimum short link number loadable by the fourth sub-channel queue according to the fourth remaining short link number and a fourth standard short link number loadable by the fourth sub-channel queue; and finally, determining the minimum short link number which can be loaded by the short link storage channel queue according to the first minimum short link number, the second minimum short link number, the third minimum short link number and the fourth minimum short link number.

In an example embodiment, according to the number relationship between the number of short links to be loaded and the minimum number of short links that can be loaded by the short link storage channel queue, the determining the number of target loads that can be loaded by the short link storage channel queue may be implemented in the following manner: firstly, judging whether the short link number to be loaded is larger than a first preset threshold value, and taking the short link number to be loaded as a first target loading number which can be loaded by the first subchannel queue when the short link number to be loaded is determined to be smaller than the first preset threshold value; secondly, when the short link number to be loaded is determined to be larger than or equal to a first preset threshold value, judging the relation between the short link number to be loaded and the minimum short link number; then, when the short link number to be loaded is smaller than or equal to the minimum short link number, determining the target loading number which can be loaded by the short link storage channel queue according to the data size level of the short link storage channel queue; and finally, when the short link number to be loaded is determined to be larger than the minimum short link number, determining the target loading number which can be loaded by the short link storage channel queue according to the current residual short link number.

In an example embodiment, according to the data volume level of the short link storage channel queue, the determining the target load number that can be loaded by the short link storage channel queue may be implemented as follows: and determining the loading sequence of the short link to be loaded by the short link storage channel queue according to the data volume level of the short link storage channel queue, and determining the target loading quantity which can be loaded by the short link storage channel queue based on the loading sequence.

In an exemplary embodiment, determining the target load number that the short link storage channel queue can load according to the current remaining short link number may be implemented as follows: firstly, determining a first target loading quantity which can be loaded by the first subchannel queue according to the first standard short link quantity and the first residual short link quantity; secondly, determining a second target loading quantity which can be loaded by the second sub-channel queue according to the second standard short link quantity and the second residual short link quantity; then, determining a third target loading quantity which can be loaded by the third sub-channel queue according to the third standard short link quantity and the third residual short link quantity; and finally, determining a fourth target loading quantity which can be loaded by the fourth sub-channel queue according to the fourth standard short link quantity and the fourth residual short link quantity.

The specific determination of the number of target loads that can be loaded by the short link store channel queue will be further explained and described below. Specifically, according to the configured proportion and the existing quantity (the number of residual short links) in the 4 sub-channel queues, the short links to be loaded can be dynamically and evenly loaded into 4 channel queues such as a single channel (a first sub-channel queue), a ten channel (a second sub-channel queue), a hundred channel (a third sub-channel queue) and a thousand channel (a fourth sub-channel queue); a specific example diagram of each subchannel queue may be shown in fig. 6; meanwhile, it should be additionally described that the specific number of the sub-channel queues can be set according to actual needs, and the present example does not make special restrictions on the specific number; the specific number of sub-channel queues can be predicted based on a network model or obtained based on manual experience, and the example is not limited in particular. Further, in the loading process of dynamically balancing the short link to be loaded, the method can be realized by the following steps:

firstly, subtracting short link offset from the total number X of batch number files to obtain the number of short links to be loaded (namely the available amount A); secondly, obtaining the residual quantity B (the first residual short link quantity, the second residual short link quantity, the third residual short link quantity and the fourth residual short link quantity) of each channel queue of one, ten, hundred and thousand; then, obtaining the minimum quantity C (the first minimum short link quantity, the second minimum short link quantity, the third minimum short link quantity and the fourth minimum short link quantity) of the channel queues of which the number, the ten, the hundred and the thousand can be distributed according to the configuration proportion; further, if the available amount A is smaller than 10 (a first preset threshold value), directly loading the available amount A into a single-size channel queue (a first sub-channel queue); if the available amount A is more than or equal to 10 and less than C (the minimum short link number which can be loaded by the short link storage channel queue), loading the available amount into 4 channels according to the order of thousands, hundreds, tens and thousands; if the available amount A is larger than C, taking A+B as a sum, then obtaining the distribution amounts D1, D2, D3 and D4 of one, ten, hundred and thousand channels according to the configuration proportion, assuming that the residual amounts of the one, ten, hundred and thousand channels are B1, B2, B3 and B4 respectively, the theoretical distribution amounts of the ten hundred and thousand channels are (D1-B1), (D2-B2), (D3-B3) and (D4-B4) respectively, when the theoretical distribution amount is smaller than or equal to 0, the channels are not distributed, and judging whether the residual available distribution amounts exist after the actual distribution of the 4 channels is completed, if so, the available amounts are respectively loaded into the 4 channels according to the sequence of the thousand, hundred and ten channels.

In step S140, the short link to be loaded is loaded into the short link storage channel queue based on the target load number.

Specifically, after the target loading quantity required to be loaded by each sub-channel queue is obtained, a corresponding quantity of short links can be loaded into the corresponding sub-channel queue from the batch number file, so that after a short link acquisition request is received, the short links can be directly fed back to the application program client.

So far, the short link loading method described in the exemplary embodiments of the present disclosure has been fully implemented. Hereinafter, a specific implementation procedure of the short link acquisition method will be explained and explained.

Specifically, the exemplary embodiments of the present disclosure further provide a method for obtaining a short link, where the method may operate on a server, a server cluster, or a cloud server, etc.; of course, those skilled in the art may also operate the methods of the present disclosure on other platforms as desired, which is not particularly limited in the present exemplary embodiment. Referring to fig. 7, the method for acquiring a short link may include the steps of:

step S710, receiving a short-chain acquisition request sent by an application client set in a terminal device;

Step S720, determining the number of short links required by the application client in response to the short link acquisition request;

step S730, based on the short link number required by the application client, acquiring the short link to be sent from the short link storage channel queue; the short link to be sent is loaded into the short link storage channel queue based on the short link loading method described in any one of the above;

step S740, feeding back the short link to be sent to the application client in the terminal device.

In an example embodiment, based on the number of short links required by the application client, the obtaining the short links to be sent from the short link storage channel queue may be implemented in the following manner: if the number of short links required by the application program client is smaller than a first preset threshold, acquiring short links to be sent from a first subchannel queue; if the number of short links required by the application program client is greater than or equal to a first preset threshold and less than a second preset threshold, acquiring short links to be transmitted from a first sub-channel queue and a second sub-channel queue; if the number of short links required by the application program client is greater than or equal to a second preset threshold and less than a third preset threshold, acquiring short links to be transmitted from a first sub-channel queue, a second sub-channel queue and a third sub-channel queue; and if the number of short links required by the application program client is greater than or equal to a third preset threshold, acquiring short links to be transmitted from the first sub-channel queue, the second sub-channel queue, the third sub-channel queue and the fourth sub-channel queue.

Hereinafter, step S710 to step S740 will be explained and explained. Specifically, in the actual application process, short chains can be obtained from different channel queues according to a certain selection algorithm according to the number of short chains required by a calling party (namely, an application program client side arranged in the terminal equipment); for example, assume that the size of a request batch of short chains is represented by the variable size, enumerating the following scenarios: when the size is smaller than 10, the designated short-chain return can be directly obtained from a channel queue storing a single size; if the channel queues with single size are not returned enough, a group is obtained from the high-order channels according to the order of ten, hundred and thousand, a specified number of short chains are taken from the group, the rest short chains are stored in the channel queues with single size, and finally the short chains are returned; further, when the size is smaller than 100 (the second preset threshold value) and larger than or equal to 10, the number of full ten bits can be obtained from ten channel queues storing 10 short chains as a group, then the remaining number of bits is obtained from the channel queues storing a single size, and finally the remaining number of bits is returned; of course, if the number of the short chains is not enough to return, a group is acquired from the high-order channels according to the order of hundreds and thousands, the specified number of short chains are acquired from the group, the rest short chains are stored in ten channels with 10 short chains as a group, and finally, the rest short chains less than 10 short chains are stored in each channel and finally return; further, if the size is smaller than 1000 (the third preset threshold value) and greater than or equal to 100, the number of full hundred bits can be obtained from the hundred-channel queues storing 100 short chains as a group, then the remaining number is obtained according to the above manner, and finally the return is performed; finally, for the case that the size is greater than 1000, the number of full kilobits can be firstly obtained from a thousand-channel queue storing 1000 short chains as a group, then the remaining number is obtained according to the mode, and finally the returning is carried out; of course, before returning to the caller, the packets may be grouped by short-chain lot number, and then the offsets of the lot numbers may be updated separately.

So far, the loading method of the short link and the acquiring method of the short link described in the exemplary embodiments of the present disclosure have been fully implemented. As can be seen from the foregoing, the loading method of the short link and the acquiring method of the short link according to the exemplary embodiments of the present disclosure have high performance with little collision on one hand: by adopting a high-efficiency short chain generation algorithm, the collision in the short chain generation process can be greatly reduced, so that excellent performance is realized; on the other hand, it also has highly scalable performance: the embodiment of the disclosure realizes high expandability of the short chain generation system, including dynamic expansion and contraction of short chain quantity according to needs, and ensures that the system is still stable and efficient when facing the increasing user needs; meanwhile, the short-chain bit number (short-chain bit number, namely the character bit number of the short-chain batch number plus the character bit number of the short-chain suffix) also supports flexible expansion and contraction, and allows the short-chain length to be adjusted according to service requirements; in yet another aspect, single pen or batch support: the embodiment of the disclosure not only supports the acquisition of a single short chain, but also can easily cope with the requirement of batch acquisition, and meets the application scenes with different scales and complexity; meanwhile, the short link loading method and the short link acquiring method described in the example embodiments of the present disclosure can also bring more efficient, flexible and stable short link generation experience to the user, and provide better quality service to the user and the service.

The following are device embodiments of the present disclosure that may be used to perform method embodiments of the present disclosure. For details not disclosed in the embodiments of the apparatus of the present disclosure, please refer to the embodiments of the method of the present disclosure.

The embodiment of the disclosure also provides a short link loading device. Specifically, referring to fig. 8, the short-link loading device may include a batch number file downloading module 810, a short-link number determining module 820 to be loaded, a target loading number determining module 830, and a short-link loading module 840. Wherein:

the batch number file downloading module 810 may be configured to lock a target short-chain batch number, and download a batch number file corresponding to the target short-chain batch number from a preset file server based on the target short-chain batch number;

the short link number to be loaded determining module 820 may be configured to obtain a short link offset in the target short link batch number, and determine the short link number to be loaded included in the batch number file based on the short link offset;

the target load number determining module 830 may be configured to determine, according to a current remaining short link number in a short link storage channel queue and a short link number to be loaded, a target load number that the short link storage channel queue can load;

The short link loading module 840 may be configured to load the short link to be loaded into the short link storage channel queue based on the target load number.

In one exemplary embodiment of the present disclosure, locking the target short chain lot number includes: locking an unused current short-chain batch number in a preset short-chain connection batch number list, and judging whether the current short-chain batch number is in an occupied state or not; when the current short-chain batch number is determined to be in an idle state, taking the current short-chain batch number as a target short-chain batch number; when the current short-chain batch number is determined to be in an occupied state, one unused current short-chain batch number is locked in a preset short-chain connection batch number list again until the current short-chain batch number is in an idle state, and the current short-chain batch number in the idle state is taken as a target short-chain batch number.

In an exemplary embodiment of the present disclosure, determining the number of short links to be loaded included in the lot number file based on the short link offset includes: determining a target initial loading position of a short link to be loaded in the batch number file based on the short link offset; the short link offset is set according to the number of loaded short links in the batch number file; determining the number of loaded short chains in the batch number file according to the original initial loading position of the batch number file and the target initial loading position; and determining the short link number to be loaded according to the loaded number and all the short link numbers in the batch number file.

In an exemplary embodiment of the present disclosure, determining, according to a current remaining number of short links in a short link storage channel queue and a number of short links to be loaded, a target load number that the short link storage channel queue can load includes: acquiring the current residual short link number in a short link storage channel queue, and determining the minimum short link number which can be loaded by the short link storage channel queue according to the current residual short link number and the standard short link number which can be loaded by the short link storage channel queue; and determining the target loading quantity which can be loaded by the short link storage channel queue according to the quantity relation between the short link quantity to be loaded and the minimum short link quantity which can be loaded by the short link storage channel queue.

In one exemplary embodiment of the present disclosure, the short link storage channel queue includes a sub-channel queue having a plurality of different data volume levels; the sub-channel queues comprise a plurality of first sub-channel queues, second sub-channel queues, third sub-channel queues and fourth sub-channel queues; the first data volume level of the first sub-channel queue, the second data volume level of the second sub-channel queue, the third data volume level of the third sub-channel queue and the fourth data volume level of the fourth sub-channel queue are sequentially increased; the current remaining short link number includes a plurality of first remaining short link number corresponding to the first subchannel queue, second remaining short link number corresponding to the second subchannel, third remaining short link number corresponding to the third subchannel, and fourth remaining short link number corresponding to the fourth subchannel.

In an exemplary embodiment of the present disclosure, obtaining a current remaining short link number in a short link storage channel queue, and determining a minimum short link number that can be loaded by the short link storage channel queue according to the current remaining short link number and a standard short link number that can be loaded by the short link storage channel queue, including: acquiring a first residual short link number corresponding to a first subchannel queue, a second residual short link number corresponding to a second subchannel queue, a third residual short link number corresponding to a third subchannel queue and a fourth residual short link number corresponding to a fourth subchannel queue; determining a first minimum short link number which can be loaded by the first sub-channel queue according to the first residual short link number and the first standard short link number which can be loaded by the first sub-channel queue; determining a second minimum short link number which can be loaded by the second sub-channel queue according to the second residual short link number and a second standard short link number which can be loaded by the second sub-channel queue; determining a third minimum short link number which can be loaded by the third sub-channel queue according to the third residual short link number and a third standard short link number which can be loaded by the third sub-channel queue; determining a fourth minimum short link number which can be loaded by the fourth sub-channel queue according to the fourth residual short link number and a fourth standard short link number which can be loaded by the fourth sub-channel queue; and determining the minimum short link number which can be loaded by the short link storage channel queue according to the first minimum short link number, the second minimum short link number, the third minimum short link number and the fourth minimum short link number.

In an exemplary embodiment of the present disclosure, determining, according to a number relationship between the number of short links to be loaded and a minimum number of short links that can be loaded by a short link storage channel queue, a target load number that can be loaded by the short link storage channel queue includes: judging whether the short link number to be loaded is larger than a first preset threshold value, and taking the short link number to be loaded as a first target loading number which can be loaded by the first subchannel queue when the short link number to be loaded is determined to be smaller than the first preset threshold value; when the short link number to be loaded is determined to be greater than or equal to a first preset threshold, judging the relation between the short link number to be loaded and the minimum short link number; when the short link number to be loaded is smaller than or equal to the minimum short link number, determining the target loading number which can be loaded by the short link storage channel queue according to the data size level of the short link storage channel queue; and when the short link number to be loaded is determined to be larger than the minimum short link number, determining the target loading number which can be loaded by the short link storage channel queue according to the current residual short link number.

In an exemplary embodiment of the present disclosure, determining, according to a data volume level of the short link storage channel queue, a target load number that the short link storage channel queue can load includes: and determining the loading sequence of the short link to be loaded by the short link storage channel queue according to the data volume level of the short link storage channel queue, and determining the target loading quantity which can be loaded by the short link storage channel queue based on the loading sequence.

In an exemplary embodiment of the present disclosure, determining, according to a current remaining short link number, a target load number that the short link storage channel queue can load includes: determining a first target loading quantity which can be loaded by the first subchannel queue according to the first standard short link quantity and the first residual short link quantity; determining a second target loading quantity which can be loaded by the second sub-channel queue according to the second standard short link quantity and the second residual short link quantity; determining a third target loading quantity which can be loaded by the third sub-channel queue according to the third standard short link quantity and the third residual short link quantity; and determining a fourth target loading quantity which can be loaded by the fourth sub-channel queue according to the fourth standard short link quantity and the fourth residual short link quantity.

In an exemplary embodiment of the present disclosure, the short link loading device further includes:

the current short-chain batch number generation module can be used for generating a current short-chain batch number and writing the current short-chain batch number into a preset short-chain connection batch number list;

the short-chain suffix generation module can be used for generating a short-chain suffix corresponding to the current short-chain batch number and writing the short-chain suffix into a short-chain storage set;

the short-chain suffix quantity judging module can be used for deleting repeated short-chain suffixes in the short-chain storage set and judging whether the quantity of short-chain suffixes in the short-chain storage set after the repeated short-chain suffixes are removed reaches the preset suffix quantity or not;

and the short-chain suffix storage module may be configured to store the short-chain suffix in the short-chain storage set to a file in the preset file server with the current short-chain batch number as a file name when determining that the number of short-chain suffixes in the short-chain storage set reaches a preset suffix number.

In one exemplary embodiment of the present disclosure, generating the current short-chain batch number includes: responding to a short-link batch generation task, acquiring a batch code in the batch generation task, and judging whether the batch code is larger than a preset batch quantity maximum value or not; randomly selecting target characters with preset character digits from a preset short-chain character set when the batch code is determined to be smaller than or equal to the preset batch quantity maximum value; combining the target characters based on the selection sequence of the target characters to obtain current short-chain batch numbers, traversing a preset short-chain connection batch number list, and judging whether batch numbers which are repeated with the current short-chain batch numbers exist in the preset short-chain connection batch number list or not; if the batch number which is repeated with the current short-chain batch number exists, the selecting step and the combining step of the target character are repeated until the batch number which is repeated with the current short-chain batch number does not exist.

The embodiment of the disclosure also provides a short link acquisition device. Specifically, referring to fig. 9, the short link generating device includes a short link acquisition request receiving module 910, a short link number determining module 920, a short link acquisition module 930, and a short link feedback module 940. Wherein:

the short-chain acquisition request receiving module 910 may be configured to receive a short-chain acquisition request sent by an application client set in a terminal device;

a short link number determining module 920, configured to determine, in response to the short link acquisition request, a short link number required by the application client;

the short link acquiring module 930 may be configured to acquire, from a short link storage channel queue, a short link to be sent based on the number of short links required by the application client; the short link to be sent is loaded into the short link storage channel queue based on the short link loading method described in any one of the above;

and a short link feedback module 940, configured to feed back the short link to be sent to an application client in the terminal device.

In an exemplary embodiment of the present disclosure, based on the number of short links required by the application client, obtaining the short link to be sent from the short link storage channel queue includes: if the number of short links required by the application program client is smaller than a first preset threshold, acquiring short links to be sent from a first subchannel queue; if the number of short links required by the application program client is greater than or equal to a first preset threshold and less than a second preset threshold, acquiring short links to be transmitted from a first sub-channel queue and a second sub-channel queue; if the number of short links required by the application program client is greater than or equal to a second preset threshold and less than a third preset threshold, acquiring short links to be transmitted from a first sub-channel queue, a second sub-channel queue and a third sub-channel queue; and if the number of short links required by the application program client is greater than or equal to a third preset threshold, acquiring short links to be transmitted from the first sub-channel queue, the second sub-channel queue, the third sub-channel queue and the fourth sub-channel queue.

The specific details of each module in the above-mentioned short-link loading device and short-link acquiring device are described in detail in the corresponding short-link loading method and short-link acquiring method, so that they will not be described in detail here.

It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit in accordance with embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.

Furthermore, although the steps of the methods in the present disclosure are depicted in a particular order in the drawings, this does not require or imply that the steps must be performed in that particular order or that all illustrated steps be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform, etc.

In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided. Those skilled in the art will appreciate that the various aspects of the present disclosure may be implemented as a system, method, or program product. Accordingly, various aspects of the disclosure may be embodied in the following forms, namely: an entirely hardware embodiment, an entirely software embodiment (including firmware, micro-code, etc.) or an embodiment combining hardware and software aspects may be referred to herein as a "circuit," module "or" system.

An electronic device 1000 according to such an embodiment of the present disclosure is described below with reference to fig. 10. The electronic device 1000 shown in fig. 10 is merely an example and should not be construed as limiting the functionality and scope of use of the disclosed embodiments.

As shown in fig. 10, the electronic device 1000 is embodied in the form of a general purpose computing device. Components of electronic device 1000 may include, but are not limited to: the at least one processing unit 1010, the at least one memory unit 1020, a bus 1030 connecting the various system components (including the memory unit 1020 and the processing unit 1010), and a display unit 1040.

Wherein the storage unit stores program code that is executable by the processing unit 1010 such that the processing unit 1010 performs steps according to various exemplary embodiments of the present disclosure described in the above section of the present specification. For example, the processing unit 1010 may perform step S110 as shown in fig. 1: the method comprises the steps of locking a target short-chain batch number, and downloading a batch number file corresponding to the target short-chain batch number from a preset file server based on the target short-chain batch number; step S120: acquiring a short link offset in the target short link batch number, and determining the number of short links to be loaded, which is included in the batch number file, based on the short link offset; step S130: determining the target loading quantity which can be loaded by the short link storage channel queue according to the current residual short link quantity in the short link storage channel queue and the short link quantity to be loaded; step S140: and loading the short link to be loaded into the short link storage channel queue based on the target loading quantity.

As another example, the processing unit 1010 may perform step S710 as shown in fig. 7: receiving a short-chain acquisition request sent by an application program client arranged in terminal equipment; step S720: determining the short link number required by the application program client in response to the short link acquisition request; step S730: based on the short link number required by the application program client, acquiring short links to be sent from a short link storage channel queue; the short link to be sent is loaded into the short link storage channel queue based on the short link loading method described in any one of the above; step S740: and feeding the short link to be sent back to an application program client in the terminal equipment.

The memory unit 1020 may include readable media in the form of volatile memory units such as Random Access Memory (RAM) 10201 and/or cache memory unit 10202, and may further include Read Only Memory (ROM) 10203.

The storage unit 1020 may also include a program/utility 10204 having a set (at least one) of program modules 10205, such program modules 10205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.

Bus 1030 may be representing one or more of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

The electronic device 1000 can also communicate with one or more external devices 1100 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 1000, and/or with any device (e.g., router, modem, etc.) that enables the electronic device 1000 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 1050. Also, electronic device 1000 can communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through network adapter 1060. As shown, the network adapter 1060 communicates with other modules of the electronic device 1000 over the bus 1030. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with the electronic device 1000, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.

From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (may be a personal computer, a server, a terminal device, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.

In an exemplary embodiment of the present disclosure, a computer-readable storage medium having stored thereon a program product capable of implementing the method described above in the present specification is also provided. In some possible implementations, various aspects of the disclosure may also be implemented in the form of a program product comprising program code for causing a terminal device to carry out the steps according to the various exemplary embodiments of the disclosure as described in the "exemplary methods" section of this specification, when the program product is run on the terminal device.

A program product for implementing the above-described method according to an embodiment of the present disclosure may employ a portable compact disc read-only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The computer readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).

Furthermore, the above-described figures are only schematic illustrations of processes included in the method according to the exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily appreciated that the processes shown in the above figures do not indicate or limit the temporal order of these processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, for example, among a plurality of modules.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. This application is intended to cover any adaptations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

Claims (17)

1. A method for loading a short link, comprising:

the method comprises the steps of locking a target short-chain batch number, and downloading a batch number file corresponding to the target short-chain batch number from a preset file server based on the target short-chain batch number;

acquiring a short link offset in the target short link batch number, and determining the number of short links to be loaded, which is included in the batch number file, based on the short link offset;

Determining the target loading quantity which can be loaded by the short link storage channel queue according to the current residual short link quantity in the short link storage channel queue and the short link quantity to be loaded;

and loading the short link to be loaded into the short link storage channel queue based on the target loading quantity.

2. The method of loading a short link according to claim 1, wherein locking the target short chain lot number comprises:

locking an unused current short-chain batch number in a preset short-chain connection batch number list, and judging whether the current short-chain batch number is in an occupied state or not;

when the current short-chain batch number is determined to be in an idle state, taking the current short-chain batch number as a target short-chain batch number;

when the current short-chain batch number is determined to be in an occupied state, one unused current short-chain batch number is locked in a preset short-chain connection batch number list again until the current short-chain batch number is in an idle state, and the current short-chain batch number in the idle state is taken as a target short-chain batch number.

3. The method of loading a short link according to claim 1, wherein determining the number of short links to be loaded included in the lot number file based on the short link offset comprises:

Determining a target initial loading position of a short link to be loaded in the batch number file based on the short link offset; the short link offset is set according to the number of loaded short links in the batch number file;

determining the number of loaded short chains in the batch number file according to the original initial loading position of the batch number file and the target initial loading position;

and determining the short link number to be loaded according to the loaded number and all the short link numbers in the batch number file.

4. The method for loading a short link according to claim 1, wherein determining the target load number that can be loaded by the short link storage channel queue according to the current remaining short link number in the short link storage channel queue and the short link number to be loaded comprises:

acquiring the current residual short link number in a short link storage channel queue, and determining the minimum short link number which can be loaded by the short link storage channel queue according to the current residual short link number and the standard short link number which can be loaded by the short link storage channel queue;

and determining the target loading quantity which can be loaded by the short link storage channel queue according to the quantity relation between the short link quantity to be loaded and the minimum short link quantity which can be loaded by the short link storage channel queue.

5. The method of loading a short link according to claim 4, wherein the short link storage channel queue comprises a sub-channel queue having a plurality of different data volume levels;

the sub-channel queues comprise a plurality of first sub-channel queues, second sub-channel queues, third sub-channel queues and fourth sub-channel queues;

the first data volume level of the first sub-channel queue, the second data volume level of the second sub-channel queue, the third data volume level of the third sub-channel queue and the fourth data volume level of the fourth sub-channel queue are sequentially increased; the current remaining short link number includes a plurality of first remaining short link number corresponding to the first subchannel queue, second remaining short link number corresponding to the second subchannel, third remaining short link number corresponding to the third subchannel, and fourth remaining short link number corresponding to the fourth subchannel.

6. The method for loading a short link according to claim 5, wherein obtaining a current remaining number of short links in a short link storage channel queue and determining a minimum number of short links that can be loaded by the short link storage channel queue according to the current remaining number of short links and a standard number of short links that can be loaded by the short link storage channel queue, comprises:

Acquiring a first residual short link number corresponding to a first subchannel queue, a second residual short link number corresponding to a second subchannel queue, a third residual short link number corresponding to a third subchannel queue and a fourth current residual short link number corresponding to a fourth subchannel queue;

determining a first minimum short link number which can be loaded by the first sub-channel queue according to the first residual short link number and the first standard short link number which can be loaded by the first sub-channel queue; and

determining a second minimum short link number which can be loaded by the second sub-channel queue according to the second residual short link number and a second standard short link number which can be loaded by the second sub-channel queue; and

determining a third minimum short link number which can be loaded by the third sub-channel queue according to the third residual short link number and a third standard short link number which can be loaded by the third sub-channel queue; and

determining a fourth minimum short link number which can be loaded by the fourth sub-channel queue according to the fourth residual short link number and a fourth standard short link number which can be loaded by the fourth sub-channel queue;

And determining the minimum short link number which can be loaded by the short link storage channel queue according to the first minimum short link number, the second minimum short link number, the third minimum short link number and the fourth minimum short link number.

7. The method for loading a short link according to claim 6, wherein determining the target load number that can be loaded by the short link storage channel queue according to the number relationship between the short link number to be loaded and the minimum short link number that can be loaded by the short link storage channel queue comprises:

judging whether the short link number to be loaded is larger than a first preset threshold value, and taking the short link number to be loaded as a first target loading number which can be loaded by the first subchannel queue when the short link number to be loaded is determined to be smaller than the first preset threshold value;

when the short link number to be loaded is determined to be greater than or equal to a first preset threshold, judging the relation between the short link number to be loaded and the minimum short link number;

when the short link number to be loaded is smaller than or equal to the minimum short link number, determining the target loading number which can be loaded by the short link storage channel queue according to the data size level of the short link storage channel queue;

And when the short link number to be loaded is determined to be larger than the minimum short link number, determining the target loading number which can be loaded by the short link storage channel queue according to the current residual short link number.

8. The method for loading a short link according to claim 7, wherein determining the target load number that can be loaded by the short link storage channel queue according to the data size level of the short link storage channel queue comprises:

and determining the loading sequence of the short link to be loaded by the short link storage channel queue according to the data volume level of the short link storage channel queue, and determining the target loading quantity which can be loaded by the short link storage channel queue based on the loading sequence.

9. The method for loading short links according to claim 7, wherein determining the target load number that can be loaded by the short link storage channel queue according to the current remaining number of short links comprises:

determining a first target loading quantity which can be loaded by the first subchannel queue according to the first standard short link quantity and the first residual short link quantity; and

determining a second target loading quantity which can be loaded by the second sub-channel queue according to the second standard short link quantity and the second residual short link quantity; and

Determining a third target loading quantity which can be loaded by the third sub-channel queue according to the third standard short link quantity and the third residual short link quantity; and

and determining a fourth target loading quantity which can be loaded by the fourth sub-channel queue according to the fourth standard short link quantity and the fourth residual short link quantity.

10. The method for loading a short link according to any one of claims 1 to 9, further comprising:

generating a current short-chain batch number, and writing the current short-chain batch number into a preset short-chain connection batch number list;

generating a short chain suffix corresponding to the current short chain batch number, and writing the short chain suffix into a short chain storage set;

deleting repeated short chain suffixes in the short chain storage set, and judging whether the number of short chain suffixes in the short chain storage set after the repeated short chain suffixes are removed reaches the preset number of suffixes or not;

when the number of short chain suffixes in the short chain storage set is determined to reach the preset number of suffixes, the current short chain batch number is used as a file name, and the short chain suffixes in the short chain storage set are stored into a file taking the current short chain batch number as the file name in the preset file server.

11. The method of loading a short link of claim 10, wherein generating a current short chain lot number comprises:

responding to a short-link batch generation task, acquiring a batch code in the batch generation task, and judging whether the batch code is larger than a preset batch quantity maximum value or not;

randomly selecting target characters with preset character digits from a preset short-chain character set when the batch code is determined to be smaller than or equal to the preset batch quantity maximum value;

combining the target characters based on the selection sequence of the target characters to obtain current short-chain batch numbers, traversing a preset short-chain connection batch number list, and judging whether batch numbers which are repeated with the current short-chain batch numbers exist in the preset short-chain connection batch number list or not;

if the batch number which is repeated with the current short-chain batch number exists, the selecting step and the combining step of the target character are repeated until the batch number which is repeated with the current short-chain batch number does not exist.

12. The method for acquiring the short link is characterized by comprising the following steps:

receiving a short-chain acquisition request sent by an application program client arranged in terminal equipment;

determining the short link number required by the application program client in response to the short link acquisition request;

Based on the short link number required by the application program client, acquiring short links to be sent from a short link storage channel queue; wherein the short link to be sent is loaded into the short link storage channel queue based on the short link loading method of any one of claims 1-11;

and feeding the short link to be sent back to an application program client in the terminal equipment.

13. The method for obtaining a short link according to claim 12, wherein obtaining a short link to be sent from a short link storage channel queue based on the number of short links required by the application client includes:

if the number of short links required by the application program client is smaller than a first preset threshold, acquiring short links to be sent from a first subchannel queue;

if the number of short links required by the application program client is greater than or equal to a first preset threshold and less than a second preset threshold, acquiring short links to be transmitted from a first sub-channel queue and a second sub-channel queue;

if the number of short links required by the application program client is greater than or equal to a second preset threshold and less than a third preset threshold, acquiring short links to be transmitted from a first sub-channel queue, a second sub-channel queue and a third sub-channel queue;

And if the number of short links required by the application program client is greater than or equal to a third preset threshold, acquiring short links to be transmitted from the first sub-channel queue, the second sub-channel queue, the third sub-channel queue and the fourth sub-channel queue.

14. A short link loading device comprising:

the batch number file downloading module is used for locking a target short-chain batch number and downloading a batch number file corresponding to the target short-chain batch number from a preset file server based on the target short-chain batch number;

the short link quantity to be loaded determining module is used for acquiring the short link offset in the target short link batch number and determining the short link quantity to be loaded, which is included in the batch number file, based on the short link offset;

the target loading quantity determining module is used for determining the target loading quantity which can be loaded by the short link storage channel queue according to the current residual short link quantity in the short link storage channel queue and the short link quantity to be loaded;

and the short link loading module is used for loading the short link to be loaded into the short link storage channel queue based on the target loading quantity.

15. A short link acquisition apparatus, comprising:

the short-chain acquisition request receiving module is used for receiving a short-chain acquisition request sent by an application program client side arranged in the terminal equipment;

a short link number determining module, configured to determine, in response to the short link acquisition request, a short link number required by the application client;

the short link acquisition module is used for acquiring short links to be sent from a short link storage channel queue based on the short link number required by the application program client; wherein the short link to be sent is loaded into the short link storage channel queue based on the short link loading method of any one of claims 1-11;

and the short link feedback module is used for feeding the short link to be sent back to the application program client in the terminal equipment.

16. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the method of loading a short link according to any one of claims 1-11, and the method of acquiring a short link according to claim 12 or 13.

17. An electronic device, comprising:

A processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the method of loading a short link according to any of claims 1-11 and the method of retrieving a short link according to claim 12 or 13 via execution of the executable instructions.