Request processing method based on tree storage structure
A storage structure and request processing technology, applied in the field of data processing, can solve the problems of consuming large server resources and reducing request processing efficiency, and achieve the effect of enhancing comprehensiveness and improving request processing efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0037] In order to make the technical problems, technical solutions and beneficial effects solved by the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.
[0038] The present invention provides a request processing method based on tree storage structure, refer to figure 1 , including the following steps:
[0039]Step 1, predefine the request encoding rule; the request encoding rule is specifically: divide the request into a first-level request, a second-level request, ..., an n-level request; wherein, the first-level request is a basic request; the second-level request A level request is a sub-request of a level 1 request, a level 2 request is a basic request combined with the first subsidiary request; a level 3 request is...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


