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

What is AI technical title?
AI technical title is built by Patsnap AI team. It summarizes the technical point description of the patent document.
A data query, left and right value technology, applied in the field of data processing, can solve the problems of occupying service resources, long recursion time, low efficiency, etc., to achieve the effect of improving utilization, reducing load, and reducing occupation

CN112256729APending Publication Date: 2021-01-22北京神州数字科技有限公司

5 Cites 0 Cited by

Patent Information

Authority / Receiving Office: CN · China
Patent Type: Applications(China)
Current Assignee / Owner
Publication Date: 2021-01-22

Patent Text Reader

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.

Need to check novelty before this filing date? Find Prior Art

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 ...

Examples

Embodiment Construction

[0030]The present invention will be specifically introduced below in conjunction with specific embodiments.

[0031]The data query method based on the infinite classification of left and right values provided by the embodiments of the present invention includes the following steps:

[0032]S101: Receive a data query request carrying a minimum lower limit value and a maximum upper limit value;

[0033]S102: Obtain data that meets the requirements according to the preset left and right values of each piece of data in the database to obtain a data set;

[0034]S103: Send the data set to the client.

[0035]Optionally, before obtaining the data that meets the requirements according to the preset left and right values of each piece of data in the database, the method further includes:

[0036]Use the left and right value infinite classification to realize the algorithm, and set the left value and right value for each piece of data in the database.

[0037]Optionally, after sending the data set to the c...