CN105786916B - A kind of storage method and system of the gradation directory based on large capacity table - Google Patents
A kind of storage method and system of the gradation directory based on large capacity table Download PDFInfo
- Publication number
- CN105786916B CN105786916B CN201410827977.0A CN201410827977A CN105786916B CN 105786916 B CN105786916 B CN 105786916B CN 201410827977 A CN201410827977 A CN 201410827977A CN 105786916 B CN105786916 B CN 105786916B
- Authority
- CN
- China
- Prior art keywords
- catalogue
- directory
- large capacity
- data block
- record
- 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.)
- Active
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses the storage methods and system of a kind of gradation directory based on large capacity table.This method comprises: identifying the object or catalogue is lowermost layer, and stores the object or catalogue by identifier is added before the initial of given path lowermost layer object or catalogue；Obtain the parent directory path of the object or catalogue, and judge whether the parent directory path is first layer, if it is not, then adding identifier before the initial of the catalogue in the parent directory path, identifying the parent directory path is lowermost layer, and stores the catalogue in the parent directory path.It is thereby achieved that the object and catalogue of same layer are centrally stored, and then efficiency is improved in retrieval.
Description
Technical field
The present invention relates to the storage method of field of cloud calculation more particularly to a kind of gradation directory based on large capacity table and it is
System.
Background technique
Traditional Relational DataBase is all poor for performance and the extendible capacity aspect of the data of tera-scale item number.Great Rong
Scale can accommodate PB grades of data, with the development of business, its quantity can decades of times grade growth.Although large capacity table solves
The limitation of capacity, but its catalogue or file be at storage side, the catalogue or file for the specific level being queried are random distributions
, this will lead to a large amount of continuous scanning and subsequent path parsing, to consume a large amount of IO and cpu resource.For example, to grab
The letter sequence taken is earlier, it is intermediate, rearward /bn1/a_dp1/a_dp2/b ,/bn1/a_dp1/mfile_dp2 ,/bn1/
For the path of a_dp1/z_dp2/z:
/bn1/a_dp1/a_dp2/b
....
/bn1/a_dp1/a_dp2/c/23/s
/bn1/a_dp1/ab_dp2/c/23/s
(centre shares 60,000,000,000 object records)
....
/bn1/a_dp1/mfile_dp2
....
/bn1/a_dp1/a_dp2/c/23/s
/bn1/a_dp1/ab_dp2/c/23/s
(centre shares 40,000,000,000 object records)
....
/bn1/a_dp1/z_dp2/z
If 10,000,000,000 object records can be stored on a server, there are 10 servers, for retrieval/bn1/a_
The next stage catalogue or file of dp1 is needed to 10 stopped with/bn1/a_dp1/a_dp2/b to/bn1/a_dp1/z_dp2/z
Server carries out full scan, and also needs the object name recorded to every to carry out classification parsing while scanning, to be truncated to
In this case 3rd level catalogue does subdirectory retrieval, needs the storage to 10 servers to do a full scan, to 100,000,000,000
Object record does character string interception, matching, a variety of operations of duplicate removal.Therefore, the catalogue storage mode of large capacity table, so that same
The catalogue and object of layer cannot be centrally stored, cause the efficiency in retrieval extremely low.
Summary of the invention
The technical problem to be solved by the present invention is to the catalogues of large capacity table and object storage mode, so that the catalogue of same layer
Cannot be centrally stored with object, cause the efficiency in retrieval extremely low.
According to an aspect of the present invention, a kind of storage method of gradation directory based on large capacity table is proposed, comprising:
Identifier will be added before the initial of given path lowermost layer object or catalogue, identifies the object or catalogue is minimum
Layer, and store the object or catalogue；
The parent directory path of the object or catalogue is obtained, and judges whether the parent directory path is first layer, if not
It is then to add identifier before the initial of the catalogue in the parent directory path, identifying the parent directory path is lowermost layer, and is deposited
Store up the catalogue in the parent directory path.
Further, the key (key) of object or catalogue as large capacity table, by number of objects corresponding to lower layer of the catalogue
Mesh is as value corresponding to the catalogue (value)；
When adding object, the corresponding value of the upper directory of the object is incremented by；
When deleting object, the key-value pair record of the object is first deleted, and the value of the upper directory of the object is passed
Subtract.
Further, it when adding object, if the upper directory of the object is not present, first creaties directory, and will be described
The corresponding value of catalogue is set as 1；
When deleting object, if the value of the upper directory of the object successively decrease after for 0, by the directory delete.
Further, the server that the home record of data block is stored with termination record and the data block is saved,
In, the data block includes the record of the object or catalogue in large capacity table；
In catalog or object, first passes through the home record of data block in metadata table and terminate record and find and want
The corresponding data block of catalogue or object of retrieval, then the server that the data block is stored is found, retrieve the server.
Further, the identifier is leading character, and object or the directory sorting for identifying same layer are preposition.
According to another aspect of the present invention, it is also proposed that a kind of storage system of the gradation directory based on large capacity table, comprising:
Processing module, for will add identifier before the initial of given path lowermost layer object or catalogue, it is described right to identify
As or catalogue be lowermost layer；The parent directory path of the object or catalogue is obtained, and judges whether the parent directory path is
One layer, if it is not, then adding identifier before the initial of the catalogue in the parent directory path, identifying the parent directory path is most
Low layer；
Memory module is used for storage object or catalogue.
Further, maintenance module, for using object or catalogue as the key of large capacity table, by lower layer of institute of the catalogue
Corresponding object number is as value corresponding to the catalogue；When adding object, the upper directory of the object is corresponding
Value is incremented by；When deleting object, the key-value pair record of the object is first deleted, and by the value of the upper directory of the object
Successively decrease.
Further, maintenance module is used for when adding object, if the upper directory of the object is not present, first creates mesh
Record, and 1 is set by the corresponding value of the catalogue；When deleting object, if the value of the upper directory of the object is passed
It is 0 after subtracting, then by the directory delete.
Further, logging modle, home record and termination for saving data block record and the data block is deposited
The server of storage, wherein the data block includes the record of the object or catalogue in large capacity table；
Wherein, it in catalog or object, first passes through the home record of data block in metadata table and terminates record and look for
To data block corresponding with the catalogue or object to be retrieved, then the server that the data block is stored is found, retrieves the clothes
Business device.
Further, the identifier is leading character, and object or the directory sorting for identifying same layer are preposition.
Compared with prior art, the present invention is by knowing mark-on before the initial of given path lowermost layer object or catalogue
Symbol, identifying the object or catalogue is lowermost layer, and stores the object or catalogue；Obtain the parent directory of the object or catalogue
Path, and judge whether the parent directory path is first layer, if it is not, then the parent directory path catalogue initial
Preceding plus identifier, identifying the parent directory path is lowermost layer, and stores the catalogue in the parent directory path.It is thereby achieved that
The object and catalogue of same layer are centrally stored, and then improve efficiency in retrieval.
By referring to the drawings to the detailed description of exemplary embodiment of the present invention, other feature of the invention and its
Advantage will become apparent.
Detailed description of the invention
The attached drawing for constituting part of specification describes the embodiment of the present invention, and together with the description for solving
Release the principle of the present invention.
The present invention can be more clearly understood according to following detailed description referring to attached drawing, in which:
Fig. 1 is that the present invention is based on the flow diagrams of one embodiment of the storage method of the gradation directory of large capacity table.
Fig. 2 is that the present invention is based on the structural schematic diagrams of one embodiment of the storage system of the gradation directory of large capacity table.
Fig. 3 is gradation directory of the present invention storage and prior art storage mode comparison diagram.
Specific embodiment
Carry out the various exemplary embodiments of detailed description of the present invention now with reference to attached drawing.It should also be noted that unless in addition having
Body explanation, the unlimited system of component and the positioned opposite of step, numerical expression and the numerical value otherwise illustrated in these embodiments is originally
The range of invention.
Simultaneously, it should be appreciated that for ease of description, the size of various pieces shown in attached drawing is not according to reality
Proportionate relationship draw.
Be to the description only actually of at least one exemplary embodiment below it is illustrative, never as to the present invention
And its application or any restrictions used.
Technology, method and apparatus known to person of ordinary skill in the relevant may be not discussed in detail, but suitable
In the case of, the technology, method and apparatus should be considered as authorizing part of specification.
It is shown here and discuss all examples in, any occurrence should be construed as merely illustratively, without
It is as limitation.Therefore, the other examples of exemplary embodiment can have different values.
It should also be noted that similar label and letter indicate similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined in a attached drawing, then in subsequent attached drawing does not need that it is further discussed.
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with specific embodiment, and reference
Attached drawing, the present invention is described in more detail.
Fig. 1 is that the present invention is based on the flow diagrams of one embodiment of the storage method of the gradation directory of large capacity table.
Method includes the following steps:
In step 110, will before the initial of given path lowermost layer object or catalogue plus identifier, identify the object or
Catalogue is lowermost layer, and stores the object or catalogue.
In step 120, the parent directory path of the object or catalogue is obtained, and judges whether the parent directory path is
One layer, if it is not, 130 are thened follow the steps, if so, thening follow the steps 140.
In step 130, identifier is added before the initial of the catalogue in the parent directory path, identifies the parent directory path
For lowermost layer, and store the catalogue in the parent directory path.
In step 140, no longer executes plus identifier is operated with storage.
Wherein, the identifier can be leading character, for example, character minimum value (Character.MIN-VALUE),
Character.MIN-VALUE is unprintable and display output a character in a computer, is easy for the sake of differentiating with Δ
It indicates, since system default presses endianness order, by adding leading character before object or catalogue initial, can be achieved with same
The object or directory sorting of layer are preposition, and continuously store together.It will be understood by those of skill in the art that Δ is only intended to lift
Example, can be identified with other any shapes in a computer, be should not be construed as limiting the invention.
By taking object/bucketname1/a_depth1/z_depth2/z as an example, bucketname1 is first layer, a_
Depth1 is the second layer, and z_depth2 is third layer, and z is lowermost layer, that is, the path of object or catalogue is from left to right followed successively by
One layer/second layer/third layer/four layer/.../n-th layer/lowermost layer, then object/bucketname1/a_depth1/z_
Output of the depth2/z by calculating are as follows:
/bucketname1/a_depth1/z_depth2/Δz
/bucketname1/a_depth1/Δz_depth2
/bucketname1/Δa_depth1
Since it is not object, so not adding identifier in first layer that first layer, which is memory paragraph (bucketname) layer,.
Same layer object or catalogue are stored together by the present invention, such as:
/bn1/Δa_dp1/
……
/bn1/a_dp1/Δa_dp2/
/bn1/a_dp1/Δab_dp2/
/bn1/a_dp1/Δmfile_dp2
/bn1/a_dp1/Δz_dp2/
……
/bn1/a_dp1/a_dp2/Δb
/bn1/a_dp1/a_dp2/Δc/
/bn1/a_dp1/ab_dp2/Δc/
……
/bn1/a_dp1/z_dp2/Δz
Wherein, with the catalogue that indicates of "/" ending, the expression object of no "/" ending.
Using metadata table, the case where large capacity table, is recorded, for example, object or catalogue exist in record large capacity table
Server and the storage condition in the data block of server, such as a data block size are 128M, and metadata table can be remembered
The home record of server and data block where record data block and termination record, can be quickly by the retrieval of metadata table
Navigate to the object for needing to inquire or catalogue.Wherein, metadata table can be individually placed on a server, can also be placed on more
On platform server.
Such as in retrieval/bn1/a_dp1/ next stage object or catalogue, of data block in metadata table is first passed through
Begin to record and terminate to record to find data block corresponding with the catalogue or object to be retrieved, then finds what the data block was stored
Server retrieves the server.
If there is 100,000,000,000 records in server, three layers of catalogue have 1,000,000 records, want I/O operation in the prior art
100000000000 times, and the I/O operation done required for the present invention is 1,000,000 times.
In addition, a variety of operations such as character string interception, matching, duplicate removal are done to 100,000,000,000 object records in the prior art, and
Object record of the invention only needs to remove leading character operation.
In an embodiment of the present invention, identifier, mark will be added before the initial of given path lowermost layer object or catalogue
The object or catalogue are lowermost layer, and store the object or catalogue；The parent directory path of the object or catalogue is obtained, and
Judge whether the parent directory path is first layer, if it is not, the then mark-on before the initial of the catalogue in the parent directory path
Know symbol, identifying the parent directory path is lowermost layer, and stores the catalogue in the parent directory path.It is thereby achieved that same layer
Object and catalogue it is centrally stored, and then retrieval when improve efficiency.
The key (key) of another embodiment of the invention, object or catalogue as large capacity table, the large capacity table are object
Directory hierarchy storage table, using object number corresponding to lower layer of the catalogue as value corresponding to the catalogue (value).
When adding object, the corresponding value of the upper directory of the object is incremented by, if the upper directory of the object is not deposited
It is then first createing directory, and set 1 for the corresponding value of the catalogue.
When deleting object, the key-value pair record of the object is first deleted, and the value of the upper directory of the object is passed
Subtract, if the value of the upper directory of the object successively decrease after for 0, by the directory delete.
In an embodiment of the present invention, it is indexed in TOC level, when deleting the object under a catalogue, if this catalogue
Lower is sky, then can delete together the catalogue；When increasing or deleting object, pass through the object under the catalogue after decomposing to each layer
Number add up or is successively decreased, and when number of objects under catalogue is 0 deletes the catalogue, in raising retrieval performance and memory capacity
The function to catalogue file additions and deletions maintenance management is realized simultaneously.
Fig. 2 is that the present invention is based on the structural schematic diagrams of one embodiment of the storage system of the gradation directory of large capacity table.
The system includes: processing module 210 and memory module 220.Wherein:
Processing module 210, for will be before the initial of given path lowermost layer object or catalogue plus identifier, described in mark
Object or catalogue are lowermost layer；Obtain the parent directory path of the object or catalogue, and judge the parent directory path whether be
First layer, if it is not, then adding identifier before the initial of the catalogue in the parent directory path, identifying the parent directory path is
Lowermost layer.
Memory module 220 is used for storage object or catalogue.
Wherein, the identifier can be leading character, for example, character minimum value (Character.MIN-VALUE),
Character.MIN-VALUE is unprintable and display output a character in a computer, is easy for the sake of differentiating with Δ
It indicates, since system default presses endianness order, by adding leading character before object or catalogue initial, can be achieved with same
The object or directory sorting of layer are preposition, and continuously store together.It will be understood by those of skill in the art that Δ is only intended to lift
Example, can be identified with other any shapes in a computer, be should not be construed as limiting the invention.
By taking object/bucketname1/a_depth1/z_depth2/z as an example, bucketname1 is first layer, a_
Depth1 is the second layer, and z_depth2 is third layer, and z is lowermost layer, that is, the path of object or catalogue is from left to right followed successively by
One layer/second layer/third layer/four layer/.../n-th layer/lowermost layer, then object/bucketname1/a_depth1/z_
Output of the depth2/z by calculating are as follows:
/bucketname1/a_depth1/z_depth2/Δz
/bucketname1/a_depth1/Δz_depth2
/bucketname1/Δa_depth1
Since it is not object, so not adding identifier in first layer that first layer, which is memory paragraph (bucketname) layer,.
Same layer object or catalogue are stored together by the present invention, such as:
/bn1/Δa_dp1/
……
/bn1/a_dp1/Δa_dp2/
/bn1/a_dp1/Δab_dp2/
/bn1/a_dp1/Δmfile_dp2
/bn1/a_dp1/Δz_dp2/
……
/bn1/a_dp1/a_dp2/Δb
/bn1/a_dp1/a_dp2/Δc/
/bn1/a_dp1/ab_dp2/Δc/
……
/bn1/a_dp1/z_dp2/Δz
Wherein, with the catalogue that indicates of "/" ending, the expression object of no "/" ending.
The system further includes logging modle 230, for saving the home record of data block and terminating record and the number
The server stored according to block, wherein the data block includes the record of the object or catalogue in large capacity table.The record mould
Block 230 can be metadata table.For example, a data block size is 128M, metadata table will record the service where data block
The home record of device and data block and termination record, can navigate to pair for needing to inquire by the retrieval of metadata table quickly
As or catalogue.Wherein, metadata table can be individually placed on a server, can also be placed on multiple servers.
Such as in retrieval/bn1/a_dp1/ next stage object or catalogue, of data block in metadata table is first passed through
Begin to record and terminate to record to find data block corresponding with the catalogue or object to be retrieved, then finds what the data block was stored
Server retrieves the server.
If there is 100,000,000,000 records in server, three layers of catalogue have 1,000,000 records, want I/O operation in the prior art
100000000000 times, and the I/O operation done required for the present invention is 1,000,000 times.
In addition, a variety of operations such as character string interception, matching, duplicate removal are done to 100,000,000,000 object records in the prior art, and
Object record of the invention only needs to remove leading character operation.
In an embodiment of the present invention, by the way that identifier will be added before the initial of given path lowermost layer object or catalogue,
It identifies the object or catalogue is lowermost layer；The parent directory path of the object or catalogue is obtained, and judges the parent directory road
Whether diameter is first layer, if it is not, then adding identifier before the initial of the catalogue in the parent directory path, identifies father's mesh
Record path is lowermost layer.It is thereby achieved that the object and catalogue of same layer are centrally stored, and then efficiency is improved in retrieval.
Another embodiment of the present invention, the system further include maintenance module 240, for using object or catalogue as large capacity
The key of table, which is object directory bedding storage table, using object number corresponding to lower layer of the catalogue as institute
Value corresponding to catalogue (value) is stated, when adding object, the corresponding value of the upper directory of the object is incremented by, if this is right
The upper directory of elephant is not present, then first creaties directory, and sets 1 for the corresponding value of the catalogue, when deleting object,
The key-value pair record of the object is first deleted, and the value of the upper directory of the object is successively decreased, if the upper layer mesh of the object
The value of record is 0 after successively decreasing, then by the directory delete.
In an embodiment of the present invention, it is indexed in TOC level, when deleting the object under a catalogue, if this catalogue
Lower is sky, then can delete together the catalogue；When increasing or deleting object, pass through the object under the catalogue after decomposing to each layer
Number add up or is successively decreased, and when number of objects under catalogue is 0 deletes the catalogue, in raising retrieval performance and memory capacity
The function to catalogue file additions and deletions maintenance management is realized simultaneously.
With a specific embodiment, the present invention will be further described below.
As shown in figure 3, be configured to first at 10 2 road intel E5-2640v2,128GB memory, 4T hard drive space clothes
Distributed data base is disposed on business device, then creates object directory bedding storage table on it.
When cloud storage user's upload object, first leading character is added to carry out to before the initial of path lowermost layer object or catalogue
Escape, then obtains the parent directory path of the object or catalogue, and judges whether the parent directory path is first layer, if not
It is then to add leading character to carry out escape before the initial of the catalogue in the parent directory path, and store the parent directory path
Catalogue, the object of same layer and catalogue is centrally stored.
When adding object, the corresponding value of the upper directory of the object is incremented by, if the upper directory of the object is not deposited
It is then first createing directory, and set 1 for the corresponding value of the catalogue, when deleting object, is first deleting the key of the object
Value is successively decreased to record, and by the value of the upper directory of the object, if after the value of the upper directory of the object successively decreases
It is 0, then by the directory delete.
Wherein, using metadata table, the case where object directory bedding storage table, is recorded, for example, record object mesh
Object or catalogue are in server and the storage condition in the data block of server in record bedding storage table.In catalog or
When object, the home record and termination record for first passing through data block in metadata table are found corresponding with the catalogue or object to be retrieved
Data block, then find the server that the data block is stored, retrieve the server.
In the prior art, catalog or when object, needs to do the storage of server full scan, and will be to institute
The catalogue or object of retrieval do a variety of operations such as character string interception, matching, duplicate removal.
In an embodiment of the present invention, compared with traditional database, the present invention need to only traverse a certain catalogue to be inquired
Or the data of object layer, also, catalogue or object record only need to remove leading character operation.Therefore, the present invention calculates and stores energy
Power is 10 times extending transversely, and what be can be convenient does lateral dilatation, compared to large capacity table default storage approach, recall precision
Improve 5 orders of magnitude.
So far, the present invention is described in detail.In order to avoid covering design of the invention, it is public that this field institute is not described
The some details known.Those skilled in the art as described above, completely it can be appreciated how implementing technology disclosed herein
Scheme.
Method and device of the invention may be achieved in many ways.For example, can by software, hardware, firmware or
Person's software, hardware, firmware any combination realize method and device of the invention.The step of for the method it is above-mentioned
Sequence is merely to be illustrated, and the step of method of the invention is not limited to sequence described in detail above, unless with other sides
Formula illustrates.In addition, in some embodiments, the present invention can be also embodied as recording program in the recording medium, these
Program includes for realizing machine readable instructions according to the method for the present invention.Thus, the present invention also covers storage for executing
The recording medium of program according to the method for the present invention.
Although some specific embodiments of the invention are described in detail by example, the skill of this field
Art personnel it should be understood that above example merely to being illustrated, the range being not intended to be limiting of the invention.The skill of this field
Art personnel are it should be understood that can without departing from the scope and spirit of the present invention modify to above embodiments.This hair
Bright range is defined by the following claims.
Claims (8)
1. a kind of storage method of the gradation directory based on large capacity table, comprising:
Identifier will be added before the initial of given path lowermost layer object or catalogue, identifies the object or catalogue is lowermost layer,
And store the object or catalogue；
The parent directory path of the object or catalogue is obtained, and judges whether the parent directory path is first layer, if it is not, then
Add identifier before the initial of the catalogue in the parent directory path, identifying the parent directory path is lowermost layer, and stores institute
State the catalogue in parent directory path；
Save the server that the home record of data block is stored with termination record and the data block, wherein the data
Block includes the record of the object or catalogue in large capacity table；
In catalog or object, first passes through the home record of data block in metadata table and terminate record and find and to retrieve
Catalogue or the corresponding data block of object, then find the server that the data block is stored, retrieve the server.
2. the storage method of the gradation directory according to claim 1 based on large capacity table, further includes:
The key key of object or catalogue as large capacity table, using object number corresponding to lower layer of the catalogue as the mesh
The corresponding value value of record；
When adding object, the corresponding value of the upper directory of the object is incremented by；
When deleting object, the key-value pair record of the object is first deleted, and the value of the upper directory of the object is successively decreased.
3. the storage method of the gradation directory according to claim 2 based on large capacity table, comprising:
It when adding object, if the upper directory of the object is not present, first creaties directory, and the catalogue is corresponding
Value is set as 1；
When deleting object, if the value of the upper directory of the object successively decrease after for 0, by the directory delete.
4. the storage method of the gradation directory according to any one of claims 1 to 3 based on large capacity table, comprising:
The identifier is leading character, and object or the directory sorting for identifying same layer are preposition.
5. a kind of storage system of the gradation directory based on large capacity table, comprising:
Processing module, for will before the initial of given path lowermost layer object or catalogue plus identifier, identify the object or
Catalogue is lowermost layer；The parent directory path of the object or catalogue is obtained, and judges whether the parent directory path is first layer,
If it is not, then adding identifier before the initial of the catalogue in the parent directory path, identifying the parent directory path is lowermost layer；
Memory module is used for storage object or catalogue；
Logging modle, the server for saving the home record of data block and termination records and the data block is stored,
Wherein, the data block includes the record of the object in large capacity table or catalogue；
Wherein, in catalog or object, first pass through data block in metadata table home record and terminate record find with
The corresponding data block of catalogue or object to be retrieved, then the server that the data block is stored is found, retrieve the server.
6. the storage system of the gradation directory according to claim 5 based on large capacity table, further includes:
Maintenance module, for using object or catalogue as the key key of large capacity table, by object corresponding to lower layer of the catalogue
Number is as value value corresponding to the catalogue；When adding object, the corresponding value of the upper directory of the object is incremented by；
When deleting object, the key-value pair record of the object is first deleted, and the value of the upper directory of the object is successively decreased.
7. the storage system of the gradation directory according to claim 6 based on large capacity table, comprising:
Maintenance module is used for when adding object, if the upper directory of the object is not present, is first creatied directory, and will be described
The corresponding value of catalogue is set as 1；When deleting object, if the value of the upper directory of the object successively decrease after for 0, will
The directory delete.
8. according to the storage system of any gradation directory based on large capacity table of claim 5 to 7, comprising:
The identifier is leading character, and object or the directory sorting for identifying same layer are preposition.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410827977.0A CN105786916B (en) | 2014-12-26 | 2014-12-26 | A kind of storage method and system of the gradation directory based on large capacity table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410827977.0A CN105786916B (en) | 2014-12-26 | 2014-12-26 | A kind of storage method and system of the gradation directory based on large capacity table |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105786916A CN105786916A (en) | 2016-07-20 |
| CN105786916B true CN105786916B (en) | 2019-11-12 |
Family
ID=56388918
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410827977.0A Active CN105786916B (en) | 2014-12-26 | 2014-12-26 | A kind of storage method and system of the gradation directory based on large capacity table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105786916B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109144991B (en) * | 2017-06-15 | 2021-09-14 | 北京京东尚科信息技术有限公司 | Method and device for dynamic sub-metering, electronic equipment and computer-storable medium |
| CN110797082A (en) * | 2019-10-24 | 2020-02-14 | 福建和瑞基因科技有限公司 | Method and system for storing and reading gene sequencing data |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101226552A (en) * | 2008-02-01 | 2008-07-23 | 北京乾坤化物数字技术有限公司 | Method for management of magnanimity information using directory composed of multidimensional structure tree |
| CN103870588A (en) * | 2014-03-27 | 2014-06-18 | 杭州朗和科技有限公司 | Method and device used in database |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4945475A (en) * | 1986-10-30 | 1990-07-31 | Apple Computer, Inc. | Hierarchical file system to provide cataloging and retrieval of data |
-
2014
- 2014-12-26 CN CN201410827977.0A patent/CN105786916B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101226552A (en) * | 2008-02-01 | 2008-07-23 | 北京乾坤化物数字技术有限公司 | Method for management of magnanimity information using directory composed of multidimensional structure tree |
| CN103870588A (en) * | 2014-03-27 | 2014-06-18 | 杭州朗和科技有限公司 | Method and device used in database |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105786916A (en) | 2016-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110268394A (en) | KVS tree | |
| CN103631842B (en) | For detecting the method and system of multiple row compound keys row set | |
| CN110291518A (en) | Merge tree garbage index | |
| CN110383261A (en) | Stream for multithread storage device selects | |
| CN110268399A (en) | Merging tree for attended operation is modified | |
| US10114846B1 (en) | Balanced distribution of sort order values for a multi-column sort order of a relational database | |
| CN104462185B (en) | A kind of digital library's cloud storage system based on mixed structure | |
| US20190065546A1 (en) | Multi stage aggregation using digest order after a first stage of aggregation | |
| US10860562B1 (en) | Dynamic predicate indexing for data stores | |
| CN107515879B (en) | Method and electronic equipment for document retrieval | |
| CN108509275A (en) | A kind of catalogue moving method and metadata load-balancing method | |
| AU2018290753B2 (en) | Systems and methods of creation and deletion of tenants within a database | |
| CN102169491B (en) | Dynamic detection method for multi-data concentrated and repeated records | |
| CN110888837B (en) | Object storage small file merging method and device | |
| US10664460B2 (en) | Index B-tree maintenance for linear sequential insertion | |
| CN104462527A (en) | Data deduplication method and device | |
| CN105160273A (en) | Knowledge management method based on access control and intelligent retrieval | |
| CN104008107A (en) | Implement method of knowledge base on operation and maintenance management | |
| CN105630923A (en) | Method for realizing archives administration informatization | |
| CN105786916B (en) | A kind of storage method and system of the gradation directory based on large capacity table | |
| CN108090186A (en) | A kind of electric power data De-weight method on big data platform | |
| CN108108478B (en) | Data format conversion method and system and electronic equipment | |
| WO2021082928A1 (en) | Data reduction method and apparatus, computing device, and storage medium | |
| CN104537023A (en) | Storage method and device for reverse index records | |
| JP2006092503A (en) | Multi-instance in-memory database |
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 |
Effective date of registration: 20220128 Address after: 100007 room 205-32, floor 2, building 2, No. 1 and No. 3, qinglonghutong a, Dongcheng District, Beijing Patentee after: Tianyiyun Technology Co.,Ltd. Address before: No.31, Financial Street, Xicheng District, Beijing, 100033 Patentee before: CHINA TELECOM Corp.,Ltd. |
|
| TR01 | Transfer of patent right |