WO2020034186A1 - 一种生成短网址的方法和终端 - Google Patents

一种生成短网址的方法和终端 Download PDF

Info

Publication number
WO2020034186A1
WO2020034186A1 PCT/CN2018/101000 CN2018101000W WO2020034186A1 WO 2020034186 A1 WO2020034186 A1 WO 2020034186A1 CN 2018101000 W CN2018101000 W CN 2018101000W WO 2020034186 A1 WO2020034186 A1 WO 2020034186A1
Authority
WO
WIPO (PCT)
Prior art keywords
value
key
short url
url
redis
Prior art date
Application number
PCT/CN2018/101000
Other languages
English (en)
French (fr)
Inventor
彭江明
Original Assignee
福建联迪商用设备有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 福建联迪商用设备有限公司 filed Critical 福建联迪商用设备有限公司
Priority to CN201880001079.6A priority Critical patent/CN109313660A/zh
Priority to PCT/CN2018/101000 priority patent/WO2020034186A1/zh
Publication of WO2020034186A1 publication Critical patent/WO2020034186A1/zh

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/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]
    • 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/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking

Definitions

  • the present invention relates to the field of Internet technologies, and in particular, to a method and a terminal for generating a short URL.
  • the short URL refers to a technology and service on the Internet. This service can provide a very short URL instead of the possibly longer URL, shortening the length of the long URL. When users visit a shortened URL, they are usually redirected to the original URL. Most URL shortening services provide APIs. URL shortening services are widely used in Twitter and other social blogs that have word limit per message and other social networks. Short URLs are used in scenarios such as forum signatures with limited word counts, hidden individual URL advertising recommendation codes, websites being included in the SPAM list, and file download scenarios. The benefits of short URLs include the following:
  • the technical problem to be solved by the present invention is to provide a method and terminal for generating a short URL, which can be deployed on multiple operating systems and supports high concurrent processing.
  • a method for generating a short URL including the steps:
  • the ID value of redis is incremented by a preset value, and the incremented ID value is converted by a preset base algorithm to generate a corresponding short URL.
  • a terminal for generating a short website includes a memory, a processor, and a computer program stored on the memory and executable on the processor.
  • the processor executes the computer program, the following steps are implemented:
  • S2 Receive a request to generate a corresponding short URL from a long URL, increment the ID value of redis by a preset value, and convert the self-incremented ID value by a preset base algorithm to generate a corresponding short URL;
  • the short URL is used as a key value
  • the long URL corresponding to the short URL is used as a value value
  • the key value and the value value are stored in the redis as a key value pair, and the process returns to step S2.
  • the beneficial effect of the present invention is that by using the Java programming language to initialize the ID value of redis, each time a request is generated to generate a corresponding short URL from a long URL, the ID value of redis is incremented by a preset value, and a preset base algorithm is used.
  • Converting the incremented ID value to generate a corresponding short URL, using the short URL as a key value, using the long URL corresponding to the short URL as a value value, and using the key value and the value value as a key Value pairs are stored in the redis; it can implement software deployment on multiple operating systems, greatly reducing the constraints of the operating system on the software, so that the software can run in various environments; and support high concurrent requests to avoid encountering high concurrent Make the system into an abnormal state during the scene.
  • FIG. 1 is a flowchart of a method for generating a short URL according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of a terminal for generating a short URL according to an embodiment of the present invention
  • Terminal for generating short URL 2. Memory; 3. Processor.
  • the most key idea of the present invention is: use the java language to convert a long URL to generate a corresponding short URL, and store the generated short URL into redis.
  • a method for generating a short URL including steps:
  • the ID value of redis is incremented by a preset value, and the incremented ID value is converted by a preset base algorithm to generate a corresponding short URL.
  • the beneficial effect of the present invention is that by using the java programming language to initialize the ID value of redis, each time a request is received to generate a corresponding short URL from a long URL, the ID value of redis is incremented by a preset value, and the The set base algorithm converts the incremented ID value to generate a corresponding short URL, where the short URL is used as a key value, and the long URL corresponding to the short URL is used as a value value, and the key value and The value value is stored in the redis as a key-value pair; the software can be deployed on multiple operating systems, which greatly reduces the constraints imposed by the operating system on the software and enables the software to run in various environments; and supports high concurrent requests, Avoid getting the system into an abnormal state when encountering high concurrency scenarios.
  • the base of the ID value of the redis initialized using the Java programming language is decimal.
  • the base of the ID value of the initialized redis is decimal, which is used for subsequent conversion with a preset base algorithm to generate a character string of a preset base algorithm.
  • the preset base algorithm is a 62 base algorithm
  • the conversion of the self-incrementing ID value by a preset base algorithm to generate a corresponding short URL includes:
  • the incremented ID value is converted into a corresponding 62-digit value through a 62-digit algorithm, and the 62-digit value is converted into a character string according to a preset 62-digit ascii code table, and the character The string serves as a short URL corresponding to the long URL.
  • the preset base algorithm is a 62 base algorithm
  • the ID value of the self-incremented redis is converted by the 62 base algorithm to generate a corresponding short URL for pairing storage with the long URL.
  • the 62-digit ascii code includes 26 lowercase letters, 26 uppercase letters, and 10 digits.
  • the 62 characters are shuffled to form a character array of length 62, and the character array is As a preset 62-digit ascii code table, 1 to 62 characters in the array respectively correspond to 0-61 in the 62-digit base.
  • the 62-length character array generated by the 62-digit ascii code is used as the 62-digit ascii code table through the shuffle algorithm, and the 62-digit ascii code table realizes the corresponding relationship with the decimal system. .
  • step S2 the method further includes:
  • a servlet is defined, and the servlet is used to receive and process the short URL request.
  • step S3 includes:
  • Parse the received short URL request obtain the key value in the short URL, and determine whether there is a value corresponding to the key value in the redis according to the key value, and if so, use the value value as The long URL corresponding to the short URL is returned; otherwise, abnormal information is returned.
  • the short URL request received through the parsing is used to make a judgment, and a corresponding return is performed according to the judgment, so as to implement different judgment feedback on various short URL requests.
  • step S2 a validity period is set for each key-value pair stored in redis.
  • step S2 a level is set for each key-value pair stored in redis, and different validity periods are set for key-value pairs of different levels.
  • the key-value pairs stored in redis are set at different levels and have different validity periods for different levels of key-value pairs, so that the life cycle of the short URL corresponding to the generated long URL can be selected and processed, which is flexible. It has high performance and improves the controllability and utilization of the storage time after the short URL is generated.
  • the key-value pairs stored in the redis are traversed every preset time, and whether the key-value pair is invalid according to the validity period of the key-value pair, and if so, the key-value pair is removed from the redis. Delete.
  • the stored key-value pairs are traversed through a preset time and judged whether they are invalid according to their validity period, and the invalid key-value pairs are deleted.
  • the invalid key-value pairs can be deleted in time, which can ensure the data stored in the database Effectiveness to avoid the accumulation of data.
  • a terminal for generating a short URL includes a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein when the processor executes the computer program, the following is implemented: step:
  • the ID value of redis is incremented by a preset value, and the incremented ID value is converted by a preset base algorithm to generate a corresponding short URL.
  • the beneficial effect of the present invention is that by using the java programming language to initialize the ID value of redis, each time a request is received to generate a corresponding short URL from a long URL, the ID value of redis is incremented by a preset value, and the The set base algorithm converts the incremented ID value to generate a corresponding short URL, where the short URL is used as a key value, and the long URL corresponding to the short URL is used as a value value, and the key value and The value value is stored in the redis as a key-value pair; the software can be deployed on multiple operating systems, which greatly reduces the constraints imposed by the operating system on the software and enables the software to run in various environments; and supports high concurrent requests, Avoid getting the system into an abnormal state when encountering high concurrency scenarios.
  • the base of the ID value of the redis initialized using the Java programming language is decimal.
  • the base of the ID value of the initialized redis is decimal, which is used for subsequent conversion with a preset base algorithm to generate a character string of a preset base algorithm.
  • the preset base algorithm is a 62 base algorithm
  • the conversion of the self-incrementing ID value by a preset base algorithm to generate a corresponding short URL includes:
  • the incremented ID value is converted into a corresponding 62-digit value through a 62-digit algorithm, and the 62-digit value is converted into a character string according to a preset 62-digit ascii code table, and the character The string serves as a short URL corresponding to the long URL.
  • the preset base algorithm is a 62 base algorithm
  • the ID value of the self-incremented redis is converted by the 62 base algorithm to generate a corresponding short URL for pairing storage with the long URL.
  • the 62-digit ascii code includes 26 lowercase letters, 26 uppercase letters, and 10 digits.
  • the 62 characters are shuffled to form a character array of length 62, and the character array is As a preset 62-digit ascii code table, 1 to 62 characters in the array respectively correspond to 0-61 in the 62-digit base.
  • the 62-length character array generated by the 62-digit ascii code is used as the 62-digit ascii code table through the shuffle algorithm, and the 62-digit ascii code table realizes the corresponding relationship with the decimal system. .
  • step S2 the method further includes:
  • a servlet is defined, and the servlet is used to receive and process the short URL request.
  • step S3 includes:
  • Parse the received short URL request obtain the key value in the short URL, and determine whether there is a value corresponding to the key value in the redis according to the key value, and if so, use the value value as The long URL corresponding to the short URL is returned; otherwise, abnormal information is returned.
  • the short URL request received through the parsing is used to make a judgment, and a corresponding return is performed according to the judgment, so as to implement different judgment feedback on various short URL requests.
  • step S2 a validity period is set for each key-value pair stored in redis.
  • step S2 a level is set for each key-value pair stored in redis, and different validity periods are set for key-value pairs of different levels.
  • the key-value pairs stored in redis are set at different levels and have different validity periods for different levels of key-value pairs, so that the life cycle of the short URL corresponding to the generated long URL can be selected and processed, which is flexible. It has high performance and improves the controllability and utilization of the storage time after the short URL is generated.
  • the key-value pairs stored in the redis are traversed every preset time, and whether the key-value pair is invalid according to the validity period of the key-value pair, and if so, the key-value pair is removed from the redis. Delete.
  • the stored key-value pairs are traversed through a preset time and judged whether they are invalid according to their validity period, and the invalid key-value pairs are deleted.
  • the invalid key-value pairs can be deleted in time, and the data stored in the database can be guaranteed. Effectiveness to avoid the accumulation of data.
  • a method for generating a short URL including steps:
  • the preset value may be set to 1, and the self-incrementing ID value is converted by a preset base algorithm to generate a corresponding short URL.
  • the preset base algorithm is 62 base. algorithm;
  • the incremented ID value is converted into a corresponding 62-digit value through a 62-digit algorithm.
  • the 62-digit ascii code includes 26 lowercase letters, 26 uppercase letters, and 10 numbers.
  • the 62 characters are formed by a shuffle algorithm into a character array having a length of 62, and the character array is used as a preset 62 ascii code table.
  • the 1 to 62 characters in the array respectively correspond to the 62 base. 0-61, according to the 62-digit ascii code table, convert the 62-digit value into a character string, and use the character string as the short URL corresponding to the long URL;
  • a method for generating a short URL including steps:
  • the ID value of redis is incremented by a preset value, and the incremented ID value is converted by a preset base algorithm to generate a corresponding short URL.
  • a valid period is set for each key-value pair stored in redis.
  • a level is set for each key-value pair stored in redis, and different valid periods are set for key values corresponding to different levels of key-value pairs;
  • the key-value pairs stored in the redis are traversed every preset time, and whether the key-value pairs are invalid according to the validity period of the key-value pairs, and if so, the key-value pairs are deleted from the redis.
  • a method for generating a short URL including steps:
  • the ID value of redis is incremented by a preset value, and the incremented ID value is converted by a preset base algorithm to generate a corresponding short URL.
  • the address of the short URL is: http://xx.cn/hrYnr0. It consists of the domain name and the key of the short address. From the servlet, you can obtain the key.
  • key is hrYnr0; parse the received short URL request, obtain the key value in the short URL, and determine whether there is a value corresponding to the key value in the redis according to the key value, and if it is, the The value is returned to the client as a long URL redirection corresponding to the short URL, otherwise, exception information is returned.
  • a method for generating a short URL including steps:
  • the preset value may be set to 1, and the self-incrementing ID value is converted by a preset base algorithm to generate a corresponding short URL.
  • the preset base algorithm is 62 base. algorithm;
  • the incremented ID value is converted into a corresponding 62-digit value through a 62-digit algorithm.
  • the 62-digit ascii code includes 26 lowercase letters, 26 uppercase letters, and 10 numbers.
  • the last character of the 62-character array (the character corresponding to the subscript i) is used as the start of the reverse order loop, and the character corresponding to the subscript i is randomly rounded to obtain the result value subscript j (the dividend is corresponding to the subscript i) ,
  • the divisor is the index i + 1), replace the character corresponding to the array index i with the character corresponding to the index j, and continue to cycle the next character (that is, the character corresponding to the index i-1) until the loop reaches Until the end of the first character replacement, an out-of-order character array with a length of 62 is finally formed.
  • the character array is used as a preset 62-digit ascii code table, and 1 to 62 characters in the array correspond to 62 characters. 0-61 in the system, according to the 62-digit ascii code table, converting the 62-digit value into a character string, and using the character string as the short URL corresponding to the long URL;
  • a valid period is set for each key-value pair stored in redis.
  • a level is set for each key-value pair stored in redis, and different valid periods are set for key values corresponding to different levels of key-value pairs;
  • the level setting standard can be specified by specific services, for example, the validity period of the corresponding key value can be increased according to the frequency of access.
  • the default validity period of the initial set key value is unified to 30 days, and weighted processing is performed for each visit. , That is, the shorter the frequency of access, the longer the retention period;
  • the validity period of the key value is guaranteed by the redis expiration policy, and no special deletion process is required for the program;
  • the address of the short URL is: http://xx.cn/hrYnr0. It consists of the domain name and the key of the short address. From the servlet, you can obtain the key.
  • the above key is hrYnr0; parse the received short URL request, obtain the key value in the short URL, and determine whether there is a value corresponding to the key value in the redis according to the key value, and if it is, the The value is returned to the client as a long URL redirection corresponding to the short URL, otherwise, exception information is returned.
  • a terminal 1 for generating a short URL includes a memory 2, a processor 3, and a computer program stored on the memory 2 and executable on the processor 3.
  • the processor 3 executes all Each step in the first embodiment is implemented when the computer program is described.
  • a terminal 1 for generating a short URL includes a memory 2, a processor 3, and a computer program stored on the memory 2 and executable on the processor 3.
  • the processor 3 executes all
  • Each step in the second embodiment is implemented when the computer program is described.
  • a terminal 1 for generating a short URL includes a memory 2, a processor 3, and a computer program stored on the memory 2 and executable on the processor 3.
  • the processor 3 executes all
  • Each step in the third embodiment is implemented when the computer program is described.
  • a terminal 1 for generating a short URL includes a memory 2, a processor 3, and a computer program stored on the memory 2 and executable on the processor 3.
  • the processor 3 executes all
  • Each step in the fourth embodiment is realized when the computer program is described.
  • the method and terminal for generating short URLs initialize the redis ID value by using the java programming language.
  • the redis ID value is automatically increased A preset value, and transforming the self-incrementing ID value by a preset base algorithm to generate a corresponding short URL, using the short URL as a key value, and using the long URL corresponding to the short URL as a value value Storing the key value and the value value into the redis as a key-value pair; enabling the software to be deployed on multiple operating systems, greatly reducing the constraints imposed by the operating system on the software, and enabling the software to run in various environments ; And support high concurrent requests, to avoid the system into an abnormal state when encountering high concurrency scenarios; redis uses a memory mechanism, the query efficiency is faster and more efficient than a relational database; all key-value pairs stored in redis Set the level and set different validity periods for different levels of key-value pairs, which can
  • the product reduces query efficiency, realizes the selection and processing of the life cycle of the generated short URL corresponding to the long URL, has high flexibility, and improves the controllability and utilization of the storage time after the short URL is generated; traversing the storage through a preset time
  • the key-value pair is determined to be invalid according to its validity period, and the invalid key-value pair is deleted.
  • the invalid key-value pair can be deleted in time, which can ensure the validity of the data stored in the database and avoid the accumulation of data.

