CN111475511A - Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure - Google Patents

Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure Download PDF

Info

Publication number
CN111475511A
CN111475511A CN202010260902.4A CN202010260902A CN111475511A CN 111475511 A CN111475511 A CN 111475511A CN 202010260902 A CN202010260902 A CN 202010260902A CN 111475511 A CN111475511 A CN 111475511A
Authority
CN
China
Prior art keywords
node
nodes
data
tree structure
data storage
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
Application number
CN202010260902.4A
Other languages
Chinese (zh)
Inventor
魏帆
李茗
武婕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Stringon Technology Beijing Co ltd
Original Assignee
Stringon Technology Beijing Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Stringon Technology Beijing Co ltd filed Critical Stringon Technology Beijing Co ltd
Priority to CN202010260902.4A priority Critical patent/CN111475511A/en
Publication of CN111475511A publication Critical patent/CN111475511A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2246Trees, e.g. B+trees
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • G06F16/2379Updates performed during online database operations; commit processing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (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

According to the data storage method, the data access device and the data storage equipment based on the tree structure, the node table and the relational mapping table are created based on data to be stored, the first tree structure is generated according to the mapping relational table, the second tree structure is generated based on the node table, and the node data can be updated rapidly in real time; meanwhile, values corresponding to the nodes are classified, parameters and operations corresponding to the types can be quickly acquired during access, and the efficiency of data storage and access is greatly improved.

Description

Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure
Technical Field
The invention relates to the technical field of data processing, in particular to a data storage method, an access method, a device and equipment based on a tree structure.
Background
With the development and popularization of computer technology and big data processing technology, various data information is in a massive high-speed development trend. At present, most application scenarios of computer software are relational databases, and query and storage under complex relational conditions consume a large amount of database resources, including storage space and calling time. Under the background of rapid development of the current artificial intelligence industry, with the outbreak of data volume, the traditional relational data can not meet the requirements of data definition and use under the network and big data environment, and the efficiency of data storage and access is affected by serious consequences.
Disclosure of Invention
The embodiment of the invention provides a data storage method, an access method, a device and equipment based on a tree structure, which are used for solving the problem that the current data structure cannot meet the requirement of low access efficiency of a data storage machine in a big data explosion process.
In order to solve the above technical problem, an embodiment of the present invention provides a data storage and access method based on a tree structure, including:
responding to a data storage instruction, creating a node table and a relational mapping table according to data to be stored, wherein the node table comprises node positions and key values corresponding to nodes, and the relational mapping table comprises node directions and relations between the nodes and father nodes and child nodes of the nodes;
generating a first tree structure according to the relationship mapping table, wherein the first tree structure comprises a root node, branch nodes and leaf nodes, and the root node, the branch nodes and the leaf nodes are mapped in an associated manner;
and storing the data to be stored to the corresponding nodes of the first tree structure based on the node table to form a second tree structure, and storing the second tree structure to a database.
Further, the generating a data packet with a tree structure based on the original data specifically includes: and generating the tree-structured data packet by using an object container nested mode.
Further, the key values corresponding to the nodes in the node table are specifically as follows:
when the node is a leaf node, the key comprises the node name of the leaf node, and the value is a corresponding value;
when the node is a non-leaf node, the key is a set of names of all child nodes included in the non-leaf node, and the value is a set of values of all child nodes included in the non-leaf node.
Further, the values corresponding to the nodes in the node table include at least one type of private key, number, text.
Further, the node table further includes a parameter corresponding to a type of the value corresponding to the node.
On the other hand, an embodiment of the present invention further provides a data access method based on a tree structure, including:
responding to a data access instruction, and acquiring a node to be accessed according to the node position;
acquiring target data according to a node table corresponding to the node to be accessed and the relational mapping table;
and outputting the target data according to a specified mode.
Further, the obtaining of the target data according to the node table and the relation mapping table corresponding to the node to be accessed specifically includes:
obtaining a value corresponding to a node to be accessed according to a node table corresponding to the node to be accessed and a relational mapping table, and obtaining target data according to the value corresponding to the node to be accessed; or
Inquiring the type of a value corresponding to the node to be accessed according to a node table corresponding to the node to be accessed and a relational mapping table, acquiring a parameter corresponding to the type of the value according to the type of the value, and acquiring target data based on the parameter.
Further, the authority of the data storage and access is verified, and if the storage and the reading have the authority, the reading or the access is completed.
On the other hand, an embodiment of the present invention provides a data storage device based on a tree structure, including:
the system comprises a creating unit, a data storage unit and a mapping unit, wherein the creating unit is used for responding to a data storage instruction and creating a node table and a relational mapping table according to data to be stored, the node table comprises node positions and key values corresponding to nodes, and the relational mapping table comprises node points and relations between the nodes and father nodes and child nodes of the nodes;
the first tree structure generating unit is used for generating a first tree structure according to the relationship mapping table, wherein the first tree structure comprises a root node, branch nodes and leaf nodes, and the root node, the branch nodes and the leaf nodes are associated and mapped with one another;
and the second tree structure generating unit is used for storing the data to be stored to the corresponding nodes of the first tree structure based on the node table to form a second tree structure and storing the second tree structure to a database.
On the other hand, an embodiment of the present invention provides a data access apparatus based on a tree structure, including:
the node acquisition unit is used for responding to the data access instruction and acquiring the node to be accessed according to the node position;
the target data acquisition unit is used for acquiring target data according to the node table corresponding to the node to be accessed and the relational mapping table;
and a target data output unit for outputting the target data in a specified mode.
In another aspect, an embodiment of the present invention provides a computer storage medium storing a computer program, which when executed by at least one processor implements the method of any one of the above.
The data storage and access method and device based on the tree structure provided by the embodiment of the invention create the node table and the relational mapping table based on the data to be stored, generate the first tree structure according to the mapping relational table, generate the second tree structure based on the node table, and can update the node data rapidly in real time; meanwhile, values corresponding to the nodes are classified, parameters and operations corresponding to the types can be quickly acquired during access, and the efficiency of data storage and access is greatly improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
FIG. 1 is a diagram illustrating a data storage method based on a tree structure according to an embodiment;
fig. 2 is a flowchart of a specific implementation of the data access method based on the tree structure according to the embodiment of the present invention;
figure 3 also provides a data storage device based on tree structure according to the embodiment of the present invention,
FIG. 4 is a block diagram of a data access device based on a tree structure according to an embodiment of the present invention
Fig. 5 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the specific embodiments of the present invention and the accompanying drawings. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the invention. 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.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
Referring to fig. 1, the present embodiment provides a data storage method based on a tree structure, including the following steps:
s101, responding to a data storage instruction, and creating a node table and a relational mapping table according to data to be stored;
the data to be stored is determined according to the received data storage instruction, and the data to be stored can be video data, audio data, character strings and the like.
After the data to be stored is determined, the data is classified to form data information required in a node table, and the node table comprises node names, node positions, key values corresponding to the nodes, classification of node values and the like. The information in the node table can be automatically inserted into the fields according to the requirements, or the fields are analyzed and classified according to the information contained in the data to be stored, or the fields are analyzed and processed according to the subsequent use.
ID name location value key kry type path
0
1
The relation mapping table comprises node direction, relations between nodes and father nodes and child nodes and the like;
Figure 1
s102, generating a first tree structure according to the relation mapping table;
after the data to be stored is processed to generate a node table and a relational mapping table, a frame of a tree structure of data storage, namely a first tree structure, is built based on the relational mapping table, and the first tree structure sets storage positions of different data and mapping relations among the data so as to store specific data at corresponding positions subsequently. The first data frame comprises a plurality of nodes, including a root node, branch nodes in the tree and leaf nodes, wherein the nodes and the nodes have mapping relations, the mapping relations are determined by adding father node information or son node information which is associated with each node, the nodes and the nodes form a hierarchy through the mapping relations, and the hierarchy is displayed through a tree structure according to a logical index relation.
S103, storing data to be stored to corresponding nodes of the first tree structure based on the node table to form a second tree structure, and storing the second tree structure to a database.
The method comprises the steps of acquiring information of data to be stored according to information in a node table on the basis of a first tree structure, disassembling the first tree structure to acquire each node and a corresponding mapping relation under the node, adding a data entry to be stored in the node table to a corresponding node in the first tree structure according to field content to generate a second tree structure, wherein the second tree structure comprises the node and data information corresponding to the node, such as a node name, a node position, a node path, a key value of the node, a type of a node value and data corresponding to the node. The second tree structure is stored in a database.
Specifically, in the second tree structure, the nodes include a root node, a branch node, and a leaf node, and the nodes are hierarchically indexed from the root node to the branch node and then indexed from the branch node to the leaf node, and the branch nodes may be further divided into multiple layers. When the node is a leaf node, the destination of the leaf node comprises the leaf node name, and the value is a corresponding determined value; when the node is a root node or a non-leaf node of a branch node, the key of the non-leaf node is a name set of all sub-nodes included in the non-leaf node, and the value of the non-leaf node is a value set of all sub-nodes included in the non-leaf node. And all the child nodes contained in the non-leaf nodes are the child nodes of the next layer mapped by the non-leaf nodes.
Specifically, the value corresponding to the node includes at least one type of private key, number, and text.
In particular, the node further comprises a parameter corresponding to the type of value corresponding to the node.
Fig. 2 is a flowchart of a specific implementation of the data access method based on the tree structure according to the embodiment of the present invention; the embodiment of the present invention further provides a data access method based on the data storage method, including:
s201, responding to a data access instruction, and acquiring a node to be accessed according to a node position;
when a user needs to access the nodes in the tree structure, an access instruction is triggered, the positions of the nodes are extracted according to information in the instruction, and the nodes with access are obtained. Specifically, the access instruction includes a node position of the node to be accessed, the node to be accessed is located in the first tree structure, and information such as a node name and a node key value of the node to be accessed is acquired.
S202, acquiring target data according to a node table corresponding to a node to be accessed and a relational mapping table;
in this step, a node table is queried according to the node information acquired in the step S201 and a relation mapping table to acquire a value and a type of the value corresponding to the node to be accessed, a parameter corresponding to the type of the value is acquired according to the value and the type of the value corresponding to the node to be accessed, and target data is acquired based on the parameter. S203, outputting the target data according to the designated mode.
Specifically, the type of the value includes any one of text, number, and key, and each type corresponds to a corresponding parameter and operation, for example, the key corresponds to a private key, a public key, an encryption algorithm, and the like.
S203, outputting the target data according to the designated mode.
After the target data is acquired in step S202, the target data is output in a designated mode or corresponding operations in the target data are executed according to the access instruction.
Specifically, the data searched according to the field in the node table to be accessed may include multiple items of content, for example, data with a client number of 001 is searched, a node value corresponding to the client number is a value of a digital type, and information with the same value, such as an account number, an application number, a loan code, and the like, of the client may be simultaneously searched according to the digital type, so that an output format needs to be defined here. In this embodiment, the content to be displayed may be set manually, for example, the data of the customer number 001 is inquired, and several items of information such as the customer number and the loan code are specified to be displayed. A default format may also be selected, for example, when the specific content to be displayed is not set, all the queried data information is displayed by default.
Specifically, in the data storage method and the data access method based on the tree structure, the method further includes verifying the authority of the data storage and access, and if the storage and the reading have the authority, completing the reading or the access. The authority can be verified in an account login mode, and the authority can also be verified in a key pairing mode.
The data storage and access method based on the tree structure provided by the embodiment of the invention is characterized in that a node table and a relational mapping table are created based on data to be stored, a first tree structure is generated according to the mapping relational table, a second tree structure is generated based on the node table, and node data can be updated rapidly in real time; meanwhile, values corresponding to the nodes are classified, parameters and operations corresponding to the types can be quickly acquired during access, and the efficiency of data storage and access is greatly improved.
Referring to fig. 3, fig. 3 is a diagram of a data storage device based on a tree structure according to an embodiment of the present invention, including:
a creating unit 301, configured to create, in response to a data storage instruction, a node table and a relationship mapping table according to data to be stored, where the node table includes node positions and key values corresponding to nodes, and the relationship mapping table includes node pointers, and relationships between nodes and parent nodes and child nodes thereof;
a first tree structure generating unit 302, configured to generate a first tree structure according to the relationship mapping table, where the first tree structure includes a root node, branch nodes, and leaf nodes, and the root node, the branch nodes, and the leaf nodes are associated and mapped with each other;
a second tree structure generating unit 303, configured to store data to be stored on a corresponding node of the first tree structure based on the node table to form a second tree structure, and store the second tree structure in a database.
Referring to fig. 4, fig. 4 is a diagram of a data access apparatus based on a tree structure according to an embodiment of the present invention, including:
a node obtaining unit 401, configured to respond to the data access instruction, and obtain a node to be accessed according to a node position;
a target data obtaining unit 402, configured to obtain target data according to a node table and a relation mapping table corresponding to a node to be accessed;
a target data output unit 403 for outputting the target data in a specified mode.
According to the data storage device and the data access device provided by the embodiment of the invention, the node table and the relational mapping table are created based on the data to be stored, the first tree structure is generated according to the mapping relational table, the second tree structure is generated based on the node table, and the node data can be updated rapidly in real time; meanwhile, values corresponding to the nodes are classified, parameters and operations corresponding to the types can be quickly acquired during access, and the efficiency of data storage and access is greatly improved.
Fig. 5 is a schematic structural diagram of a computer device according to an embodiment of the present invention, as shown in fig. 5, the device includes a processor 301, a memory 302, and a data bus 303, where the processor 301 and the memory 302 are communicatively connected through the bus 303;
the processor 301 calls the program instructions in the memory 302 to execute the methods provided by the above-mentioned embodiments of the methods, including: responding to a data storage instruction, creating a node table and a relational mapping table according to data to be stored, wherein the node table comprises node positions, key values corresponding to nodes and types of the node values, and the relational mapping table comprises node points and relations between the nodes and father nodes and child nodes of the nodes; generating a first tree structure according to the relationship mapping table, wherein the first tree structure comprises a root node, branch nodes and leaf nodes, and the root node, the branch nodes and the leaf nodes are mapped in an associated manner; and storing the data to be stored to the corresponding nodes of the first tree structure based on the node table to form a second tree structure, and storing the second tree structure to a database. When the node is a leaf node, the key comprises the node name of the leaf node, and the value is a corresponding value; when the node is a non-leaf node, the key is a set of names of all child nodes included in the non-leaf node, and the value is a set of values of all child nodes included in the non-leaf node. Responding to a data access instruction, and acquiring a node to be accessed according to the node position; acquiring target data according to a node table corresponding to the node to be accessed and the relational mapping table; and outputting the target data according to a specified mode.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, apparatus (device), or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (devices) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (10)

1. A data storage method based on a tree structure is characterized by comprising the following steps:
responding to a data storage instruction, creating a node table and a relational mapping table according to data to be stored, wherein the node table comprises node positions, key values corresponding to nodes and types of the node values, and the relational mapping table comprises node points and relations between the nodes and father nodes and child nodes of the nodes;
generating a first tree structure according to the relationship mapping table, wherein the first tree structure comprises a root node, branch nodes and leaf nodes, and the root node, the branch nodes and the leaf nodes are mapped in an associated manner;
and storing the data to be stored to the corresponding nodes of the first tree structure based on the node table to form a second tree structure, and storing the second tree structure to a database.
2. The method of claim 1, wherein the node corresponding key values in the node table are specifically:
when the node is a leaf node, the key comprises the node name of the leaf node, and the value is a corresponding value;
when the node is a non-leaf node, the key is a set of names of all child nodes included in the non-leaf node, and the value is a set of values of all child nodes included in the non-leaf node.
3. The method of claim 1, wherein the value corresponding to the node comprises at least one type of private key, number, text.
4. The method of claim 1, wherein the node further comprises a parameter corresponding to a type of value corresponding to the node.
5. A data access method based on the data storage method of the tree structure is characterized in that,
responding to a data access instruction, and acquiring a node to be accessed according to the node position;
acquiring target data according to a node table corresponding to the node to be accessed and the relational mapping table;
and outputting the target data according to a specified mode.
6. The method of claim 5, wherein the obtaining the target data according to the node table and the relation mapping table corresponding to the node to be accessed specifically comprises:
obtaining a value and a value type corresponding to a node to be accessed according to a node table and a relational mapping table corresponding to the node to be accessed, obtaining a parameter corresponding to the value type according to the value and the value type corresponding to the node to be accessed, and obtaining target data based on the parameter.
7. The method of claim 1, 5 or 6, wherein: and verifying the authority of the data storage and access, and if the storage and the reading have the authority, finishing the reading or the access.
8. A tree-based data storage device, comprising:
the system comprises a creating unit, a data storage unit and a mapping unit, wherein the creating unit is used for responding to a data storage instruction and creating a node table and a relational mapping table according to data to be stored, the node table comprises node positions and key values corresponding to nodes, and the relational mapping table comprises node points and relations between the nodes and father nodes and child nodes of the nodes;
the first tree structure generating unit is used for generating a first tree structure according to the relationship mapping table, wherein the first tree structure comprises a root node, branch nodes and leaf nodes, and the root node, the branch nodes and the leaf nodes are associated and mapped with one another;
and the second tree structure generating unit is used for storing the data to be stored to the corresponding nodes of the first tree structure based on the node table to form a second tree structure and storing the second tree structure to a database.
9. A tree-based data access apparatus, comprising:
the node acquisition unit is used for responding to the data access instruction and acquiring the node to be accessed according to the node position;
the target data acquisition unit is used for acquiring target data according to the node table corresponding to the node to be accessed and the relational mapping table;
and a target data output unit for outputting the target data in a specified mode.
10. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method of any of claims 1 to 7 are implemented by the processor when executing the computer program.
CN202010260902.4A 2020-04-03 2020-04-03 Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure Pending CN111475511A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010260902.4A CN111475511A (en) 2020-04-03 2020-04-03 Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010260902.4A CN111475511A (en) 2020-04-03 2020-04-03 Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure

Publications (1)

Publication Number Publication Date
CN111475511A true CN111475511A (en) 2020-07-31

Family

ID=71750541

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010260902.4A Pending CN111475511A (en) 2020-04-03 2020-04-03 Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure

Country Status (1)

Country Link
CN (1) CN111475511A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112579575A (en) * 2020-12-28 2021-03-30 超越科技股份有限公司 Method for quickly constructing database index structure
CN113282456A (en) * 2021-05-24 2021-08-20 北京京东振世信息技术有限公司 Data processing method and device
CN113590348A (en) * 2021-07-26 2021-11-02 京东科技控股股份有限公司 Parameter transmission method, device, equipment and medium based on tree structure

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050138052A1 (en) * 2003-12-22 2005-06-23 International Business Machines Corporation Method, computer program product, and system converting relational data into hierarchical data structure based upon tagging trees
US20090228500A1 (en) * 2008-03-07 2009-09-10 International Business Machines Corporation Relationship based tree structure with scoped parameters
KR20140060672A (en) * 2012-11-12 2014-05-21 스마트팩토리 주식회사 Method of merging data structures and apparatus for the same
EP3340071A1 (en) * 2016-12-23 2018-06-27 CompuGroup Medical SE Offline preparation for bulk inserts
CN109766337A (en) * 2018-11-28 2019-05-17 杭州云为科技有限公司 Storage method, electronic equipment, storage medium and the system of tree structure data
CN110134681A (en) * 2019-04-15 2019-08-16 平安科技(深圳)有限公司 Data storage and querying method, device, computer equipment and storage medium

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050138052A1 (en) * 2003-12-22 2005-06-23 International Business Machines Corporation Method, computer program product, and system converting relational data into hierarchical data structure based upon tagging trees
US20090228500A1 (en) * 2008-03-07 2009-09-10 International Business Machines Corporation Relationship based tree structure with scoped parameters
KR20140060672A (en) * 2012-11-12 2014-05-21 스마트팩토리 주식회사 Method of merging data structures and apparatus for the same
EP3340071A1 (en) * 2016-12-23 2018-06-27 CompuGroup Medical SE Offline preparation for bulk inserts
CN109766337A (en) * 2018-11-28 2019-05-17 杭州云为科技有限公司 Storage method, electronic equipment, storage medium and the system of tree structure data
CN110134681A (en) * 2019-04-15 2019-08-16 平安科技(深圳)有限公司 Data storage and querying method, device, computer equipment and storage medium

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112579575A (en) * 2020-12-28 2021-03-30 超越科技股份有限公司 Method for quickly constructing database index structure
CN113282456A (en) * 2021-05-24 2021-08-20 北京京东振世信息技术有限公司 Data processing method and device
CN113282456B (en) * 2021-05-24 2023-09-22 北京京东振世信息技术有限公司 Data processing method and device
CN113590348A (en) * 2021-07-26 2021-11-02 京东科技控股股份有限公司 Parameter transmission method, device, equipment and medium based on tree structure
CN113590348B (en) * 2021-07-26 2024-05-17 京东科技控股股份有限公司 Parameter transmission method, device, equipment and medium based on tree structure

Similar Documents

Publication Publication Date Title
CN111475511A (en) Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure
EP3608797A1 (en) Method for checking whether bim model file is changed
CN109241159B (en) Partition query method and system for data cube and terminal equipment
CN104035754A (en) XML (Extensible Markup Language)-based custom code generation method and generator
CN111324577B (en) Yml file reading and writing method and device
CN106611037A (en) Method and device for distributed diagram calculation
CN110515896B (en) Model resource management method, model file manufacturing method, device and system
CN106970958B (en) A kind of inquiry of stream file and storage method and device
CN106844288A (en) A kind of random string generation method and device
CN108415912A (en) Data processing method based on MapReduce model and equipment
CN109254962B (en) Index optimization method and device based on T-tree and storage medium
US20220076151A1 (en) Computer-implemented system and method having a digital twin and a graph-based structure
CN106599241A (en) Big data visual management method for GIS software
CN114239237A (en) Power distribution network simulation scene generation system and method supporting digital twinning
CN111125216B (en) Method and device for importing data into Phoenix
CN107391533A (en) Generate the method and device of graphic data base Query Result
CN109657060B (en) Safety production accident case pushing method and system
CN115543428A (en) Simulated data generation method and device based on strategy template
US8656410B1 (en) Conversion of lightweight object to a heavyweight object
CN110659286B (en) Dynamic space index method based on weakly balanced space tree and storage medium and device thereof
CN113986545A (en) Method and device for associating user with role
CN112749189A (en) Data query method and device
CN116484066B (en) Multi-class data processing method
CN113378184B (en) Method, apparatus and computer program product for data protection
CN117332543B (en) Distribution processing method for heterogeneous data sources of power grid

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