CN114553825B - 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
- CN114553825B CN114553825B CN202210167808.3A CN202210167808A CN114553825B CN 114553825 B CN114553825 B CN 114553825B CN 202210167808 A CN202210167808 A CN 202210167808A CN 114553825 B CN114553825 B CN 114553825B
- Authority
- CN
- China
- Prior art keywords
- address
- short
- webpage
- web page
- redis node
- 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
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
Abstract
The invention provides a method for converting a webpage address into a short address, which comprises the following steps: s1, analyzing a webpage address to obtain a domain name, performing a hash code coding mode on the domain name to obtain a numerical value i, and performing modulo operation on the fraction by using the numerical value i to obtain a redis node; s2, converting the webpage address into a summary with the length of 32 bits by adopting a hash function, and taking the first n-bit characters of the summary as key marks of the short address; step S3, judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not expired, not storing, avoiding covering, and otherwise, indicating that collision occurs; s4, after the last short address identification key identification is obtained, storing the webpage address into the redis node; s5, the client accesses the short address, analyzes and obtains the redisnode number and the short address identification key identification, and jumps to the original webpage address; the invention can convert the web page address into the short address, thereby avoiding overlong web page 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 web site services, web page addresses take a form of thousands of forms, for example, web sites with search functions carry many parameters, such as search keywords, search sources, coding types, etc., so that url addresses become very long. When you want to share url to other people, it is inconvenient, and the address may be cut off by the chat tool, sent by short message segments, lost when copying, etc. problems may occur. This problem is solved in sharing if the long address can be made to be a reduced short address. If the short address is generated rapidly, compared with the traditional method of increasing id by a database, the read-write efficiency is greatly improved by directly using the redis data cache as a unique storage medium, and the problems of short address collision, data fragmentation storage and the like are solved by adopting the redis as the short address storage medium.
Disclosure of Invention
In order to overcome the above problems, an object of the present invention is to provide a method capable of converting a web page address into a short address, thereby avoiding an excessive web page address.
The invention is realized by adopting the following scheme: a method for converting a web page address to a short address, the method comprising the steps of:
s1, analyzing a webpage address to obtain a domain name, performing a hash code coding mode on the domain name to obtain a numerical value i, and performing modulo operation on the fraction by using the numerical value i to obtain a redis node;
s2, converting the webpage address into a summary with the length of 32 bits by adopting a hash function, taking the first n-bit characters of the summary as key identifiers of short addresses, and reading long address data with redis nodes as the key identifiers;
step S3, judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not expired, not storing, avoiding covering, and otherwise, indicating that collision occurs;
s4, after the last short address identification key identification is obtained, storing the webpage address into the redis node;
and S5, accessing the short address by the client, analyzing to obtain the serial number of the redis node and the key identification of the short address identification, reading the designated redis node to obtain long address data, and jumping 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 the web page address to obtain a domain name, removing the protocol header of the web page address, then obtaining the first slash/front character string which is the web page domain name, calling the web page domain name by a hash code coding mode to obtain a value v, and taking the modulus of the fragment number of the redis node by the value v to obtain a value i, wherein the web page address under the domain name is stored on the redis node with the number of the value i.
Further, the step S2 is further specifically: the hash function MD5 is called to convert the web page address into a summary character string with the length of 32 bits, whether the redis node has long address data is judged, if yes, whether the read data is consistent with the web page address is compared,
and if not, continuing to call the hash function.
Further, the step S3 is further specifically: judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not expired, not storing, avoiding covering, otherwise, indicating that collision occurs, and increasing the bit number of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is a short link of the webpage address.
Further, the step S4 is further specifically: and forming a short label by adding a key identifier to the redis node number i, storing the webpage address as a value function into the redis node by using the key identifier of the redis node, setting the expiration time of the required webpage address, wherein the expiration time is 24h, and adding the short address key identifier to the redis node number i as the final short address label.
Further, the step S5 is further specifically: the client browser accesses the short address, and divides the short address by '/' to obtain the last element, obtains the first character as the redis node number i, obtains the rest character as the short address key identification, reads the long address data on the redis node to obtain the webpage address, and can jump to the webpage address.
The invention also provides a system for converting the web page address into the short address, which comprises an analysis module, a reading module, a judging module, a storage module and a jump module, wherein the analysis module is used for analyzing the web page address to obtain a domain name, performing a hash code coding mode on the domain name to obtain a numerical value i, and performing modulo operation on fragments by using the numerical value i to obtain a redis node; the reading module converts the webpage address into a summary with the length of 32 bits by adopting a hash function, takes the first n characters of the summary as key identification of a short address, and reads long address data with redis nodes as key identification; the judging module judges whether the long address data is consistent with the webpage address, if so, the short address key identification is not expired, the short address key identification is not stored, coverage is avoided, and if not, collision is indicated; the storage module stores the webpage address into the redis node after obtaining the last short address identification key identification; the jump module, namely the client accesses the short address, analyzes to obtain the redis node number and the short address identification key identification, reads the designated redis node to obtain long address data, jumps to the original webpage address, and therefore achieves the purpose of converting the webpage address into the short address.
Further, the parsing module is further specifically: analyzing the web page address to obtain a domain name, removing the protocol header of the web page address, then obtaining the first slash/front character string which is the web page domain name, calling the web page domain name by a hash code coding mode to obtain a value v, and taking the modulus of the fragment number of the redis node by the value v to obtain a value i, wherein the web page address under the domain name is stored on the redis node with the number of the value i.
Further, the reading module is further specifically: and calling a hash function MD5 to convert the webpage address into a summary character string with the length of 32 bits, judging whether the redis node has long address data, if so, comparing whether the read data is consistent with the webpage address, and if not, continuing to call the hash function.
Further, the judging module is further specifically: judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not expired, not storing, avoiding covering, otherwise, indicating that collision occurs, and increasing the bit number of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is a short link of the webpage address.
Further, the storage module is further specifically: and forming a short label by adding a key identifier to the redis node number i, storing the webpage address as a value function into the redis node by using the key identifier of the redis node, setting the expiration time of the required webpage address, wherein the expiration time is 24h, and adding the short address key identifier to the redis node number i as the final short address label.
Further, the jump module is further specifically: the client browser accesses the short address, and divides the short address by '/' to obtain the last element, obtains the first character as the redis node number i, obtains the rest character as the short address key identification, reads the long address data on the redis node to obtain the webpage address, and can jump to the webpage address.
The invention has the beneficial effects that: the method and the device can convert the webpage address into the short address, can quickly generate the short address, and avoid the hash collision as much as possible on the basis of ensuring the short address.
Drawings
FIG. 1 is a schematic flow chart of the method of the present invention.
Fig. 2 is a system schematic block diagram 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 to a short address according to the present invention includes the following steps:
s1, analyzing a webpage address to obtain a domain name, performing a hash code coding mode on the domain name to obtain a numerical value i, and performing modulo operation on the fraction by using the numerical value i to obtain a redis node;
s2, converting the webpage address into a summary with the length of 32 bits by adopting a hash function, taking the first n-bit characters of the summary as key identifiers of short addresses, and reading long address data with redis nodes as the key identifiers;
step S3, judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not expired, not storing, avoiding covering, and otherwise, indicating that collision occurs;
s4, after the last short address identification key identification is obtained, storing the webpage address into the redis node;
and S5, accessing the short address by the client, analyzing to obtain the serial number of the redis node and the key identification of the short address identification, reading the designated redis node to obtain long address data, and jumping 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 examples:
analyzing a webpage address to obtain a domain name, performing a hashcode method on the domain name to obtain a value v, and performing modulo operation on the fragment number by using the value i to obtain a redis node.
Because the data needs to be stored in slices in consideration of the data magnitude, it is stored in different redis nodes. The web page address is resolved to obtain a domain name, for example, the web page address is https:// www.long.com/user/detail/share/mygoods.html, the protocol header https:// or http://, then the first slash/front character string is obtained to be the web page domain name, the halcode method is carried out on the domain name to call int (crc32.checksumIEEE ([ ] bytes (s)) to obtain a value v, v is used for modulo v%10 on the fragment number 10 of rediss to obtain i, for example, i=1, and then the web page address under the www.long.com domain name is stored on the rediss node with the number of 1.
And secondly, carrying out hash on the webpage address to obtain a summary with 32-bit length, taking the first n-bit characters of the summary as keys of the short address, reading long address data with the short address mark as keys on the redis node, comparing whether the webpage address is the same, and 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 summary string s of length 32,
for example, s=6ce7a2a 4734d478035ee3c853b1f8e8a, the initial n=5 is set, and the first 5 bits of s are taken as the short address flag key=6ce7a. And (3) reading whether long address data exist in key=6ce 7a on the redis node 1 from the redis number of the webpage address obtained in the step I, if so, comparing whether the read data are the same as the webpage address https:// www.long.com/user/detail/share/mygoods.
If the read long address is different from the web page address, the collision is indicated, namely the first 5 bits of the hash result of the 2 different addresses are the same, 1 bit is added to fetch the first 6 bits key, the long address is continuously read for comparison, if any collision is continued, the number of bits of the key is increased until the redis cannot 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 in the second step are different from the webpage address, the first 5 bits of the hash result indicating that the collision occurs, namely 2 different addresses, are the same. Then increment n, initially 5, increment 1 to 6, take the first 6 bits of the 32-bit abstract character string s=6ce7a2a 4734d478035ee3c853b1f8e8a obtained in the second step as the identification key=6ce7a2 of the short address, continue to read the redis comparison, if there is still different long address data, continue to increment n until the key cannot read the long address data or the long address data and the web page address are consistent.
And step four, after the final short connection identification key is obtained, storing the webpage address into a designated redis node, and setting the expiration time of 1 day. A short tag is formed by adding a key to the redis node number i, for example, 16ce7a2, and a short address https:// surl. Xxx. Com/16ce7a2 is returned.
And thirdly, obtaining a short address identifier key=6c7a2 from the step three, taking the 6c7a2 as a key of redis, storing a webpage address https:// www.long.com/user/detail/share/mygoods.html as a value in a redis node 1, and setting required address expiration time. And the final short address label is obtained by adding a short address identification key to the redis node number i, so as to obtain 16ce7a2, and returning the address https:// surl. Xxx. Com/16ce7a2 of the short address service.
Step five, the client accesses the short address, analyzes to obtain the redis node number and the short address identification key, reads the designated redis to obtain long address data, and jumps to the original webpage address.
The client browser accesses short address https:// surl. Xxx.com/16ce7a2, divides the short address https:// surl. Xxx.com/16ce7a2 by '/' to obtain the last element, obtains 16ce7a2, obtains the first character 1 as redis node number i, obtains the rest character as short address identification key=6ce 7a2, reads long address data of key=6ce 7a2 on redis node 1, obtains web address=https:// www.long.com/user/detail/share/mygoods.
In a word, the invention can resolve the long address domain name, and takes the domain name as the basis of the data packet; after MD5 is carried out on the long address, the short address identification is increased by the initial 5 bits until the read long address data is empty or the same as the read long address data; after determining the final short address identification, storing the long address into the redis packet node; splicing the redis node group number 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 the packet number and the short address identification of the redis node where the long address data is located, and url jump is carried out after the long address data is obtained.
Referring to fig. 2, the invention further provides a system for converting a web page address into a short address, which comprises an analysis module, a reading module, a judging module, a storage module and a skip module, wherein the analysis module is used for analyzing the web page address to obtain a domain name, performing a hashcode coding mode on the domain name to obtain a value i, and performing modulo operation on the fragment number by using the value i to obtain a redis node; the reading module converts the webpage address into a summary with the length of 32 bits by adopting a hash function, takes the first n characters of the summary as key identification of a short address, and reads long address data with redis nodes as key identification; the judging module judges whether the long address data is consistent with the webpage address, if so, the short address key identification is not expired, the short address key identification is not stored, coverage is avoided, and if not, collision is indicated; the storage module stores the webpage address into the redis node after obtaining the last short address identification key identification; the jump module, namely the client accesses the short address, analyzes to obtain the redis node number and the short address identification key identification, reads the designated redis node to obtain long address data, jumps to the original webpage address, and therefore achieves the purpose of converting the webpage address into the short address.
The analysis module is further specifically: analyzing the web page address to obtain a domain name, removing the protocol header of the web page address, then obtaining the first slash/front character string which is the web page domain name, calling the web page domain name by a hash code coding mode to obtain a value v, and taking the modulus of the fragment number of the redis node by the value v to obtain a value i, wherein the web page address under the domain name is stored on the redis node with the number of the value i.
The reading module is further specifically: and calling a hash function MD5 to convert the webpage address into a summary character string with the length of 32 bits, judging whether the redis node has long address data, if so, comparing whether the read data is consistent with the webpage address, and if not, continuing to call the hash function.
The judging module is further specifically: judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not expired, not storing, avoiding covering, otherwise, indicating that collision occurs, and increasing the bit number of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is a short link of the webpage address.
The storage module is further specifically: and forming a short label by adding a key identifier to the redis node number i, storing the webpage address as a value function into the redis node by using the key identifier of the redis node, setting the expiration time of the required webpage address, wherein the expiration time is 24h, and adding the short address key identifier to the redis node number i as the final short address label.
The jump module is further specifically: the client browser accesses the short address, and divides the short address by '/' to obtain the last element, obtains the first character as the redis node number i, obtains the rest character as the short address key identification, reads the long address data on the redis node to obtain the webpage address, and can jump to the webpage address.
The foregoing description is only of the preferred embodiments of the invention, and all changes and modifications that come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein.
Claims (12)
1. A method for converting a web page address to a short address, the method comprising the steps of:
s1, analyzing a webpage address to obtain a domain name, performing a hash code coding mode on the domain name to obtain a numerical value i, and performing modulo operation on the fraction by using the numerical value i to obtain a redis node;
s2, converting the webpage address into a summary with the length of 32 bits by adopting a hash function, taking the first n-bit characters of the summary as key identifiers of short addresses, and reading long address data with redis nodes as the key identifiers;
step S3, judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not expired, not storing, avoiding covering, and otherwise, indicating that collision occurs;
s4, after the last short address identification key identification is obtained, storing the webpage address into the redis node;
and S5, accessing the short address by the client, analyzing to obtain the serial number of the redis node and the key identification of the short address identification, reading the designated redis node to obtain long address data, and jumping 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 to a short address according to claim 1, wherein: the step S1 is further specifically: analyzing the web page address to obtain a domain name, removing the protocol header of the web page address, then obtaining the first slash/front character string which is the web page domain name, calling the web page domain name by a hash code coding mode to obtain a value v, and taking the modulus of the fragment number of the redis node by the value v to obtain a value i, wherein the web page address under the domain name is stored on the redis node with the number of the value i.
3. The method for converting a web page address to a short address according to claim 1, wherein: the step S2 is further specifically: and calling a hash function MD5 to convert the webpage address into a summary character string with the length of 32 bits, judging whether the redis node has long address data, if so, comparing whether the read data is consistent with the webpage address, and if not, continuing to call the hash function.
4. The method for converting a web page address to a short address according to claim 1, wherein: the step S3 is further specifically: judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not expired, not storing, avoiding covering, otherwise, indicating that collision occurs, and increasing the bit number of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is a short link of the webpage address.
5. The method for converting a web page address to a short address according to claim 1, wherein: the step S4 is further specifically: and forming a short label by adding a key identifier to the redis node number i, storing the webpage address as a value function into the redis node by using the key identifier of the redis node, setting the expiration time of the required webpage address, wherein the expiration time is 24h, and adding the short address key identifier to the redis node number i as the final short address label.
6. The method for converting a web page address to a short address according to claim 1, wherein: the step S5 is further specifically: the client browser accesses the short address, and divides the short address by '/' to obtain the last element, obtains the first character as the redis node number i, obtains the rest character as the short address key identification, reads the long address data on the redis node to obtain the webpage address, and can jump to the webpage address.
7. A system for converting a web page address to a short address, characterized by: the method comprises an analysis module, a reading module, a judging module, a storage module and a jump module, wherein the analysis module analyzes a webpage address to obtain a domain name, carries out a hashcode coding mode on the domain name to obtain a numerical value i, and carries out modulo operation on the fragment number by the numerical value i to obtain a redis node; the reading module converts the webpage address into a summary with the length of 32 bits by adopting a hash function, takes the first n characters of the summary as key identification of a short address, and reads long address data with redis nodes as key identification; the judging module judges whether the long address data is consistent with the webpage address, if so, the short address key identification is not expired, the short address key identification is not stored, coverage is avoided, and if not, collision is indicated; the storage module stores the webpage address into the redis node after obtaining the last short address identification key identification; the jump module, namely the client accesses the short address, analyzes to obtain the redis node number and the short address identification key identification, reads the designated redis node to obtain long address data, jumps to the original webpage address, and therefore achieves the purpose of converting the webpage address into the short address.
8. The system for converting web page addresses to shorter addresses of claim 7, wherein: the analysis module is further specifically: analyzing the web page address to obtain a domain name, removing the protocol header of the web page address, then obtaining the first slash/front character string which is the web page domain name, calling the web page domain name by a hash code coding mode to obtain a value v, and taking the modulus of the fragment number of the redis node by the value v to obtain a value i, wherein the web page address under the domain name is stored on the redis node with the number of the value i.
9. The system for converting web page addresses to shorter addresses of claim 7, wherein: the reading module is further specifically: and calling a hash function MD5 to convert the webpage address into a summary character string with the length of 32 bits, judging whether the redis node has long address data, if so, comparing whether the read data is consistent with the webpage address, and if not, continuing to call the hash function.
10. The system for converting web page addresses to shorter addresses of claim 7, wherein: the judging module is further specifically: judging whether the long address data is consistent with the webpage address, if so, indicating that the short address key identification is not expired, not storing, avoiding covering, otherwise, indicating that collision occurs, and increasing the bit number of the key identification until the redis node cannot read the data of the key identification, wherein the result of the key is a short link of the webpage address.
11. The system for converting web page addresses to shorter addresses of claim 7, wherein: the storage module is further specifically: and forming a short label by adding a key identifier to the redis node number i, storing the webpage address as a value function into the redis node by using the key identifier of the redis node, setting the expiration time of the required webpage address, wherein the expiration time is 24h, and adding the short address key identifier to the redis node number i as the final short address label.
12. The system for converting web page addresses to shorter addresses of claim 7, wherein: the jump module is further specifically: the client browser accesses the short address, and divides the short address by '/' to obtain the last element, obtains the first character as the redis node number i, obtains the rest character as the short address key identification, reads the long address data on the redis node to obtain the 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 CN114553825A (en) | 2022-05-27 |
| CN114553825B true 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) |
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 (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101848459A (en) * | 2010-03-30 | 2010-09-29 | 北京交通大学 | Wireless transducer network address configuration method based on IEEE 802.15.4 |
| 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 |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7916723B2 (en) * | 2000-03-03 | 2011-03-29 | Adtran, Inc. | Automatic network topology identification by nodes in the network |
| KR100899809B1 (en) * | 2007-12-11 | 2009-05-27 | 한국전자통신연구원 | Coordinator, gateway and transmission method for ipv6 in wireless sensor network |
| CN104104649B (en) * | 2013-04-02 | 2017-09-19 | 阿里巴巴集团控股有限公司 | The method of page login, apparatus and system |
-
2022
- 2022-02-23 CN CN202210167808.3A patent/CN114553825B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101848459A (en) * | 2010-03-30 | 2010-09-29 | 北京交通大学 | Wireless transducer network address configuration method based on IEEE 802.15.4 |
| 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网络的分段地址分配策略及其路由;袁利永 等;《计算机科学》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114553825A (en) | 2022-05-27 |
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 | |
| US10999384B2 (en) | Method and system for identifying website visitors | |
| CN108090064B (en) | Data query method and device, data storage server and system | |
| US6519626B1 (en) | System and method for converting a file system path into a uniform resource locator | |
| US7660816B2 (en) | Use of browser cookies to store structured data | |
| US7054855B2 (en) | Method and system for performing a pattern match search for text strings | |
| US20080098001A1 (en) | Techniques for efficient loading of binary xml data | |
| US6963868B2 (en) | Multi-bit Patricia trees | |
| US20020078087A1 (en) | Content indicator for accelerated detection of a changed web page | |
| US20050027731A1 (en) | Compression dictionaries | |
| CN114553825B (en) | Method and system for converting webpage address into short address | |
| CN103793508B (en) | A kind of loading recommendation information, the methods, devices and systems of network address detection | |
| US7611057B2 (en) | Contents access method and sorting apparatus | |
| KR20050013961A (en) | Method and apparatus for late-binding/dynamic pathname resolution | |
| US7539776B1 (en) | Dynamic uniform resource locator compression | |
| CN101167067A (en) | DNS compatible PNRP peer name encoding | |
| Werner et al. | Compressing soap messages by using pushdown automata | |
| CN112307369A (en) | Short link processing method, device, terminal and storage medium | |
| WO2006115654A2 (en) | Pack uri scheme to identify and reference parts of a package | |
| CN116126997B (en) | Document deduplication storage method, system, device and storage medium | |
| CN106959975B (en) | Transcoding resource cache processing method, device and equipment | |
| US20030051056A1 (en) | Method and system for transmitting compacted text data | |
| US7246131B2 (en) | Dialog fragmentation for mobile devices | |
| US20040015780A1 (en) | Position-independent access to data elements in an electronic document | |
| US20060026510A1 (en) | Method for optimizing markup language transformations using a fragment data cache |
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 |