Landscapes

  • Engineering & Computer Science (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)
  • Information Transfer Between Computers (AREA)
  • Computer And Data Communications (AREA)

Abstract

一种生成短网址的方法和终端，通过使用java编程语言初始化redis的ID值，每接收将长网址生成对应的短网址的请求，将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址，将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis；能够实现将软件部署在多个操作系统，大大降低计操作系统对软件的约束，使软件可以在各种环境下运行；并且支持高并发请求，避免遇到高并发场景时使系统陷入到异常状态。

Description

一种生成短网址的方法和终端 技术领域
本发明涉及互联网技术领域，尤其涉及一种生成短网址的方法和终端。
 背景技术
短网址指的是一种互联网上的技术与服务。此服务可以提供一个非常短小的网址以代替原来的可能较长的网址，将长的网址长度缩短。用户访问缩短后的网址时，通常将会重定向到原来的网址。大多数的网址缩短服务都提供有API，网址缩短服务在Twitter的等一些每条消息有字数限制的微博客及其他社交网络中有广泛的使用。短网址的运用场景有：论坛签名有字数限制；隐藏个人的URL广告推荐码；网站被列入SPAM名单；文件下载等场景。短网址的好处，主要有下面几个方面：
1、节省网址长度，便于社交化传播。
2、方便后台跟踪点击量、地域分布等用户统计。
3、规避关键词、域名屏蔽手段。
4、隐藏真实地址，适合做付费推广链接。
现有技术中，通常使用其他对系统兼容性较为单一的编程语言进行短网址的生成，软件部署时对单一系统的依赖性较高；通常使用传统的关系型数据库存储生成的短网址，当遇到高并发场景时，容易使系统陷入到异常状态。
 技术问题
本发明所要解决的技术问题是：提供一种生成短网址的方法和终端，可部署在多个操作系统，且支持高并发处理。
 技术解决方案
为了解决上述技术问题，本发明采用的一种技术方案为：
一种生成短网址的方法，包括步骤：
S1、使用java编程语言初始化redis的ID值；
S2、每接收一次将长网址生成对应的短网址的请求，执行：
S21、将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址；
S22、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis。
为了解决上述技术问题，本发明采用的另一种技术方案为：
一种生成短网址的终端，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现以下步骤：
S1、使用java编程语言初始化redis的ID值；
S2、接收将长网址生成对应的短网址的请求，将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址；
S3、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis，并返回步骤S2。
 有益效果
本发明的有益效果在于：通过使用java编程语言初始化redis的ID值，每接收将长网址生成对应的短网址的请求，将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址，将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis；能够实现将软件部署在多个操作系统，大大降低计操作系统对软件的约束，使软件可以在各种环境下运行；并且支持高并发请求，避免遇到高并发场景时使系统陷入到异常状态。
 附图说明
图1为本发明实施例的生成短网址的方法的流程图；
图2为本发明实施例的生成短网址的终端的结构示意图；
标号说明：
1、生成短网址的终端；2、存储器；3、处理器。
 本发明的实施方式
为详细说明本发明的技术内容、所实现目的及效果，以下结合实施方式并配合附图予以说明。
本发明最关键的构思在于: 使用java语言将长网址转换生成对应的短网址，并将生成的短网址存入redis。
请参照图1，一种生成短网址的方法，包括步骤：
S1、使用java编程语言初始化redis的ID值；
S2、每接收一次将长网址生成对应的短网址的请求，执行：
S21、将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址；
S22、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis。
从上述描述可知，本发明的有益效果在于：通过使用java编程语言初始化redis的ID值，每接收将长网址生成对应的短网址的请求，将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址，将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis；能够实现将软件部署在多个操作系统，大大降低计操作系统对软件的约束，使软件可以在各种环境下运行；并且支持高并发请求，避免遇到高并发场景时使系统陷入到异常状态。
进一步的，所述S1中，使用java编程语言初始化redis的ID值的进制是10进制。
由上述描述可知，所述初始化redis的ID值的进制是10进制，用于后续与预设进制算法进行转换生成预设进制算法的字符串。
进一步的，所述S2中，所述预设的进制算法为62进制算法；
所述通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址包括：
通过62进制算法对所述自增后的ID值转化成对应的62进制数值，根据预设的62进制的ascii码表将所述62进制数值转化成字符串，将所述字符串作为与所述长网址对应的短网址。
由上述描述可知，所述预设的进制算法为62进制算法，通过62进制算法将自增的redis的ID值转换生成对应的短网址，用于和所述长网址配对存储。
进一步的，所述62进制的ascii码包括26个小写字母、26个大写字母和10个数字，对所述62个字符通过洗牌算法形成一个长度为62的字符数组，将所述字符数组作为预设的62进制的ascii码表，所述数组中1到62个字符分别对应62进制中的0-61。
由上述描述可知，通过洗牌算法将62进制的ascii码生成的62长度的字符数组作为62进制的ascii码表，所述62进制的ascii码表实现了和10进制的对应关系。
进一步的，所述步骤S2之后还包括：
S3、接收并处理短网址请求，返回与所述短网址对应的长网址。
由上述描述可知，当接收到短网址请求时，可进行处理并返回与短网址对应的长网址，实现用户访问短网址时跳转到对应的长网址。
进一步的，定义一个servlet，利用所述servlet接收并处理所述短网址请求。
由上述描述可知，利用所述servlet便于用户访问短网址时进行处理跳转到对应的长网址。
进一步的，所述步骤S3包括：
解析接收的短网址请求，获取所述短网址中的key值，根据所述key值，判断所述redis中是否有与所述key值对应的value值，若是，则将所述value值作为与所述短网址对应的长网址返回，否则，返回异常信息。
由上述描述可知，通过所述解析接收的短网址请求进行判断，并根据判断进行对应的返回，实现对各种短网址的请求进行不同的判断回馈。
进一步的，所述步骤S2中对存入redis中的每一键值对设置一有效期。
由上述描述可知，通过设置有效期可有效的进行数据的清理，并保持key值的重复利用，避免大批写入数据库后造成数据堆积使查询效率下降。
进一步的，所述步骤S2中对存入redis中的每一键值对设置级别，为不同级别的键值对设置不同的有效期。
由上述描述可知，所述对存入redis的所有键值对设置级别并对不同级别的键值对设置不同的有效期，实现对所生成的长网址对应的短网址的生命周期进行选择处理，灵活性高，提高了短网址生成后存储时间的可控制性和利用率。
进一步的，每隔预设时间遍历所述redis中存储的键值对，根据所述键值对的有效期，判断所述键值对是否失效，若是，则将所述键值对从所述redis中删除。
由上述描述可知，通过预设时间遍历存储的键值对并根据其有效期判断是否失效，并将失效的的键值对删除，能够将失效的键值对及时删除，可以保证数据库中存储的数据的有效性，避免数据的堆积。
请参照图2，一种生成短网址的终端，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其特征在于，所述处理器执行所述计算机程序时实现以下步骤：
S1、使用java编程语言初始化redis的ID值；
S2、每接收一次将长网址生成对应的短网址的请求，执行：
S21、将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址；
S22、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis。
从上述描述可知，本发明的有益效果在于：通过使用java编程语言初始化redis的ID值，每接收将长网址生成对应的短网址的请求，将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址，将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis；能够实现将软件部署在多个操作系统，大大降低计操作系统对软件的约束，使软件可以在各种环境下运行；并且支持高并发请求，避免遇到高并发场景时使系统陷入到异常状态。
进一步的，所述S1中，使用java编程语言初始化redis的ID值的进制是10进制。
由上述描述可知，所述初始化redis的ID值的进制是10进制，用于后续与预设进制算法进行转换生成预设进制算法的字符串。
进一步的，所述S2中，所述预设的进制算法为62进制算法；
所述通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址包括：
通过62进制算法对所述自增后的ID值转化成对应的62进制数值，根据预设的62进制的ascii码表将所述62进制数值转化成字符串，将所述字符串作为与所述长网址对应的短网址。
由上述描述可知，所述预设的进制算法为62进制算法，通过62进制算法将自增的redis的ID值转换生成对应的短网址，用于和所述长网址配对存储。
进一步的，所述62进制的ascii码包括26个小写字母、26个大写字母和10个数字，对所述62个字符通过洗牌算法形成一个长度为62的字符数组，将所述字符数组作为预设的62进制的ascii码表，所述数组中1到62个字符分别对应62进制中的0-61。
由上述描述可知，通过洗牌算法将62进制的ascii码生成的62长度的字符数组作为62进制的ascii码表，所述62进制的ascii码表实现了和10进制的对应关系。
进一步的，所述步骤S2之后还包括：
S3、接收并处理短网址请求，返回与所述短网址对应的长网址。
由上述描述可知，当接收到短网址请求时，可进行处理并返回与短网址对应的长网址，实现用户访问短网址时跳转到对应的长网址。
进一步的，定义一个servlet，利用所述servlet接收并处理所述短网址请求。
由上述描述可知，利用所述servlet便于用户访问短网址时进行处理跳转到对应的长网址。
进一步的，所述步骤S3包括：
解析接收的短网址请求，获取所述短网址中的key值，根据所述key值，判断所述redis中是否有与所述key值对应的value值，若是，则将所述value值作为与所述短网址对应的长网址返回，否则，返回异常信息。
由上述描述可知，通过所述解析接收的短网址请求进行判断，并根据判断进行对应的返回，实现对各种短网址的请求进行不同的判断回馈。
进一步的，所述步骤S2中对存入redis中的每一键值对设置一有效期。
由上述描述可知，通过设置有效期可有效的进行数据的清理，并保持key值的重复利用，避免大批写入数据库后造成数据堆积使查询效率下降。
进一步的，所述步骤S2中对存入redis中的每一键值对设置级别，为不同级别的键值对设置不同的有效期。
由上述描述可知，所述对存入redis的所有键值对设置级别并对不同级别的键值对设置不同的有效期，实现对所生成的长网址对应的短网址的生命周期进行选择处理，灵活性高，提高了短网址生成后存储时间的可控制性和利用率。
进一步的，每隔预设时间遍历所述redis中存储的键值对，根据所述键值对的有效期，判断所述键值对是否失效，若是，则将所述键值对从所述redis中删除。
由上述描述可知，通过预设时间遍历存储的键值对并根据其有效期判断是否失效，并将失效的的键值对删除，能够将失效的键值对及时删除，可以保证数据库中存储的数据的有效性，避免数据的堆积。
实施例一
请参照图1，一种生成短网址的方法，包括步骤：
S1、使用java编程语言初始化redis的ID值，所述ID值的进制为10进制；
S2、每接收一次将长网址生成对应的短网址的请求，执行：
S21、将redis的ID值自增预设值；
具体的，所述预设值可设置为1，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址，所述预设的进制算法为62进制算法；
具体的，通过62进制算法对所述自增后的ID值转化成对应的62进制数值，所述62进制的ascii码包括26个小写字母、26个大写字母和10个数字，对所述62个字符通过洗牌算法形成一个长度为62的字符数组，将所述字符数组作为预设的62进制的ascii码表，所述数组中1到62个字符分别对应62进制中的0-61，根据所述的62进制的ascii码表将所述62进制数值转化成字符串，将所述字符串作为与所述长网址对应的短网址；
S22、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis。
实施例二
请参照图1，一种生成短网址的方法，包括步骤：
S1、使用java编程语言初始化redis的ID值；
S2、每接收一次将长网址生成对应的短网址的请求，执行：
S21、将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址；
S22、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis；
其中，对存入redis中的每一键值对设置一有效期，优选的，对存入redis中的每一键值对设置级别，为不同级别的键值对对应的key值设置不同的有效期；
每隔预设时间遍历所述redis中存储的键值对，根据所述键值对的有效期，判断所述键值对是否失效，若是，则将所述键值对从所述redis中删除。
实施例三
请参照图1，一种生成短网址的方法，包括步骤：
S1、使用java编程语言初始化redis的ID值；
S2、每接收一次将长网址生成对应的短网址的请求，执行：
S21、将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址；
S22、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis；
S3、定义一个servlet，接收并处理短网址请求，例如短网址的地址为：http://xx.cn/hrYnr0，由域名和短地址的key组成，从servlet中，可以获取到key，上面的key就是hrYnr0；解析接收的短网址请求，获取所述短网址中的key值，根据所述key值，判断所述redis中是否有与所述key值对应的value值，若是，则将所述value值作为与所述短网址对应的长网址重定向返回给客户端，否则，返回异常信息。
实施例四
请参照图1，一种生成短网址的方法，包括步骤：
S1、使用java编程语言初始化redis的ID值，所述ID值的进制为10进制；
S2、每接收一次将长网址生成对应的短网址的请求，执行：
S21、将redis的ID值自增预设值；
具体的，所述预设值可设置为1，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址，所述预设的进制算法为62进制算法；
具体的，通过62进制算法对所述自增后的ID值转化成对应的62进制数值，所述62进制的ascii码包括26个小写字母、26个大写字母和10个数字，将所述62个字符数组的最后一个字符（下标为i对应的字符）作为逆序循环的开始，对下标为i对应的字符进行随机取余得到结果值下标j（被除数为下标i对应的字符，除数为下标i+1），将下标j对应的字符替代所述数组下标i对应的字符，继续循环下一个字符（即下标i-1对应的字符），直到循环至第一个字符替换结束为止，最终形成一个长度为62的乱序字符数组，将所述字符数组作为预设的62进制的ascii码表，所述数组中1到62个字符分别对应62进制中的0-61，根据所述的62进制的ascii码表将所述62进制数值转化成字符串，将所述字符串作为与所述长网址对应的短网址；
通过上述的乱序算法，网络入侵者无法猜测字符数组的生成规则而进行入侵，提高了安全性；
S22、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis；
其中，对存入redis中的每一键值对设置一有效期，优选的，对存入redis中的每一键值对设置级别，为不同级别的键值对对应的key值设置不同的有效期；
进一步的，级别的设置标准可由具体的业务来规定，例如：可根据访问的频率增加其对应的键值的有效期，初始设置键值的默认有效期统一为30天，当每访问一次就进行加权处理，即访问频率越高的短网址，其保留的期限越久；
每隔预设时间遍历所述redis中存储的键值对，根据所述键值对的有效期，判断所述键值对是否失效，若是，则将所述键值对从所述redis中删除；
进一步的，所述键值的有效期由redis的过期策略保障，无需程序特殊进行删除处理；
S3、定义一个servlet，接收并处理短网址请求，例如短网址的地址为：http://xx.cn/hrYnr0，由域名和短地址的key组成，从servlet中，可以获取到key，上面的key就是hrYnr0；解析接收的短网址请求，获取所述短网址中的key值，根据所述key值，判断所述redis中是否有与所述key值对应的value值，若是，则将所述value值作为与所述短网址对应的长网址重定向返回给客户端，否则，返回异常信息。
实施例五
请参照图2，一种生成短网址的终端1，包括存储器2、处理器3以及存储在所述存储器2上并可在所述处理器3上运行的计算机程序，所述处理器3执行所述计算机程序时实现实施例一中的各个步骤。
实施例六
请参照图2，一种生成短网址的终端1，包括存储器2、处理器3以及存储在所述存储器2上并可在所述处理器3上运行的计算机程序，所述处理器3执行所述计算机程序时实现实施例二中的各个步骤。
实施例七
请参照图2，一种生成短网址的终端1，包括存储器2、处理器3以及存储在所述存储器2上并可在所述处理器3上运行的计算机程序，所述处理器3执行所述计算机程序时实现实施例三中的各个步骤。
实施例八
请参照图2，一种生成短网址的终端1，包括存储器2、处理器3以及存储在所述存储器2上并可在所述处理器3上运行的计算机程序，所述处理器3执行所述计算机程序时实现实施例四中的各个步骤。
综上所述，本发明提供的一种生成短网址的方法和终端，通过使用java编程语言初始化redis的ID值，每接收将长网址生成对应的短网址的请求，将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址，将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis；能够实现将软件部署在多个操作系统，大大降低计操作系统对软件的约束，使软件可以在各种环境下运行；并且支持高并发请求，避免遇到高并发场景时使系统陷入到异常状态；redis采用的是内存机制，查询效率比关系型数据库更快，效率更高；对存入redis的所有键值对设置级别并对不同级别的键值对设置不同的有效期，可有效的进行数据的清理，并保持key值的重复利用，避免大批写入数据库后造成数据堆积使查询效率下降，实现对所生成的长网址对应的短网址的生命周期进行选择处理，灵活性高，提高了短网址生成后存储时间的可控制性和利用率；通过预设时间遍历存储的键值对并根据其有效期判断是否失效，并将失效的的键值对删除，能够将失效的键值对及时删除，可以保证数据库中存储的数据的有效性，避免数据的堆积。
以上所述仅为本发明的实施例，并非因此限制本发明的专利范围，凡是利用本发明说明书及附图内容所作的等同变换，或直接或间接运用在相关的技术领域，均同理包括在本发明的专利保护范围内。

