Data query method based on left-right value infinite classification implementation algorithm

Abstract

The invention discloses a data query method based on a left-right value infinite classification implementation algorithm, which relates to the technical field of data processing, and comprises the following steps of: receiving a data query request carrying a minimum lower limit value and a maximum upper limit value, and obtaining data meeting requirements according to preset left and right valuesof each piece of data in a database to obtain a data set; and sending the data set to a client, so that efficiency is improved, the server load is reduced, and user experience is improved.

Description

Technical field[0001]The invention relates to the technical field of data processing, in particular to a data query method based on an infinite classification of left and right values ​​to realize an algorithm.Background technique[0002]At present, the query of multi-level data is mainly carried out by way of traversal. For tree-shaped data with a more complex hierarchical structure, the recursion time is longer, it takes up more service resources, and requires frequent interaction with the database, resulting in low efficiency.Summary of the invention[0003]In order to solve the shortcomings of the prior art, the embodiment of the present invention provides a data query method based on the infinite classification of left and right values ​​to realize an algorithm, the method includes the following steps:[0004]Receive data query requests carrying the minimum lower limit value and the maximum upper limit value;[0005]According to the preset left and right values ​​of each piece of data ...

AI Technical Summary

Problems solved by technology

For tree-shaped data with a complex hierarchical structure, the recursion time is long, which takes up service resources and requires frequent interaction with the database, resulting in low efficiency.