CN112307058B - Short link processing method and device, storage medium and computer equipment - Google Patents

Short link processing method and device, storage medium and computer equipment Download PDF

Info

Publication number
CN112307058B
CN112307058B CN202011165220.1A CN202011165220A CN112307058B CN 112307058 B CN112307058 B CN 112307058B CN 202011165220 A CN202011165220 A CN 202011165220A CN 112307058 B CN112307058 B CN 112307058B
Authority
CN
China
Prior art keywords
short link
short
link
identifier
type
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011165220.1A
Other languages
Chinese (zh)
Other versions
CN112307058A (en
Inventor
韩德刚
夏露
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Shuidi Technology Group Co ltd
Original Assignee
Beijing Shuidi Technology Group Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Shuidi Technology Group Co ltd filed Critical Beijing Shuidi Technology Group Co ltd
Priority to CN202011165220.1A priority Critical patent/CN112307058B/en
Publication of CN112307058A publication Critical patent/CN112307058A/en
Application granted granted Critical
Publication of CN112307058B publication Critical patent/CN112307058B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2453—Query optimisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2282—Tablespace storage structures; Management thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2455—Query execution
    • G06F16/24552—Database cache management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/284—Relational databases

Abstract

The invention discloses a short link processing method, a short link processing device, a storage medium and computer equipment, and relates to the technical field of Internet. The method comprises the following steps: receiving a short link generation request sent by a requester, wherein the short link generation request carries long links and short link types; generating a first identifier according to the receiving order of the short link generation request, and generating a short link according to the first identifier through a short link generation algorithm; and storing the mapping relation among the first identifier, the short link and the long link in a data table corresponding to the type of the short link, and sending the short link to the requester. The short links generated by the method are stored in the data tables corresponding to the short link types, so that the short link retrieval is more convenient, the query efficiency of acquiring the long links through the short links is improved, in addition, the generated short links are stored in different data tables according to different types, the classification and arrangement of the short links can be facilitated, and the processing efficiency of the short links is improved.

Description

Short link processing method and device, storage medium and computer equipment
Technical Field
The present invention relates to the field of internet technologies, and in particular, to a method and apparatus for processing a short link, a storage medium, and a computer device.
Background
The short link is a special character string which converts a long link into a simplified link in a program calculation mode, and the long link is converted into the short link, so that the number of characters can be saved in the storage and transmission processes of the link, and sensitive request parameters can be hidden. Through the short link, the user can obtain the long link corresponding to the short link and jump to the resource corresponding to the long link correctly. In some interactive, notification and marketing scenarios where links need to be added, the length of text strings is usually limited, and at this time, the conversion of long links into short links may play a critical role.
In the prior art, as the number of short links generated by the server is increased, the generated short links and the mapping relation between the short links and the long links are required to be stored in the database to ensure the availability of the short links, however, as time is accumulated, the number of the short links stored in the database is increased, so that the retrieval difficulty of the short links is obviously improved, the query efficiency of the short links is reduced, and the jump speed of the short links is obviously reduced.
Disclosure of Invention
In view of this, the present application provides a method, an apparatus, a storage medium, and a computer device for processing a short link, which mainly aims at solving the technical problem that the query efficiency is not high enough in the process of acquiring a long link through a short link.
According to a first aspect of the present invention, there is provided a method of processing a short link, the method comprising:
receiving a short link generation request sent by a requester, wherein the short link generation request carries long links and short link types;
generating a first identifier according to the receiving order of the short link generation request, and generating a short link according to the first identifier through a short link generation algorithm;
and storing the mapping relation among the first identifier, the short link and the long link in a data table corresponding to the type of the short link, and sending the short link to the requester.
Optionally, the type of short link includes a permanent short link; storing the mapping relation among the first identifier, the short link and the long link in a data table corresponding to the type of the short link, and sending the short link to the requester, wherein the mapping relation comprises the following steps: judging whether the generation quantity of the permanent short links reaches a first preset quantity value in a first preset time period; if the generation number of the permanent short links does not reach a first preset number value within a first preset time period, storing the mapping relation among the first identifier, the short links and the long links in a data table corresponding to the permanent short links, and sending the short links to a requester; and if the generation quantity of the permanent short links reaches a first preset quantity value in a first preset time period, sending overrun information of the generation quantity of the permanent short links to a requester.
Optionally, the short link type further includes a non-permanent short link, and the short link generation request further carries an effective date of the short link; storing the mapping relation among the first identifier, the short link and the long link in a data table corresponding to the type of the short link, and sending the short link to the requester, and further comprising: storing the first identifier, the short link, the effective date of the short link and the mapping relation between the long link in a data table corresponding to the non-permanent short link, and sending the short link to the requester.
Optionally, the method further comprises: periodically judging whether each data record in the data table corresponding to the non-permanent short link is in the effective date range; if the data record is not within the valid date range, deleting the data record.
Optionally, the method further comprises: receiving a type conversion request of a short link, wherein the type conversion request of the short link carries the short link, the type of the short link and the type to be converted; judging whether a type conversion request of the short link is effective or not according to the short link, the type of the short link and the type to be converted; and if the short link type conversion request is effective, transferring the data record corresponding to the short link from the data table corresponding to the short link type to the data table corresponding to the type to be converted.
Optionally, determining whether the type conversion request of the short link is valid according to the short link, the type of the short link and the type to be converted includes: according to the short links, sequentially inquiring whether corresponding data records exist in the data table corresponding to the type to be converted, the type conversion record table and the data table corresponding to the type of the short links; if the data table corresponding to the type to be converted and/or the data table corresponding to the type conversion record table have corresponding data records and/or the data table corresponding to the type of the short link does not have corresponding data records, judging that the type conversion request of the short link is invalid; if the data table corresponding to the type to be converted and the type conversion record table do not have the corresponding data record, and the data table corresponding to the short link type has the corresponding data record, judging that the short link type conversion request is valid.
Optionally, the method further comprises: receiving a short-link jump request, wherein the short-link jump request carries a short link; obtaining a first identifier corresponding to the short link through an inverse algorithm of the short link generation algorithm; and inquiring the data table according to the first identifier to obtain a long link corresponding to the short link, and jumping to the resource corresponding to the long link.
Optionally, the data table is queried according to the first identifier to obtain a long link corresponding to the short link, and the long link is jumped to a resource corresponding to the long link, including: sequentially inquiring the cache server, the data table corresponding to the type of each short link and the type conversion record table according to the first identifier; and if the data record corresponding to the first identifier is inquired, acquiring a long link corresponding to the data record, and jumping to a resource corresponding to the long link.
Optionally, the method further comprises: if the data record corresponding to the first identifier is not queried or the queried data record is not within the effective date range, skipping to a preset resource.
Optionally, the method further comprises: counting the number of the jump requests of the short links in the resources corresponding to the long links to obtain the jump request quantity of each short link; judging whether the jump request quantity of each short link reaches a second preset quantity value in a second preset time period; and if the jump request quantity of the short link reaches a second preset quantity value within a second preset time period, storing the data record corresponding to the short link in the cache unit.
Optionally, generating the first identifier according to the receiving order of the short link generation request, and generating the short link according to the first identifier by a short link generation algorithm includes: generating a first identifier according to the receiving order of the short link generation request, wherein the first identifier is a decimal value; converting the first identifier into a second identifier through a decimal-to-M-ary algorithm, wherein the second identifier is an M-ary numerical value, and M is greater than ten; and generating a short link according to the second identifier.
Optionally, before generating the first identifier according to the receiving order of the short link generation request and generating the short link according to the first identifier by the short link generation algorithm, the method further includes: obtaining M numbers and letters which are different from each other; through a shuffling algorithm, carrying out disordered mixed arrangement on M numbers and letters which are different from each other to obtain an unordered character set consisting of M characters; and according to the unordered character set, a decimal-to-M system algorithm is obtained through a system conversion algorithm.
According to a second aspect of the present invention, there is provided a short-link processing apparatus, the apparatus comprising:
the generation request receiving module is used for receiving a short link generation request sent by a requester, wherein the short link generation request carries long links and short link types;
the short link generation module is used for generating a first identifier according to the receiving sequence of the short link generation request and generating a short link according to the first identifier through a short link generation algorithm;
and the data storage and transmission module is used for storing the mapping relation among the first identifier, the short link and the long link in a data table corresponding to the type of the short link and transmitting the short link to the requester.
According to a third aspect of the present invention, there is provided a storage medium having stored thereon a computer program which, when executed by a processor, implements the above-described short-link processing method.
According to a fourth aspect of the present invention, there is provided a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the above-mentioned short-link processing method when executing the program.
The invention provides a short link processing method, a device, a storage medium and computer equipment, which are characterized in that firstly, a short link generation request which is sent by a request party and carries long links and short link types is received, then a first identifier is generated according to the receiving sequence of the short link generation request, short links corresponding to the first identifier are generated according to the first identifier through a short link generation algorithm, finally, the mapping relation among the first identifier, the short links and the long links is stored in a data table corresponding to the short link types, and the short links are sent to the request party. The short links generated by the method are stored in the data tables corresponding to the short link types, so that the short link retrieval is more convenient, the query efficiency of acquiring the long links through the short links is improved, in addition, the generated short links are stored in different data tables according to different types, the classification and arrangement of the short links can be facilitated, and the processing efficiency of the short links is improved.
The foregoing description is only an overview of the technical solutions of the present application, and may be implemented according to the content of the specification in order to make the technical means of the present application more clearly understood, and in order to make the above-mentioned and other objects, features and advantages of the present application more clearly understood, the following detailed description of the present application will be given.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiments of the invention and together with the description serve to explain the invention and do not constitute a limitation on the invention. In the drawings:
fig. 1 is a schematic flow chart of a short link processing method according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart of another method for processing short links according to an embodiment of the present invention;
fig. 3 is a schematic flow chart of a short link generation method according to an embodiment of the present invention;
FIG. 4 is a schematic flow chart of a method for converting types of short links according to an embodiment of the present invention;
FIG. 5 is a schematic flow chart of a short link jump method according to an embodiment of the present invention;
FIG. 6 is a schematic flow chart of a method for processing a short link according to an embodiment of the present invention;
Fig. 7 is a schematic structural diagram of a short link processing device according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of another short link processing apparatus according to an embodiment of the present invention.
Detailed Description
The invention will be described in detail hereinafter with reference to the drawings in conjunction with embodiments. It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other.
In one embodiment, as shown in fig. 1, a method for processing a short link is provided, and the method is applied to a computer device such as a client or a server, for example, and includes the following steps:
101. and receiving a short link generation request sent by a requester, wherein the short link generation request carries long links and short link types.
The short link is a unique string that converts a long link into a simplified link through a program calculation manner, the long link may refer to a uniform resource locator (Uniform Resource Locator, URL), and the uniform resource locator is also commonly referred to as a link, where the uniform resource locator corresponds to a resource, and through the uniform resource locator, a user may access and share multiple available resources such as a web page, a file, and a picture in an internet application.
Specifically, the computer device may receive a short link generation request sent by the requester at any time, where in this embodiment, the short link generation request at least carries two information, namely, a long link and a short link type, where the long link is a to-be-converted link string, the short link type is a converted short link type, and the short link type may be divided according to different dimensions, such as an effective date of the short link, a resource type corresponding to the long link, and a short link generation time, and for each converted short link, there is at least one short link type corresponding to the short link.
102. And generating a first identifier according to the receiving order of the short link generation request, and generating the short link according to the first identifier through a short link generation algorithm.
Specifically, the computer device may allocate a sequence number to the generation request according to the receiving order of the generation request of the short link, that is, allocate a first identifier to the generation request of the short link, and then convert the first identifier into the short link according to the first identifier through a preset short link generation algorithm. In the present embodiment, the receiving order of the generation request of each short link is unique, and therefore, short links generated by the same conversion algorithm are also unique. Furthermore, the short link generation algorithm may be a numerical conversion algorithm, such as a decimal-to-M-ary algorithm, where M is greater than ten and typically less than or equal to sixty-two, so that the short link generated is as brief as possible.
Further, the allocation sequence of the first identifiers may be monotonically increasing, or may be increasing according to a time period or other parameters, for example, the computer device may keep the allocation sequence of the first identifiers increasing through the characteristics of the database, or may guarantee that the first identifiers keep increasing according to the time period and the allocation sequence according to the receiving sequence of the date and the day, so as to guarantee the uniqueness of the first identifiers.
103. And storing the mapping relation among the first identifier, the short link and the long link in a data table corresponding to the type of the short link, and sending the short link to the requester.
Specifically, after the computer device generates the short link, the first identifier, the short link and the original long link may be stored in the same data record, that is, the mapping relationship between the first identifier, the short link and the long link is stored in a storage unit such as a database or a cache server, and when the mapping relationship is stored, the computer device may store the data record corresponding to the short link in a data table corresponding to the type of the short link, so that the classification processing and the later query and retrieval of the short link are facilitated, and finally, the computer device may send the generated short link to the requester to end the response.
According to the short link processing method provided by the embodiment, firstly, a short link generation request which is sent by a requesting party and carries long links and short links is received, then, a first identifier is generated according to the receiving sequence of the short link generation request, short links corresponding to the first identifier are generated according to the first identifier through a short link generation algorithm, and finally, the mapping relation among the first identifier, the short links and the long links is stored in a data table corresponding to the types of the short links, and the short links are sent to the requesting party. The short links generated by the method are stored in the data tables corresponding to the short link types, so that the short link retrieval is more convenient, the query efficiency of acquiring the long links through the short links is improved, in addition, the generated short links are stored in different data tables according to different types, the classification and arrangement of the short links can be facilitated, and the processing efficiency of the short links is improved.
Further, as a refinement and extension of the specific implementation manner of the foregoing embodiment, in order to fully describe the implementation process of this embodiment, a short link processing method is provided, as shown in fig. 2, and the method includes the following steps:
201. and receiving a short link generation request sent by a requester, wherein the short link generation request carries long links and short link types.
Specifically, the computer device may receive a short link generation request sent by the requester at any time, where in this embodiment, the short link generation request at least carries two information, namely, a long link and a short link type, where the long link is a to-be-converted link string, the short link type is a converted short link type, and the short link type may be divided according to different dimensions, such as an effective date of the short link, a resource type corresponding to the long link, and a short link generation time, and for each converted short link, there is at least one short link type corresponding to the short link.
In an alternative embodiment, as shown in fig. 3, the types of short links may include permanent short links, where permanent short links are permanently valid short links that are permanently saved until the service is not permanently down, and non-permanent short links, where non-permanent short links are short links that require access to normally jump within a specified period of validity after generation. It should be noted that if the short link is of a non-permanent type, the short link generation request should also carry the expiration date of the short link.
202. And generating a first identifier according to the receiving order of the short link generation request, and generating the short link according to the first identifier through a short link generation algorithm.
Specifically, the computer device may allocate a sequence number to the generation request according to the receiving order of the generation request of the short link, that is, allocate a first identifier to the generation request of the short link, and then convert the first identifier into the short link according to the first identifier through a preset short link generation algorithm. In the present embodiment, the receiving order of the generation request of each short link is unique, and therefore, short links generated by the same conversion algorithm are also unique.
In an alternative embodiment, the method of generating a short link may include the steps of: firstly, generating a first identifier according to the receiving order of short link generation requests, wherein the first identifier is a decimal value, specifically, the first identifier can be a decimal unique number distributed for short link generation requests according to the characteristics of a database, then converting the first identifier into a second identifier through a decimal-to-M-system algorithm, wherein the second identifier is an M-system value, M is greater than ten and is generally less than or equal to sixty-two, so that the generated short link is as short as possible, and finally, generating the short link according to parameters such as the second identifier, a domain name and the like, or directly taking the second identifier as the short link. In the algorithm, since the first identifier of the decimal system before conversion is unique, the second identifier of the M system after multilevel conversion is also unique, so that the problem of hash collision when a hash algorithm is used for generating short chains is solved.
Further, in the above embodiment, the generation process of the decimal-to-M-ary algorithm may include the following steps: firstly, M numbers and letters which are different from each other are obtained, wherein the M numbers and letters which are different from each other can be selected from 62 characters of 0-9, A-Z and a-Z, or can be the 62 characters themselves, then, the M numbers and letters which are different from each other are randomly mixed and arranged through a shuffling algorithm, namely, the M numbers and letters which are different from each other are repeatedly shuffled to obtain an unordered character set consisting of M characters, and finally, according to the unordered character set, a decimal-to-M binary algorithm is obtained through a binary conversion algorithm. In this embodiment, the generation of the unordered character set is performed only once during the system initialization, and is used as a basis for the mutual conversion between decimal and M-ary, preferably, M is sixty-two, and the decimal-to-M-ary algorithm is a decimal-to-sixty-binary algorithm, so that the generated short link is most simplified.
Further, the allocation sequence of the first identifiers may be monotonically increasing, or may be increasing according to a time period or other parameters, for example, the computer device may keep the allocation sequence of the first identifiers increasing through the characteristics of the database, or may guarantee that the first identifiers keep increasing according to the time period and the allocation sequence according to the receiving sequence of the date and the day, so as to guarantee the uniqueness of the first identifiers.
203. And storing the mapping relation among the first identifier, the short link and the long link in a data table corresponding to the type of the short link, and sending the short link to the requester.
Specifically, after the computer device generates the short link, the first identifier, the short link and the original long link may be stored in the same data record, that is, the mapping relationship between the first identifier, the short link and the long link is stored in a storage unit such as a database or a cache server, and when the mapping relationship is stored, the computer device may store the data record corresponding to the short link in a data table corresponding to the type of the short link, so that the classification processing and the later query and retrieval of the short link are facilitated, and finally, the computer device may send the generated short link to the requester to end the response.
In an alternative embodiment, as shown in fig. 3, if the type of the short link in the short link generation request is a permanent short link, the implementation method of this step may include the following steps: firstly judging whether the generation quantity of the permanent short links reaches a first preset quantity value in a first preset time period, wherein the first preset time period can be a preset time length of one day, three days or one week, the first preset quantity value can be a quantity value set according to actual conditions, and further, if the generation quantity of the permanent short links does not reach the first preset quantity value in the first preset time period, storing a mapping relation among a first identifier, the short links and the long links in a data table corresponding to the permanent short links, and sending the short links to a requester; and if the generation quantity of the permanent short links reaches a first preset quantity value in a first preset time period, sending overrun information of the generation quantity of the permanent short links to a requester.
In the above embodiment, the permanent short link is permanently valid once generated, and the data record stored in the data table corresponding to the permanent short link is permanently stored until the service is not permanently disconnected, but in consideration of the storage capacity problem of the database, the present embodiment also limits the use scenario or the daily request frequency of the requester, so that the data in the data table corresponding to the permanent short link does not grow too fast, and the influence on the system performance is reduced.
In another alternative embodiment, as shown in fig. 3, if the short link type in the short link generation request is a non-permanent short link, the short link generation request further carries the effective date of the short link, and in this case, the implementation method of this step may further include the following steps: storing the first identifier, the short link, the effective date of the short link and the mapping relation between the long link in a data table corresponding to the non-permanent short link, and sending the short link to the requester. In this embodiment, the non-persistent short link needs to be accessed within a specified period of validity after it is generated to jump normally.
In the above embodiment, after the short link is sent to the requesting party, it may also be periodically determined whether each data record in the data table corresponding to the non-permanent short link is within the valid date range, and if a certain data record is not within the valid date range, the data record may be deleted. Compared with the data storage mode of the permanent short links, the non-permanent short links have one more short link effective date parameter during storage, and by the parameter, historical data records can be dynamically deleted according to the increase condition of the data volume of the permanent short links, so that the data volume of a data table of the non-permanent links is kept within an acceptable range of a system under the condition that the generation quantity of the non-permanent short links is not limited, and the stability of the system is improved.
204. And receiving a type conversion request of the short link, wherein the type conversion request of the short link carries the short link, the type of the short link and the type to be converted.
Specifically, for the generated short link, the system may receive a type conversion request of the short link at any time, where in this embodiment, the type conversion request of the short link at least carries three information including a short link, a type of the short link, and a type to be converted, where the short link refers to the short link that has been generated and stored in the storage unit.
In an alternative embodiment, the permanent short link may be converted to a non-permanent short link and the non-permanent short link may be converted to a permanent short link by a type conversion request of the short link. For example, in the case of a permanent short link being converted into a non-permanent short link, the type of short link is a permanent short link, and the type to be converted is a non-permanent short link.
205. And judging whether the type conversion request of the short link is effective or not according to the short link, the type of the short link and the type to be converted.
Specifically, before performing type conversion, it is first required to determine whether the short link type conversion request is valid, and the determining method may include the following steps: as shown in fig. 4, firstly, according to the short link, sequentially inquiring whether a data table corresponding to the type to be converted, a type conversion record table and a data table corresponding to the type of the short link have corresponding data records, and if the data table corresponding to the type to be converted and/or the type conversion record table have corresponding data records and/or the data table corresponding to the type of the short link does not have corresponding data records, judging that the type conversion request of the short link is invalid; if the data table corresponding to the type to be converted and the type conversion record table do not have the corresponding data record, and the data table corresponding to the short link type has the corresponding data record, judging that the short link type conversion request is valid. In this way, it can be determined whether the request for type conversion of the short link is repeated or has an information error, so as to avoid repeated conversion of one type of short link into another type of short link, or repeated searching for an absent short link.
206. And if the short link type conversion request is effective, transferring the data record corresponding to the short link from the data table corresponding to the short link type to the data table corresponding to the type to be converted.
Specifically, as shown in fig. 4, if it is determined that the type conversion request of the short link is valid, that is, there is no data record corresponding to the short link in the data table corresponding to the type to be converted and there is a corresponding data record in the data table corresponding to the type of the short link, the data record is transferred from the data table corresponding to the type of the short link to the data table corresponding to the type to be converted, thereby completing the type conversion of the short link. After completing the type conversion of the short link, the computer device may also send information about the success or failure of the conversion to the requesting party, so that the requesting party can acquire the information in time.
207. And receiving a short-link jump request, wherein the short-link jump request carries the short link.
Specifically, the computer device may also receive a short link skip request sent by the requester at any time, where in this embodiment, the short link skip request at least carries a short link to be skipped.
208. And obtaining a first identifier corresponding to the short link through an inverse algorithm of the short link generation algorithm.
Specifically, the computer device may obtain the first identifier corresponding to the short link through an inverse algorithm of the short link generation algorithm, where the inverse algorithm of the short link generation algorithm corresponds to the short link generation algorithm in step 202. For example, in an alternative embodiment, the short link is obtained by a decimal-to-M-ary algorithm based on the first identifier, and then when performing the inverse algorithm, the first identifier needs to be obtained by an M-ary-to-decimal algorithm based on the short link.
209. And inquiring the data table according to the first identifier to obtain a long link corresponding to the short link, and jumping to the resource corresponding to the long link.
Specifically, the computer device may query the data table according to the converted first identifier, so as to obtain a long link corresponding to the short link, and jump to a resource corresponding to the long link, for example, jump to a page corresponding to the long link. It should be noted that, when the data table is queried, the data table corresponding to the short link type may be queried preferentially to improve the query efficiency of the short link, when the data table corresponding to the short link type has no corresponding data record, then query other data tables sequentially, if neither query is performed, or the short link has exceeded the valid date range, the method may skip to the default resource, or the default resource designated by the scene, such as skip to the default page. In this embodiment, since the first identifiers are decimal values and the first identifiers are sequentially allocated, the query efficiency of the short link can be improved to the greatest extent by using the first identifiers as indexes, and the jump speed of the short link can be improved.
In an alternative embodiment, as shown in fig. 5, a specific method of querying a data table may include the steps of: according to the first identifier, sequentially inquiring a data table corresponding to the type of the cache server and the short link, a type conversion record table and data tables corresponding to other types, acquiring a long link corresponding to the data record if the data record corresponding to the first identifier is inquired, and then jumping to a resource corresponding to the long link; if the data record corresponding to the first identifier is not queried or the queried data record is not within the effective date range, directly skipping to a preset resource. The inquiry is carried out according to the sequence, so that the inquiry efficiency of the short link can be improved to the greatest extent.
210. And counting the number of the jump requests of the short links in the resources corresponding to the long links to obtain the jump request quantity of each short link.
Specifically, as shown in fig. 5, in the process of responding to the short-link skip request, the computer device may count the skip-successful requests to count the skip-request amount of the short-link skip-successful.
211. And judging whether the jump request quantity of each short link reaches a second preset quantity value in a second preset time period.
Specifically, as shown in fig. 5, the computer device may sequentially determine whether the skip request amount of each short link reaches a second preset amount value within a second preset period of time, where the second preset period of time may be a preset time length of one day, three days, or one week, and the second preset amount value may be an amount value set according to an actual situation.
212. And if the jump request quantity of the short link reaches a second preset quantity value within a second preset time period, storing the data record corresponding to the short link in the cache unit.
Specifically, as shown in fig. 5, if the skip request amount of the short link reaches a second preset amount value within a second preset period of time, the data record corresponding to the short link may be stored in a cache server such as dis. By the method, the automatic decision of writing the jump request quantity in a certain time can be made, caching is carried out on the basis of reasonably utilizing the caching resources, the time consumption of requesting the jump can be greatly reduced, and the user experience is improved.
In a specific example, as shown in fig. 6, the processing method of the short link may specifically include an initialization phase, a short link generation phase, and a short link jump phase, which are specifically described as follows:
In the initialization stage, the computer equipment firstly obtains sixty-two mutually different numbers and letters, wherein the sixty-two mutually different numbers and letters are 0-9, A-Z and a-Z, then carries out multi-round shuffling on the sixty-two mutually different numbers and letters through a shuffling algorithm to obtain an unordered character set consisting of sixty-two characters, and finally obtains a decimal-to-sixty-binary algorithm and a sixty-binary-to-decimal algorithm through a binary conversion algorithm according to the unordered character set.
In the short link generation stage, the computer device firstly generates a first identifier according to the receiving order of short link generation requests, wherein the first identifier is a decimal unique number distributed for the short link generation requests according to the characteristics of a database, then converts the first identifier into a second identifier through a decimal-to-sixty binary algorithm, wherein the second identifier is a sixty binary value, finally takes the second identifier as a short link, and sends the generated short link to a requester.
In the short link skip stage, the computer equipment firstly receives a short link skip request, then obtains a first identifier corresponding to the short link through a hexatwelve-system decimal algorithm, finally sequentially queries each data table according to the first identifier to obtain a long link corresponding to the short link, and skips to resources corresponding to the long link, such as pages corresponding to the long link.
The three processes realize the whole process of short link processing, and the short links generated by the method can correspond to the receiving order of the short link generation request, so that the uniqueness of the short links is ensured, the problem of short link conflict is solved, and in addition, the short links generated by the method are stored in the data table corresponding to the short link type, so that the short link processing method is more convenient to search, and the query efficiency of acquiring long links through the short links is improved.
Further, as a specific implementation of the method shown in fig. 1 to fig. 6, the present embodiment provides a short-link processing apparatus, as shown in fig. 7, including: a generation request receiving module 31, a short link generating module 32, and a data storage transmitting module 33.
The generation request receiving module 31 is configured to receive a short link generation request sent by a requester, where the short link generation request carries a long link and a short link type;
the short link generation module 32 is configured to generate a first identifier according to a receiving order of the short link generation request, and generate a short link according to the first identifier through a short link generation algorithm;
the data storage and transmission module 33 may be configured to store the mapping relationship among the first identifier, the short link, and the long link in a data table corresponding to the type of the short link, and send the short link to the requester.
In a specific application scenario, the short link generation module 32 is specifically configured to generate a first identifier according to a receiving order of a short link generation request, where the first identifier is a decimal value; converting the first identifier into a second identifier through a decimal-to-M-ary algorithm, wherein the second identifier is an M-ary numerical value, and M is greater than ten; and generating a short link according to the second identifier.
In a specific application scenario, as shown in fig. 8, the apparatus further includes a conversion algorithm generating module 34, where the conversion algorithm generating module 34 is specifically configured to obtain M numbers and letters that are different from each other; through a shuffling algorithm, carrying out disordered mixed arrangement on M numbers and letters which are different from each other to obtain an unordered character set consisting of M characters; and according to the unordered character set, a decimal-to-M system algorithm is obtained through a system conversion algorithm.
In a specific application scenario, the type of short link includes a permanent short link; the data storage and transmission module 33 is specifically configured to determine whether the number of generated permanent short links reaches a first preset number value within a first preset time period; if the generation number of the permanent short links does not reach a first preset number value within a first preset time period, storing the mapping relation among the first identifier, the short links and the long links in a data table corresponding to the permanent short links, and sending the short links to a requester; and if the generation quantity of the permanent short links reaches a first preset quantity value in a first preset time period, sending overrun information of the generation quantity of the permanent short links to a requester.
In a specific application scenario, the type of the short link comprises a non-permanent short link, and the short link generation request also carries the effective date of the short link; the data storage and transmission module 33 may be specifically configured to store the first identifier, the short link, the effective date of the short link, and the mapping relationship between the long link in a data table corresponding to the non-permanent short link, and send the short link to the requester.
In a specific application scenario, as shown in fig. 8, the apparatus further includes an validity period judging module 35 and a data deleting module 36, where the validity period judging module 35 is configured to periodically judge whether each data record in the data table corresponding to the non-permanent short link is within a valid date range; the data deleting module 36 may be configured to delete the data record if the data record is not within the valid date range.
In a specific application scenario, as shown in fig. 8, the apparatus further includes a conversion request receiving module 41, a conversion request judging module 42, and a data transferring module 43, where the conversion request receiving module 41 is configured to receive a type conversion request of a short link, where the type conversion request of the short link carries a short link, a type of the short link, and a type to be converted, and the conversion request judging module 42 is configured to judge whether the type conversion request of the short link is valid according to the type of the short link, and the type to be converted; the data transfer module 43 may be configured to transfer the data record corresponding to the short link from the data table corresponding to the type of the short link to the data table corresponding to the type to be converted if the type conversion request of the short link is valid.
In a specific application scenario, the conversion request judging module 42 is specifically configured to sequentially query, according to the short link, whether there is a corresponding data record in the data table corresponding to the type to be converted, the type conversion record table, and the data table corresponding to the type of the short link; if the data table corresponding to the type to be converted and/or the data table corresponding to the type conversion record table have corresponding data records and/or the data table corresponding to the type of the short link does not have corresponding data records, judging that the type conversion request of the short link is invalid; if the data table corresponding to the type to be converted and the type conversion record table do not have the corresponding data record, and the data table corresponding to the short link type has the corresponding data record, judging that the short link type conversion request is valid.
In a specific application scenario, as shown in fig. 8, the apparatus further includes a jump request receiving module 51, a short link inverse conversion module 52, and a resource jump module 53, where the jump request receiving module 51 may be configured to receive a jump request of a short link, where the jump request of the short link carries the short link; the short link inverse conversion module 52 is configured to obtain a first identifier corresponding to the short link through an inverse algorithm of the short link generation algorithm; the resource hopping module 53 is configured to query the data table according to the first identifier, obtain a long link corresponding to the short link, and hop to a resource corresponding to the long link.
In a specific application scenario, the resource jump module 53 is specifically configured to query, in sequence, the cache server, the data table and the type conversion record table corresponding to the types of each short link according to the first identifier; and if the data record corresponding to the first identifier is inquired, acquiring a long link corresponding to the data record, and jumping to a resource corresponding to the long link.
In a specific application scenario, the resource skipping module 53 may be further configured to skip to a preset resource if the data record corresponding to the first identifier is not queried or the queried data record is not within the valid date range.
In a specific application scenario, as shown in fig. 8, the apparatus further includes a skip request amount statistics module 61, a skip request amount judgment module 62, and a data cache module 63, where the skip request amount statistics module 61 may be configured to count the number of skip requests of short links in a resource corresponding to a long link, so as to obtain skip request amounts of each short link; the skip request quantity judging module 62 is configured to judge whether the skip request quantity of each short link reaches a second preset quantity value within a second preset time period; the data buffer module 63 is configured to store the data record corresponding to the short link in the buffer unit if the skip request amount of the short link reaches a second preset amount value within a second preset time period.
It should be noted that, for other corresponding descriptions of each functional unit related to the short-link processing apparatus provided in this embodiment, reference may be made to corresponding descriptions in fig. 1 to fig. 6, and no further description is given here.
Based on the above-described method shown in fig. 1 to 6, correspondingly, the present embodiment further provides a storage medium having stored thereon a computer program which, when executed by a processor, implements the above-described method for processing short links shown in fig. 1 to 6.
Based on such understanding, the technical solution of the present application may be embodied in the form of a software product, where the software product to be identified may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disc, a mobile hard disk, etc.), and include several instructions for causing a computer device (may be a personal computer, a server, or a network device, etc.) to execute the method described in each implementation scenario of the present application.
Based on the method shown in fig. 1 to 6 and the embodiment of the short-link processing apparatus shown in fig. 7 and 8, in order to achieve the above object, this embodiment further provides an entity device for processing short links, which may specifically be a personal computer, a server, a smart phone, a tablet computer, a smart watch, or other network devices, where the entity device includes a storage medium and a processor; a storage medium storing a computer program; a processor for executing a computer program to implement the method as described above and shown in fig. 1 to 6.
Optionally, the physical device may further include a user interface, a network interface, a camera, radio Frequency (RF) circuitry, sensors, audio circuitry, WI-FI modules, and the like. The user interface may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), etc., and the optional user interface may also include a USB interface, a card reader interface, etc. The network interface may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface), etc.
It will be appreciated by those skilled in the art that the structure of the entity device for processing short links provided in this embodiment is not limited to the entity device, and may include more or fewer components, or some components in combination, or different arrangements of components.
The storage medium may also include an operating system, a network communication module. The operating system is a program for managing the entity equipment hardware and the software resources to be identified, and supports the operation of the information processing program and other software and/or programs to be identified. The network communication module is used for realizing communication among all components in the storage medium and communication with other hardware and software in the information processing entity equipment.
From the above description of the embodiments, it will be apparent to those skilled in the art that the present application may be implemented by means of software plus necessary general hardware platforms, or may be implemented by hardware. By applying the technical scheme, the method comprises the steps of firstly receiving a short link generation request carrying long links and short links sent by a requester, then generating a first identifier according to the receiving sequence of the short link generation request, generating short links corresponding to the first identifier according to the first identifier through a short link generation algorithm, finally storing the mapping relation among the first identifier, the short links and the long links in a data table corresponding to the types of the short links, and sending the short links to the requester. Compared with the prior art, the short links generated by the method are stored in the data tables corresponding to the short link types, so that the short link retrieval is more convenient, the query efficiency of acquiring the long links through the short links is improved, in addition, the generated short links are stored in different data tables according to different types, the classification and arrangement of the short links can be facilitated, and the processing efficiency of the short links is improved.
Those skilled in the art will appreciate that the drawings are merely schematic illustrations of one preferred implementation scenario, and that the modules or flows in the drawings are not necessarily required to practice the present application. Those skilled in the art will appreciate that modules in an apparatus in an implementation scenario may be distributed in an apparatus in an implementation scenario according to an implementation scenario description, or that corresponding changes may be located in one or more apparatuses different from the implementation scenario. The modules of the implementation scenario may be combined into one module, or may be further split into a plurality of sub-modules.
The foregoing application serial numbers are merely for description, and do not represent advantages or disadvantages of the implementation scenario. The foregoing disclosure is merely a few specific implementations of the present application, but the present application is not limited thereto and any variations that can be considered by a person skilled in the art shall fall within the protection scope of the present application.

