CN106407303A - Data storage method and apparatus, and data query method and apparatus - Google Patents
Data storage method and apparatus, and data query method and apparatus Download PDFInfo
- Publication number
- CN106407303A CN106407303A CN201610772794.2A CN201610772794A CN106407303A CN 106407303 A CN106407303 A CN 106407303A CN 201610772794 A CN201610772794 A CN 201610772794A CN 106407303 A CN106407303 A CN 106407303A
- Authority
- CN
- China
- Prior art keywords
- node
- tree
- data
- storage structure
- depth
- 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
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/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data storage method and apparatus, and a data query method and apparatus. The data storage method comprises the steps of performing an initialization operation on mass data to establish the mass data into a tree-form storage structure; and establishing a database for the tree-form storage structure, wherein the database comprises a hierarchical mapping relation chart taking node depth as a main key. According to the technical scheme provided by the embodiments of the invention, the mass data is established into the tree-form storage structure; when the database is established for the tree-form storage structure, the hierarchical mapping relation chart taking the node depth as the main key is established in the database; and therefore, through the hierarchical storage mode, all nodes under a certain hierarchy can be rapidly searched when the data size is quite large.
Description
Technical field
The present invention relates to technical field of data processing, particularly to a kind of data storage, querying method and device.
Background technology
Developing rapidly with information technology, data explosion has become distinct issues, the storage of mass data with
Inquiring technology has been one of study hotspot in recent years.For example, certain large enterprise through long-run development, organizational structure is very huge
Greatly, organization node is even up to up to ten thousand, or even hundreds of thousands；For so huge organizational structure it is desirable to search wherein a certain
Organization node, according to traditional data base will be abnormal slow.
Below taking certain large enterprise as a example, introduce data storage of the prior art and querying method.As shown in table 1, it is
Table structure in data base for certain Company Organization：
Table 1
If it is intended to all of three levels of organization agency node can adopt following methods in inquiry table：
One, by the level function in data base, institutional all nodes are classified, are further taken out three-level node
All data, in the case of data volume is less, this method does not interfere with the speed of inquiry, but when data volume reaches one
Fixed rank, will be very time-consuming carrying out inquiry to data base, inefficiency.
Two, to be stored using redis and organization is stored as Storage Structure of Tree, it is possible to use redis's is distributed
The characteristic of caching is slower to solve the problems, such as mass data inquiry；The storage organization of this tree construction such as table 2 below (1) and table 2 (2) institute
Show：
Table 2 (1)
This method can quickly read institutional information using the fast advantage of redis read-write, but group loom
Structure often exists multistage, if all of organizational information of a certain level is it is necessary to travel through institute in organization to be inquired about
Some nodes, the institutional id of that level required for finding.When inquiring about mass data, this method is consumed
Time is exponentially increased, and leads to inefficiency.
Content of the invention
In view of this, it is an object of the invention to provide a kind of can quickly search mass data by being classified lookup mode
Data storage, querying method and device.
To achieve these goals, the invention provides a kind of date storage method, including：
Initialization operation is carried out to mass data, described mass data is built into Storage Structure of Tree；
Data base is built to described Storage Structure of Tree, described data base includes the classification with node depth for major key key
Mapping table.
Preferably, data base is built to described Storage Structure of Tree, including：
Using the id of each node in described Storage Structure of Tree as key, simultaneously with the sequence number of described node, corresponding
Father node id, title and node serial number, as key assignments value, to build node mapping table.
Preferably, data base is built to described Storage Structure of Tree, also include：
Using the node depth of described Storage Structure of Tree as key, simultaneously by the id of all nodes of same node depth
As value, to build depth map relation table, in order to according to described node depth come the id of query node, thus according to
The id of node inquires about described node mapping table.
Preferably, mass data is carried out initialization operation, specifically include：
Using database functions, described mass data is spliced into Storage Structure of Tree.
The present invention also provides a kind of data query method, and described querying method includes：
Obtain the node depth value of the Storage Structure of Tree of user input；
Corresponding node under described node depth is inquired about in described Storage Structure of Tree.
Preferably, described querying method also includes：
Travel through described Storage Structure of Tree, the id according to described node inquires about the corresponding all data of described node simultaneously.
The present invention also provides a kind of data storage device, and described device includes：
Initialization module, for carrying out initialization operation to mass data, described mass data is built into tree-like depositing
Storage structure；
Build module, for the hierarchy mapping including with node depth for major key key is built to described Storage Structure of Tree
The data base of relation table.
Preferably, described structure module includes：
First structure submodule, for using the id of each node in described Storage Structure of Tree as key, simultaneously with institute
Sequence number, corresponding father node id, title and the node serial number of stating node, as key assignments value, to build node mapping table.
Preferably, described structure module also includes：
Second structure submodule, for using the node depth of described Storage Structure of Tree as key, simultaneously by same node
The id of all nodes of depth, as value, to build depth map relation table, in order to be inquired about according to described node depth
The id of node, thus inquire about described node mapping table according to the id of node.
Preferably, described initialization module concrete configuration is, using database functions, described magnanimity tree evidence is spliced into tree
Shape storage organization.
The present invention also provides a kind of data query arrangement, and described device includes：
Acquisition module, for obtaining the node depth value of the Storage Structure of Tree of user input；
First enquiry module, for inquiring about corresponding node under described node depth in described Storage Structure of Tree.
Preferably, also including：
Second enquiry module, for traveling through described Storage Structure of Tree, the id according to described node inquires about described section simultaneously
The corresponding all data of point.
Compared with prior art, the invention has the advantages that：The technical scheme of the embodiment of the present invention is passed through institute
State mass data and be built into Storage Structure of Tree, and to Storage Structure of Tree build data base when, build in data base with
Node depth is the hierarchy mapping relation table of major key key, so that in data volume than larger by way of this classification storage
When, can quickly search all nodes under a certain level.
Brief description
Fig. 1 is the flow chart of the embodiment one of date storage method of the present invention；
Fig. 2 is the flow chart of the embodiment two of date storage method of the present invention；
Whether Fig. 3 is to judge the utilization rate of mobile terminal processor in the embodiment two of data query method of the present invention
The flow chart exceeding predetermined threshold value；
Fig. 4 is the schematic diagram of the embodiment one of data storage device of the present invention；
Fig. 5 is the schematic diagram of the embodiment two of data storage device of the present invention；
Fig. 6 is the schematic diagram of the embodiment of data query arrangement of the present invention.
Specific embodiment
With reference to the accompanying drawings and examples, the specific embodiment of the present invention is described in further detail.Hereinafter implement
Example is used for the present invention is described, but is not limited to the scope of the present invention.
Redis be one increase income write using ANSI C language, support network, can based on internal memory also can persistence day
Will type, Key-value data base, and provide the API of polyglot, redis to be a high performance key-value storage system
System.
Fig. 1 is the flow chart of the embodiment one of date storage method of the present invention, as shown in figure 1, the data of the present embodiment
Storage method, specifically may include steps of：
S101, carries out initialization operation to mass data, mass data is built into Storage Structure of Tree.
Specifically, mass data to be stored is initialized that is to say, that mass data is spliced into tree-like depositing
Storage structure is stored.
S102, builds data base to Storage Structure of Tree, and data base includes the hierarchy mapping with node depth for major key key
Relation table.
Specifically, be mass data Storage Structure of Tree based on build data base, the present embodiment is according to tree-like storage
The node of structure and hierarchical relationship, Storage Structure of Tree are split into the structure storage on multiple bases, what deserves to be explained is this
The hierarchy mapping relation table with node depth for major key key is included a bit in the structure on basis.So, when user is in inquiry one section
During point, can be inquired about according to node depth, the nodal information being inquired further according to node depth, further determined that node
Details, for mass data, this storage mode can rapidly find required node.
The technical scheme of the embodiment of the present invention by mass data is built into Storage Structure of Tree, and to tree-like storage
When structure builds data base, data base builds the hierarchy mapping relation table with node depth for major key key, by this point
Level storage mode so that data volume than larger when, can quickly search all nodes under a certain level.
Fig. 2 is the flow chart of the embodiment two of date storage method of the present invention, and the date storage method of the present embodiment exists
On the basis of above-described embodiment one, introduce technical scheme further in further detail.As shown in Fig. 2 the present embodiment
Date storage method, specifically may include steps of：
Mass data is spliced into Storage Structure of Tree using database functions by S201.
Specifically, using database functions, mass data to be stored is initialized, mass data is spliced into
Storage Structure of Tree is stored.
For example, the SQL statement of data base can be adopted to build Storage Structure of Tree, code is as follows：
S202, using the id of each node in Storage Structure of Tree as key, simultaneously with the sequence number of node, corresponding father
Node i d, title and node serial number, as key assignments value, to build node mapping table.As shown in table 3 (1)：
Table 3 (1)：
This node mapping table is consistent with constructed node mapping table in prior art, that is, consistent with table 2 (1).Should
Node mapping table, stores the details of each node.
S203, using the node depth of Storage Structure of Tree as key, simultaneously by the id of all nodes of same node depth
As value, to build depth map relation table, in order to inquire about the id of required node according to node depth, thus according to
The id query node mapping table of node.As shown in table 3 (2)：
Table 3 (2)：
Specifically, the embodiment of the present invention can be using node depth as key, and node i d is as value, so extra large in inquiry
When amount data, can be made a look up as key using node depth, first look for out all nodes of same level, then root
Further search for out the details of each node according to table 3 (1).For mass data, such storage mode, Neng Goushi
Now quickly search.
The technical scheme of the embodiment of the present invention utilizes existing redis storage model by the present invention, by tree-like storage knot
Structure splits into the structure storage on multiple bases, i.e. node mapping table, and the purpose of so storage is can be quickly classified to look into
Look for all nodes under a certain level of tree structure.
Fig. 3 is the flow chart of the embodiment one of data query method of the present invention.As shown in figure 3, the data of the present embodiment
Querying method, specifically may include steps of：
S301, obtains the node depth value of the Storage Structure of Tree of user input.
Specifically, the node depth according to user input, described in order to, in the node mapping table of table 3 (2), find
All nodes of the corresponding same level of node depth value.
S302, corresponding node under query node depth in Storage Structure of Tree.
S303, travels through Storage Structure of Tree, the corresponding all data of id query node according to node simultaneously.
Specifically, in addition it is also necessary to traversal Storage Structure of Tree after determining all nodes of a level, every to inquire about further
The corresponding all data of one node.
Below the querying method of three kinds of storage organizations in Redis is illustrated respectively：
As a example organization within by a large enterprise, the organization of enterprises is hierarchical, and each
Organization has the id of oneself, title (name), father node (parent_id), sequence number, affiliated as a single node
Level and level title.As shown in table 4：
Table 4：
For example,
1, with org:tree:level:The 0 key value storing in redis as root node, value is corresponding node id
Set, in table 4 for { 1,7,10 }
2, with org:tree:parentId:The key value of the storage of data structure that 1 is 1 as father node, value is all
Parent_id is the set of the id of 1 node, in table 4 for { 2,5 }.
3, with org:tree:id:The 3 key values storing as agency information, value is the org object that id is 3
Map, in table 4 for<id,3>,<Name, organization 111>,<parent_id,2>,<order_no,3>}
Data query method classification using the present embodiment is searched, for example, if all data of 2 grades of nodes will be inquired about,
Using redis order in table 3 (2) shown in node mapping table in search：smembers(org:tree:level:2) obtain
The data got is { 3,4,6 }, then travels through returning result again, in the node mapping table shown in that is, in table 3 (1), passes through
Id inquires about all agency informations.Classification can quickly be realized search.
The technical scheme of the embodiment of the present invention by mass data is built into Storage Structure of Tree, and to tree-like storage
When structure builds data base, data base builds the hierarchy mapping relation table with node depth for major key key, by this point
Level storage mode so that data volume than larger when, can quickly search all nodes under a certain level.
Fig. 4 is the schematic diagram of the embodiment one of data storage device of the present invention, as shown in figure 4, the data of the present embodiment
Storage device, specifically can include initialization module 41 and build module 42.
Initialization module 41, for carrying out initialization operation to mass data, mass data is built into tree-like storage
Structure；
Build module 42, close for Storage Structure of Tree is built with the hierarchy mapping including with node depth for major key key
It is the data base of table.
The data storage device of the present embodiment, realizes machine by using above-mentioned module data is carried out with rapid classification lookup
System is identical with the realization mechanism of the date storage method of above-mentioned embodiment illustrated in fig. 1, may be referred in detail implement shown in above-mentioned Fig. 1
The record of example, will not be described here.
Fig. 5 is the schematic diagram of the embodiment two of data storage device of the present invention, and the data storage device of the present embodiment exists
On the basis of embodiment as shown in Figure 4, introduce technical scheme further in further detail.As shown in figure 5, at this
In the data storage device of embodiment：
Build module 42 to include：
First structure submodule 421, for using the id of each node in Storage Structure of Tree as key, simultaneously to save
The sequence number of point, corresponding father node id, title and node serial number, as key assignments value, to build node mapping table.
Build module 42 also to include：
Second structure submodule 422, for using the node depth of Storage Structure of Tree as key, simultaneously by same node
The id of all nodes of depth, as value, to build depth map relation table, in order to according to node depth come query node
Id, thus the id query node mapping table according to node.
Initialization module 41 concrete configuration is, using database functions, magnanimity tree evidence is spliced into Storage Structure of Tree.
The data storage device of the present embodiment, realizes machine by using above-mentioned module data is carried out with rapid classification lookup
System is identical with the realization mechanism of the date storage method of above-mentioned embodiment illustrated in fig. 2, may be referred in detail implement shown in above-mentioned Fig. 2
The record of example, will not be described here.
Fig. 6 is the schematic diagram of the embodiment of data query arrangement of the present invention, as shown in fig. 6, the data of the present embodiment is looked into
Ask device, specifically can include acquisition module 61, the first enquiry module 62 and the second enquiry module 63.
Acquisition module 61, for obtaining the node depth value of the Storage Structure of Tree of user input；
First enquiry module 62, for corresponding node under query node depth in Storage Structure of Tree.
Second enquiry module 63, for traveling through Storage Structure of Tree, the corresponding institute of id query node according to node simultaneously
There is data.
The data query arrangement of the present embodiment, realizes machine by using above-mentioned module data is carried out with rapid classification inquiry
System is corresponding with the realization mechanism of the data query method of above-mentioned embodiment illustrated in fig. 1, may be referred to real shown in above-mentioned Fig. 1 in detail
Apply the record of example, will not be described here.
Above example is only the exemplary embodiment of the present invention, is not used in the restriction present invention, protection scope of the present invention
It is defined by the claims.Those skilled in the art can make respectively to the present invention in the essence and protection domain of the present invention
Plant modification or equivalent, this modification or equivalent also should be regarded as being within the scope of the present invention.
Claims (12)
1. a kind of date storage method is it is characterised in that methods described includes：
Initialization operation is carried out to mass data, described mass data is built into Storage Structure of Tree；
Data base is built to described Storage Structure of Tree, described data base includes the hierarchy mapping with node depth for major key key
Relation table.
2. method according to claim 1 it is characterised in that to described Storage Structure of Tree build data base, including：
Using the id of each node in described Storage Structure of Tree as key, saved with the sequence number of described node, corresponding father simultaneously
Point id, title and node serial number, as key assignments value, to build node mapping table.
3. method according to claim 2, it is characterised in that building data base to described Storage Structure of Tree, also includes：
Using the node depth of described Storage Structure of Tree as key, simultaneously using the id of all nodes of same node depth as
Value, to build depth map relation table, in order to according to described node depth come the id of query node, thus according to node
Id inquire about described node mapping table.
4. method according to claim 1, it is characterised in that mass data is carried out initialization operation, specifically includes：
Using database functions, described mass data is spliced into Storage Structure of Tree.
5. a kind of data query method is it is characterised in that methods described includes：
Obtain the node depth value of the Storage Structure of Tree of user input；
Corresponding node under described node depth is inquired about in described Storage Structure of Tree.
6. method according to claim 5 is it is characterised in that also include：
Travel through described Storage Structure of Tree, the id according to described node inquires about the corresponding all data of described node simultaneously.
7. a kind of data storage device is it is characterised in that described device includes：
Initialization module, for carrying out initialization operation to mass data, described mass data is built into tree-like storage knot
Structure；
Build module, for the hierarchy mapping relation including with node depth for major key key is built to described Storage Structure of Tree
The data base of table.
8. device according to claim 7 is it is characterised in that described structure module includes：
First structure submodule, for using the id of each node in described Storage Structure of Tree as key, simultaneously with described section
The sequence number of point, corresponding father node id, title and node serial number, as key assignments value, to build node mapping table.
9. device according to claim 8 is it is characterised in that described structure module also includes：
Second structure submodule, for using the node depth of described Storage Structure of Tree as key, simultaneously by same node depth
All nodes id as value, to build depth map relation table, in order to according to described node depth come query node
Id, thus described node mapping table is inquired about according to the id of node.
10. device according to claim 7 is it is characterised in that described initialization module concrete configuration is to adopt data base
Described magnanimity tree evidence is spliced into Storage Structure of Tree by function.
A kind of 11. data query arrangement are it is characterised in that described device includes：
Acquisition module, for obtaining the node depth value of the Storage Structure of Tree of user input；
First enquiry module, for inquiring about corresponding node under described node depth in described Storage Structure of Tree.
12. devices according to claim 11 are it is characterised in that also include：
Second enquiry module, for traveling through described Storage Structure of Tree, the id according to described node inquires about described node pair simultaneously
The all data answered.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610772794.2A CN106407303A (en) | 2016-08-30 | 2016-08-30 | Data storage method and apparatus, and data query method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610772794.2A CN106407303A (en) | 2016-08-30 | 2016-08-30 | Data storage method and apparatus, and data query method and apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106407303A true CN106407303A (en) | 2017-02-15 |
Family
ID=58003032
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610772794.2A Pending CN106407303A (en) | 2016-08-30 | 2016-08-30 | Data storage method and apparatus, and data query method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106407303A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107329942A (en) * | 2017-06-28 | 2017-11-07 | 深圳市康必达中创科技有限公司 | Report form generation method and device based on tree structure |
| CN107741833A (en) * | 2017-10-30 | 2018-02-27 | 广东乐心医疗电子股份有限公司 | Storage method and device of nestable key-value |
| CN108334563A (en) * | 2018-01-09 | 2018-07-27 | 北京明略软件系统有限公司 | A kind of method and device of data query |
| CN108694219A (en) * | 2017-04-12 | 2018-10-23 | 腾讯科技（深圳）有限公司 | A kind of data processing method and device |
| CN108875028A (en) * | 2018-06-22 | 2018-11-23 | 福建南威软件有限公司 | A kind of searching method of pair of resource |
| CN109471894A (en) * | 2018-10-29 | 2019-03-15 | 深圳市瑞驰信息技术有限公司 | A kind of system and method for novel decentralized file and the unified storage of object |
| CN109657114A (en) * | 2018-08-21 | 2019-04-19 | 国家计算机网络与信息安全管理中心 | A method of extracting webpage semi-structured data |
| CN109766312A (en) * | 2019-01-07 | 2019-05-17 | 深圳大学 | A kind of block chain storage method, system, device and computer readable storage medium |
| CN110309144A (en) * | 2018-03-22 | 2019-10-08 | 北京新媒传信科技有限公司 | A kind of method and device with redis building tree form data structure |
| CN110325977A (en) * | 2017-03-20 | 2019-10-11 | 阿列克谢·彼得罗维奇·塞梅诺夫 | Electronic databank and its generation method |
| CN110333846A (en) * | 2019-06-18 | 2019-10-15 | 国云科技股份有限公司 | A kind of method of the cleer and peaceful assembling data father and son upper and lower relation list of quick thread |
| CN110377603A (en) * | 2019-06-28 | 2019-10-25 | 中信百信银行股份有限公司 | Date storage method and device |
| CN111026962A (en) * | 2019-12-03 | 2020-04-17 | 泰康保险集团股份有限公司 | Hierarchical relation query response time reduction method, server and user front end |
| US10853341B2 (en) | 2019-06-28 | 2020-12-01 | Advanced New Technologies Co., Ltd. | Blockchain based hierarchical data storage |
| WO2020258853A1 (en) * | 2019-06-28 | 2020-12-30 | 创新先进技术有限公司 | Blockchain-based hierarchical storage method and apparatus, and electronic device |
| CN114491172A (en) * | 2022-04-07 | 2022-05-13 | 深圳竹云科技股份有限公司 | Method, device and equipment for quickly searching tree structure nodes and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1553645A (en) * | 2003-05-30 | 2004-12-08 | 华为技术有限公司 | Method for realizing panel point scattering process of scattering branch |
| US20050010606A1 (en) * | 2003-07-11 | 2005-01-13 | Martin Kaiser | Data organization for database optimization |
| CN103473267A (en) * | 2013-08-09 | 2013-12-25 | 深圳市中科新业信息科技发展有限公司 | Data storage query method and system |
| CN103605797A (en) * | 2013-12-05 | 2014-02-26 | 用友软件股份有限公司 | Data storage and inquiry devices and data storage and inquiry methods |
| CN105404634A (en) * | 2014-09-15 | 2016-03-16 | 南京理工大学 | Key-Value data block based data management method and system |
-
2016
- 2016-08-30 CN CN201610772794.2A patent/CN106407303A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1553645A (en) * | 2003-05-30 | 2004-12-08 | 华为技术有限公司 | Method for realizing panel point scattering process of scattering branch |
| US20050010606A1 (en) * | 2003-07-11 | 2005-01-13 | Martin Kaiser | Data organization for database optimization |
| CN103473267A (en) * | 2013-08-09 | 2013-12-25 | 深圳市中科新业信息科技发展有限公司 | Data storage query method and system |
| CN103605797A (en) * | 2013-12-05 | 2014-02-26 | 用友软件股份有限公司 | Data storage and inquiry devices and data storage and inquiry methods |
| CN105404634A (en) * | 2014-09-15 | 2016-03-16 | 南京理工大学 | Key-Value data block based data management method and system |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110325977A (en) * | 2017-03-20 | 2019-10-11 | 阿列克谢·彼得罗维奇·塞梅诺夫 | Electronic databank and its generation method |
| CN108694219A (en) * | 2017-04-12 | 2018-10-23 | 腾讯科技（深圳）有限公司 | A kind of data processing method and device |
| CN107329942A (en) * | 2017-06-28 | 2017-11-07 | 深圳市康必达中创科技有限公司 | Report form generation method and device based on tree structure |
| CN107741833A (en) * | 2017-10-30 | 2018-02-27 | 广东乐心医疗电子股份有限公司 | Storage method and device of nestable key-value |
| CN108334563A (en) * | 2018-01-09 | 2018-07-27 | 北京明略软件系统有限公司 | A kind of method and device of data query |
| CN110309144A (en) * | 2018-03-22 | 2019-10-08 | 北京新媒传信科技有限公司 | A kind of method and device with redis building tree form data structure |
| CN108875028A (en) * | 2018-06-22 | 2018-11-23 | 福建南威软件有限公司 | A kind of searching method of pair of resource |
| CN109657114A (en) * | 2018-08-21 | 2019-04-19 | 国家计算机网络与信息安全管理中心 | A method of extracting webpage semi-structured data |
| CN109657114B (en) * | 2018-08-21 | 2023-11-03 | 国家计算机网络与信息安全管理中心 | Method for extracting webpage semi-structured data |
| CN109471894B (en) * | 2018-10-29 | 2021-12-24 | 深圳市瑞驰信息技术有限公司 | Novel system and method for uniformly storing distributed files and objects |
| CN109471894A (en) * | 2018-10-29 | 2019-03-15 | 深圳市瑞驰信息技术有限公司 | A kind of system and method for novel decentralized file and the unified storage of object |
| CN109766312A (en) * | 2019-01-07 | 2019-05-17 | 深圳大学 | A kind of block chain storage method, system, device and computer readable storage medium |
| CN110333846A (en) * | 2019-06-18 | 2019-10-15 | 国云科技股份有限公司 | A kind of method of the cleer and peaceful assembling data father and son upper and lower relation list of quick thread |
| CN110333846B (en) * | 2019-06-18 | 2022-12-06 | 国云科技股份有限公司 | Method for quickly clearing and assembling data parent-child context list |
| US10853341B2 (en) | 2019-06-28 | 2020-12-01 | Advanced New Technologies Co., Ltd. | Blockchain based hierarchical data storage |
| WO2020258853A1 (en) * | 2019-06-28 | 2020-12-30 | 创新先进技术有限公司 | Blockchain-based hierarchical storage method and apparatus, and electronic device |
| US11030175B2 (en) | 2019-06-28 | 2021-06-08 | Advanced New Technologies Co., Ltd. | Blockchain based hierarchical data storage |
| US11288247B2 (en) | 2019-06-28 | 2022-03-29 | Advanced New Technologies Co., Ltd. | Blockchain based hierarchical data storage |
| CN110377603A (en) * | 2019-06-28 | 2019-10-25 | 中信百信银行股份有限公司 | Date storage method and device |
| CN111026962A (en) * | 2019-12-03 | 2020-04-17 | 泰康保险集团股份有限公司 | Hierarchical relation query response time reduction method, server and user front end |
| CN111026962B (en) * | 2019-12-03 | 2023-09-22 | 泰康保险集团股份有限公司 | Hierarchical relation query response time reduction method, server and user front end |
| CN114491172A (en) * | 2022-04-07 | 2022-05-13 | 深圳竹云科技股份有限公司 | Method, device and equipment for quickly searching tree structure nodes and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106407303A (en) | Data storage method and apparatus, and data query method and apparatus | |
| US8700605B1 (en) | Estimating rows returned by recursive queries using fanout | |
| US10073876B2 (en) | Bloom filter index for device discovery | |
| US20150293958A1 (en) | Scalable data structures | |
| US10915532B2 (en) | Supporting a join operation against multiple NoSQL databases | |
| US11556534B2 (en) | Subquery predicate generation to reduce processing in a multi-table join | |
| US20180144061A1 (en) | Edge store designs for graph databases | |
| CN111258978A (en) | Data storage method | |
| CN105574054A (en) | Distributed cache range query method, apparatus and system | |
| CN106547646B (en) | Data backup and recovery method and data backup and recovery device | |
| US8015195B2 (en) | Modifying entry names in directory server | |
| CN103440249A (en) | System and method for rapidly searching unstructured data | |
| CN113190645A (en) | Index structure establishing method, device, equipment and storage medium | |
| CN101963993B (en) | Method for fast searching database sheet table record | |
| CN109815238A (en) | The dynamic adding method and device of database are realized with strict balanced binary tree | |
| US11847121B2 (en) | Compound predicate query statement transformation | |
| CN116348868A (en) | Metadata indexing for information management | |
| CN106250443A (en) | The method and system of data base's complex text inquiry are solved based on internal memory full-text search | |
| US20180144060A1 (en) | Processing deleted edges in graph databases | |
| US11645283B2 (en) | Predictive query processing | |
| US11586604B2 (en) | In-memory data structure for data access | |
| CN112685557B (en) | Visual information resource management method and device | |
| CN110609926A (en) | Data tag storage management method and device | |
| CN105159899A (en) | Searching method and searching device | |
| US11841857B2 (en) | Query efficiency using merged columns |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170215 |