Claims (20)

  1. 一种生成短网址的方法，其特征在于，包括步骤：
    S1、使用java编程语言初始化redis的ID值；
    S2、每接收一次将长网址生成对应的短网址的请求，执行：
    S21、将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址；
    S22、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis。
  2. 根据权利要求1所述的生成短网址的方法，其特征在于，所述S1中，使用java编程语言初始化redis的ID值的进制是10进制。
  3. 根据权利要求2所述的生成短网址的方法，其特征在于，所述S2中，所述预设的进制算法为62进制算法；
    所述通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址包括：
    通过62进制算法对所述自增后的ID值转化成对应的62进制数值，根据预设的62进制的ascii码表将所述62进制数值转化成字符串，将所述字符串作为与所述长网址对应的短网址。
  4. 根据权利要求3所述的生成短网址的方法，其特征在于，所述62进制的ascii码包括26个小写字母、26个大写字母和10个数字，对所述62个字符通过洗牌算法形成一个长度为62的字符数组，将所述字符数组作为预设的62进制的ascii码表，所述数组中1到62个字符分别对应62进制中的0-61。
  5. 根据权利要求1所述的生成短网址的方法，其特征在于，所述步骤S2之后还包括：
    S3、接收并处理短网址请求，返回与所述短网址对应的长网址。
  6. 根据权利要求5所述的生成短网址的方法，其特征在于，定义一个servlet，利用所述servlet接收并处理所述短网址请求。
  7. 根据权利要求5或6所述的生成短网址的方法，其特征在于，所述步骤S3包括：
    解析接收的短网址请求，获取所述短网址中的key值，根据所述key值，判断所述redis中是否有与所述key值对应的value值，若是，则将所述value值作为与所述短网址对应的长网址返回，否则，返回异常信息。
  8. 根据权利要求1所述的生成短网址的方法，其特征在于，所述步骤S2中对存入redis中的每一键值对设置一有效期。
  9. 根据权利要求8所述的生成短网址的方法，其特征在于，所述步骤S2中对存入redis中的每一键值对设置级别，为不同级别的键值对设置不同的有效期。
  10. 根据权利要求8或权利要求9所述的生成短网址的方法，其特征在于，
    每隔预设时间遍历所述redis中存储的键值对，根据所述键值对的有效期，判断所述键值对是否失效，若是，则将所述键值对从所述redis中删除。
  11. 一种生成短网址的终端，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其特征在于，所述处理器执行所述计算机程序时实现以下步骤：
    S1、使用java编程语言初始化redis的ID值；
    S2、每接收一次将长网址生成对应的短网址的请求，执行：
    S21、将redis的ID值自增预设值，并通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址；
    S22、将所述短网址作为key值，将所述短网址对应的长网址作为value值，将所述key值和value值作为一键值对存入所述redis。
  12. 根据权利要求11所述的生成短网址的终端，其特征在于，所述S1中，使用java编程语言初始化redis的ID值的进制是10进制。
  13. 根据权利要求12所述的生成短网址的终端，其特征在于，所述S2中，所述预设的进制算法为62进制算法；
    所述通过预设的进制算法对所述自增后的ID值进行转换生成对应的短网址包括：
    通过62进制算法对所述自增后的ID值转化成对应的62进制数值，根据预设的62进制的ascii码表将所述62进制数值转化成字符串，将所述字符串作为与所述长网址对应的短网址。
  14. 根据权利要求13所述的生成短网址的终端，其特征在于，所述62进制的ascii码包括26个小写字母、26个大写字母和10个数字，对所述62个字符通过洗牌算法形成一个长度为62的字符数组，将所述字符数组作为预设的62进制的ascii码表，所述数组中1到62个字符分别对应62进制中的0-61。
  15. 根据权利要求11所述的生成短网址的终端，其特征在于，所述步骤S2之后还包括：
    S3、接收并处理短网址请求，返回与所述短网址对应的长网址。
  16. 根据权利要求15所述的生成短网址的终端，其特征在于，定义一个servlet，利用所述servlet接收并处理所述短网址请求。
  17. 根据权利要求15或16所述的生成短网址的终端，其特征在于，所述步骤S3包括：
    解析接收的短网址请求，获取所述短网址中的key值，根据所述key值，判断所述redis中是否有与所述key值对应的value值，若是，则将所述value值作为与所述短网址对应的长网址返回，否则，返回异常信息。
  18. 根据权利要求11所述的生成短网址的终端，其特征在于，所述步骤S2中对存入redis中的每一键值对设置一有效期。
  19. 根据权利要求8所述的生成短网址的终端，其特征在于，所述步骤S2中对存入redis中的每一键值对设置级别，为不同级别的键值对设置不同的有效期。
  20. 根据权利要求8或权利要求9所述的生成短网址的终端，其特征在于，
    每隔预设时间遍历所述redis中存储的键值对，根据所述键值对的有效期，判断所述键值对是否失效，若是，则将所述键值对从所述redis中删除。
PCT/CN2018/101000 2018-08-17 2018-08-17 一种生成短网址的方法和终端 WO2020034186A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201880001079.6A CN109313660A (zh) 2018-08-17 2018-08-17 一种生成短网址的方法和终端
PCT/CN2018/101000 WO2020034186A1 (zh) 2018-08-17 2018-08-17 一种生成短网址的方法和终端

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2018/101000 WO2020034186A1 (zh) 2018-08-17 2018-08-17 一种生成短网址的方法和终端

Publications (1)

Publication Number Publication Date
WO2020034186A1 true WO2020034186A1 (zh) 2020-02-20

Family

ID=65221686

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/101000 WO2020034186A1 (zh) 2018-08-17 2018-08-17 一种生成短网址的方法和终端

Country Status (2)

Country Link
CN (1) CN109313660A (zh)
WO (1) WO2020034186A1 (zh)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110113384A (zh) * 2019-04-15 2019-08-09 深圳壹账通智能科技有限公司 网络请求处理方法、装置、计算机设备和存储介质
CN110113390A (zh) * 2019-04-17 2019-08-09 深圳壹账通智能科技有限公司 网络请求处理方法、装置、计算机设备和存储介质
CN110213397A (zh) * 2019-05-29 2019-09-06 北京达佳互联信息技术有限公司 数据生成方法、装置、电子设备及存储介质
CN110968460B (zh) * 2019-11-27 2020-10-27 上海众言网络科技有限公司 系统崩溃状态下网址恢复的方法和装置
CN111274328A (zh) * 2020-01-10 2020-06-12 北京慧博科技有限公司 一种可追踪到人的点击情况的短网址服务的方法
CN113111275A (zh) * 2020-01-13 2021-07-13 北京沃东天骏信息技术有限公司 短网址生成的方法、装置、电子设备和存储介质
CN111797334B (zh) * 2020-06-19 2024-01-23 北京达佳互联信息技术有限公司 一种网址访问方法、装置、电子设备及存储介质
CN112417326A (zh) * 2020-11-20 2021-02-26 百度在线网络技术（北京）有限公司 Url的转换方法和装置、电子设备和存储介质
CN112487317A (zh) * 2020-11-23 2021-03-12 中国人寿保险股份有限公司 一种统一资源定位符转换方法、装置、设备及介质
CN113612869B (zh) * 2021-08-25 2023-12-19 福建凯米网络科技有限公司 一种短网址生成方法、终端及存储介质
CN114448930A (zh) * 2022-03-15 2022-05-06 平安科技（深圳）有限公司 短地址生成方法、装置、电子设备及计算机可读存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104601736A (zh) * 2013-10-30 2015-05-06 腾讯科技（深圳）有限公司 一种短url服务的实现方法及装置
CN106817375A (zh) * 2017-02-07 2017-06-09 上海斐讯数据通信技术有限公司 链接伪装系统及方法
CN107729409A (zh) * 2017-09-26 2018-02-23 中国银联股份有限公司 一种短链接生成方法及装置

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102810089B (zh) * 2011-05-30 2017-07-04 盛乐信息技术（上海）有限公司 基于内容的短链接系统及实现方法
CN102801769A (zh) * 2012-03-01 2012-11-28 盛乐信息技术（上海）有限公司 短链接生成方法及系统
CN105630927B (zh) * 2015-12-22 2019-06-18 北京奇虎科技有限公司 链接生成方法和装置
CN106210161A (zh) * 2016-06-24 2016-12-07 中国银联股份有限公司 一种短链接生成方法及系统
CN106202187A (zh) * 2016-06-28 2016-12-07 北京京东尚科信息技术有限公司 一种在浏览器中处理短链接的方法和装置
CN106375189A (zh) * 2016-08-31 2017-02-01 北京炎黄新星网络科技有限公司 一种长短链转换的方法和系统
CN107092503A (zh) * 2017-03-28 2017-08-25 武汉斗鱼网络科技有限公司 移动端小数据uuid永久存储的方法及系统

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104601736A (zh) * 2013-10-30 2015-05-06 腾讯科技（深圳）有限公司 一种短url服务的实现方法及装置
CN106817375A (zh) * 2017-02-07 2017-06-09 上海斐讯数据通信技术有限公司 链接伪装系统及方法
CN107729409A (zh) * 2017-09-26 2018-02-23 中国银联股份有限公司 一种短链接生成方法及装置