Claims (14)

1. A method for processing a short link, the method comprising:
receiving a short link generation request sent by a requester, wherein the short link generation request carries long links and short link types;
generating a first identifier according to the receiving order of the short link generation request, and generating a short link according to the first identifier through a short link generation algorithm;
Storing the mapping relation among the first identifier, the short link and the long link in a data table corresponding to the type of the short link, and sending the short link to the requester;
wherein the type of the short link comprises a permanent short link; storing the mapping relationship among the first identifier, the short link and the long link in a data table corresponding to the type of the short link, and sending the short link to the requester, including: judging whether the generation quantity of the permanent short links reaches a first preset quantity value in a first preset time period; if the generated number of the permanent short links does not reach the first preset number value within the first preset time period, storing the mapping relation among the first identifier, the short links and the long links in a data table corresponding to the permanent short links, and sending the short links to the requester; and if the generation number of the permanent short links reaches the first preset number value in the first preset time period, sending overrun information of the generation number of the permanent short links to the requester.
2. The method of claim 1, wherein the short link type further comprises a non-permanent short link, and the short link generation request further carries an expiration date of the short link; storing the mapping relationship among the first identifier, the short link and the long link in a data table corresponding to the type of the short link, and sending the short link to the requester, and further including:
storing the first identifier, the short link, the effective date of the short link and the mapping relation between the long link in a data table corresponding to the non-permanent short link, and sending the short link to the requester.
3. The method according to claim 2, wherein the method further comprises:
periodically judging whether each data record in the data table corresponding to the non-permanent short link is in the effective date range or not;
and if the data record is not in the valid date range, deleting the data record.
4. The method according to claim 2, wherein the method further comprises:
receiving a type conversion request of a short link, wherein the type conversion request of the short link carries the short link, the type of the short link and the type to be converted;
Judging whether a type conversion request of the short link is effective or not according to the short link, the type of the short link and the type to be converted;
and if the short link type conversion request is effective, transferring the data record corresponding to the short link from the data table corresponding to the short link type to the data table corresponding to the type to be converted.
5. The method of claim 4, wherein the determining whether the type conversion request of the short link is valid according to the short link, the type of the short link, and the type to be converted comprises:
according to the short link, sequentially inquiring whether corresponding data records exist in a data table corresponding to the type to be converted, a type conversion record table and a data table corresponding to the type of the short link;
if the data table corresponding to the type to be converted and/or the data table corresponding to the type conversion record table have corresponding data records and/or the data table corresponding to the type of the short link does not have corresponding data records, judging that the type conversion request of the short link is invalid;
and if the data table corresponding to the type to be converted and the type conversion record table do not have corresponding data records, and the data table corresponding to the type of the short link has corresponding data records, judging that the type conversion request of the short link is valid.
6. The method according to claim 1, wherein the method further comprises:
receiving a short-link jump request, wherein the short-link jump request carries a short link;
obtaining a first identifier corresponding to the short link through an inverse algorithm of the short link generation algorithm;
and inquiring a data table according to the first identifier to obtain a long link corresponding to the short link, and jumping to a resource corresponding to the long link.
7. The method of claim 6, wherein the querying the data table according to the first identifier obtains a long link corresponding to the short link, and jumps to a resource corresponding to the long link, including:
according to the first identification, sequentially inquiring a cache server, a data table corresponding to the type of each short link and a type conversion record table;
and if the data record corresponding to the first identifier is queried, acquiring a long link corresponding to the data record, and jumping to a resource corresponding to the long link.
8. The method of claim 7, wherein the method further comprises:
and if the data record corresponding to the first identifier is not queried or the queried data record is not within the effective date range, jumping to a preset resource.
9. The method of claim 6, wherein the method further comprises:
counting the number of the jump requests of the short links in the resources corresponding to the long links to obtain the jump request quantity of each short link;
judging whether the jump request quantity of each short link reaches a second preset quantity value in a second preset time period;
and if the jump request quantity of the short link reaches the second preset quantity value within the second preset time period, storing the data record corresponding to the short link in a cache unit.
10. The method according to claim 1, wherein the generating a first identifier according to the receiving order of the short link generation request, and generating a short link according to the first identifier by a short link generation algorithm, comprises:
generating a first identifier according to the receiving order of the short link generation request, wherein the first identifier is a decimal value;
converting the first identifier into a second identifier through a decimal-to-M-ary algorithm, wherein the second identifier is an M-ary numerical value, and M is greater than ten;
and generating the short link according to the second identifier.
11. The method according to claim 10, wherein before generating the first identifier according to the receiving order of the short link generation request and generating the short link according to the first identifier by a short link generation algorithm, the method further comprises:
obtaining M numbers and letters which are different from each other;
the M numbers and the letters which are different from each other are disordered and arranged through a shuffling algorithm, so that an unordered character set consisting of M characters is obtained;
and according to the unordered character set, obtaining the decimal-to-M system algorithm through a system conversion algorithm.
12. A short link processing apparatus, the apparatus comprising:
the generation request receiving module is used for receiving a short link generation request sent by a requester, wherein the short link generation request carries long links and short link types;
the short link generation module is used for generating a first identifier according to the receiving sequence of the short link generation request and generating a short link according to the first identifier through a short link generation algorithm;
the data storage and transmission module is used for storing the mapping relation among the first identifier, the short link and the long link in a data table corresponding to the type of the short link and transmitting the short link to the requester;
Wherein the type of the short link comprises a permanent short link; the data storage and transmission module is specifically configured to: judging whether the generation quantity of the permanent short links reaches a first preset quantity value in a first preset time period; if the generated number of the permanent short links does not reach the first preset number value within the first preset time period, storing the mapping relation among the first identifier, the short links and the long links in a data table corresponding to the permanent short links, and sending the short links to the requester; and if the generation number of the permanent short links reaches the first preset number value in the first preset time period, sending overrun information of the generation number of the permanent short links to the requester.
13. A storage medium having stored thereon a computer program, which when executed by a processor, implements the steps of the method of any of claims 1 to 11.
14. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the computer program when executed by the processor implements the steps of the method according to any one of claims 1 to 11.
CN202011165220.1A 2020-10-27 2020-10-27 Short link processing method and device, storage medium and computer equipment Active CN112307058B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011165220.1A CN112307058B (en) 2020-10-27 2020-10-27 Short link processing method and device, storage medium and computer equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011165220.1A CN112307058B (en) 2020-10-27 2020-10-27 Short link processing method and device, storage medium and computer equipment

