CN111090426A - Method, system and equipment for processing http request - Google Patents
Method, system and equipment for processing http request Download PDFInfo
- Publication number
- CN111090426A CN111090426A CN201911318457.6A CN201911318457A CN111090426A CN 111090426 A CN111090426 A CN 111090426A CN 201911318457 A CN201911318457 A CN 201911318457A CN 111090426 A CN111090426 A CN 111090426A
- Authority
- CN
- China
- Prior art keywords
- http request
- tree
- array
- identifier
- request
- 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.)
- Withdrawn
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
- G06F16/9566—URL specific, e.g. using aliases, detecting broken or misspelled links
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/448—Execution paradigms, e.g. implementations of programming paradigms
Abstract
The application discloses a method for processing an http request, which comprises the following steps: when an http request is received, acquiring a uniform resource identifier from the http request; resolving the uniform resource identifier into an array; determining corresponding resources in the identifier tree according to the elements in the array; and determining a request mode of the http request, and calling a corresponding processing program to process the resource according to the request mode. According to the method and the device, the uniform resource identifier is obtained from the http request, then the uniform resource identifier is analyzed into the array, the corresponding resource is determined in the identifier tree according to the elements in the array, the corresponding resource can be matched for the http request without traversing all interfaces, and the processing efficiency of the http request is greatly improved. The application also provides a system, equipment and a readable storage medium for http request processing, and the system, the equipment and the readable storage medium have the beneficial effects.
Description
Technical Field
The present application relates to the field of http request processing, and in particular, to a method, a system, a device, and a readable storage medium for http request processing.
Background
In recent years, in the field of programming, Application Programming Interface (API) of Restful style is widely popular, and is largely used in http interface development due to its standardization. Restful style APIs are often developed with resources and URIs tied together to make the association formally intuitive. To allow a resource to be identified, a unique Identifier is required, which in the Web is a Uniform Resource Identifier (URI). The URI may be considered as the address of a resource or the name of a resource. The design of URIs should follow the principle of addressability, be self-describing, and need to be formally intuitive.
In the Restful API development process, generally, after a program is started, all URIs are registered and bound as a list, for example, "/a/b/c.html" of http:// basic.com/a/b/c.html is used as a key value, and a method is bound accordingly. When the request of/a/b/c.html comes, each item in the list is searched, and the corresponding method of "/a/b/c.html" is found and executed. In this way, when the number of interfaces is large, all lists need to be searched in a traversal manner, so that the http request is processed inefficiently.
Therefore, how to improve the processing efficiency of the http request is a technical problem that needs to be solved by those skilled in the art at present.
Disclosure of Invention
The application aims to provide a method, a system, equipment and a readable storage medium for processing an http request, which are used for improving the processing efficiency of the http request.
In order to solve the above technical problem, the present application provides a method for processing an http request, including:
when an http request is received, acquiring a uniform resource identifier from the http request;
resolving the uniform resource identifier into an array;
determining corresponding resources in the identifier tree according to the elements in the array; the identifier tree is tree structure data established according to all the uniform resource identifiers;
and determining a request mode of the http request, and calling a corresponding processing program to process the resource according to the request mode.
Optionally, the determining, in the identifier tree, a corresponding resource according to an element in the array includes:
determining a child node in the identifier tree which is equal to a first element in the array as a temporary node, and temporarily storing the temporary node and all child nodes of the temporary node as a temporary tree;
judging whether a next element adjacent to the element corresponding to the temporary node exists in the array;
if so, updating the temporary node into a child node of which the median of the temporary tree is equal to the next element in the array, updating the temporary tree into the updated temporary node and all child nodes of the updated temporary node, and returning to the step of judging whether the next element adjacent to the element corresponding to the temporary node exists in the array;
if not, searching the temporary tree for the resources corresponding to the elements in the array.
Optionally, when the resource corresponding to the element in the array is not found in the temporary tree, the method further includes:
and returning prompt information that the resource is not found.
Optionally, before determining the corresponding resource according to the element in the array in the identifier tree, the method further includes:
receiving an identifier tree establishment request;
acquiring all the uniform resource identifiers and resources corresponding to all the uniform resource identifiers;
and establishing the identifier tree according to all the uniform resource identifiers and the resources corresponding to each uniform resource identifier.
Optionally, the http request may include at least one of a creation request, a deletion request, an update request, and a query request.
Optionally, the processing program includes at least one of a view processing program, a create processing program, an edit processing program, and a delete processing program.
Optionally, after invoking the corresponding handler according to the request manner to process the resource, the method further includes:
and returning an execution result.
The present application further provides a system for http request processing, the system comprising:
the first obtaining module is used for obtaining a uniform resource identifier from the http request when the http request is received;
the analysis module is used for analyzing the uniform resource identifiers into arrays;
a first determining module, configured to determine, in an identifier tree, a corresponding resource according to an element in the array; the identifier tree is tree structure data established according to all the uniform resource identifiers;
and the second determining module is used for determining the request mode of the http request and calling a corresponding processing program to process the resource according to the request mode.
The present application also provides an http request processing device, including:
a memory for storing a computer program;
a processor for implementing the steps of the method of http request processing as described in any one of the above when executing the computer program.
The present application further provides a readable storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps of the method of http request processing according to any one of the preceding claims.
The http request processing method provided by the application comprises the following steps: when an http request is received, acquiring a uniform resource identifier from the http request; resolving the uniform resource identifier into an array; determining corresponding resources in the identifier tree according to the elements in the array; the identifier tree is tree structure data established according to all uniform resource identifiers; and determining a request mode of the http request, and calling a corresponding processing program to process the resource according to the request mode.
According to the technical scheme, the uniform resource identifiers are obtained from the http request, then the uniform resource identifiers are analyzed into the arrays, the corresponding resources are determined in the identifier tree according to the elements in the arrays, the corresponding resources can be matched for the http request without traversing all interfaces, and the processing efficiency of the http request is greatly improved. The application also provides a system, a device and a readable storage medium for http request processing, which have the beneficial effects described above and are not described herein again.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a method for http request processing according to an embodiment of the present application;
fig. 2 is a flowchart of another http request processing method according to an embodiment of the present application;
FIG. 3 is a flow chart of an actual representation of S103 of a method of http request processing provided in FIG. 1;
fig. 4 is a block diagram of a system for http request processing according to an embodiment of the present application;
fig. 5 is a block diagram of another http request processing system according to an embodiment of the present application;
fig. 6 is a block diagram of an http request processing apparatus according to an embodiment of the present application.
Detailed Description
The core of the application is to provide a method, a system, equipment and a readable storage medium for processing an http request, which are used for improving the processing efficiency of the http request.
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart of a method for processing an http request according to an embodiment of the present application.
The method specifically comprises the following steps:
s101: when an http request is received, acquiring a uniform resource identifier from the http request;
based on the fact that in the development process of the Restful API, in general, after a program is started, all URIs are registered and bound into a list, in this way, when the number of interfaces is large, all lists need to be searched in a traversing manner, and the http request is low in processing efficiency; therefore, the present application provides a method for http request processing, which is used to solve the above problems;
the uniform resource identifiers and the resources have a one-to-one mapping relationship, and the mapping relationship is stored in a list mode in the prior art, so that the searching efficiency is low; the mapping relation between the uniform resource identifier and the resource is creatively stored through the tree structure, so that the searching speed is greatly increased, and the processing efficiency of the http request is further improved;
optionally, the uniform resource identifier may be extracted from the http request by a preset system function, for example, "/a/b/c.html" may be extracted from "http:// basic.
S102: resolving the uniform resource identifier into an array;
optionally, after obtaining the uniform resource identifier, the uniform resource identifier may be parsed into an array by a script or the like, for example, "/a/b/c.html" may be parsed into an array of three elements [ a, b, c.html ].
S103: determining corresponding resources in the identifier tree according to the elements in the array;
the identifier tree mentioned here is tree structure data established according to all uniform resource identifiers;
optionally, before step S103 is executed, the steps shown in fig. 2 may also be executed to complete the establishment of the identifier tree, please refer to fig. 2, and fig. 2 is a flowchart of another http request processing method provided in this embodiment of the present application.
The method specifically comprises the following steps:
s201: receiving an identifier tree establishment request;
s202: acquiring all uniform resource identifiers and resources corresponding to all the uniform resource identifiers;
s203: and establishing an identifier tree according to all the uniform resource identifiers and the resource corresponding to each uniform resource identifier.
Based on the above embodiment, the establishment of the identifier tree is completed by acquiring all uniform resource identifiers and resources corresponding to each uniform resource identifier, and according to all uniform resource identifiers and resources corresponding to each uniform resource identifier, so that the efficiency of http request processing can be greatly improved.
Preferably, the determining of the corresponding resource according to the element in the array in the identifier tree mentioned herein may specifically include the steps shown in fig. 3, please refer to fig. 3 below, and fig. 3 is a flowchart of an actual representation manner of S103 in the http request processing method provided in fig. 1, and specifically may include the following steps:
s301: determining child nodes in the identifier tree which are equal to the first element in the array as temporary nodes, and temporarily storing the temporary nodes and all the child nodes of the temporary nodes as temporary trees;
s302: judging whether a next element adjacent to the element corresponding to the temporary node exists in the array;
if yes, go to step S303; if not, go to step S304;
s303: updating the temporary node into a child node of which the median of the temporary tree is equal to the next element in the array, updating the temporary tree into the updated temporary node and all child nodes of the updated temporary node, and returning to execute the step S302;
s304: and searching resources corresponding to the elements in the array in the temporary tree.
For example, when the array is [ a, b ], the embodiment of the present application determines a child node with a as a temporary node, and temporarily stores the temporary node and all child nodes thereof as a temporary tree; then determining that the next element b adjacent to the element a corresponding to the temporary node exists in the array, updating the temporary node to be a child node of which the median value of the temporary tree with the root node value a is equal to b at the moment, updating the temporary tree with the root node value a to be a temporary tree with the root node value b, and searching a resource corresponding to the element in the array in the temporary tree with the root node value b at the moment, wherein b is the last element in the array;
optionally, when the resource corresponding to the element in the array is not found in the temporary tree, it indicates that there may be an error in the http request, and at this time, a prompt message indicating that the resource is not found may be returned, so that the user or the worker modifies or deletes the http request.
S104: and determining a request mode of the http request, and calling a corresponding processing program to process the resource according to the request mode.
Optionally, the http request may include at least one of a creation request, a deletion request, an update request, and a query request;
alternatively, the processing program referred to herein may include at least one of a view processing program, a create processing program, an edit processing program, and a delete processing program.
Preferably, after the corresponding processing program is called to process the resource according to the request mode, the execution result can be returned, so that the user or the staff can perform the next operation according to the execution result.
Based on the technical scheme, the method for processing the http request obtains the uniform resource identifier from the http request, then resolves the uniform resource identifier into an array, determines the corresponding resource according to the elements in the array in the identifier tree, can match the corresponding resource for the http request without traversing all interfaces, and greatly improves the processing efficiency of the http request.
Referring to fig. 4, fig. 4 is a block diagram of a system for http request processing according to an embodiment of the present application.
The system may include:
a first obtaining module 100, configured to obtain a uniform resource identifier from an http request when the http request is received;
the parsing module 200 is configured to parse the uniform resource identifier into an array;
a first determining module 300, configured to determine, in the identifier tree, a corresponding resource according to an element in the array; the identifier tree is tree structure data established according to all uniform resource identifiers;
the second determining module 400 is configured to determine a request mode of the http request, and call a corresponding processing program to process the resource according to the request mode.
Referring to fig. 5, fig. 5 is a block diagram of another http request processing system according to an embodiment of the present application.
The first determining module 300 may include:
the determining submodule is used for determining a child node in the identifier tree, which is equal to the first element in the array, as a temporary node, and temporarily storing the temporary node and all child nodes of the temporary node as a temporary tree;
the judgment submodule is used for judging whether the next element adjacent to the element corresponding to the temporary node exists in the array;
the updating submodule is used for updating the temporary node into a child node of which the median value of the temporary tree is equal to the next element in the array when the next element adjacent to the element corresponding to the temporary node exists in the array, updating the temporary tree into the updated temporary node and all child nodes of the updated temporary node, and returning to the judging submodule to execute the step of judging whether the next element adjacent to the element corresponding to the temporary node exists in the array;
and the searching submodule is used for searching the resource corresponding to the element in the array in the temporary tree when the next element adjacent to the element corresponding to the temporary node does not exist in the array.
The first determining module 300 may further include:
and the return submodule is used for returning the prompt information that the resource is not found when the resource corresponding to the element in the array is not found in the temporary tree.
The system may further comprise:
a receiving module for receiving an identifier tree establishment request;
the second acquisition module is used for acquiring all uniform resource identifiers and resources corresponding to each uniform resource identifier;
and the establishing module is used for establishing an identifier tree according to all the uniform resource identifiers and the resources corresponding to each uniform resource identifier.
The system may further comprise:
and the return module is used for returning the execution result after calling the corresponding processing program to process the resource according to the request mode.
Since the embodiment of the system part corresponds to the embodiment of the method part, the embodiment of the system part is described with reference to the embodiment of the method part, and is not repeated here.
Referring to fig. 6, fig. 6 is a structural diagram of an http request processing device according to an embodiment of the present application.
The http request processing apparatus 600 may vary significantly due to different configurations or capabilities and may include one or more processors (CPUs) 622 (e.g., one or more processors) and memory 632, one or more storage media 630 (e.g., one or more mass storage devices) storing applications 642 or data 644. Memory 632 and storage medium 630 may be, among other things, transient or persistent storage. The program stored in the storage medium 630 may include one or more modules (not shown), each of which may include a sequence of instructions operating on the device. Further, the processor 622 may be configured to communicate with the storage medium 630 to execute a series of instruction operations in the storage medium 630 on the http request processing device 600.
The http request processing apparatus 600 may also include one or more power supplies 626, one or more wired or wireless network interfaces 650, one or more input-output interfaces 658, and/or one or more operating systems 641, such as Windows Server, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, etc.
The steps in the http request processing method described above in fig. 1 to 3 are implemented by the http request processing device based on the structure shown in fig. 6.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system, the apparatus and the module described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus, device and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of modules is merely a division of logical functions, and an actual implementation may have another division, for example, a plurality of modules or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or modules, and may be in an electrical, mechanical or other form.
Modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical modules, may be located in one place, or may be distributed on a plurality of network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present application may be integrated into one processing module, or each of the modules may exist alone physically, or two or more modules are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.
The integrated module, if implemented in the form of a software functional module and sold or used as a separate product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a function calling device, or a network device) to execute all or part of the steps of the method of the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The http request processing method, system, device and readable storage medium provided by the present application are described in detail above. The principles and embodiments of the present application are explained herein using specific examples, which are provided only to help understand the method and the core idea of the present application. It should be noted that, for those skilled in the art, it is possible to make several improvements and modifications to the present application without departing from the principle of the present application, and such improvements and modifications also fall within the scope of the claims of the present application.
It is further noted that, in the present specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Claims (10)
1. A method of http request processing, comprising:
when an http request is received, acquiring a uniform resource identifier from the http request;
resolving the uniform resource identifier into an array;
determining corresponding resources in the identifier tree according to the elements in the array; the identifier tree is tree structure data established according to all the uniform resource identifiers;
and determining a request mode of the http request, and calling a corresponding processing program to process the resource according to the request mode.
2. The method of claim 1, wherein determining the corresponding resource from the elements in the array in the identifier tree comprises:
determining a child node in the identifier tree which is equal to a first element in the array as a temporary node, and temporarily storing the temporary node and all child nodes of the temporary node as a temporary tree;
judging whether a next element adjacent to the element corresponding to the temporary node exists in the array;
if so, updating the temporary node into a child node of which the median of the temporary tree is equal to the next element in the array, updating the temporary tree into the updated temporary node and all child nodes of the updated temporary node, and returning to the step of judging whether the next element adjacent to the element corresponding to the temporary node exists in the array;
if not, searching the temporary tree for the resources corresponding to the elements in the array.
3. The method according to claim 2, wherein when the resource corresponding to the element in the array is not found in the temporary tree, further comprising:
and returning prompt information that the resource is not found.
4. The method of claim 1, further comprising, prior to determining the corresponding resource from the elements in the array in the identifier tree:
receiving an identifier tree establishment request;
acquiring all the uniform resource identifiers and resources corresponding to all the uniform resource identifiers;
and establishing the identifier tree according to all the uniform resource identifiers and the resources corresponding to each uniform resource identifier.
5. The method according to claim 1, wherein the http request is requested in a manner including at least one of a create request, a delete request, an update request, and a query request.
6. The method of claim 1, wherein the handler comprises at least one of a view handler, a create handler, an edit handler, and a delete handler.
7. The method of claim 1, after invoking the corresponding handler to process the resource according to the request manner, further comprising:
and returning an execution result.
8. A system for http request processing, comprising:
the first obtaining module is used for obtaining a uniform resource identifier from the http request when the http request is received;
the analysis module is used for analyzing the uniform resource identifiers into arrays;
a first determining module, configured to determine, in an identifier tree, a corresponding resource according to an element in the array; the identifier tree is tree structure data established according to all the uniform resource identifiers;
and the second determining module is used for determining the request mode of the http request and calling a corresponding processing program to process the resource according to the request mode.
9. An http request processing apparatus, comprising:
a memory for storing a computer program;
processor for implementing the steps of the method of http request processing according to any one of claims 1 to 4 when executing the computer program.
10. A readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method of http request processing according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911318457.6A CN111090426A (en) | 2019-12-19 | 2019-12-19 | Method, system and equipment for processing http request |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911318457.6A CN111090426A (en) | 2019-12-19 | 2019-12-19 | Method, system and equipment for processing http request |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111090426A true CN111090426A (en) | 2020-05-01 |
Family
ID=70395856
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911318457.6A Withdrawn CN111090426A (en) | 2019-12-19 | 2019-12-19 | Method, system and equipment for processing http request |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111090426A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102597993A (en) * | 2009-09-25 | 2012-07-18 | 国际商业机器公司 | Managing application state information by means of a uniform resource identifier (uri) |
| CN104683364A (en) * | 2013-11-26 | 2015-06-03 | 中国科学院声学研究所 | Web page display method, Web page display system and control method for Internet of things |
| KR101598187B1 (en) * | 2014-12-23 | 2016-02-26 | 주식회사 시큐아이 | Method and apparatus for blocking distributed denial of service |
| CN107612833A (en) * | 2017-09-20 | 2018-01-19 | 郑州云海信息技术有限公司 | A kind of URI method for routing and relevant apparatus based on storage system |
-
2019
- 2019-12-19 CN CN201911318457.6A patent/CN111090426A/en not_active Withdrawn
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102597993A (en) * | 2009-09-25 | 2012-07-18 | 国际商业机器公司 | Managing application state information by means of a uniform resource identifier (uri) |
| CN104683364A (en) * | 2013-11-26 | 2015-06-03 | 中国科学院声学研究所 | Web page display method, Web page display system and control method for Internet of things |
| KR101598187B1 (en) * | 2014-12-23 | 2016-02-26 | 주식회사 시큐아이 | Method and apparatus for blocking distributed denial of service |
| CN107612833A (en) * | 2017-09-20 | 2018-01-19 | 郑州云海信息技术有限公司 | A kind of URI method for routing and relevant apparatus based on storage system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6626211B2 (en) | Method and apparatus for processing short link and short link server | |
| WO2016192556A1 (en) | Interface invoking method, device and terminal | |
| US10574724B2 (en) | Automatic discovery of management nodes and generation of CLI using HA module | |
| US10275398B2 (en) | Content display device, content display method, and content display program | |
| CN111143403B (en) | SQL conversion method and device and storage medium | |
| CN110750315B (en) | Class loading method, device, equipment and storage medium in Android system | |
| CN113382282B (en) | Page resource access method and device, electronic equipment and storage medium | |
| CN108804100B (en) | Method and device for creating interface element, storage medium and mobile terminal | |
| CN111586201A (en) | Domain name resolution system, method, device and storage medium | |
| CN115329170A (en) | Webpage crawling method, device, equipment and storage medium | |
| US11909640B2 (en) | Creating endpoints | |
| CN111090426A (en) | Method, system and equipment for processing http request | |
| CN108446144B (en) | Application program starting method and device, terminal and storage medium | |
| CN113377752B (en) | Data cleaning method, device and system and computer readable storage medium | |
| CN112130860B (en) | JSON object analysis method and device, electronic equipment and storage medium | |
| US20240146650A1 (en) | Creating endpoints | |
| CN117271460B (en) | Scientific research digital networking service method and system based on scientific research digital object language relation | |
| CN113536074B (en) | Keyword query method and device in vue framework, computer equipment and medium | |
| CN116483483B (en) | Data query method and device and electronic equipment | |
| CN113778673B (en) | Data processing method, storage medium and apparatus | |
| CN110738982B (en) | Request processing method and device and electronic equipment | |
| CN112925573B (en) | Method, device, equipment and computer readable medium for loading web page | |
| CN117951155A (en) | Data processing method, device, electronic equipment and storage medium | |
| CN117311792A (en) | Version number updating method, device, equipment and storage medium | |
| CN111124923A (en) | Running state query method and device, server equipment and storage medium |
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 | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20200501 |