CN114553825A - Method and system for converting webpage address into short address - Google Patents
Method and system for converting webpage address into short address Download PDFInfo
- Publication number
- CN114553825A CN114553825A CN202210167808.3A CN202210167808A CN114553825A CN 114553825 A CN114553825 A CN 114553825A CN 202210167808 A CN202210167808 A CN 202210167808A CN 114553825 A CN114553825 A CN 114553825A
- Authority
- CN
- China
- Prior art keywords
- address
- webpage
- short
- redis node
- key identification
- 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.)
- Granted
Links
Images
Classifications
-
- 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/09—Mapping addresses
- H04L61/25—Mapping addresses of the same type
- H04L61/2596—Translation of addresses of the same type other than IP, e.g. translation from MAC to MAC 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/901—Indexing; Data structures therefor; Storage structures
- G06F16/9014—Indexing; Data structures therefor; Storage structures hash tables
-
- 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]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Power Engineering (AREA)
- Computer And Data Communications (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a method for converting a webpage address into a short address, which comprises the following steps: step S1, analyzing the webpage address to obtain a domain name, performing hash code encoding on the domain name to obtain a numerical value i, and performing modulus on the fragment number by using the numerical value i to obtain a redis node where the fragment number is located; step S2, converting the webpage address into a 32-bit length abstract by adopting a hash function, and taking the first n-bit character of the abstract as the key identification of the short address; step S3, judging whether the long address data is consistent with the webpage address, if yes, indicating that the short address key identification is not overdue, not storing, avoiding covering, and if not, indicating that collision occurs; s4, storing the webpage address into a redis node after the last short address identification key identification is obtained; step S5, the client accesses the short address, analyzes to obtain the number of the redis node and the key identification of the short address, and jumps to the original webpage address; the invention can convert the webpage address into a short address, thereby avoiding the overlong webpage address.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a system for converting a webpage address into a short address.
Background
With the development of website services, web addresses are in a strange form, for example, a website with a search function carries many parameters, such as search keywords, search sources, encoding types, and the like, so that url addresses become very long. When you want to share the url with other people, it is very inconvenient, and it is possible that the address is too long and is cut off by the chat tool, and is sent by the short message in a segmented manner, and is lost when copied. If the long address can be changed into a reduced short address, the problem will be solved when sharing. If the short address is generated quickly, compared with the traditional method of increasing the id of the database, the read-write efficiency is greatly improved by directly using the redis data cache as the only storage medium, and the problems of short address collision, data fragmentation storage and the like need to be solved by using the redis as the short address storage medium.
Disclosure of Invention
To overcome the above problems, it is an object of the present invention to provide a method for converting a web page address into a short address, thereby avoiding the web page address from being too long.
The invention is realized by adopting the following scheme: a method for converting a web page address into a short address, comprising the following steps:
step S1, analyzing the webpage address to obtain a domain name, performing hash code encoding on the domain name to obtain a numerical value i, and performing modulus on the fragment number by using the numerical value i to obtain a redis node where the fragment number is located;
step S2, converting the webpage address into an abstract with the length of 32 bits by adopting a hash function, taking the first n-bit character of the abstract as a key identifier of a short address, and reading the long address data of a redis node as the key identifier;
step S3, judging whether the long address data is consistent with the webpage address, if yes, indicating that the short address key identification is not overdue, not storing, avoiding covering, and if not, indicating that collision occurs;
s4, storing the webpage address into a redis node after the last short address identification key identification is obtained;
and step S5, the client accesses the short address, analyzes to obtain the number of the redis node and the key identification of the short address, reads the specified redis node to obtain the long address data, and jumps to the original webpage address, thereby realizing the conversion of the webpage address into the short address.
Further, the step S1 is further specifically: analyzing a webpage address to obtain a domain name, removing a protocol head of the webpage address, then obtaining a first slash/front character string which is the webpage domain name, calling the webpage domain name in a hash code mode to obtain a numerical value v, performing modulus operation on the fragment number of a redis node by using the numerical value v to obtain a numerical value i, and storing the webpage address under the domain name on the redis node with the numerical value i.
Further, the step S2 is further specifically: calling a hash function MD5 to convert the webpage address into an abstract character string with the length of 32 bits, judging whether long address data exist in the redis node, if so, comparing whether the read data is consistent with the webpage address,
if not, continuing to call the hash function.
Further, the step S3 is further specifically: and judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not overdue, not storing to avoid coverage, and if not, indicating that collision occurs, and increasing the number of bits of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is the short link of the webpage address.
Further, the step S4 is further specifically: and forming a short label by adding the key identification to the number i of the redis node, storing the key identification of the redis node and the webpage address as a value function into the redis node, and setting the expiration time of the required webpage address, wherein the expiration time is 24h, and the final short address label is the number i of the redis node and the key identification of the short address.
Further, the step S5 is further specifically: the client browser accesses the short address, obtains the last element by '/' segmentation, obtains the first-bit character as a redis node number i, obtains the remaining characters as a short address key identification, reads long address data on the redis node, obtains a webpage address, and can jump to the webpage address.
The invention also provides a system for converting the webpage address into the short address, which comprises an analysis module, a reading module, a judgment module, a storage module and a skipping module, wherein the analysis module analyzes the webpage address to obtain the domain name, performs a hash code encoding mode on the domain name to obtain a numerical value i, and performs a modulus on the fragment number by using the numerical value i to obtain the located redis node; the reading module converts the webpage address into an abstract with the length of 32 bits by adopting a hash function, takes the first n-bit character of the abstract as a key identifier of a short address, and reads the long address data of a redis node as the key identifier; the judging module judges whether the long address data is consistent with the webpage address, if so, the short address key identification is not overdue and is not stored, so that coverage is avoided, and if not, collision is indicated; the storage module is used for storing the webpage address into the redis node after the last short address identification key identification is obtained; the skip module is used for enabling a client to access the short address, analyzing the short address to obtain a redis node number and a short address identification key identification, reading the specified redis node to obtain long address data, and skipping to the original webpage address, so that the webpage address is converted into the short address.
Further, the parsing module is further specifically: analyzing a webpage address to obtain a domain name, removing a protocol head of the webpage address, then obtaining a first slash/front character string which is the webpage domain name, calling the webpage domain name in a hash code mode to obtain a numerical value v, performing modulus operation on the fragment number of a redis node by using the numerical value v to obtain a numerical value i, and storing the webpage address under the domain name on the redis node with the numerical value i.
Further, the reading module is further specifically: and calling a hash function MD5 to convert the webpage address into an abstract character string with the length of 32 bits, judging whether long address data exist in the redis node, if so, comparing whether the read data are consistent with the webpage address, and if not, continuing to call the hash function.
Further, the determining module is further specifically: and judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not overdue, not storing to avoid coverage, and if not, indicating that collision occurs, and increasing the number of bits of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is the short link of the webpage address.
Further, the storage module is further specifically: and forming a short label by adding the key identification to the number i of the redis node, storing the key identification of the redis node and the webpage address as a value function into the redis node, and setting the expiration time of the required webpage address, wherein the expiration time is 24h, and the final short address label is the number i of the redis node and the key identification of the short address.
Further, the skip module is further specifically: the client browser accesses the short address, obtains the last element by '/' segmentation, obtains the first-bit character as a redis node number i, obtains the remaining characters as a short address key identification, reads long address data on the redis node, obtains a webpage address, and can jump to the webpage address.
The invention has the beneficial effects that: the invention can convert the webpage address into the short address, can quickly generate the short address, and avoids the hash collision as much as possible on the basis of ensuring the short address.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention.
Fig. 2 is a schematic block diagram of the system of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
Referring to fig. 1, a method for converting a web page address into a short address of the present invention includes the following steps:
step S1, analyzing the webpage address to obtain a domain name, performing hash code encoding on the domain name to obtain a numerical value i, and performing modulus on the fragment number by using the numerical value i to obtain a redis node where the fragment number is located;
step S2, converting the webpage address into an abstract with the length of 32 bits by adopting a hash function, taking the first n-bit character of the abstract as a key identifier of a short address, and reading the long address data of a redis node as the key identifier;
step S3, judging whether the long address data is consistent with the webpage address, if yes, indicating that the short address key identification is not overdue, not storing, avoiding covering, and if not, indicating that collision occurs;
s4, storing the webpage address into a redis node after the last short address identification key identification is obtained;
and step S5, the client accesses the short address, analyzes to obtain the number of the redis node and the key identification of the short address, reads the specified redis node to obtain the long address data, and jumps to the original webpage address, thereby realizing the conversion of the webpage address into the short address.
The invention is further illustrated by the following specific examples:
step one, analyzing a webpage address to obtain a domain name, performing a hash code method on the domain name to obtain a value v, and performing modulus on the fragment number by using a value i to obtain a redis node where the fragment number is located.
Because the data size is considered, the data needs to be stored in different redis nodes in a fragmentation mode. The method comprises the steps of resolving a webpage address to obtain a domain name, wherein the webpage address is https:// www.long.com/user/detail/share/mygoods. html, removing a protocol header https:// or http://, then obtaining a first slash/front character string which is the webpage domain name, calling int (crc32.checksumieee ([ ] byte (s)) by a hashcode method for the domain name to obtain a value v, and performing modulo v% 10 on the number 10 of redis fragments by v to obtain i, wherein i is 1, and the webpage address under www.long.com domain name is stored on the redis node with the number of 1.
And step two, carrying out hash on the webpage address to obtain an abstract with the length of 32 bits, taking the first n-bit character of the abstract as a key of the short address, reading long address data with the short address identification as the key on the redis node, comparing whether the webpage addresses are the same or not, if the original address is equal to the obtained long address data, indicating that the short connection is not expired, and not storing.
The hash function GetMD5 is called to convert the web page address into a digest string s of length 32,
for example, s is 6ce7a2a4734d478035ee3c853b1f8e8a, the initial n is set to 5, and the first 5 bits of s are taken as the identifier key of the short address 6ce7 a. And (3) obtaining that the redis number of the webpage address is 1 from the first step, reading whether long address data exists on key 6ce7a on the redis node 1, if so, comparing whether the read data is the same as the webpage address https:// www.long.com/user/detail/share/morph/mygoods.
And step three, if the read long address is different from the webpage address, the collision is shown, namely the first 5 bits of the hash result of 2 different addresses are the same, 1 bit is added to take the first 6 bits of key, the long address is continuously read for comparison, if the collision is any, the number of bits of key is continuously increased until the redis can not read the data of the key, and the result of the key is the last short connection of the address.
If the long address data read by the step is different from the webpage address, it indicates that a collision occurs, i.e. the first 5 bits of the hash result of 2 different addresses are the same. And increasing n, if the initial value is 5, increasing 1 to 6, taking the first 6 bits of the digest character string s of 32 obtained in the step two as the identifier key of the short address 6ce7a2, and continuing to read the redis comparison, wherein if different long address data still exist, the n is continuously increased until the long address data cannot be read by the key or the long address data is consistent with the webpage address.
And step four, after the final short connection identification key is obtained, storing the webpage address into a specified redis node, and setting the expiration time of 1 day. And adding a key to a redis node number i to form a short label, such as 16ce7a2, and returning a short address https:// surl.
And obtaining a short address identifier key 6ce7a2 from the third step, taking 6ce7a2 as the key of the redis, taking the webpage address https:// www.long.com/user/detail/share/mygoods. html as value, storing the value into the redis node 1, and setting the required address expiration time. And the final short address label is the number i of the redis node plus the short address identification key to obtain 16ce7a2, and the address https:// surl.xxx.com/16ce7a2 of the short address service is returned.
And step five, the client accesses the short address, analyzes to obtain a redis node number and a short address identification key, reads the specified redis to obtain long address data, and jumps to the original webpage address.
The client browser accesses a short address https:// surl.xxx.com/16ce7a2, divides by '/' to obtain a last element to obtain 16ce7a2, obtains a first-bit character 1 as a redis node number i, obtains the remaining character as a short address identifier key 6ce7a2, reads long address data of the key 6ce7a2 on the redis node 1 to obtain a webpage address https:// www.long.com/user/detail/share/mygoods.html, and jumps to the webpage address.
In a word, the invention can resolve the long address domain name, and takes the domain name as the basis of data grouping; after MD5 is carried out on the long address, the short address identification is increased in increments by 5 initial bits until the read long address data is empty or the same as the long address data; after the last short address identification is determined, the long address is stored in a redis packet node; splicing the group number of the redis node and the short address identifier to obtain a final short address; when the browser accesses the short address, the short label is analyzed to obtain a group number of a redis node where the long address data is located and a short address identifier, and url skipping is carried out after the long address data is obtained.
Referring to fig. 2, the present invention further provides a system for converting a web page address into a short address, including an analyzing module, a reading module, a determining module, a storing module and a skipping module, where the analyzing module analyzes a web page address to obtain a domain name, performs a hash code encoding on the domain name to obtain a value i, and performs a modulo operation on a fragment number by using the value i to obtain a redis node where the fragment number is located; the reading module converts the webpage address into an abstract with the length of 32 bits by adopting a hash function, takes the first n-bit character of the abstract as a key identifier of a short address, and reads the long address data of a redis node as the key identifier; the judging module judges whether the long address data is consistent with the webpage address, if so, the short address key identification is not overdue and is not stored, so that coverage is avoided, and if not, collision is indicated; the storage module is used for storing the webpage address into the redis node after the last short address identification key identification is obtained; the skip module is used for enabling a client to access the short address, analyzing the short address to obtain a redis node number and a short address identification key identification, reading the specified redis node to obtain long address data, and skipping to the original webpage address, so that the webpage address is converted into the short address.
The analysis module is further specifically: analyzing a webpage address to obtain a domain name, removing a protocol head of the webpage address, then obtaining a first slash/front character string which is the webpage domain name, calling the webpage domain name in a hash code mode to obtain a numerical value v, performing modulus operation on the fragment number of a redis node by using the numerical value v to obtain a numerical value i, and storing the webpage address under the domain name on the redis node with the numerical value i.
The reading module is further specifically: and calling a hash function MD5 to convert the webpage address into an abstract character string with the length of 32 bits, judging whether long address data exist in the redis node, if so, comparing whether the read data are consistent with the webpage address, and if not, continuing to call the hash function.
The judging module is further specifically: and judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not overdue, not storing to avoid coverage, and if not, indicating that collision occurs, and increasing the number of bits of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is the short link of the webpage address.
The storage module is further specifically: and forming a short label by adding the key identification to the number i of the redis node, storing the key identification of the redis node and the webpage address as a value function into the redis node, and setting the expiration time of the required webpage address, wherein the expiration time is 24h, and the final short address label is the number i of the redis node and the key identification of the short address.
The skip module is further specifically: the client browser accesses the short address, obtains the last element by '/' segmentation, obtains the first-bit character as a redis node number i, obtains the remaining characters as a short address key identification, reads long address data on the redis node, obtains a webpage address, and can jump to the webpage address.
The above description is only a preferred embodiment of the present invention, and all equivalent changes and modifications made in accordance with the claims of the present invention should be covered by the present invention.
Claims (12)
1. A method for converting a webpage address into a short address is characterized by comprising the following steps:
step S1, analyzing the webpage address to obtain a domain name, performing hash code encoding on the domain name to obtain a numerical value i, and performing modulus on the fragment number by using the numerical value i to obtain a redis node where the fragment number is located;
step S2, converting the web page address into an abstract with the length of 32 bits by adopting a hash function, taking the first n-bit character of the abstract as a key identification of a short address, and reading long address data of a redis node as the key identification;
step S3, judging whether the long address data is consistent with the webpage address, if yes, indicating that the short address key identification is not overdue, not storing, avoiding covering, and if not, indicating that collision occurs;
s4, storing the webpage address into a redis node after the last short address identification key identification is obtained;
and step S5, the client accesses the short address, analyzes to obtain the number of the redis node and the short address identification key identification, reads the designated redis node to obtain the long address data, and jumps to the original webpage address, thereby realizing the conversion of the webpage address into the short address.
2. The method for converting a web page address into a short address according to claim 1, wherein: the step S1 further includes: analyzing a webpage address to obtain a domain name, removing a protocol head of the webpage address, then obtaining a first slash/front character string which is the webpage domain name, calling the webpage domain name in a hash code mode to obtain a numerical value v, performing modulus operation on the fragment number of a redis node by using the numerical value v to obtain a numerical value i, and storing the webpage address under the domain name on the redis node with the numerical value i.
3. The method for converting a web page address into a short address according to claim 1, wherein: the step S2 further includes: and calling a hash function MD5 to convert the webpage address into an abstract character string with the length of 32 bits, judging whether long address data exist in the redis node, if so, comparing whether the read data are consistent with the webpage address, and if not, continuing to call the hash function.
4. The method for converting a web page address into a short address according to claim 1, wherein: the step S3 further includes: and judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not overdue, not storing to avoid coverage, and if not, indicating that collision occurs, and increasing the number of bits of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is the short link of the webpage address.
5. The method for converting a web page address into a short address according to claim 1, wherein: the step S4 further includes: and forming a short label by adding the key identification to the number i of the redis node, storing the key identification of the redis node and the webpage address as a value function into the redis node, and setting the expiration time of the required webpage address, wherein the expiration time is 24h, and the final short address label is the number i of the redis node and the key identification of the short address.
6. The method for converting a web page address into a short address according to claim 1, wherein: the step S5 further includes: the client browser accesses the short address, obtains the last element by '/' segmentation, obtains the first-bit character as a redis node number i, obtains the remaining characters as a short address key identification, reads long address data on the redis node, obtains a webpage address, and can jump to the webpage address.
7. A system for converting a webpage address into a short address is characterized in that: the domain name reading method comprises an analyzing module, a reading module, a judging module, a storage module and a skipping module, wherein the analyzing module analyzes a webpage address to obtain a domain name, performs a hash code encoding mode on the domain name to obtain a numerical value i, and performs modulus on a fragment number by using the numerical value i to obtain a located redis node; the reading module converts the webpage address into an abstract with the length of 32 bits by adopting a hash function, takes the first n-bit character of the abstract as a key identifier of a short address, and reads the long address data of a redis node as the key identifier; the judging module judges whether the long address data is consistent with the webpage address, if so, the short address key identification is not overdue and is not stored, so that coverage is avoided, and if not, collision is indicated; the storage module is used for storing the webpage address into the redis node after the last short address identification key identification is obtained; the skip module is used for enabling a client to access the short address, analyzing to obtain a redis node number and a short address identification key identification, reading the specified redis node to obtain long address data, and skipping to the original webpage address, so that the webpage address is converted into the short address.
8. The system for converting a web page address into a short address as claimed in claim 7, wherein: the analysis module further specifically comprises: analyzing a webpage address to obtain a domain name, removing a protocol head of the webpage address, then obtaining a first slash/front character string which is the webpage domain name, calling the webpage domain name in a hash code mode to obtain a numerical value v, performing modulus operation on the fragment number of a redis node by using the numerical value v to obtain a numerical value i, and storing the webpage address under the domain name on the redis node with the numerical value i.
9. The system for converting a web page address into a short address as claimed in claim 7, wherein: the reading module is further specifically: and calling a hash function MD5 to convert the webpage address into an abstract character string with the length of 32 bits, judging whether long address data exist in the redis node, if so, comparing whether the read data are consistent with the webpage address, and if not, continuing to call the hash function.
10. The system for converting a web page address into a short address as claimed in claim 7, wherein: the judging module is further specifically: and judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not overdue, not storing to avoid coverage, and if not, indicating that collision occurs, and increasing the number of bits of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is the short link of the webpage address.
11. The system for converting a web page address into a short address as claimed in claim 7, wherein: the storage module is further specifically: and forming a short label by adding the key identification to the number i of the redis node, storing the key identification of the redis node and the webpage address as a value function into the redis node, and setting the expiration time of the required webpage address, wherein the expiration time is 24h, and the final short address label is the number i of the redis node and the key identification of the short address.
12. The system for converting a web page address into a short address as claimed in claim 7, wherein: the skip module is further specifically: the client browser accesses the short address, obtains the last element by '/' segmentation, obtains the first-bit character as a redis node number i, obtains the remaining characters as a short address key identification, reads long address data on the redis node, obtains a webpage address, and can jump to the webpage address.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210167808.3A CN114553825B (en) | 2022-02-23 | 2022-02-23 | Method and system for converting webpage address into short address |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210167808.3A CN114553825B (en) | 2022-02-23 | 2022-02-23 | Method and system for converting webpage address into short address |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114553825A true CN114553825A (en) | 2022-05-27 |
| CN114553825B CN114553825B (en) | 2023-05-23 |
Family
ID=81677854
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210167808.3A Active CN114553825B (en) | 2022-02-23 | 2022-02-23 | Method and system for converting webpage address into short address |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114553825B (en) |
Cited By (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 (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090146833A1 (en) * | 2007-12-11 | 2009-06-11 | Electronics And Telecommunications Research Institute | Coordinator, gateway, and transmission method for IPv6 in wireless sensor network |
| US20100124176A1 (en) * | 2000-03-03 | 2010-05-20 | Adtran, Inc. | Automatic network topology identification by nodes in the network |
| CN101848459A (en) * | 2010-03-30 | 2010-09-29 | 北京交通大学 | Wireless transducer network address configuration method based on IEEE 802.15.4 |
| US20140297863A1 (en) * | 2013-04-02 | 2014-10-02 | Alibaba Group Holding Limited | Managing redirected website login using a short address |
| CN104657432A (en) * | 2015-01-28 | 2015-05-27 | 北京金和软件股份有限公司 | Method for reducing repetitive rate of converting long address into short addresses |
| CN110602265A (en) * | 2019-09-02 | 2019-12-20 | 积成电子股份有限公司 | 61850 model short address configuration and resource mapping method suitable for IED equipment |
| WO2021254897A1 (en) * | 2020-06-15 | 2021-12-23 | Signify Holding B.V. | An efficient method for mapping between a local short address and a long ip address |
-
2022
- 2022-02-23 CN CN202210167808.3A patent/CN114553825B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100124176A1 (en) * | 2000-03-03 | 2010-05-20 | Adtran, Inc. | Automatic network topology identification by nodes in the network |
| US20090146833A1 (en) * | 2007-12-11 | 2009-06-11 | Electronics And Telecommunications Research Institute | Coordinator, gateway, and transmission method for IPv6 in wireless sensor network |
| CN101848459A (en) * | 2010-03-30 | 2010-09-29 | 北京交通大学 | Wireless transducer network address configuration method based on IEEE 802.15.4 |
| US20140297863A1 (en) * | 2013-04-02 | 2014-10-02 | Alibaba Group Holding Limited | Managing redirected website login using a short address |
| CN104657432A (en) * | 2015-01-28 | 2015-05-27 | 北京金和软件股份有限公司 | Method for reducing repetitive rate of converting long address into short addresses |
| CN110602265A (en) * | 2019-09-02 | 2019-12-20 | 积成电子股份有限公司 | 61850 model short address configuration and resource mapping method suitable for IED equipment |
| WO2021254897A1 (en) * | 2020-06-15 | 2021-12-23 | Signify Holding B.V. | An efficient method for mapping between a local short address and a long ip address |
Non-Patent Citations (2)
| Title |
|---|
| 李达: "LoRaWAN网关与数据服务器***设计与实现", 《中国优秀硕士学位论文全文数据库》 * |
| 袁利永 等: "无线传感mesh网络的分段地址分配策略及其路由", 《计算机科学》 * |
Cited By (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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114553825B (en) | 2023-05-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8464930B2 (en) | System and method for encoding and decoding data and references to data in machine-readable graphical codes | |
| US7054855B2 (en) | Method and system for performing a pattern match search for text strings | |
| CN108090064B (en) | Data query method and device, data storage server and system | |
| WO2019095416A1 (en) | Information pushing method and apparatus, and terminal device and storage medium | |
| US6519626B1 (en) | System and method for converting a file system path into a uniform resource locator | |
| US20080098001A1 (en) | Techniques for efficient loading of binary xml data | |
| US6963868B2 (en) | Multi-bit Patricia trees | |
| CN107947918B (en) | Carrier-free text steganography method based on character features | |
| CN111414560B (en) | Shared information processing method and device, related equipment and storage medium | |
| CN112347377B (en) | IP address field searching method, service scheduling method, device and electronic equipment | |
| KR20090034321A (en) | Method and systems for efficient delivery of previously stored content | |
| CN108900554B (en) | HTTP asset detection method, system, device and computer medium | |
| US11070231B2 (en) | Reducing storage of blockchain metadata via dictionary-style compression | |
| CN103581130A (en) | Data compression processing method, system and device | |
| US20110153531A1 (en) | Information processing apparatus and control method for the same | |
| JP2014515228A (en) | Method for encoding a data identifier | |
| US9953103B2 (en) | Client processing for binary XML in a database system | |
| CN1251135C (en) | Self-descriptive data tag | |
| CN112307369A (en) | Short link processing method, device, terminal and storage medium | |
| CN103793508B (en) | A kind of loading recommendation information, the methods, devices and systems of network address detection | |
| CN114553825B (en) | Method and system for converting webpage address into short address | |
| CN101167067A (en) | DNS compatible PNRP peer name encoding | |
| CN112307138A (en) | Storage and query method, system and medium of region information | |
| CN107979595B (en) | Private data protection method and gateway system | |
| Cannane et al. | General‐purpose compression for efficient retrieval |
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 |