Publications (2)

Publication Number Publication Date
CN112307058A CN112307058A (en) 2021-02-02
CN112307058B true CN112307058B (en) 2024-03-15

Family

ID=74331120

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011165220.1A Active CN112307058B (en) 2020-10-27 2020-10-27 Short link processing method and device, storage medium and computer equipment

Country Status (1)

Country Link
CN (1) CN112307058B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113676562B (en) * 2021-08-17 2022-10-14 平安普惠企业管理有限公司 Short-chain request convergence method and device, computer equipment and storage medium
CN115587609A (en) * 2022-09-27 2023-01-10 深圳市智码通科技有限公司 Short-link two-dimensional code generation method and device

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103428220A (en) * 2013-08-23 2013-12-04 中国人民解放军理工大学 Virtual reconstruction ubiquitous network architecture based on identity-position separation
CN104615425A (en) * 2015-01-16 2015-05-13 贾志东 Method and system for developing software system based on features and feature tree
CN107562835A (en) * 2017-08-23 2018-01-09 广东欧珀移动通信有限公司 File search method, device, mobile terminal and computer-readable recording medium
AU2016382909A1 (en) * 2015-12-30 2018-07-19 Advanced New Technologies Co., Ltd. Method and device for processing short link, and short link server
CN109584084A (en) * 2018-10-22 2019-04-05 中国平安人寿保险股份有限公司 Insurance products order information and agent's information correlation method, device and equipment
CN109918586A (en) * 2019-01-21 2019-06-21 广东万丈金数信息技术股份有限公司 Short link jump method, device, short linked server and storage medium
CN110851748A (en) * 2019-10-14 2020-02-28 平安科技（深圳）有限公司 Short link generation method, server, storage medium and computer equipment
CN111355732A (en) * 2020-02-28 2020-06-30 腾讯科技（深圳）有限公司 Link detection method and device, electronic equipment and storage medium
CN111506559A (en) * 2020-04-21 2020-08-07 北京同邦卓益科技有限公司 Data storage method and device, electronic equipment and storage medium
CN111538922A (en) * 2019-01-18 2020-08-14 百度在线网络技术（北京）有限公司 Link skip method, application client, device and storage medium

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103428220A (en) * 2013-08-23 2013-12-04 中国人民解放军理工大学 Virtual reconstruction ubiquitous network architecture based on identity-position separation
CN104615425A (en) * 2015-01-16 2015-05-13 贾志东 Method and system for developing software system based on features and feature tree
AU2016382909A1 (en) * 2015-12-30 2018-07-19 Advanced New Technologies Co., Ltd. Method and device for processing short link, and short link server
CN107562835A (en) * 2017-08-23 2018-01-09 广东欧珀移动通信有限公司 File search method, device, mobile terminal and computer-readable recording medium
CN109584084A (en) * 2018-10-22 2019-04-05 中国平安人寿保险股份有限公司 Insurance products order information and agent's information correlation method, device and equipment
CN111538922A (en) * 2019-01-18 2020-08-14 百度在线网络技术（北京）有限公司 Link skip method, application client, device and storage medium
CN109918586A (en) * 2019-01-21 2019-06-21 广东万丈金数信息技术股份有限公司 Short link jump method, device, short linked server and storage medium
CN110851748A (en) * 2019-10-14 2020-02-28 平安科技（深圳）有限公司 Short link generation method, server, storage medium and computer equipment
CN111355732A (en) * 2020-02-28 2020-06-30 腾讯科技（深圳）有限公司 Link detection method and device, electronic equipment and storage medium
CN111506559A (en) * 2020-04-21 2020-08-07 北京同邦卓益科技有限公司 Data storage method and device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN112307058A (en) 2021-02-02