Also Published As

Publication number Publication date
CN109313660A (zh) 2019-02-05

Similar Documents

Publication Publication Date Title
WO2020034186A1 (zh) 一种生成短网址的方法和终端
Kogan et al. Private blocklist lookups with checklist
US8464930B2 (en) System and method for encoding and decoding data and references to data in machine-readable graphical codes
Lorch et al. Shroud: Ensuring Private Access to {Large-Scale} Data in the Data Center
CN103744802B (zh) Sql注入攻击的识别方法及装置
JP4668567B2 (ja) クライアントベースのウェブクローリングのためのシステムおよび方法
US8380680B2 (en) Piecemeal list prefetch
US10325097B2 (en) Static detection of context-sensitive cross-site scripting vulnerabilities
US20040260927A1 (en) Remote data storage validation
Awad et al. Chaotic searchable encryption for mobile cloud storage
WO2010123705A2 (en) System and method for performing longest common prefix strings searches
CN108388613B (zh) 一种缓存数据的更新方法
US8352442B2 (en) Determination of an updated data source from disparate data sources
CN111585956B (zh) 一种网址防刷验证方法与装置
CN102882987A (zh) 域名过滤名单存储、匹配方法及装置
US20020083070A1 (en) Method and system for operating a network server to discourage inappropriate use
CN103593442B (zh) 日志数据的去重方法及装置
CN114048201A (zh) 一种基于分布式流计算引擎Flink的关键字段实时去重方法
CN102882988A (zh) 一种获得资源信息的地址信息的方法、装置及设备
CN111026985A (zh) 一种短链接生成方法、装置和服务器
US20060288028A1 (en) Decompressing electronic documents
CN107736003B (zh) 用于保护域名安全的方法和设备
US20230059796A1 (en) Systems and methods for robust malware signature detection in databases
US11750392B1 (en) Authenticated index data structure with back-pointers
CN111177751B (zh) 一种pdf文件的加密方法、设备及可读介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18930503

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18930503

Country of ref document: EP

Kind code of ref document: A1