CN113612869B - Short website generation method, terminal and storage medium - Google Patents
Short website generation method, terminal and storage medium Download PDFInfo
- Publication number
- CN113612869B CN113612869B CN202110982714.7A CN202110982714A CN113612869B CN 113612869 B CN113612869 B CN 113612869B CN 202110982714 A CN202110982714 A CN 202110982714A CN 113612869 B CN113612869 B CN 113612869B
- Authority
- CN
- China
- Prior art keywords
- website
- short
- long
- dynamic parameter
- generating
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000004364 calculation method Methods 0.000 claims abstract description 24
- 238000006243 chemical reaction Methods 0.000 claims abstract description 20
- 238000004422 calculation algorithm Methods 0.000 claims description 22
- 230000005540 biological transmission Effects 0.000 claims description 13
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012163 sequencing technique Methods 0.000 claims description 7
- 238000001514 detection method Methods 0.000 abstract description 8
- 238000012546 transfer Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 3
- 230000001174 ascending effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2101/00—Indexing scheme associated with group H04L61/00
- H04L2101/60—Types of network addresses
- H04L2101/672—Short addresses
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
- G06F16/9566—URL specific, e.g. using aliases, detecting broken or misspelled links
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5046—Resolving address allocation conflicts; Testing of addresses
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a short website generating method, a terminal and a storage medium, comprising the following steps: receiving a website conversion request for generating a corresponding short website according to the long website; carrying out hash calculation on the long website to obtain a corresponding calculated value; judging whether the calculated value exists in a Redis or not, wherein the Redis stores a short website and a corresponding calculated value; if yes, returning to the short website; if not, generating a unique ID of the long website, converting the unique ID into a corresponding short website, and storing the calculated value of the long website and the short website into the Redis. The invention can avoid the generation of repeated data, thus avoiding the conflict detection and reducing the calculated amount and the storage pressure. The technical scheme can convert the same long website into the same short website for multiple times, and can avoid converting the same long website into different short websites for multiple times.
Description
Technical Field
The present invention relates to the field of internet technologies, and in particular, to a method, a terminal, and a storage medium for generating a short website.
Background
Short web sites (shorturls) refer to web sites that are relatively short in form. Short websites are widely used in the internet, such as two-dimension code generation, short message sending and the like, and short websites can be used for replacing the original lengthy websites, so that the sharing of links is facilitated.
At present, short websites mainly have the following generation schemes:
1. and calculating a hash value of the long website by using a hash algorithm to obtain a short code, so that the direct mapping relation between the long website and the short code is realized.
2. Short codes which are not repeated are generated in batches in advance, and when long websites need to be converted, one of the short codes is read randomly to return.
3. Setting self-increment through Redis, and then carrying out binary conversion to obtain a short website.
The scheme is used for carrying out conflict detection when the short website is obtained through calculation, and the problems that the same long website is converted for multiple times to generate different short codes and the short website does not support carrying parameters and has poor flexibility exist.
Disclosure of Invention
Therefore, it is necessary to provide a method for generating short websites to solve the technical problem that the short websites need conflict detection and multiple conversions of the same long websites to generate different short websites.
In order to achieve the above object, the present inventors provide a short web address generation method, comprising the steps of:
receiving a website conversion request for generating a corresponding short website according to the long website;
carrying out hash calculation on the long website to obtain a corresponding calculated value;
judging whether the calculated value exists in a Redis or not, wherein the Redis stores a short website and a corresponding calculated value;
if yes, returning to the short website; if not, generating a unique ID of the long website, converting the unique ID into a corresponding short website, and storing the calculated value of the long website and the short website into the Redis.
Further, the hash calculation of the long website to obtain a corresponding calculated value includes the steps of:
and sequencing the long websites through a preset sequencing algorithm to obtain character strings, and performing message-digest calculation on the character strings to obtain digest values, wherein the digest values are calculated values.
Further, the message-digest calculation is MD5 calculation, and the digest value is MD5 calculation performed on the long web address to obtain an MD5 value.
Further, the step of generating a unique ID of the long web site, and converting the unique ID into a corresponding short web site includes the steps of:
inserting the long website into a mysql database to obtain an auto-increment primary key ID of the long website;
and converting the self-increasing primary key ID into a short website according to a preset binary conversion algorithm.
Further, before the receiving the web address conversion request for generating the corresponding short web address according to the long web address, the method further includes the steps of:
presetting a dynamic parameter configuration mode of a short website; the dynamic parameter configuration mode is used for adjusting the parameters of the long website corresponding to the short website according to the dynamic parameter configuration mode when the short website is accessed.
Further, the dynamic parameter configuration mode includes: dynamic parameter delivery is not supported, dynamic parameter delivery is supported, or parameter values in the original long web site are preferentially used.
Further, the preset binary conversion algorithm comprises a 62 binary algorithm.
In order to solve the technical problems, the invention also provides another technical scheme:
the terminal for generating the short website comprises a memory, a processor and a computer program which is stored in the memory and can run on the processor, wherein the processor realizes the short website generation method according to any technical scheme when executing the computer program.
In order to solve the technical problems, the invention also provides another technical scheme:
a storage medium having stored thereon a computer program which when executed by a processor implements the short web address generation method of any of the above aspects.
Compared with the prior art, the technical scheme judges whether the long website has the corresponding short website stored in the Redis according to the calculated value of the long website, if so, the short website is directly returned, if not, the long website is converted into the short website and stored in the Redis, so that the generation of repeated data is avoided, conflict detection is not needed, and meanwhile, the calculated amount and the storage pressure can be reduced. The technical scheme can convert the same long website into the same short website for multiple times, and can avoid converting the same long website into different short websites for multiple times.
Drawings
FIG. 1 is a flow chart of a method for generating a short web address according to an embodiment;
FIG. 2 is a flowchart of a method for generating a short web address according to an embodiment;
FIG. 3 is a block diagram of a terminal for generating a short web address according to an embodiment;
FIG. 4 is a schematic diagram of a storage medium according to an embodiment;
reference numerals illustrate:
300. generating a terminal of a short website;
310. a processor;
320. a memory;
400. a storage medium;
Detailed Description
In order to describe the technical content, constructional features, achieved objects and effects of the technical solution in detail, the following description is made in connection with the specific embodiments in conjunction with the accompanying drawings.
Referring to fig. 1, the present embodiment provides a method for generating a short website. The method for generating the short website can convert the long website into the corresponding short website, and comprises the following steps:
s101, receiving a website conversion request of a short website corresponding to the long website; wherein the long web sites and the short web sites typically employ different snapshots and different ranks, the long web sites being longer in form than the short web sites, and the long web sites typically include "www" and the short web sites typically do not include "www".
S102, carrying out hash calculation on the long website to obtain a corresponding calculated value; the hash calculation is carried out on the long websites, so that calculated values with the same length can be obtained for the long websites with different lengths, the storage is convenient, and the storage capacity can be effectively reduced.
S103, judging whether the calculated value exists in a Redis, wherein the Redis stores a short website and a corresponding calculated value;
if yes, returning to the short website; if not, generating a unique ID of the long website, converting the unique ID into a corresponding short website, and storing the calculated value of the long website and the short website into the Redis.
Wherein, redis is a high-performance key-value database, and the data in Redis are cached in the memory, thereby ensuring the reading and writing efficiency. And the Redis periodically writes updated data to the disk or writes modification operations to the additional record file, and master-slave synchronization is realized on the basis.
In step S103, if the calculated value of the long website is stored in the Redis, the corresponding short website is directly returned from the Redis, so that repeated generation of the short website is not required, and the calculated amount and storage pressure of the system are reduced. If the calculated value of the long website does not exist in the Redis, the calculated value is converted into a corresponding short website according to the unique ID of the long website, and the corresponding short website is stored in the Redis, and as the unique ID of each long website is different, the short website obtained according to the unique ID of the long website is ensured to be different, and therefore collision detection is not needed.
As can be seen from the above description, the short web site generation method can avoid repeated calculation to generate short web sites, reduce the calculation amount and the storage pressure, and generate each short web site differently, so that collision detection is not required.
In an embodiment, the hash calculation of the long website to obtain the corresponding calculated value includes the steps of:
and sequencing the long websites through a preset sequencing algorithm to obtain character strings, and performing message-digest calculation on the character strings to obtain digest values, wherein the digest values are calculated values. Among them, the message-digest calculation is preferably MD5 calculation. Because the website after the sequencing is still very long and the matching performance is poor, the length of the website can be shortened to 32 or 16 bits through MD5 calculation, so that the performance of the website is improved. In other embodiments, other message-digest calculation algorithms such as MD4, MD3, sha-1, RIPEMD, haval, etc. may also be used. MD5 is the message-digest algorithm 5, which allows large volumes of information to be "compressed" into a secure format (i.e., a string of bytes of arbitrary length is converted into a string of hexadecimal digits of certain length) by MD 5.
The long websites are sequenced to obtain a unique character string A, and MD5 calculation is performed on the character string A to obtain an MD5 value B (namely a calculated value). The sorting of the long websites refers to sorting parameters in the long websites, the sorting mode can be sorting of ascending order or descending order of parameter names of the long websites, and the sorting can ensure that a batch of character strings A obtained after parameter sorting are unique. For example:
long web site http:// www.ktvme.comab =122 & kk=32 & bg=333, after ascending order, fixed as: http:// www.ktvme.comab =122 & bg=333 & kk=32.
In one embodiment, the step of generating the unique ID of the long web site and converting the unique ID into the corresponding short web site includes the steps of:
inserting the long website into a mysql database to obtain an auto-increment primary key ID of the long website;
and converting the self-increasing primary key ID into a short website according to a preset binary conversion algorithm.
Wherein, the preset binary conversion algorithm comprises a 62-degree algorithm, a 52-degree algorithm, a 42-degree algorithm and the like.
The mysql database is a relational database and has the advantages of small volume, high speed, low cost, open source code and the like.
In the mysql database, the self-added primary key ID is increased by 1 every time a piece of data is added. Each piece of data has a unique identification (i.e., primary key ID). When the long website is inserted into the mysql database by executing the insertion statement, the self-increasing main key ID of the long website can be obtained, and the self-increasing main key ID can be obtained through the mysql_insert_ID function of the PHP.
In the embodiment, the long website is inserted into the mysql database, and the short website is obtained through the self-increment primary key ID (identity) binary conversion algorithm of the long website, so that the uniqueness of the short website can be ensured, and conflict detection is not needed. In other embodiments, the long website may be inserted into another database such as sqlsvr database or sqlite database to obtain the corresponding self-increasing primary key ID.
Considering that the short website does not support the carrying parameters in the prior art, the use flexibility of the short website is poor. In an embodiment, the method for generating a short website further includes the steps of: the method comprises the steps of presetting a dynamic parameter configuration mode of a short website, wherein the dynamic parameter configuration mode is used for adjusting parameters of a long website corresponding to the short website according to the dynamic parameter configuration mode when the short website is accessed, so that the effect of transparent transmission of dynamic parameters is achieved, namely, the dynamic parameters are transmitted to the corresponding long website when the long website is accessed through the short website.
Wherein the dynamic parameter configuration mode includes: either or both of not supporting dynamic parameter delivery, and supporting partial parameter delivery (i.e., supporting dynamic parameter delivery but preferentially using parameter values in the original long web site).
In practical use, the corresponding dynamic parameter transfer mode (for example, supporting dynamic parameter transfer) can be selected according to the use situation of the short website. When the user accesses the short website, the dynamic parameters of the short website and the parameters of the long website are recombined and arranged and calculated according to the parameter transmission mode judgment preset by the user, so that the effect of transparent transmission of the dynamic parameters is achieved.
The following description will take the example of a user accessing a short web site.
The step of clicking the short website by the user to access the page comprises the following steps:
step one: the user clicks on the short web site.
Step two: the short website service center verifies the correctness of the short website.
Step three: judging a preset dynamic parameter transmission mode of the short website, and combining the dynamic parameters in the short website to rearrange the parameters of the long website according to the dynamic parameter transmission mode.
Step four: the short website service center performs redirection jump to the long website address and carries the rearranged parameters.
Step five: the user sees the desired web page.
In order to more clearly understand the short web site dynamic parameter transparent transmission process, a specific example is described below.
Assume that a long web site a is: http:// www.ktvme.com/a/b/cid=1 & type=4 & abc=222; the long website is converted into a short website under three dynamic parameter transmission modes as follows:
1) Mode 1: https:// s.ktvme.com/asbxjs; mode 1 does not support dynamic parameter delivery;
2) Mode 2: https:// s.ktvme.com/sxsccs; mode 2 supports dynamic parameter delivery, but the parameter values in the original long website are used preferentially;
3) Mode 3: https:// s.ktvme.com/xsssacsa; mode 3 supports dynamic parameters, and the new parameter value can cover the parameter value of the original long website;
the generation of short websites for the above three modes differs only in the option of dynamic parameter mode, and other generation logic is the same.
The three dynamic parameter delivery modes are assumed to be delivered in the same manner by obtaining a short website (i.e. a short link), and carry the same parameters as follows:
4) Mode 1: https:// s.ktvme.com/asbxjstype=10 & kk=2;
5) Mode 2: https:// s.ktvme.com/sxsscstype=10 & kk=2;
6) Mode 3: https:// s.ktvme.com/xsssacctype=10 & kk=2;
when the user accesses 4), since mode 1 is selected and mode 1 does not deliver dynamic parameters, the parameters type=10 & kk=2 on the short web site (i.e. short link) will be discarded and the user accesses directly to the original long web site a.
When the user accesses 5), mode 2 is selected, which allows dynamic parameters to be delivered, but the parameter values in the original long web address are used preferentially. Thus type=10 is discarded, kk=2 is incorporated into the parameter, and the user accesses http:// www.ktvme.com/a/b/cid=1 & type=4 & abc=222 & kk=2.
When the user accesses 6), mode 3 is selected, which allows the delivery of dynamic parameters, the new parameter values will override the parameter values of the original long web address, so that type=10 will override type=4, the user accesses the address http:// www.ktvme.com/a/b/cid=1 & type=10 & abc=222 & kk=2.
Through the dynamic parameter transmission, a shorter short website link can be obtained through the short website service, and the parameters can be transmitted, so that the flexibility and expansibility of short website application are improved.
As shown in fig. 2, in one embodiment of the method for generating a short web address, the method for generating the short web address includes the steps of:
s201, receiving a long website A conversion request and presetting a dynamic parameter configuration mode B; wherein, the dynamic parameter configuration mode B is whether to support the dynamic parameter B, and the dynamic parameter configuration model includes: dynamic parameter transfer is not supported, dynamic parameter transfer is supported, partial parameter transfer is supported (i.e. dynamic parameter transfer is supported but parameter values in the original long website are preferentially used;
s202, converting a long website into a unique character string C by using a sorting algorithm;
s203, performing MD5 calculation on the character string C to obtain a corresponding MD5 value D;
s204, judging whether the MD5 value D exists in Redis; if yes, jump to S208; if not, executing S205;
s205, inserting a long website and a dynamic parameter configuration mode B into a mysql database to obtain an auto-increment primary key ID;
s206, converting the auto-increment primary key ID into a short code E by using a binary algorithm;
s207, storing the MD5 value D and the short code E in a Redis by a Key-value;
s208, returning to the short website.
According to the specific embodiment, the short website generation method uses the self-increment primary key ID of the mysql database to carry out binary conversion to obtain the short code, so that the conversion is quick and collision detection is not needed. And moreover, the MD5 algorithm is adopted after the sorting algorithm, so that repeated requests can be intercepted, and the waste of storage space is reduced. Furthermore, the short website generation method also supports dynamic parameter transparent transmission through a preset dynamic parameter configuration mode, and dynamic parameter application, so that a large number of approximate long websites (such as links with inconsistent parameters) do not need repeated conversion, only need conversion once, and the rest links can be realized only by using dynamic parameters for transmission, thereby greatly improving flexibility and reducing a large number of unnecessary requests.
As shown in fig. 3, in one embodiment, a terminal 300 for generating a short web address is provided. The terminal 300 generating the short web address is used for converting the long web address into a corresponding short web address. The terminal 300 for generating a short web address includes a memory 320, a processor 310 and a computer program stored in the memory 320 and executable on the processor, wherein the processor 310 implements the short web address generation method described in any of the above embodiments when executing the computer program.
As shown in fig. 4, in an embodiment, there is provided a storage medium 400, on which a computer program is stored, the program implementing the short web address generation method described in any of the above embodiments when the computer program is executed by a processor.
It should be noted that, although the foregoing embodiments have been described herein, the scope of the present invention is not limited thereby. Therefore, based on the innovative concepts of the present invention, alterations and modifications to the embodiments described herein, or equivalent structures or equivalent flow transformations made by the present description and drawings, apply the above technical solution, directly or indirectly, to other relevant technical fields, all of which are included in the scope of the invention.
Claims (7)
1. The short website generation method is characterized by comprising the following steps:
receiving a website conversion request for generating a corresponding short website according to the long website;
carrying out hash calculation on the long website to obtain a corresponding calculated value;
judging whether the calculated value exists in a Redis or not, wherein the Redis stores a short website and a corresponding calculated value;
if yes, returning to the short website; if not, generating a unique ID of the long website, converting the unique ID into a corresponding short website, and storing the calculated value of the long website and the short website into the Redis;
before receiving the website conversion request for generating the corresponding short website according to the long website, the method further comprises the steps of:
presetting a dynamic parameter configuration mode of a short website; the dynamic parameter configuration mode is used for adjusting parameters of a long website corresponding to the short website according to the dynamic parameter configuration mode when the short website is accessed, so as to realize dynamic parameter transparent transmission, and comprises the following steps:
judging a preset dynamic parameter transmission mode of the short website, combining the dynamic parameters in the short website according to the dynamic parameter transmission mode, and rearranging the parameters of the long website; the short website service center performs redirection jump to the long website address and carries the rearranged parameters, wherein the dynamic parameter configuration mode comprises the following steps: dynamic parameter delivery is not supported, dynamic parameter delivery is supported, or parameter values in the original long web site are preferentially used.
2. The method for generating a short web address according to claim 1, wherein the step of performing hash computation on the long web address to obtain a corresponding calculated value comprises the steps of:
and sequencing the long websites through a preset sequencing algorithm to obtain character strings, and performing message-digest calculation on the character strings to obtain digest values, wherein the digest values are calculated values.
3. The short web site generation method of claim 2, wherein the message-digest calculation is an MD5 calculation, and the digest value is an MD5 value obtained by performing an MD5 calculation on the long web site.
4. The short web site generation method according to claim 1, wherein the step of generating the unique ID of the long web site and converting the unique ID into the corresponding short web site comprises the steps of:
inserting the long website into a mysql database to obtain an auto-increment primary key ID of the long website;
and converting the self-increasing primary key ID into a short website according to a preset binary conversion algorithm.
5. The short web site generation method of claim 4 wherein the predetermined binary conversion algorithm comprises a 62-ary algorithm.
6. A terminal for generating a short web address, comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the short web address generation method according to any one of claims 1 to 5 when executing the computer program.
7. A storage medium having stored thereon a computer program, wherein the program when executed by a processor implements the short web address generation method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110982714.7A CN113612869B (en) | 2021-08-25 | 2021-08-25 | Short website generation method, terminal and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110982714.7A CN113612869B (en) | 2021-08-25 | 2021-08-25 | Short website generation method, terminal and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113612869A CN113612869A (en) | 2021-11-05 |
| CN113612869B true CN113612869B (en) | 2023-12-19 |
Family
ID=78341999
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110982714.7A Active CN113612869B (en) | 2021-08-25 | 2021-08-25 | Short website generation method, terminal and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113612869B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115587609A (en) * | 2022-09-27 | 2023-01-10 | 深圳市智码通科技有限公司 | Short-link two-dimensional code generation method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102402558A (en) * | 2010-09-16 | 2012-04-04 | 腾讯科技（深圳）有限公司 | Method and system for providing message containing website |
| CN106412140A (en) * | 2015-08-03 | 2017-02-15 | 沈阳东软睿道教育服务有限公司 | Short link address generating method and system thereof |
| CN106933854A (en) * | 2015-12-30 | 2017-07-07 | 阿里巴巴集团控股有限公司 | Short linking processing method, device and server |
| CN109313660A (en) * | 2018-08-17 | 2019-02-05 | 福建联迪商用设备有限公司 | A kind of method and terminal generating short network address |
| CN110213397A (en) * | 2019-05-29 | 2019-09-06 | 北京达佳互联信息技术有限公司 | Data creation method, device, electronic equipment and storage medium |
| CN110365806A (en) * | 2019-06-06 | 2019-10-22 | 无线生活（杭州）信息科技有限公司 | Network address conversion method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10860239B2 (en) * | 2018-05-04 | 2020-12-08 | EMC IP Holding Company LLC | Fan-out asynchronous replication caching |
-
2021
- 2021-08-25 CN CN202110982714.7A patent/CN113612869B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102402558A (en) * | 2010-09-16 | 2012-04-04 | 腾讯科技（深圳）有限公司 | Method and system for providing message containing website |
| CN106412140A (en) * | 2015-08-03 | 2017-02-15 | 沈阳东软睿道教育服务有限公司 | Short link address generating method and system thereof |
| CN106933854A (en) * | 2015-12-30 | 2017-07-07 | 阿里巴巴集团控股有限公司 | Short linking processing method, device and server |
| CN109313660A (en) * | 2018-08-17 | 2019-02-05 | 福建联迪商用设备有限公司 | A kind of method and terminal generating short network address |
| CN110213397A (en) * | 2019-05-29 | 2019-09-06 | 北京达佳互联信息技术有限公司 | Data creation method, device, electronic equipment and storage medium |
| CN110365806A (en) * | 2019-06-06 | 2019-10-22 | 无线生活（杭州）信息科技有限公司 | Network address conversion method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113612869A (en) | 2021-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110222048B (en) | Sequence generation method, device, computer equipment and storage medium | |
| JP6778795B2 (en) | Methods, devices and systems for storing data | |
| US8209334B1 (en) | Method to direct data to a specific one of several repositories | |
| CN106933854B (en) | Short link processing method and device and server | |
| CN111190928A (en) | Cache processing method and device, computer equipment and storage medium | |
| US20050027731A1 (en) | Compression dictionaries | |
| CN112579602B (en) | Multi-version data storage method, device, computer equipment and storage medium | |
| CN111831208B (en) | Information processing method and device, terminal equipment and storage medium | |
| CN106874348A (en) | File is stored and the method for indexing means, device and reading file | |
| KR102111871B1 (en) | Method and apparatus for generating random string | |
| CN111580965A (en) | Data request processing method and system | |
| CN113094334B (en) | Digital service method, device, equipment and storage medium based on distributed storage | |
| CN110069557B (en) | Data transmission method, device, equipment and storage medium | |
| CN113612869B (en) | Short website generation method, terminal and storage medium | |
| CN116578746A (en) | Object de-duplication method and device | |
| CN114127724A (en) | Integrity audit for multi-copy storage | |
| CN110334103B (en) | Recommendation service updating method, providing device, access device and recommendation system | |
| AU2014226447B2 (en) | Managing operations on stored data units | |
| US9020977B1 (en) | Managing multiprotocol directories | |
| CN111274245A (en) | Method and device for optimizing data storage | |
| CN111949648B (en) | Memory data caching system and data indexing method | |
| CN111061698B (en) | Method and device for storing Ethernet contract data | |
| US20100281212A1 (en) | Content-based write reduction | |
| CN109271797B (en) | Method and system for improving security of database sensitive information | |
| CN116010362A (en) | File storage and file reading method, device and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |