CN105353994A - Data storage method and device for three-dimensional structure and query method and device - Google Patents
Data storage method and device for three-dimensional structure and query method and device Download PDFInfo
- Publication number
- CN105353994A CN105353994A CN201510922879.XA CN201510922879A CN105353994A CN 105353994 A CN105353994 A CN 105353994A CN 201510922879 A CN201510922879 A CN 201510922879A CN 105353994 A CN105353994 A CN 105353994A
- Authority
- CN
- China
- Prior art keywords
- data
- dimensional structure
- key assignments
- checked
- floor height
- 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.)
- Granted
Links
Abstract
The invention provides a data storage method and a data storage device for a three-dimensional structure, a query method and a query device. The data storage method for the three-dimensional structure comprises the following steps: providing a structured array of the fixed size, wherein the subscript of the structured array respectively corresponds to different key assignments; acquiring the key value of every bit of the to-be-stored data by virtue of a preset function; respectively and correspondingly storing the to-be-stored data in the structured array matched with the key value of every bit of the to-be-stored data; and sequentially setting story height in the preset story height range for the to-be-stored data in the structured array. According to the data storage method and the data storage device for the three-dimensional structure, the query method and the query device disclosed by the invention, accurate data positioning is realized, and due to skip query, the data query efficiency is greatly improved.
Description
Technical field
The present invention relates to a kind of field of data storage, particularly relate to a kind of date storage method of three-dimensional structure, memory storage, querying method and inquiry unit.
Background technology
In the operational process of program, the access mode of data, the direct operational efficiency affecting program.In existing data store, the main method used is the thought of tree, and the realization of this method is not easy to understand, and certain difficulty that operates.
The method of other, the method for Hash table can be located accurately, but because there is redundancy, can not take refuge and occur identical key assignments possibility, and when searching later, carry out traveling through whole chained list, just can find required data, the time is increased.
The data storage and management method of present use, too loaded down with trivial details, complicated in the method realized.Understanding is got up very difficult, causes the growth of R&D cycle.In data search, insertion, need too much operation, cause the reduction of program efficiency.
Summary of the invention
The shortcoming of prior art in view of the above, the object of the present invention is to provide a kind of date storage method of three-dimensional structure, memory storage, querying method and inquiry unit, for solving the low problem of efficiency data query in prior art.
For achieving the above object and other relevant objects, the invention provides a kind of date storage method of three-dimensional structure, the date storage method of described three-dimensional structure comprises the following steps: the Array for structural body providing fixed size, the subscript key assignments that correspondence is different respectively of described Array for structural body; The key assignments of every data to be stored is obtained by preset function; By data to be stored respectively corresponding stored in the Array for structural body that the key assignments with every data to be stored matches; For the data to be stored in described Array for structural body set gradually the floor height meeting default floor height scope.
The invention provides a kind of data storage device of three-dimensional structure, the data storage device of described three-dimensional structure comprises: provide module, for providing the Array for structural body of fixed size, and the subscript key assignments that correspondence is different respectively of described Array for structural body; Key assignments acquisition module, for obtaining the key assignments treating every data to be stored by preset function; Preserve module, for by data to be stored respectively corresponding stored in the Array for structural body that the key assignments with every data to be stored matches; Floor height arranges module, for setting gradually for the data to be stored in described Array for structural body the floor height meeting default floor height scope.
The invention provides a kind of data enquire method of three-dimensional structure, the data enquire method institute data query of described three-dimensional structure is stored by the date storage method of three-dimensional structure as the aforementioned and is formed; The data enquire method of described three-dimensional structure comprises the following steps: the key assignments being obtained data to be checked by preset function; Obtain the Array for structural body corresponding with the key assignments of described data to be checked; In the structured data group corresponding with the key assignments of described data to be checked, inquire about according to size of data from top; When the current data inquiring current layer is greater than data to be checked, before current data, a data node jumps in the lower adjacent layer of floor height and inquires about.
In one embodiment of the invention, described data enquire method also comprises: when all data inquiring current layer are all less than data to be checked, jumps in the lower adjacent layer of floor height inquire about from the maximum data node of current layer.
In one embodiment of the invention, when inquiring about in the adjacent layer that floor height is lower, inquire about to the direction that data are larger from the back end of redirect according to size of data.
In one embodiment of the invention, described data enquire method also comprises: when the current data inquiring current layer is identical with data to be checked, determines that current data is data to be checked.
The invention provides a kind of data query arrangement of three-dimensional structure, the data query arrangement of described three-dimensional structure comprises: key assignments acquisition module, for being obtained the key assignments of data to be checked by preset function; Structured data acquisition module, for obtaining the Array for structural body corresponding with the key assignments of described data to be checked; Data inquiry module, in the structured data group corresponding with the key assignments of described data to be checked, inquires about according to size of data from top; Floor height handover module, during for being greater than data to be checked in the current data inquiring current layer, before current data, a data node jumps in the lower adjacent layer of floor height and inquires about.
In one embodiment of the invention, when described floor height handover module is also for being all less than data to be checked in all data inquiring current layer, jumps in the lower adjacent layer of floor height from the maximum data node of current layer and inquiring about.
In one embodiment of the invention, when described data inquiry module also for inquiring about in the adjacent layer that floor height is lower, inquire about to the direction that data are larger from the back end of redirect according to size of data.
In one embodiment of the invention, described data inquiry module also for when the current data inquiring current layer is identical with data to be checked, determines that current data is data to be checked.
As mentioned above, the date storage method of three-dimensional structure of the present invention, memory storage, querying method and inquiry unit, have following beneficial effect:
In date storage method of the present invention, querying method, by obtaining unique key assignments of data, and the floor height of bits per inch certificate is set, thus achieves orderly data storage; Like this when data query, by the Array for structural body that key assignments inquiry is corresponding, and achieve the quick position of data according to floor height difference, achieved the fast query of data by such mode, substantially increase the efficiency of data query.
Accompanying drawing explanation
Fig. 1 is shown as the schematic flow sheet of date storage method in an embodiment of three-dimensional structure of the present invention.
Fig. 2 is shown as the structural representation of data storage device in an embodiment of three-dimensional structure of the present invention.
Fig. 3 is shown as the schematic flow sheet of data enquire method in an embodiment of three-dimensional structure of the present invention.
Fig. 4 is shown as the schematic diagram of data enquire method in specific implementation of three-dimensional structure of the present invention.
Fig. 5 is shown as the structural representation of data query arrangement in an embodiment of three-dimensional structure of the present invention.
Element numbers explanation
The data storage device of 2 three-dimensional structures
21 provide module
22 key assignments acquisition modules
23 preserve module
24 floor heights arrange module
The data query arrangement of 4 three-dimensional structures
41 key assignments acquisition modules
42 structured data acquisition modules
43 data inquiry module
44 floor height handover modules
S11 ~ S14 step
S31 ~ S34 step
Embodiment
Below by way of specific instantiation, embodiments of the present invention are described, those skilled in the art the content disclosed by this instructions can understand other advantages of the present invention and effect easily.The present invention can also be implemented or be applied by embodiments different in addition, and the every details in this instructions also can based on different viewpoints and application, carries out various modification or change not deviating under spirit of the present invention.It should be noted that, when not conflicting, the feature in following examples and embodiment can combine mutually.
It should be noted that, the diagram provided in following examples only illustrates basic conception of the present invention in a schematic way, then only the assembly relevant with the present invention is shown in graphic but not component count, shape and size when implementing according to reality is drawn, it is actual when implementing, and the kenel of each assembly, quantity and ratio can be a kind of change arbitrarily, and its assembly layout kenel also may be more complicated.
As described in the background art, the data storage and management method used now is too loaded down with trivial details, complicated in the method realized, thus causes the search efficiency of data low.
And the present invention is by drawing some algorithm characteristics, shirtsleeve operation is carried out in the operation for data, realizes a kind of simple, understandable method, realize for data increasing, delete, change, look into work energy, thus reach the accurately process fast for data.
Refer to Fig. 1, the invention provides a kind of date storage method of three-dimensional structure, the date storage method of described three-dimensional structure comprises the following steps:
S11, provides the Array for structural body of fixed size, the subscript key assignments that correspondence is different respectively of described Array for structural body;
In a particular embodiment, the subscript (key assignments) of every Array for structural body is obtained by preset function;
S12, obtains the key assignments treating every data to be stored by preset function;
S13, by data to be stored respectively corresponding stored in the Array for structural body that the key assignments with every data to be stored matches;
S14, for the data to be stored in described Array for structural body set gradually the floor height meeting default floor height scope.
Be described in detail in conjunction with the storage means of embodiment to the present embodiment more below.
First the Array for structural body of fixed size is provided, such as can by Array for structural body the structure be set to shown in table 1, can certainly arrange according to the actual requirements, this should not limit the scope of the invention.
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
Table 1
The subscript of the Array for structural body shown in table 1 is the key assignments that we will be obtained by setting function.
The process of concrete acquisition key assignments is as follows: by setting a function, parameter is passed in function, carries out certain computing and obtains a unique key assignments.When design function, in order to access the overabundance of data after each node below preventing, obtaining key assignments function and preferably can realize being uniform distribution, avoiding like this occurring hanging up a large amount of data after some nodes, cause whole three-dimensional structure uneven.The function of setting can adopt existing function to realize, and does not repeat them here.
Because the data inserted inevitably there will be the identical data of key assignments, sequencedly be inserted into after current node to the operation of these data, produce an orderly chained list, and for each node be inserted in chained list produces a random floor height, but the floor height of current generation can not exceed the maximal value (the floor height upper limit that initial setting can be maximum) of floor height.
After being calculated parameter by setting function, the key assignments of acquisition must in the scope of array index.Here each Array for structural body member is a structure, and each member at least will comprise the pointer that is pointed to node below, after being convenient to produce key assignments, and data inserting after this node, also convenient index search backward.Such as:
Structname1{
Structname2*node；
intcurrent_level；
}arry[index]；
The mode of adding data after each node is the sequential chained lists having height, can realize jump and search when making to search data again by such design.Wherein, currentlevel value record be in sequential chained list after this key assignments, floor height maximum in all chained list members, but this floor height value can not exceed the MAX_LEVEL (setting the restriction of maximum floor height in this method) of maximum restriction.
Again during data inserting, after finding the point that will insert, need generation random floor height, the random data of generation preferably meets and distributes just very much, and can increase search efficient, stable like this, function is realized by oneself definition.When the floor height produced is greater than current maximum floor height, but when being no more than the maximum floor height of setting, upgrade existing maximum floor height.In addition, when deleting, after finding data, if the data of deleting are current maximum floor heights, after deletion, upgrade current maximum floor height.
Date storage method of the present invention, by a kind of 3 D stereo implementation, is first according to data acquisition key assignments; Next is when follow-up data inserting, for current data produces a random height, realizes inquiry of jumping after convenient.Achieved the orderly storage of data by such storage mode, for follow-up inquiry is provided convenience, thus greatly improve the efficiency of inquiry.
With reference to figure 2, the invention provides a kind of data storage device of three-dimensional structure, the data storage device of described three-dimensional structure comprises: provide module 21, key assignments acquisition module 22, preservation module 23 and floor height to arrange module 24.
The described module 21 that provides is for providing the Array for structural body of fixed size, and the subscript of described Array for structural body distinguishes corresponding different key assignments;
Described key assignments acquisition module 22 is for obtaining the key assignments treating every data to be stored by preset function;
Described preservation module 23 for by data to be stored respectively corresponding stored in the Array for structural body that the key assignments with every data to be stored matches;
Described floor height arranges module 24 for setting gradually for the data to be stored in described Array for structural body the floor height meeting default floor height scope.
Implementation procedure and the aforesaid date storage method of the data storage device of the present embodiment are similar, do not repeat them here.
The present invention also provides a kind of data enquire method of three-dimensional structure, and the data enquire method institute data query of described three-dimensional structure is stored by the date storage method of aforesaid three-dimensional structure and formed; With reference to figure 3, the data enquire method of described three-dimensional structure comprises the following steps:
S31, obtains the key assignments of data to be checked by preset function;
S32, obtains the Array for structural body corresponding with the key assignments of described data to be checked;
S33, in the structured data group corresponding with the key assignments of described data to be checked, inquires about according to size of data from top;
S34, when the current data inquiring current layer is greater than data to be checked, before current data, a data node jumps in the lower adjacent layer of floor height and inquires about.
In the present embodiment, when all data inquiring current layer are all less than data to be checked, jump in the lower adjacent layer of floor height from the maximum data node of current layer and inquire about.
Particularly, when inquiring about in the adjacent layer that floor height is lower, inquire about to the direction that data are larger from the back end of redirect according to size of data.When the adjacent layer that floor height is lower is inquired about, the size of same judgement current data and data to be checked, when current data is greater than data to be checked, before current data, a data node jumps to the lower adjacent layer of floor height, continue to inquire about to the direction that data are larger, repeat above-mentioned query script until when the current data that inquires current layer is identical with data to be checked, determine that current data is data to be checked.
Below in conjunction with specific embodiment, above-mentioned data enquire method is described further.
With reference to figure 4, what show is the data obtaining identical key assignments (array index), the situation of the sequential chained list formed after node, the level record in this chained list be the height of the * forward [] of the variable data array of current data, both subscripts of * forward [].
After storage, the Major Members of node:
Structname2{
Void*data；
Structname2*forward[]；
Intlevel；
}
Each node data storage method below as shown in Figure 4, searches data searching, until the data of looking for required for finding in layer from top downwards at every turn.Such as search 85, first have the maximal value (1) preset and a minimum value (-1), crossing the border to prevent from searching, being limited in this scope and searching.
Search and start to check from level3, once backward, when finding 37, judge larger than 37, less than 1, start from the node of 37 jump to lower one deck then from 37 backward compare, when finding level1 successively downwards, find 85 end.In the process of searching, because the type of data is indefinite, needs oneself design comparison function, compare the size of data inserting, produce an order chained list.
For another example, when we are in follow-up searching, if when will search data 32, we calculate a key assignments by the function of specifying, and go to search in the sequential chained list after can directly locking onto which node by this key assignments.After this chained list, start Fig. 4, go to search according to the mode of great-jump-forward, first start to be searched downwards by height from top (the top height this sequential chained list, this floor height value must be less than or equal to MAX_LEVEL (the maximum floor height of restriction)) of this node.When searching 32, in this figure, be three layers to the maximum, level3 relatively after 32 be greater than 21, be less than 37.Start to jump to level2 from 21 nodes, start backward to compare, find to be less than 37.Jumped downwards by the place of 21 data again, repeat, in the action of level2 layer, to compare backward, find the value equaling 32, then judge whether it is the value that will search.
The data enquire method of the present embodiment, first achieves the accurate location of data, then searches data at the follow-up great-jump-forward in process that relocates, more convenient and swift, promotes the execution efficiency of code.
With reference to figure 5, the present invention also provides a kind of data query arrangement of three-dimensional structure, and the data query arrangement of described three-dimensional structure comprises: key assignments acquisition module 41, structured data acquisition module 42, data inquiry module 43 and floor height handover module 44.
Described key assignments acquisition module 41 is for obtaining the key assignments of data to be checked by preset function; The key assignments acquisition module 41 of the present embodiment with reference to the key assignments acquisition module 22 in figure 2, can not repeat them here.
Described structured data acquisition module 42 is for obtaining the Array for structural body corresponding with the key assignments of described data to be checked;
Described data inquiry module 43, in the structured data group corresponding with the key assignments of described data to be checked, is inquired about according to size of data from top;
When described floor height handover module 44 is for being greater than data to be checked in the current data inquiring current layer, before current data, a data node jumps in the lower adjacent layer of floor height and inquires about.
In the present embodiment, when described floor height handover module 44 is also for being all less than data to be checked in all data inquiring current layer, jumps in the lower adjacent layer of floor height from the maximum data node of current layer and inquiring about.
When described data inquiry module 43 also for inquiring about in the adjacent layer that floor height is lower, inquire about to the direction that data are larger from the back end of redirect according to size of data.Repeat query script successively until when the current data inquiring current layer is identical with data to be checked, determine that current data is data to be checked.
The implementation procedure of the inquiry unit of the present embodiment with reference to the aforementioned detailed description about querying method, can not repeat them here.
In sum, the date storage method of three-dimensional structure of the present invention, memory storage, querying method and inquiry unit, implementation is simple, data manipulation accurately and fast; Not only achieve the accurate location of data, and searched by great-jump-forward, substantially increase the efficiency of data query.So the present invention effectively overcomes various shortcoming of the prior art and tool high industrial utilization.
Above-described embodiment is illustrative principle of the present invention and effect thereof only, but not for limiting the present invention.Any person skilled in the art scholar all without prejudice under spirit of the present invention and category, can modify above-described embodiment or changes.Therefore, such as have in art usually know the knowledgeable do not depart from complete under disclosed spirit and technological thought all equivalence modify or change, must be contained by claim of the present invention.
Claims (10)
1. a date storage method for three-dimensional structure, is characterized in that, the date storage method of described three-dimensional structure comprises the following steps:
There is provided the Array for structural body of fixed size, the subscript key assignments that correspondence is different respectively of described Array for structural body;
The key assignments of every data to be stored is obtained by preset function;
By data to be stored respectively corresponding stored in the Array for structural body that the key assignments with every data to be stored matches;
For the data to be stored in described Array for structural body set gradually the floor height meeting default floor height scope.
2. a data storage device for three-dimensional structure, is characterized in that, the data storage device of described three-dimensional structure comprises:
Module is provided, for providing the Array for structural body of fixed size, the subscript key assignments that correspondence is different respectively of described Array for structural body;
Key assignments acquisition module, for obtaining the key assignments treating every data to be stored by preset function;
Preserve module, for by data to be stored respectively corresponding stored in the Array for structural body that the key assignments with every data to be stored matches;
Floor height arranges module, for setting gradually for the data to be stored in described Array for structural body the floor height meeting default floor height scope.
3. a data enquire method for three-dimensional structure, is characterized in that, the data enquire method institute data query of described three-dimensional structure is stored by the date storage method of three-dimensional structure as claimed in claim 1 and formed; The data enquire method of described three-dimensional structure comprises the following steps:
The key assignments of data to be checked is obtained by preset function;
Obtain the Array for structural body corresponding with the key assignments of described data to be checked;
In the structured data group corresponding with the key assignments of described data to be checked, inquire about according to size of data from top;
When the current data inquiring current layer is greater than data to be checked, before current data, a data node jumps in the lower adjacent layer of floor height and inquires about.
4. the data enquire method of three-dimensional structure according to claim 3, it is characterized in that, described data enquire method also comprises: when all data inquiring current layer are all less than data to be checked, jumps in the lower adjacent layer of floor height inquire about from the maximum data node of current layer.
5. the data enquire method of the three-dimensional structure according to claim 3 or 4, is characterized in that, when inquiring about in the adjacent layer that floor height is lower, inquires about from the back end of redirect according to size of data to the direction that data are larger.
6. the data enquire method of three-dimensional structure according to claim 5, is characterized in that, described data enquire method also comprises: when the current data inquiring current layer is identical with data to be checked, determines that current data is data to be checked.
7. a data query arrangement for three-dimensional structure, is characterized in that, the data query arrangement of described three-dimensional structure comprises:
Key assignments acquisition module, for obtaining the key assignments of data to be checked by preset function;
Structured data acquisition module, for obtaining the Array for structural body corresponding with the key assignments of described data to be checked;
Data inquiry module, in the structured data group corresponding with the key assignments of described data to be checked, inquires about according to size of data from top;
Floor height handover module, during for being greater than data to be checked in the current data inquiring current layer, before current data, a data node jumps in the lower adjacent layer of floor height and inquires about.
8. the data query arrangement of three-dimensional structure according to claim 7, it is characterized in that, when described floor height handover module is also for being all less than data to be checked in all data inquiring current layer, jumps in the lower adjacent layer of floor height from the maximum data node of current layer and inquiring about.
9. the data query arrangement of the three-dimensional structure according to claim 7 or 8, it is characterized in that, when described data inquiry module also for inquiring about in the adjacent layer that floor height is lower, inquire about to the direction that data are larger from the back end of redirect according to size of data.
10. the data query arrangement of three-dimensional structure according to claim 9, is characterized in that, described data inquiry module also for when the current data inquiring current layer is identical with data to be checked, determines that current data is data to be checked.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510922879.XA CN105353994B (en) | 2015-12-11 | 2015-12-11 | Date storage method and device, the querying method and device of three-dimensional structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510922879.XA CN105353994B (en) | 2015-12-11 | 2015-12-11 | Date storage method and device, the querying method and device of three-dimensional structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105353994A true CN105353994A (en) | 2016-02-24 |
| CN105353994B CN105353994B (en) | 2019-10-22 |
Family
ID=55329972
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510922879.XA Active CN105353994B (en) | 2015-12-11 | 2015-12-11 | Date storage method and device, the querying method and device of three-dimensional structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105353994B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107656876A (en) * | 2017-10-19 | 2018-02-02 | 浪潮金融信息技术有限公司 | Date storage method and device, computer-readable recording medium, terminal |
| CN107678979A (en) * | 2017-10-19 | 2018-02-09 | 浪潮金融信息技术有限公司 | Date storage method and device |
| CN107766491A (en) * | 2017-10-18 | 2018-03-06 | 浪潮金融信息技术有限公司 | File memory method and device, computer-readable recording medium, terminal |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4555771A (en) * | 1978-08-31 | 1985-11-26 | Fujitsu Limited | Data processing system for data base management of matrix type data |
| US20020091704A1 (en) * | 1996-09-02 | 2002-07-11 | Rudolf Bayer | Database system and method of organizing an n-dimensional data set |
| CN102141992A (en) * | 2010-01-28 | 2011-08-03 | 广州市西美信息科技有限公司 | Method for storing and querying multidimensional database |
| CN103488727A (en) * | 2013-09-16 | 2014-01-01 | 河海大学 | Two-dimensional time-series data storage and query method based on periodic logs |
| CN103678520A (en) * | 2013-11-29 | 2014-03-26 | 中国科学院计算技术研究所 | Multi-dimensional interval query method and system based on cloud computing |
| US20150074084A1 (en) * | 2013-09-12 | 2015-03-12 | Neustar, Inc. | Method and system for performing query processing in a key-value store |
| CN104462434A (en) * | 2014-12-15 | 2015-03-25 | 北京国双科技有限公司 | Data inquiring method and device |
| CN104462328A (en) * | 2014-12-02 | 2015-03-25 | 深圳中科讯联科技有限公司 | Blended data management method and device based on Hash tables and dual-circulation linked list |
-
2015
- 2015-12-11 CN CN201510922879.XA patent/CN105353994B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4555771A (en) * | 1978-08-31 | 1985-11-26 | Fujitsu Limited | Data processing system for data base management of matrix type data |
| US20020091704A1 (en) * | 1996-09-02 | 2002-07-11 | Rudolf Bayer | Database system and method of organizing an n-dimensional data set |
| CN102141992A (en) * | 2010-01-28 | 2011-08-03 | 广州市西美信息科技有限公司 | Method for storing and querying multidimensional database |
| US20150074084A1 (en) * | 2013-09-12 | 2015-03-12 | Neustar, Inc. | Method and system for performing query processing in a key-value store |
| CN103488727A (en) * | 2013-09-16 | 2014-01-01 | 河海大学 | Two-dimensional time-series data storage and query method based on periodic logs |
| CN103678520A (en) * | 2013-11-29 | 2014-03-26 | 中国科学院计算技术研究所 | Multi-dimensional interval query method and system based on cloud computing |
| CN104462328A (en) * | 2014-12-02 | 2015-03-25 | 深圳中科讯联科技有限公司 | Blended data management method and device based on Hash tables and dual-circulation linked list |
| CN104462434A (en) * | 2014-12-15 | 2015-03-25 | 北京国双科技有限公司 | Data inquiring method and device |
Non-Patent Citations (5)
| Title |
|---|
| ADNAN YAZICI等: "A Multidimensional Index Structure for Similarity-Based Fuzzy Object Oriented Database Models", 《IEEE TRANSACTION ON FUZZY SYSTEMS》 * |
| DAVID EPPSTEIN等: "The Skip Quadtree: A Simple DynamicData Structure for Multidimensional Data", 《JOURNAL OF COMPUTERS》 * |
| 吴文虎等: "《世界大学生程序设计竞赛（ACM/ICPC）高级教程 第2册 程序设计中常用的解题策略》", 31 July 2012 * |
| 罗英伟等: "《Java数据结构与面向对象编程基础》", 31 August 2008 * |
| 黄健宏: "《Redis设计与实现》", 30 June 2014 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107766491A (en) * | 2017-10-18 | 2018-03-06 | 浪潮金融信息技术有限公司 | File memory method and device, computer-readable recording medium, terminal |
| CN107656876A (en) * | 2017-10-19 | 2018-02-02 | 浪潮金融信息技术有限公司 | Date storage method and device, computer-readable recording medium, terminal |
| CN107678979A (en) * | 2017-10-19 | 2018-02-09 | 浪潮金融信息技术有限公司 | Date storage method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105353994B (en) | 2019-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101365464B1 (en) | Data management system and method using database middleware | |
| CN105117417B (en) | A kind of memory database Trie tree indexing means for reading optimization | |
| Zhang et al. | Scalable skyline computation using object-based space partitioning | |
| CN104965686B (en) | Priority queue design method and priority queue design device | |
| CN105975587B (en) | A kind of high performance memory database index organization and access method | |
| KR20130020050A (en) | Apparatus and method for managing bucket range of locality sensitivie hash | |
| CN105447174A (en) | Report generation method and apparatus | |
| CN102915382A (en) | Method and device for carrying out data query on database based on indexes | |
| CN104598517A (en) | Storage and inquiry technology for tree structure table based on ordinary database | |
| CN104112008A (en) | Multi-table data association inquiry optimizing method and device | |
| CN105353994A (en) | Data storage method and device for three-dimensional structure and query method and device | |
| CN105677683A (en) | Batch data query method and device | |
| CN107784108A (en) | A kind of data storage and management method, device and equipment | |
| CN105991478A (en) | Server resource distribution method and system | |
| CN104636349A (en) | Method and equipment for compression and searching of index data | |
| CN105718319B (en) | A kind of memory pool domain analytic method and memory pool device | |
| WO2018052519A1 (en) | N-way hash join | |
| CN106021466A (en) | Data storage method and apparatus | |
| CN105357247A (en) | Multi-dimensional cloud resource interval finding method based on hierarchical cloud peer-to-peer network | |
| CN103544300B (en) | A kind of extensible storage index structure in cloud environment realize method | |
| KR101255639B1 (en) | Column-oriented database system and join process method using join index thereof | |
| CN101350010B (en) | Operation method of hash table | |
| CN103927325A (en) | URL (uniform resource locator) classifying method and device | |
| CN107239568A (en) | Distributed index implementation method and device | |
| CN104572876A (en) | Method and device for reading configuration file corresponding to software |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201104 Address after: 318015 no.2-3167, zone a, Nonggang City, no.2388, Donghuan Avenue, Hongjia street, Jiaojiang District, Taizhou City, Zhejiang Province Patentee after: Taizhou Jiji Intellectual Property Operation Co.,Ltd. Address before: 201616 Shanghai city Songjiang District Sixian Road No. 3666 Patentee before: Phicomm (Shanghai) Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210615 Address after: 310000 room 1704-2, building 2, dingchuang wealth center, Cangqian street, Yuhang District, Hangzhou City, Zhejiang Province Patentee after: Maitian Yunji (Hangzhou) Technology Co.,Ltd. Address before: 318015 no.2-3167, area a, nonggangcheng, 2388 Donghuan Avenue, Hongjia street, Jiaojiang District, Taizhou City, Zhejiang Province Patentee before: Taizhou Jiji Intellectual Property Operation Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 310026 room 1704-2, building 2, dingchuang wealth center, Cangqian street, Yuhang District, Hangzhou City, Zhejiang Province Patentee after: Maitian Digital Technology Group Co.,Ltd. Address before: 310000 room 1704-2, building 2, dingchuang wealth center, Cangqian street, Yuhang District, Hangzhou City, Zhejiang Province Patentee before: Maitian Yunji (Hangzhou) Technology Co.,Ltd. |