Similar Documents

Publication Publication Date Title
US10250526B2 (en) Method and apparatus for increasing subresource loading speed
CN106933854B (en) Short link processing method and device and server
CN108090064A (en) A kind of data query method, apparatus, data storage server and system
CN112307058B (en) Short link processing method and device, storage medium and computer equipment
CN106897341A (en) 2 D code information querying method, server, client and system
KR20180099841A (en) Method and apparatus for handling short-cut links,
CN105472045A (en) Database migration method and database migration device
CN102523314A (en) Identifying an efficient destination server
CN104378452A (en) Method, device and system for domain name resolution
CN108184170B (en) Data processing method and device
CN107566477B (en) Method and device for acquiring files in distributed file system cluster
CN103455439A (en) Local caching device, system and method for providing content caching service
CN110764688B (en) Method and device for processing data
US20100036892A1 (en) Determination of an updated data source from disparate data sources
CN111367870A (en) Method, device and system for sharing picture book
CN112583780B (en) Method, device, system and equipment for accessing website data by using proxy IP
CN111803917A (en) Resource processing method and device
US8180857B2 (en) Method for downloading file in parallel
CN112866424A (en) Domain name query method and related equipment
CN111797334B (en) Website access method and device, electronic equipment and storage medium
CN107241446B (en) File transmission method and device of application program, terminal equipment and storage medium
CN111190861B (en) Hot spot file management method, server and computer readable storage medium
CN110049133B (en) Method and device for issuing full amount of DNS zone files
JP6233846B2 (en) Variable-length nonce generation
CN107977381B (en) Data configuration method, index management method, related device and computing equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information
CB02 Change of applicant information

Address after: 100102 201 / F, block C, 2 lizezhong 2nd Road, Chaoyang District, Beijing

Applicant after: Beijing Shuidi Technology Group Co.,Ltd.

Address before: 100102 201, 2 / F, block C, No.2 lizezhong 2nd Road, Chaoyang District, Beijing

Applicant before: Beijing Health Home Technology Co.,Ltd.

GR01 Patent grant
GR01 Patent grant