CN110263043A - Date storage method, data query method, apparatus and storage medium - Google Patents
Date storage method, data query method, apparatus and storage medium Download PDFInfo
- Publication number
- CN110263043A CN110263043A CN201910547435.0A CN201910547435A CN110263043A CN 110263043 A CN110263043 A CN 110263043A CN 201910547435 A CN201910547435 A CN 201910547435A CN 110263043 A CN110263043 A CN 110263043A
- Authority
- CN
- China
- Prior art keywords
- node
- inheritance
- code
- target
- level
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 79
- 238000013500 data storage Methods 0.000 claims description 39
- 238000012545 processing Methods 0.000 claims description 17
- 238000012986 modification Methods 0.000 claims description 4
- 230000004048 modification Effects 0.000 claims description 4
- 238000012217 deletion Methods 0.000 claims description 2
- 230000037430 deletion Effects 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 10
- PEDCQBHIVMGVHV-UHFFFAOYSA-N Glycerine Chemical compound OCC(O)CO PEDCQBHIVMGVHV-UHFFFAOYSA-N 0.000 description 7
- 230000002093 peripheral effect Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 238000013473 artificial intelligence Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This application involves a kind of date storage method, data query method, apparatus and storage mediums, belong to field of computer technology, this method comprises: obtaining the destination node in tree form data structure；The M of root node is generated when destination node is root node1Inherit coding, M in position1For positive integer；The succession coding of child node is generated when destination node is i-stage child node, the succession coding of i-stage child node includes the succession coding of (i-1)-th grade of node, and the digit of the succession coding of i-stage child node is Mi‑1+mi, Mi‑1For the digit of the succession coding of (i-1)-th grade of node, miFor the newly-increased number of encoding bits of i-stage child node；It stores destination node and inherits the corresponding relationship between coding；All child nodes for meeting query requirement can be inquired by the digit of the succession coding of the succession coding and child node of the root node of child node to be checked, and efficiency data query can be improved.
Description
Technical Field
The application relates to a data storage method, a data query device and a storage medium, and belongs to the technical field of computers.
Background
The tree data structure is a nonlinear data structure and is widely applied to the field of computers. In the field of computers, tree data structures are used to model data sets with the property of tree structures, which are a set with a hierarchical relationship composed of n finite nodes. Such as: in a typical tree data structure, a province in china contains several cities, each city containing several districts, each district containing several streets, and each street containing several residential districts.
The method for storing the data of the tree data structure comprises the following steps: establishing and storing a two-dimensional relation table between each node and a parent node of the node, such as: { Node _ id, Parent _ id }. And the Node _ id is the Node identification of the current Node, and the Parent _ id is the Node identification of the father Node of the current Node.
However, when querying data stored by the data storage method, recursive operations need to be frequently performed, and the recursive process needs to constantly access the database, so that the data query efficiency is low. Such as: a user needs to inquire all residential areas of Jiangsu province, and according to the data storage method, Node _ ids of all cities included in Jiangsu province need to be found through the Node _ ids of the Jiangsu province; then, the Node _ id of all the areas included in each city is found out through the Node _ id of each city; then, searching Node _ id of all streets included in each region through the Node _ id of each region; and finally, all the residential areas included by each street are found out through the Node _ ide of each street. These frequent recursive operations make data queries less efficient.
Disclosure of Invention
The application provides a data storage method, a data query device and a storage medium, which can solve the problem of low data query efficiency when the existing data storage method is used for storing a tree-shaped data structure. The application provides the following technical scheme:
in a first aspect, a data storage method is provided, the method including:
acquiring a target node in a tree data structure;
generating M of the root node when the target node is the root node1Bit-inheritance encoding, said M1Is a positive integer;
generating inheritance codes of the child nodes when the target node is an ith-level child node, wherein the inheritance codes of the ith-level child node comprise inheritance codes of an i-1-level node, and the number of bits of the inheritance codes of the ith-level child node is Mi-1+miSaid M isi-1Number of bits, m, encoded for inheritance of said level i-1 nodeiAdding a new coding bit number for the ith-level child node; i is an integer greater than 1;
and storing the corresponding relation between the target node and the inheritance codes, wherein different target nodes correspond to different inheritance codes.
Optionally, the newly added codes between different levels have the same number of bits, and generating the inheritance codes of the child nodes when the target node is the i-th level child node includes:
obtaining the value of the new added code bit number;
generating a new increased code with the number of the new increased code according to the value of the number of the new increased code;
acquiring inheritance codes of father nodes of the i-th-level child nodes;
and splicing the inheritance code of the father node of the ith-level child node with the newly added code to obtain the inheritance code of the ith-level child node, wherein the inheritance code of the ith-level child node is different from the inheritance codes of other ith-level child nodes.
Optionally, the storing the correspondence between the target node and the inheritance code includes:
determining a database mapped by inheritance codes of the target node;
and storing the corresponding relation between the target node and the inheritance code in the database.
Optionally, the determining a database to which the inheritance encoding of the target node is mapped includes:
using the inheritance code of the target node to carry out remainder on a preset numerical value, and determining a first database indicated by a remainder result as a database mapped by the inheritance code of the target node; or,
the first n bits of the inheritance code of the target node are used for carrying out remainder on a preset numerical value, a second database indicated by a remainder result is determined as a database mapped by the inheritance code of the target node, and n is a positive integer; or,
and (3) carrying out remainder on a preset numerical value by using the front n 'bits of the father node to which the target node belongs, and determining a third database indicated by a remainder result as a database mapped by the inheritance code of the target node, wherein n' is a positive integer.
Optionally, after storing the correspondence between the target node and the inheritance code in a database indicated by a remainder result, the method further includes:
acquiring inheritance codes of the target nodes;
searching the target node in a database mapped by the inheritance code of the target node;
and executing corresponding processing operation on the target node, wherein the processing operation comprises modification operation or deletion operation.
Optionally, the method further comprises:
acquiring the number of child nodes of the target node;
and storing the corresponding relation between the target node and the number of the child nodes.
Optionally, the method further comprises:
acquiring the data state of the target node;
storing a correspondence between the target node and the data state, the data state indicating whether the target node is deleted.
Optionally, the method further comprises:
acquiring a hierarchy identifier of a hierarchy where the target node is located;
and storing the corresponding relation between the target node and the hierarchy identification, wherein the hierarchy identifications of different hierarchies are different.
In a second aspect, a data query method is provided, where the method includes:
acquiring a data query requirement on a tree data structure, wherein the data query requirement comprises a root node to which a child node to be queried belongs and the number of stages of the child node to be queried;
acquiring inheritance codes of the root nodes;
acquiring a target digit of inheritance coding corresponding to the level number of the child node to be queried;
searching the corresponding relation between the node and the inheritance code for the child node of which the bit number of the inheritance code is the target bit number and comprises the inheritance code of the root node;
wherein the corresponding relationship between the node and the inheritance code comprises M corresponding to the root node1Bit inheritance coding, M corresponding to j-level child nodej-1+mjBit inheritance coding; the inheritance codes of the j-th level child nodes comprise inheritance codes of j-1 level nodes, and M isj-1Number of bits, m, encoded for inheritance of said level j-1 nodejThe newly added code number of the j stage child node is obtained; j is an integer greater than 1; the M is1Is a positive integer.
Optionally, the number of newly added encoding bits between different levels is the same, and the obtaining of the target number of inherited encodings corresponding to the level of the child node to be queried includes:
obtaining the value of the new added code bit number;
calculating the value of the newly added code number multiplied by j-1 and then M1To obtain the target number of bits.
Optionally, the method further comprises:
acquiring a target level identification of a level where the child node to be inquired is located;
and searching the node with the target level identification in the pre-stored corresponding relation between the node and the level identification. In a third aspect, there is provided a data storage device comprising:
the node acquisition module is used for acquiring a target node in the tree data structure;
a code generation module for generating M of the root node when the target node is the root node1Bit-inheritance encoding, said M1Is a positive integer;
the code generation module is further configured to generate an inheritance code of the child node when the target node is an i-th level child node, where the i-th level child nodeThe inheritance codes of the nodes comprise inheritance codes of i-1 level nodes, and the number of bits of the inheritance codes of the i level sub-nodes is Mi-1+miSaid M isi-1Number of bits, m, encoded for inheritance of said level i-1 nodeiAdding a new coding bit number for the ith-level child node; i is an integer greater than 1;
and the data storage module is used for storing the corresponding relation between the target node and the inheritance codes, and different target nodes correspond to different inheritance codes.
In a fourth aspect, there is provided a data query apparatus, including:
the system comprises a requirement acquisition module, a data query module and a query module, wherein the requirement acquisition module is used for acquiring a data query requirement of a tree data structure, and the data query requirement comprises a root node to which a child node to be queried belongs and the number of stages of the child node to be queried;
the code acquisition module is used for acquiring the inheritance code of the root node;
the digit acquisition module is used for acquiring the target digit of the inheritance code corresponding to the level of the child node to be inquired;
the node query module is used for searching the corresponding relation between the node and the inheritance code for the child node of which the inheritance code bit is the target bit and comprises the root node;
wherein the corresponding relationship between the node and the inheritance code comprises M corresponding to the root node1Bit inheritance coding, M corresponding to j-level child nodej-1+mjBit inheritance coding; the inheritance codes of the j-th level child nodes comprise inheritance codes of j-1 level nodes, and M isj-1Number of bits, m, encoded for inheritance of said level j-1 nodejThe newly added code number of the j stage child node is obtained; j is an integer greater than 1; the M is1Is a positive integer.
In a fifth aspect, there is provided a data storage device comprising a processor and a memory; the memory stores therein a program that is loaded and executed by the processor to implement the data storage method of the first aspect.
In a sixth aspect, a data query device is provided, the device comprising a processor and a memory; the memory stores therein a program that is loaded and executed by the processor to implement the data query method of the second aspect.
In a seventh aspect, there is provided a computer readable storage medium having a program stored therein, the program being loaded and executed by the processor to implement the data storage device of the first aspect; or, the data query method of the second aspect is implemented.
The beneficial effect of this application lies in: obtaining a target node in a tree data structure; generating M of root node when target node is root node1Bit inheritance coding; when the target node is the i-level child node, generating inheritance codes of the child nodes, wherein the inheritance codes of the i-level child node comprise inheritance codes of the i-1-level node, and the number of bits of the inheritance codes of the i-level child node is Mi-1+mi，Mi-1Number of bits, m, encoded for inheritance of level i-1 nodesiThe new coding bit number is the number of the ith-level child node; storing the corresponding relation between the target node and the inheritance code; the problem of low data query efficiency when the existing data storage method is used for storing the tree-shaped data structure can be solved; all child nodes meeting the query requirement can be queried through the inheritance codes of the root nodes of the child nodes to be queried and the bit numbers of the inheritance codes of the child nodes, and therefore the data query efficiency can be improved.
The foregoing description is only an overview of the technical solutions of the present application, and in order to make the technical solutions of the present application more clear and clear, and to implement the technical solutions according to the content of the description, the following detailed description is made with reference to the preferred embodiments of the present application and the accompanying drawings.
Drawings
FIG. 1 is a flow chart of a data storage method provided by an embodiment of the present application;
FIG. 2 is a diagram of a tree data structure provided by one embodiment of the present application;
FIG. 3 is a diagram illustrating a correspondence between a target node and inheritance encoding provided by an embodiment of the present application;
FIG. 4 is a schematic diagram of adding child nodes provided by one embodiment of the present application;
FIG. 5 is a schematic diagram of a delete child node according to an embodiment of the present application;
FIG. 6 is a flow chart of a data query method provided by an embodiment of the present application;
FIG. 7 is a block diagram of a data storage device provided by one embodiment of the present application;
FIG. 8 is a block diagram of a data query device provided in one embodiment of the present application;
fig. 9 is a block diagram of an electronic device provided by an embodiment of the application.
Detailed Description
The following detailed description of embodiments of the present application will be described in conjunction with the accompanying drawings and examples. The following examples are intended to illustrate the present application but are not intended to limit the scope of the present application.
Optionally, the present application takes the execution subject of each embodiment as an example of an electronic device, and the electronic device may be a device with data processing capability, such as a server or a terminal. The terminal may be a computer, a mobile phone, a tablet computer, a wearable device, and the like, and the embodiment does not limit the type of the terminal.
Fig. 1 is a flowchart of a data storage method according to an embodiment of the present application. The method at least comprises the following steps:
step 101, obtaining a target node in a tree data structure.
The tree data structure is used to simulate a data collection having the nature of a tree structure. The tree data structure has the following characteristics:
each node has zero or more child nodes, and the node is a father node of the child nodes;
nodes without father nodes are root nodes;
each non-root node has only one father node;
each child node, except the root node, may be divided into a plurality of disjoint sub-trees.
Wherein a node refers to a data element in the tree data structure.
Referring to fig. 2, a tree data structure is shown, in which a node where "jiangsu" is located is a root node, the root node includes two child nodes "Nanjing" and "Suzhou", the child node where "Suzhou" is located includes three child nodes "kuyu juan", "Wu zhong", and "industrial park", the child node where "industrial park" is located includes two child nodes "Du villa lake high education zone" and "Hudong", and the child node where "Du villa lake high education zone" is located includes two child nodes "moon" and "Haidepark bay".
The target node is a data element to be stored in the tree data structure. The target node may be a root node or may also be a child node other than the root node, and step 102 is executed when the target node is the root node; step 103 is performed when the target node is a child node other than the root node.
Step 102, when the target node is the root node, generating M of the root node1And (4) carrying out bit inheritance coding.
M1Is a positive integer. Of root nodeThe inheritance encoding is used to uniquely identify the root node. Alternatively, in the present application, the inherited codes may be represented by numbers and/or letters, where the numbers may be decimal, binary, etc., and the present embodiment does not limit the representation manner of the inherited codes. M1The value of (2) can ensure that the inheritance codes corresponding to all root nodes are different. Such as: m1The value of (1) is 8, the inheritance code is represented by a decimal number, the inheritance code of the root node can be any value in 00000000-.
In one example, the electronic device generates M of the root nodes in the storage order of the root nodes1And (4) carrying out bit inheritance coding. The inheritance code is smaller when the storage sequence is closer to the front, and the inheritance code is larger when the storage sequence is closer to the rear. Such as: for the root node with the first storage sequence, the inheritance code is 00000000; for the root node with the second storage order, the inheritance code is 00000001; for the root node with the storage order third, the inheritance code is 00000002.
In another example, the electronic device randomly generates M for the root node1The bits inherit the coding, and the inherited coding of different root nodes is different.
Of course, the electronic device may generate M of the root node in other manners1Bit inheritance encoding, the generation mode of inheritance encoding is not limited in this embodiment.
103, when the target node is the i-th level child node, generating inheritance codes of the child nodes, wherein the inheritance codes of the i-th level child node comprise inheritance codes of the i-1-th level node, and the number of bits of the inheritance codes of the i-th level child node is Mi-1+mi，Mi-1Number of bits, m, encoded for inheritance of level i-1 nodesiAnd the new added code number of the ith-stage child node.
i is an integer greater than 1. The progression of the node is used for indicating the depth of the node in the tree data structure, and the progression and the depth have positive correlation, that is, the depth is deeper when the progression is larger, and the depth is shallower when the progression is smaller. In this embodiment, the node … … in which the level 1 node is the root node, the level 2 child node is the child node of the root node, and the level 3 child node is the child node of the level 2 child node is cycled in this manner.
In this embodiment, the inheritance code of each level of child node is obtained by splicing the inheritance code and the new code of the superior node. Optionally, the inheritance code of the superior node is located before the new code; or, after the new code is added, the present embodiment does not limit the splicing position of the inheritance code of the upper node. In this embodiment, the inherited code of the upper node is located before the new code.
In one example, the newly added codes between different levels have the same number of bits, and when the target node is the i-th level child node, the inherited codes of the child nodes are generated, and the method comprises the following steps: acquiring the value of the newly added coding bit number; generating a new code with the number of the new code according to the value of the number of the new code; acquiring inheritance codes of father nodes of i-level child nodes; and splicing the inheritance code of the father node of the ith-level child node with the newly added code to obtain the inheritance code of the ith-level child node. Wherein, the inheritance codes of the i-th level child nodes are different from the inheritance codes of other child nodes of the i-th level.
Wherein the newly added coding bit number can be equal to M1The same; alternatively, it may be combined with M1Different.
In one example, the electronic device generates m of the ith-level child node in the storage order of the ith-level child nodeiAnd adding a new code. The more the storage sequence is, the smaller the bit newly added code is, and the more the storage sequence is, the larger the newly added code is. Such as: for the ith-level child node with the first storage sequence, the newly added code is 00000000; for the ith-level child node with the second storage sequence, the newly added code is 00000001; for the ith level child node whose storage order is the third, the inheritance code is 00000002.
In another example, the electronic device randomly generates an i-th level child nodemiAnd adding codes to the bits, wherein the added codes of different child nodes are different.
Of course, the electronic device may generate m of the ith-level child node in other mannersiThe bit addition code, the generation method of the new addition code is not limited in this embodiment.
And 104, storing the corresponding relation between the target node and the inheritance codes, wherein different target nodes correspond to different inheritance codes.
Optionally, the electronic device may first store the target node in the database, and then store the inheritance code corresponding to the target node after generating the target node; or, the inheritance code of the target node can be generated first, and then the target node and the inheritance code corresponding to the target node can be stored in the database.
The correspondence between the target node and the inherited codes is shown with reference to fig. 3, where each node includes, in addition to the root node, the inherited code of the parent node.
Optionally, the electronic device may further obtain the number of child nodes of the target node; and storing the corresponding relation between the target node and the number of the child nodes. When the number of child nodes of the target node increases, the number of child nodes increases accordingly. Referring to the corresponding relationship between the target node and the inheritance code shown in fig. 4, the number of the child nodes of the target node "the Du villa lake high education area" is increased by "Hanlin garden", and then the number of the child nodes of the target node "the Du villa lake high education area" is increased by 1.
Optionally, the electronic device may further obtain a data state of the target node; the correspondence between the target node and a data state indicating whether the target node is deleted is stored. Illustratively, the data state is represented by 0 and 1, the data state being 0 when the target node is deleted and the data state being 1 when the target node is not deleted. Referring to the correspondence between the target node and the inheritance code shown in fig. 5, when the target node "lunar bay" is deleted, the data state corresponding to "lunar bay" is changed from 1 to 0.
It should be added that, in order to avoid the electronic device generating the same inheritance code for different nodes, after the target node is deleted by the electronic device, the number of child nodes of the parent node to which the target node belongs is not changed. Such as: in fig. 5, when the target node "moon bay" is deleted, the number of child nodes of the parent node "dualha lake high school district" to which "moon bay" belongs is kept unchanged.
Optionally, the electronic device may store the correspondence between the target node and the inheritance code in the same database; alternatively, it may be stored in a plurality of databases.
In one example, when the electronic device stores the correspondence between the target node and the inherited codes to a plurality of databases, the electronic device determines the database to which the inherited codes of the target node are mapped; and storing the corresponding relation between the target node and the inheritance code in a database.
The electronic device determines the database mapped by the inherited code of the target node, and the database includes but is not limited to at least one of the following ways:
the first method comprises the following steps: and (4) carrying out remainder on the preset numerical value by using the inheritance code of the target node, and determining the first database indicated by the remainder result as the database mapped by the inheritance code of the target node.
Illustratively, in the present application, the preset value is the number of databases storing data to be stored. Of course, the preset numerical value may be a value smaller than the number of databases.
Referring to fig. 5, assuming that the number of the databases is 3, the result obtained after the inheritance code of the target node takes the remainder of 3 may be 0, 1, and 2, where 0 indicates that the databases 501 and 1 indicate that the databases 502 and 2 indicate that the database 503, and if the result obtained after the inheritance code of the target node takes the remainder of 3 is 0, the corresponding relationship between the target node and the inheritance code is stored in the database 501; if the result obtained after the inheritance code pair 3 of the target node is left is 1, storing the corresponding relation between the target node and the inheritance code into the database 502; if the result obtained after the inheritance code pair 3 of the target node is left is 2, the corresponding relation between the target node and the inheritance code is stored in the database 503.
And the second method comprises the following steps: and (4) carrying out remainder on the preset numerical value by using the first n bits of the inheritance code of the target node, and determining the second database indicated by the remainder result as the database mapped by the inheritance code of the target node.
n is a positive integer. Wherein n may be the same as M1Equal; alternatively, it may be greater than M1The value of (d); alternatively, it may be less than M1The numerical value of (c). Illustratively, n is 16 bits.
The process of determining the second database indicated by the remainder result as the database mapped by the inheritance code of the target node is the same as that shown in fig. 5, and details are not repeated here in this embodiment.
And the third is that: and (4) carrying out remainder on the preset numerical value by using the first n' bits of the parent node to which the target node belongs, and determining a third database indicated by the remainder result as the database mapped by the inheritance code of the target node.
n' is a positive integer. Wherein n' may be equal to n; alternatively, n may be different. Illustratively, n' is 16 bits.
The process of determining the third database indicated by the remainder result as the database mapped by the inheritance code of the target node is the same as that shown in fig. 5, and details are not repeated here in this embodiment.
Optionally, the electronic device may need to process the target node after storing the correspondence between the target node and the inheritance code.
If the electronic equipment needs to search the target node, acquiring the inheritance code of the target node; and searching the target node in the database mapped by the inheritance code of the target node.
If the electronic equipment needs to modify the target node, acquiring the inheritance code of the target node; searching a target node in a database mapped by the inheritance code of the target node; and executing corresponding processing operation on the target node, wherein the processing operation comprises modification operation. Such as: the name of the target node 'industrial park' is modified into 'park'.
If the electronic equipment needs to delete the target node, acquiring the inheritance code of the target node; searching a target node in a database mapped by the inheritance code of the target node; and executing corresponding processing operation on the target node, wherein the processing operation comprises a deleting operation. Such as: an operation of modifying the data state of the target node from 1 to 0.
The determination mode of the database mapped by the inheritance code of the target node is the same as the mode of mapping the database when the corresponding relation between the target node and the inheritance code is stored.
Optionally, the electronic device may further obtain a hierarchy identifier of a hierarchy where the target node is located; and storing the corresponding relation between the target node and the hierarchy identification, wherein the hierarchy identifications of different hierarchies are different.
The hierarchy identifier is used to indicate features common to nodes of the same hierarchy, such as: the common feature of the nodes "moon bay" and "haide park" at level 5 in fig. 3 is the residential area, the level mark may be the residential area, and/or a character string for indicating the residential area, and the embodiment does not limit the arrangement manner of the level mark. Therefore, when a user searches for the nodes in the same level, each node can be searched through the level identifier, and the node searching efficiency is improved.
In summary, in the data storage method provided in this embodiment, the target node in the tree data structure is obtained; generating M of root node when target node is root node1Bit inheritance coding; generating inheritance codes of the child nodes when the target node is the ith level child node, wherein the inheritance codes of the ith level child node comprise inheritance codes of the (i-1) level node, and the first level nodeThe bit number of the inheritance coding of the i-level child node is Mi-1+mi，Mi-1Number of bits, m, encoded for inheritance of level i-1 nodesiThe new coding bit number is the number of the ith-level child node; storing the corresponding relation between the target node and the inheritance code; the problem of low data query efficiency when the existing data storage method is used for storing the tree-shaped data structure can be solved; all child nodes meeting the query requirement can be queried through the inheritance codes of the root nodes of the child nodes to be queried and the bit numbers of the inheritance codes of the child nodes, and therefore the data query efficiency can be improved.
Such as: referring to the tree data structure shown in fig. 1, a user needs to query all the residential areas of the Jiangsu province. When the tree data structure is stored according to the existing data storage method, the electronic equipment needs to find Node _ ids of all cities included in Jiangsu province through the Node _ ids of the Jiangsu province; then, the Node _ id of all the areas included in each city is found out through the Node _ id of each city; then, searching Node _ id of all streets included in each region through the Node _ id of each region; and finally, all the residential areas included by each street are found out through the Node _ ide of each street. At this time, the electronic device needs to perform 4 seek operations.
When the tree data structure is stored by the data storage method provided by this embodiment, the electronic device can search all the residential areas of the Jiangsu province by only acquiring the inherited codes of the Jiangsu province and the digits of the inherited codes of the residential areas and executing one query operation.
In addition, when a child node is added, only the inheritance code of the father node needs to be acquired, and the inheritance code of the child node is generated and stored based on the inheritance code of the father node; the problem that when a tree-shaped data storage structure is designed based on left and right value coding of a binary tree, the left and right values of each node need to be modified, and the node increasing efficiency is low can be solved; since the operation of modifying the left and right values does not need to be performed, the efficiency of adding nodes in the database can be improved.
In addition, the number of the child nodes of the target node is stored, so that a user can visually know the child node condition of the target node, and the efficiency of acquiring the number of the child nodes of the target node by the user is improved.
In addition, by storing the data state of the target node, after the target node is deleted, only the data state needs to be modified to indicate that the target node is deleted; when the target node is added again, the data state is only required to be modified to indicate that the target node is not deleted, and the electronic equipment does not need to repeatedly execute the operations of deleting data and adding data on the same target node, so that the equipment resource is saved, and the data operation efficiency is improved.
In addition, by storing the corresponding relation between the target node and the inheritance code to the database mapped by the inheritance code, the pressure of the database for storing data can be shared. In addition, when querying or processing data, the electronic device queries the corresponding database for data, since the data averaged over multiple databases is reduced. Therefore, the efficiency of the electronic equipment for searching data can be improved.
Based on the foregoing embodiments, fig. 6 is a flowchart of a data query method according to an embodiment of the present application. The method at least comprises the following steps:
step 601, acquiring a data query requirement for the tree data structure, where the data query requirement includes a root node to which a child node to be queried belongs and a stage number of the child node to be queried.
Step 602, obtaining the inheritance code of the root node.
Optionally, the inheritance code of the root node may be queried by the electronic device in a correspondence between the root node and the inheritance code; or, the root node may be input by a user, and the embodiment does not limit the acquisition manner of the inheritance code of the root node.
Step 603, obtaining the target digit of the inheritance code corresponding to the level of the child node to be queried.
And the electronic equipment determines the target digit of the inheritance code according to the generation rule of the inheritance code of the child node.
In one example, the generation rule of the inherited codes of the child nodes is that the number of newly added code bits is the same between different levels. At this time, obtaining the target digit of the inheritance code corresponding to the level number of the child node to be queried includes: acquiring the value of the newly added coding bit number; multiplying the value of the newly added code bit number by j-1 and then calculating the sum of the value and the M1To obtain the target number of bits.
And step 604, searching for child nodes of the inheritance code, which have the target bit number and comprise the root node, of the inheritance code in the corresponding relation between the nodes and the inheritance code.
Wherein, the corresponding relation between the node and the inheritance code comprises M corresponding to the root node1Bit inheritance coding, M corresponding to j-level child nodej-1+mjBit inheritance coding; the inheritance codes of the j-th level child nodes comprise inheritance codes of the j-1-th level nodes, Mj-1Number of bits, m, encoded for inheritance of level j-1 nodesjThe newly added code number of the j-th-stage child node is obtained; j is an integer greater than 1; m1Is a positive integer.
Such as: referring to the correspondence between the target node and the inheritance code shown in fig. 3, the user needs to query all the residential areas of Jiangsu province. The inherited codes of the Jiangsu province acquired by the electronic equipment are 00000000, the residential areas are 5-level child nodes, if the value of the number of the newly added code is 8, the target digit is 8+4 × 8 ═ 40, the inherited codes with the first 8 digits of 000000000000 and the digit of 40 are searched in fig. 3, and the child nodes 'moon bay' and 'Heidepark' corresponding to the inherited codes are all the residential areas of the Jiangsu province which need to be inquired by the user.
Optionally, in order to improve the accuracy of the electronic device in searching for the child node, the electronic device may further obtain a target level identifier of a level where the child node to be queried is located; searching a node with a target level identification in a pre-stored corresponding relation between the node and the level identification; and searching the inherited code bit number which is the target bit number and comprises the child nodes of the inherited code of the root node in the corresponding relation between the nodes and the inherited codes, and determining the union of the two search results as the final search result.
Such as: referring to the correspondence between the target node and the inheritance code shown in fig. 3, the user needs to query all the residential areas of Jiangsu province. The inherited codes of Jiangsu province acquired by the electronic equipment are 00000000, the residential area is a 5-level child node, if the value of the newly added code bit number is 8, the target bit number is 8+4 × 8 ═ 40, the inherited codes with the first 8 bits of 000000000000 and the bit number of 40 are searched in FIG. 3, and the inherited codes correspond to child nodes of 'moon bay' and 'Haidepark'; the target level mark is 'residential area', the electronic equipment searches for a node with the target level mark 'residential area' in the corresponding relation between the pre-stored nodes and the level marks, and the child nodes 'moon bay' and 'Heidepark' are all residential areas of Jiangsu province, which need to be inquired by the user.
In summary, in the data query method provided in this embodiment, the data query requirement for the tree data structure is obtained, where the data query requirement includes the root node to which the child node to be queried belongs and the number of stages of the child node to be queried; acquiring inheritance codes of root nodes; acquiring a target digit of inheritance coding corresponding to the level number of the child node to be queried; searching the child nodes of the inheritance codes which have the target digit and comprise the root nodes and have the digits of the inheritance codes in the corresponding relation between the nodes and the inheritance codes; wherein, the corresponding relation between the node and the inheritance code comprises M corresponding to the root node1Bit inheritance coding, M corresponding to j-level child nodej-1+mjBit inheritance coding; the inheritance codes of the j-th level child nodes comprise inheritance codes of the j-1-th level nodes, Mj-1Number of bits, m, encoded for inheritance of level j-1 nodesjThe newly added code number of the j-th-stage child node is obtained; the problem of low data query efficiency when the existing data storage method is used for storing the tree-shaped data structure can be solved; all child nodes meeting the query requirement can be queried through the inheritance code of the root node of the child node to be queried and the bit number of the inheritance code of the child node, so that data query can be improvedAnd (4) inquiring efficiency.
In addition, the child nodes are inquired by combining the inheritance codes of the root nodes and the bit numbers of the inheritance codes of the child nodes with the target level identification of the child nodes to be inquired, so that the accuracy of inquiring the child nodes can be improved.
FIG. 7 is a block diagram of a data storage device provided in one embodiment of the present application. The device at least comprises the following modules: a node acquisition module 710, a code generation module 720 and a data storage module 730.
A node obtaining module 710, configured to obtain a target node in a tree data structure;
a code generation module 720, configured to generate M of the root node when the target node is the root node1Bit-inheritance encoding, said M1Is a positive integer;
the code generating module 720 is further configured to generate an inheritance code of the child node when the target node is an i-th level child node, where the inheritance code of the i-th level child node includes an inheritance code of an i-1-th level node, and the number of bits of the inheritance code of the i-th level child node is Mi-1+miSaid M isi-1Number of bits, m, encoded for inheritance of said level i-1 nodeiAdding a new coding bit number for the ith-level child node; i is an integer greater than 1;
and the data storage module 730 is configured to store a corresponding relationship between the target node and the inheritance codes, where different target nodes correspond to different inheritance codes.
For relevant details reference is made to the above-described method embodiments.
It should be noted that: in the data storage device provided in the above embodiment, when storing data, only the division of the above functional modules is taken as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the data storage device is divided into different functional modules to complete all or part of the above described functions. In addition, the data storage device provided by the above embodiment and the data storage method embodiment belong to the same concept, and specific implementation processes thereof are detailed in the method embodiment and are not described herein again.
Fig. 8 is a block diagram of a data query device according to an embodiment of the present application. The device at least comprises the following modules: a requirement obtaining module 810, a code obtaining module 820, a digit obtaining module 830 and a node query module 840.
A requirement obtaining module 810, configured to obtain a data query requirement for a tree data structure, where the data query requirement includes a root node to which a child node to be queried belongs and a number of stages of the child node to be queried;
a code obtaining module 820, configured to obtain an inheritance code of the root node;
the digit acquiring module 830 is configured to acquire a target digit of an inheritance code corresponding to the level of the child node to be queried;
a node query module 840, configured to search, in a correspondence between a node and an inherited code, a child node whose bit number of the inherited code is the target bit number and which includes the inherited code of the root node;
wherein the corresponding relationship between the node and the inheritance code comprises M corresponding to the root node1Bit inheritance coding, M corresponding to j-level child nodej-1+mjBit inheritance coding; the inheritance codes of the j-th level child nodes comprise inheritance codes of j-1 level nodes, and M isj-1Number of bits, m, encoded for inheritance of said level j-1 nodejThe newly added code number of the j stage child node is obtained; j is an integer greater than 1; the M is1Is a positive integer.
For relevant details reference is made to the above-described method embodiments.
It should be noted that: in the data query apparatus provided in the above embodiment, only the division of the functional modules is illustrated when performing data query, in practical applications, the functions may be distributed by different functional modules according to needs, that is, the internal structure of the data query apparatus is divided into different functional modules to complete all or part of the functions described above. In addition, the data query apparatus and the data query method provided in the above embodiments belong to the same concept, and specific implementation processes thereof are described in detail in the method embodiments and are not described herein again.
FIG. 9 is a block diagram of an electronic device that may include the data storage provided in FIG. 7, according to an embodiment of the present application; and/or fig. 8 provides a data query device, and the electronic device may be a smart phone, a tablet computer, a notebook computer, a desktop computer, or a server. The electronic device may also be referred to as a user equipment, a portable terminal, a laptop terminal, a desktop terminal, a control terminal, etc., and the embodiment is not limited thereto. The electronic device comprises at least a processor 901 and a memory 902.
Processor 901 may include one or more processing cores such as: 4 core processors, 8 core processors, etc. The processor 901 may be implemented in at least one hardware form of a DSP (Digital Signal Processing), an FPGA (Field-Programmable Gate Array), and a PLA (Programmable Logic Array). The processor 901 may also include a main processor and a coprocessor, where the main processor is a processor for processing data in an awake state, and is also called a Central Processing Unit (CPU); a coprocessor is a low power processor for processing data in a standby state. In some embodiments, the processor 901 may be integrated with a GPU (Graphics Processing Unit), which is responsible for rendering and drawing the content required to be displayed on the display screen. In some embodiments, the processor 901 may further include an AI (Artificial Intelligence) processor for processing computing operations related to machine learning.
Memory 902 may include one or more computer-readable storage media, which may be non-transitory. The memory 902 may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in memory 902 is used to store at least one instruction for execution by processor 901 to implement the data storage methods provided by method embodiments herein; or a data query method.
In some embodiments, the electronic device may further include: a peripheral interface and at least one peripheral. The processor 901, memory 902 and peripheral interfaces may be connected by buses or signal lines. Each peripheral may be connected to the peripheral interface via a bus, signal line, or circuit board. Illustratively, peripheral devices include, but are not limited to: radio frequency circuit, touch display screen, audio circuit, power supply, etc.
Of course, the electronic device may include fewer or more components, which is not limited by the embodiment.
Optionally, the present application further provides a computer-readable storage medium, in which a program is stored, and the program is loaded and executed by a processor to implement the data storage method of the above method embodiment; or a data query method.
Optionally, the present application further provides a computer product, which includes a computer-readable storage medium, in which a program is stored, and the program is loaded and executed by a processor to implement the data storage method of the above-mentioned method embodiment; or a data query method.
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (16)
1. A method of data storage, the method comprising:
acquiring a target node in a tree data structure;
generating M of the root node when the target node is the root node1Bit-inheritance encoding, said M1Is a positive integer;
when the target node is an i-level child node, generating inheritance codes of the child node, wherein the inheritance codes of the i-level child node comprise inheritance codes of an i-1-level nodeThe bit number of the inheritance code of the i-th level child node is Mi-1+miSaid M isi-1Number of bits, m, encoded for inheritance of said level i-1 nodeiAdding a new coding bit number for the ith-level child node; i is an integer greater than 1;
and storing the corresponding relation between the target node and the inheritance codes, wherein different target nodes correspond to different inheritance codes.
2. The method of claim 1, wherein the number of bits of newly added codes between different levels is the same, and the generating of the inherited codes of the child nodes when the target node is an i-th level child node comprises:
obtaining the value of the new added code bit number;
generating a new increased code with the number of the new increased code according to the value of the number of the new increased code;
acquiring inheritance codes of father nodes of the i-th-level child nodes;
and splicing the inheritance code of the father node of the ith-level child node with the newly added code to obtain the inheritance code of the ith-level child node, wherein the inheritance code of the ith-level child node is different from the inheritance codes of other ith-level child nodes.
3. The method of claim 1, wherein storing the correspondence between the target node and the inheritance encoding comprises:
determining a database mapped by inheritance codes of the target node;
and storing the corresponding relation between the target node and the inheritance code in the database.
4. The method of claim 3, wherein determining the database to which the inheritance encoding of the target node is mapped comprises:
using the inheritance code of the target node to carry out remainder on a preset numerical value, and determining a first database indicated by a remainder result as a database mapped by the inheritance code of the target node; or,
the first n bits of the inheritance code of the target node are used for carrying out remainder on a preset numerical value, a second database indicated by a remainder result is determined as a database mapped by the inheritance code of the target node, and n is a positive integer; or,
and (3) carrying out remainder on a preset numerical value by using the front n 'bits of the father node to which the target node belongs, and determining a third database indicated by a remainder result as a database mapped by the inheritance code of the target node, wherein n' is a positive integer.
5. The method of claim 3, wherein after storing the correspondence between the target node and the inherited encoding in a database of remainder result indications, further comprising:
acquiring inheritance codes of the target nodes;
searching the target node in a database mapped by the inheritance code of the target node;
and executing corresponding processing operation on the target node, wherein the processing operation comprises modification operation or deletion operation.
6. The method of any of claims 1 to 5, further comprising:
acquiring the number of child nodes of the target node;
and storing the corresponding relation between the target node and the number of the child nodes.
7. The method of any of claims 1 to 5, further comprising:
acquiring the data state of the target node;
storing a correspondence between the target node and the data state, the data state indicating whether the target node is deleted.
8. The method of any of claims 1 to 5, further comprising:
acquiring a hierarchy identifier of a hierarchy where the target node is located;
and storing the corresponding relation between the target node and the hierarchy identification, wherein the hierarchy identifications of different hierarchies are different.
9. A method for data query, the method comprising:
acquiring a data query requirement on a tree data structure, wherein the data query requirement comprises a root node to which a child node to be queried belongs and the number of stages of the child node to be queried;
acquiring inheritance codes of the root nodes;
acquiring a target digit of inheritance coding corresponding to the level number of the child node to be queried;
searching the corresponding relation between the node and the inheritance code for the child node of which the bit number of the inheritance code is the target bit number and comprises the inheritance code of the root node;
wherein the corresponding relationship between the node and the inheritance code comprises M corresponding to the root node1Bit inheritance coding, M corresponding to j-level child nodej-1+mjBit inheritance coding; the inheritance codes of the j-th level child nodes comprise inheritance codes of j-1 level nodes, and M isj-1Number of bits, m, encoded for inheritance of said level j-1 nodejThe newly added code number of the j stage child node is obtained; j is an integer greater than 1; the M is1Is a positive integer.
10. The method according to claim 9, wherein the number of newly added encoding bits between different levels is the same, and the obtaining of the target number of inherited encoding bits corresponding to the level of the child node to be queried comprises:
obtaining the value of the new added code bit number;
calculating the value of the newly added code number multiplied by j-1 and then M1To obtain the target number of bits.
11. The method of claim 9, further comprising:
acquiring a target level identification of a level where the child node to be inquired is located;
and searching the node with the target level identification in the pre-stored corresponding relation between the node and the level identification.
12. A data storage device, characterized in that the device comprises:
the node acquisition module is used for acquiring a target node in the tree data structure;
a code generation module for generating M of the root node when the target node is the root node1Bit-inheritance encoding, said M1Is a positive integer;
the code generation module is further configured to generate an inheritance code of the child node when the target node is an i-th level child node, where the inheritance code of the i-th level child node includes inheritance codes of an i-1-th level node, and the number of bits of the inheritance code of the i-th level child node is Mi-1+miSaid M isi-1Number of bits, m, encoded for inheritance of said level i-1 nodeiAdding a new coding bit number for the ith-level child node; i is an integer greater than 1;
and the data storage module is used for storing the corresponding relation between the target node and the inheritance codes, and different target nodes correspond to different inheritance codes.
13. A data query apparatus, characterized in that the apparatus comprises:
the system comprises a requirement acquisition module, a data query module and a query module, wherein the requirement acquisition module is used for acquiring a data query requirement of a tree data structure, and the data query requirement comprises a root node to which a child node to be queried belongs and the number of stages of the child node to be queried;
the code acquisition module is used for acquiring the inheritance code of the root node;
the digit acquisition module is used for acquiring the target digit of the inheritance code corresponding to the level of the child node to be inquired;
the node query module is used for searching the corresponding relation between the node and the inheritance code for the child node of which the inheritance code bit is the target bit and comprises the root node;
wherein the corresponding relationship between the node and the inheritance code comprises M corresponding to the root node1Bit inheritance coding, M corresponding to j-level child nodej-1+mjBit inheritance coding; the inheritance codes of the j-th level child nodes comprise inheritance codes of j-1 level nodes, and M isj-1Number of bits, m, encoded for inheritance of said level j-1 nodejThe newly added code number of the j stage child node is obtained; j is an integer greater than 1; the M is1Is a positive integer.
14. A data storage device, characterized in that the device comprises a processor and a memory; the memory stores therein a program that is loaded and executed by the processor to implement the data storage method according to any one of claims 1 to 8.
15. A data query device, characterized in that the device comprises a processor and a memory; the memory stores a program that is loaded and executed by the processor to implement the data query method according to any one of claims 9 to 11.
16. A computer-readable storage medium, characterized in that a program is stored in the storage medium, which program, when executed by a processor, is configured to implement the data storage method according to any one of claims 1 to 8; or, implementing a data query method as claimed in any one of claims 9 to 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910547435.0A CN110263043A (en) | 2019-06-24 | 2019-06-24 | Date storage method, data query method, apparatus and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910547435.0A CN110263043A (en) | 2019-06-24 | 2019-06-24 | Date storage method, data query method, apparatus and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110263043A true CN110263043A (en) | 2019-09-20 |
Family
ID=67920630
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910547435.0A Pending CN110263043A (en) | 2019-06-24 | 2019-06-24 | Date storage method, data query method, apparatus and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110263043A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111339193A (en) * | 2020-02-21 | 2020-06-26 | 腾讯云计算（北京）有限责任公司 | Category coding method and device |
| CN112860707A (en) * | 2021-03-12 | 2021-05-28 | 广州市网星信息技术有限公司 | Tree structure data processing method, device, equipment and readable storage medium |
| CN113051293A (en) * | 2021-04-21 | 2021-06-29 | 中国工商银行股份有限公司 | Resource query method and device based on tree structure and electronic equipment |
| CN113347173A (en) * | 2021-05-31 | 2021-09-03 | 新华三信息安全技术有限公司 | Packet filtering method and device and electronic equipment |
| CN113515517A (en) * | 2020-04-09 | 2021-10-19 | 深圳市华胜软件技术有限公司 | Method for querying data set based on tree structure data and computer equipment |
| CN113536188A (en) * | 2021-09-16 | 2021-10-22 | 统信软件技术有限公司 | Data storage method, data query method, computing device and storage medium |
| CN113627128A (en) * | 2020-05-07 | 2021-11-09 | 上海同是科技股份有限公司 | Hidden danger troubleshooting check item coding method and system |
| CN113961713A (en) * | 2021-09-29 | 2022-01-21 | 中国科学院计算机网络信息中心 | Graph data structure representing, storing and inquiring method and device based on hierarchical coding |
| CN114327892A (en) * | 2021-12-28 | 2022-04-12 | 武汉天喻信息产业股份有限公司 | FLASH resource management method, storage medium, electronic equipment and device |
| CN115841094A (en) * | 2023-02-15 | 2023-03-24 | 天翼云科技有限公司 | Encoding method, device, equipment, medium and product |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101187930A (en) * | 2007-12-04 | 2008-05-28 | 浙江大学 | Distribution type file system dummy directory and name space implementing method |
| CN102135972A (en) * | 2010-07-30 | 2011-07-27 | 华为软件技术有限公司 | Service tree data processing method, system, client and server |
| CN102867059A (en) * | 2012-09-19 | 2013-01-09 | 浪潮(北京)电子信息产业有限公司 | Method and system for processing data in treelike structures |
| CN103279544A (en) * | 2013-06-05 | 2013-09-04 | 中国电子科技集团公司第十五研究所 | Method and device for storing and inquiring tree structure data in relational database |
| CN103559323A (en) * | 2013-11-22 | 2014-02-05 | 盛杰 | Database implementation method |
| CN103617199A (en) * | 2013-11-13 | 2014-03-05 | 北京京东尚科信息技术有限公司 | Data operating method and data operating system |
| CN107301249A (en) * | 2017-07-25 | 2017-10-27 | 郑州云海信息技术有限公司 | A kind of file access information recording method, system and distributed cluster system |
| EP2680445B1 (en) * | 2012-06-28 | 2018-12-26 | Fujitsu Limited | Code processing technique |
-
2019
- 2019-06-24 CN CN201910547435.0A patent/CN110263043A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101187930A (en) * | 2007-12-04 | 2008-05-28 | 浙江大学 | Distribution type file system dummy directory and name space implementing method |
| CN102135972A (en) * | 2010-07-30 | 2011-07-27 | 华为软件技术有限公司 | Service tree data processing method, system, client and server |
| EP2680445B1 (en) * | 2012-06-28 | 2018-12-26 | Fujitsu Limited | Code processing technique |
| CN102867059A (en) * | 2012-09-19 | 2013-01-09 | 浪潮(北京)电子信息产业有限公司 | Method and system for processing data in treelike structures |
| CN103279544A (en) * | 2013-06-05 | 2013-09-04 | 中国电子科技集团公司第十五研究所 | Method and device for storing and inquiring tree structure data in relational database |
| CN103617199A (en) * | 2013-11-13 | 2014-03-05 | 北京京东尚科信息技术有限公司 | Data operating method and data operating system |
| CN103559323A (en) * | 2013-11-22 | 2014-02-05 | 盛杰 | Database implementation method |
| CN107301249A (en) * | 2017-07-25 | 2017-10-27 | 郑州云海信息技术有限公司 | A kind of file access information recording method, system and distributed cluster system |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111339193A (en) * | 2020-02-21 | 2020-06-26 | 腾讯云计算（北京）有限责任公司 | Category coding method and device |
| CN113515517A (en) * | 2020-04-09 | 2021-10-19 | 深圳市华胜软件技术有限公司 | Method for querying data set based on tree structure data and computer equipment |
| CN113515517B (en) * | 2020-04-09 | 2024-06-04 | 深圳市华胜软件技术有限公司 | Method and computer equipment for querying data set based on tree structure data |
| CN113627128A (en) * | 2020-05-07 | 2021-11-09 | 上海同是科技股份有限公司 | Hidden danger troubleshooting check item coding method and system |
| CN112860707A (en) * | 2021-03-12 | 2021-05-28 | 广州市网星信息技术有限公司 | Tree structure data processing method, device, equipment and readable storage medium |
| CN113051293A (en) * | 2021-04-21 | 2021-06-29 | 中国工商银行股份有限公司 | Resource query method and device based on tree structure and electronic equipment |
| CN113347173A (en) * | 2021-05-31 | 2021-09-03 | 新华三信息安全技术有限公司 | Packet filtering method and device and electronic equipment |
| CN113347173B (en) * | 2021-05-31 | 2022-04-22 | 新华三信息安全技术有限公司 | Packet filtering method and device and electronic equipment |
| CN113536188A (en) * | 2021-09-16 | 2021-10-22 | 统信软件技术有限公司 | Data storage method, data query method, computing device and storage medium |
| CN113961713A (en) * | 2021-09-29 | 2022-01-21 | 中国科学院计算机网络信息中心 | Graph data structure representing, storing and inquiring method and device based on hierarchical coding |
| CN114327892A (en) * | 2021-12-28 | 2022-04-12 | 武汉天喻信息产业股份有限公司 | FLASH resource management method, storage medium, electronic equipment and device |
| CN114327892B (en) * | 2021-12-28 | 2024-05-03 | 武汉天喻信息产业股份有限公司 | FLASH resource management method, storage medium, electronic equipment and device |
| CN115841094A (en) * | 2023-02-15 | 2023-03-24 | 天翼云科技有限公司 | Encoding method, device, equipment, medium and product |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110263043A (en) | Date storage method, data query method, apparatus and storage medium | |
| CN111274811B (en) | Address text similarity determining method and address searching method | |
| US9965821B2 (en) | Fully parallel in-place construction of 3D acceleration structures in a graphics processing unit | |
| US11030247B2 (en) | Layered graph data structure | |
| Mehta et al. | Handbook of data structures and applications | |
| US10268735B1 (en) | Graph based resolution of matching items in data sources | |
| WO2016095749A1 (en) | Method and device for querying spatial object and establishing spatial index of electronic map | |
| CN107766433B (en) | Range query method and device based on Geo-BTree | |
| US20130235050A1 (en) | Fully parallel construction of k-d trees, octrees, and quadtrees in a graphics processing unit | |
| US11249999B2 (en) | Memory efficient searching | |
| CN111159184B (en) | Metadata tracing method and device and server | |
| CN111078689B (en) | Data processing method and system of discontinuous pre-ordering traversal tree algorithm | |
| CN111247518A (en) | Database sharding | |
| CN104573022A (en) | Data query method and device for HBase | |
| CN111708805A (en) | Data query method and device, electronic equipment and storage medium | |
| CN115292344A (en) | Data dictionary construction method and device, electronic equipment and storage medium | |
| CN115203435A (en) | Entity relation generation method and data query method based on knowledge graph | |
| CN113361240B (en) | Method, apparatus, device and readable storage medium for generating target article | |
| CN113515517B (en) | Method and computer equipment for querying data set based on tree structure data | |
| Lai et al. | A spatial multi-scale integer coding method and its application to three-dimensional model organization | |
| CN115630595A (en) | Automatic logic circuit generation method and device, electronic device and storage medium | |
| CN115309850A (en) | GeoHash-based map visual range interest point retrieval method and system | |
| CN105117733A (en) | Method and device for determining clustering sample difference | |
| CN112487032A (en) | Data query method and device, storage medium and electronic equipment | |
| JP2020135530A (en) | Data management device, data search method and program |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20201126 Address after: Room 708, Ruiqi building, building 11, no.668, Fengting Avenue, Suzhou Industrial Park, Suzhou, Jiangsu Province, 215000 Applicant after: Ruishi (Suzhou) video technology Co.,Ltd. Applicant after: SUZHOU KEDA TECHNOLOGY Co.,Ltd. Address before: 215000 Unit 04, 13th Floor, Building 388 A, Xinping Street, Suzhou Industrial Park, Jiangsu Province Applicant before: Suzhou Ruiweibo Technology Co.,Ltd. Applicant before: SUZHOU KEDA TECHNOLOGY Co.,Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190920 |