CN105786916A - High-capacity table-based hierarchical directory storage method and system - Google Patents
High-capacity table-based hierarchical directory storage method and system Download PDFInfo
- Publication number
- CN105786916A CN105786916A CN201410827977.0A CN201410827977A CN105786916A CN 105786916 A CN105786916 A CN 105786916A CN 201410827977 A CN201410827977 A CN 201410827977A CN 105786916 A CN105786916 A CN 105786916A
- Authority
- CN
- China
- Prior art keywords
- catalogue
- directory
- data block
- record
- large copacity
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a high-capacity table-based hierarchical directory storage method and system. The method comprises the following steps: adding an identifier in front of the initial of a lowest-level object or directory with a given path so as to identify the object or directory as the lowest level, and storing the object or directory; and obtaining a parent directory path of the object or director, judging whether the parent directory path is the first layer, if the judging result is negative, adding an identifier in front of the initial of a directory of the parent directory path so as to identify the parent directory path as the lowest layer, and storing the directory of the parent directory path. According to the method and system disclosed in the invention, the object and the directory of the same layer are intensively stored so that the efficiency is improved during the search.
Description
Technical field
The present invention relates to field of cloud calculation, particularly relate to the storage method and system of a kind of gradation directory based on Large Copacity table.
Background technology
Traditional Relational DataBase is all poor for performance and the extendible capacity aspect of the data of TERA-SCALE bar number.Large Copacity table can hold the data of PB level, and along with the development of business, its quantity can the growth of decades of times level.Although Large Copacity table solves appearance quantitative limitation, but its catalogue or file are when storage side, and catalogue or the file of the specific level being queried are random distributions, and this can cause substantial amounts of continuous scanning, and path subsequently resolves, thus consuming a large amount of IO and cpu resource.Such as, for capture letter sequence earlier, middle, rearward /bn1/a_dp1/a_dp2/b ,/bn1/a_dp1/mfile_dp2 ,/bn1/a_dp1/z_dp2/z path:
/bn1/a_dp1/a_dp2/b
....
/bn1/a_dp1/a_dp2/c/23/s
/bn1/a_dp1/ab_dp2/c/23/s
(centre has 60,000,000,000 object record)
....
/bn1/a_dp1/mfile_dp2
....
/bn1/a_dp1/a_dp2/c/23/s
/bn1/a_dp1/ab_dp2/c/23/s
(centre has 40,000,000,000 object record)
....
/bn1/a_dp1/z_dp2/z
If 10,000,000,000 object record can be deposited on a station server, there are 10 station servers, next stage catalogue or file for retrieval/bn1/a_dp1, need to carry out full scan to with/bn1/a_dp1/a_dp2/b to/bn1/a_dp1/z_dp2/z 10 station servers stopped, and also need to the object name of every record is carried out classification parsing while scanning, to be truncated to 3rd level catalogue, like this do a subdirectory retrieval, need the storage of 10 station servers is done a full scan, 100,000,000,000 object record are done character string intercepting, coupling, the multiple computing of duplicate removal.Therefore, the catalogue storage mode of Large Copacity table so that the catalogue of same layer and object can not centralized stores, cause when retrieval extremely inefficient.
Summary of the invention
The technical problem to be solved in the present invention is catalogue and the object storage mode of Large Copacity table so that the catalogue of same layer and object can not centralized stores, cause when retrieval extremely inefficient.
According to an aspect of the present invention, it is proposed to a kind of storage method of gradation directory based on Large Copacity table, including:
Before the initial of given path lowermost layer object or catalogue, add identifier, identify described object or catalogue is lowermost layer, and store described object or catalogue；
Obtain the parent directory path of described object or catalogue, and judge whether described parent directory path is ground floor, if it is not, then before the initial of the catalogue in described parent directory path, add identifier, identifying described parent directory path is lowermost layer, and stores the catalogue in described parent directory path.
Further, object or catalogue are as the key (key) of Large Copacity table, using object number corresponding for described catalogue next layer as the value (value) corresponding to described catalogue；
When adding object, the value that the upper directory of this object is corresponding is incremented by；
When deleting object, first delete the key-value pair record of this object, and the value of the upper directory of described object is successively decreased.
Further, when adding object, if the upper directory of this object is absent from, then first create directory, and value corresponding for described catalogue is set to 1；
When deleting object, if the value of the upper directory of this object is 0 after successively decreasing, then by described directory delete.
Further, preserving the home record of data block and terminate record and the stored server of described data block, wherein, described data block includes the record of the object in Large Copacity table or catalogue；
When catalog or object, first pass through the home record of data block in metadata table and find the data block corresponding with the catalogue to retrieve or object with terminating record, then find the stored server of described data block, retrieve described server.
Further, described identifier is leading character, and object or the directory sorting of mark same layer are preposition.
According to a further aspect in the invention, it is also proposed that the storage system of a kind of gradation directory based on Large Copacity table, including:
Processing module, for adding identifier before the initial by given path lowermost layer object or catalogue, identifies described object or catalogue is lowermost layer；Obtaining the parent directory path of described object or catalogue, and judge whether described parent directory path is ground floor, if it is not, then add identifier before the initial of the catalogue in described parent directory path, identifying described parent directory path is lowermost layer；
Memory module, is used for storing object or catalogue.
Further, maintenance module, for using key as Large Copacity table of object or catalogue, using object number corresponding for described catalogue next layer as the value corresponding to described catalogue；When adding object, the value that the upper directory of this object is corresponding is incremented by；When deleting object, first delete the key-value pair record of this object, and the value of the upper directory of described object is successively decreased.
Further, maintenance module is for when adding object, if the upper directory of this object is absent from, then first createing directory, and value corresponding for described catalogue is set to 1；When deleting object, if the value of the upper directory of this object is 0 after successively decreasing, then by described directory delete.
Further, logging modle, for preserving the home record of data block and terminating record and the stored server of described data block, wherein, described data block includes the record of the object in Large Copacity table or catalogue；
Wherein, when catalog or object, first pass through the home record of data block in metadata table and find the data block corresponding with the catalogue to retrieve or object with terminating record, then find the stored server of described data block, retrieve described server.
Further, described identifier is leading character, and object or the directory sorting of mark same layer are preposition.
Compared with prior art, the present invention, by adding identifier before the initial by given path lowermost layer object or catalogue, identifies described object or catalogue is lowermost layer, and store described object or catalogue；Obtain the parent directory path of described object or catalogue, and judge whether described parent directory path is ground floor, if it is not, then before the initial of the catalogue in described parent directory path, add identifier, identifying described parent directory path is lowermost layer, and stores the catalogue in described parent directory path.It is thereby achieved that the object of same layer and catalogue centralized stores, and then improve efficiency when retrieval.
By referring to the accompanying drawing detailed description to the exemplary embodiment of the present invention, the further feature of the present invention and advantage thereof will be made apparent from.
Accompanying drawing explanation
The accompanying drawing of the part constituting description describes embodiments of the invention, and is used for together with the description explaining principles of the invention.
With reference to accompanying drawing, according to detailed description below, it is possible to be more clearly understood from the present invention, wherein:
Fig. 1 is the present invention schematic flow sheet based on an embodiment of the storage method of the gradation directory of Large Copacity table.
Fig. 2 is the present invention structural representation based on an embodiment of the storage system of the gradation directory of Large Copacity table.
Fig. 3 is gradation directory of the present invention storage and prior art storage mode comparison diagram.
Detailed description of the invention
The various exemplary embodiments of the present invention are described in detail now with reference to accompanying drawing.It should also be noted that unless specifically stated otherwise, the parts otherwise set forth in these embodiments and positioned opposite, the numerical expression of step and numerical value do not limit the scope of the invention.
Simultaneously, it should be appreciated that for the ease of describing, the size of the various piece shown in accompanying drawing is not draw according to actual proportionate relationship.
Description only actually at least one exemplary embodiment is illustrative below, never as any restriction to the present invention and application or use.
The known technology of person of ordinary skill in the relevant, method and apparatus are likely to be not discussed in detail, but in the appropriate case, described technology, method and apparatus should be considered to authorize a part for description.
Shown here with in all examples discussed, any occurrence should be construed as merely exemplary, not as restriction.Therefore, other example of exemplary embodiment can have different values.
It should also be noted that similar label and letter below figure represent similar terms, therefore, once a certain Xiang Yi accompanying drawing is defined, then it need not be further discussed in accompanying drawing subsequently.
For making the object, technical solutions and advantages of the present invention clearly understand, below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in more detail.
Fig. 1 is the present invention schematic flow sheet based on an embodiment of the storage method of the gradation directory of Large Copacity table.The method comprises the following steps:
In step 110, before the initial of given path lowermost layer object or catalogue, add identifier, identify described object or catalogue is lowermost layer, and store described object or catalogue.
In step 120, obtain the parent directory path of described object or catalogue, and judge whether described parent directory path is ground floor, if it is not, then perform step 130, if so, then perform step 140.
In step 130, adding identifier before the initial of the catalogue in described parent directory path, identifying described parent directory path is lowermost layer, and stores the catalogue in described parent directory path.
In step 140, no longer perform to add identifier and storage operation.
Wherein, described identifier can be leading character, such as, character minima (Character.MIN-VALUE), Character.MIN-VALUE is a unprintable character with display output in a computer, it is easy to represent with Δ for the purpose of resolution, owing to system default presses endianness order, by adding leading character before object or catalogue initial, can be achieved with the object of same layer or directory sorting is preposition, and store together continuously.It will be understood by those of skill in the art that Δ is only intended to citing, can identify by other any shapes in a computer, should not be construed as limitation of the present invention.
For object/bucketname1/a_depth1/z_depth2/z, bucketname1 is ground floor, a_depth1 is the second layer, z_depth2 is third layer, z is lowermost layer, that is, the path of object or catalogue be from left to right followed successively by the ground floor/second layer/third layer/four layer/.../n-th layer/lowermost layer, then object/bucketname1/a_depth1/z_depth2/z is output as through calculating:
/bucketname1/a_depth1/z_depth2/Δz
/bucketname1/a_depth1/Δz_depth2
/bucketname1/Δa_depth1
Due to, ground floor is memory paragraph (bucketname) layer, is not object, so not adding identifier at ground floor.
Same layer object or catalogue are stored together by the present invention, for instance:
/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, catalogue is represented with what "/" ended up, without the expression object of "/" ending.
Utilize metadata table, the situation of Large Copacity table is recorded, such as, in record Large Copacity table, object or catalogue are at server and the storage condition in the data block of server, such as a data block size is 128M, metadata table can record the server at data block place and the home record of data block and terminate record, can quickly be navigated to the object or catalogue that need inquiry by the retrieval of metadata table.Wherein, metadata table can individually be placed on a station server, it is also possible to is placed on multiple servers.
Such as when the next stage object of retrieval/bn1/a_dp1/ or catalogue, first pass through the home record of data block in metadata table and find the data block corresponding with the catalogue to retrieve or object with terminating record, find the stored server of described data block again, retrieve described server.
If there being 100,000,000,000 records in server, three layers catalogue has 1,000,000 records, wants I/O operation 100,000,000,000 times, and the I/O operation to do required for the present invention is 1,000,000 times in prior art.
It addition, 100,000,000,000 object record are done in prior art the multiple computings such as character string intercepting, coupling, duplicate removal, and the object record of the present invention only needs to remove leading character operation.
In an embodiment of the present invention, before the initial of given path lowermost layer object or catalogue, add identifier, identify described object or catalogue is lowermost layer, and store described object or catalogue；Obtain the parent directory path of described object or catalogue, and judge whether described parent directory path is ground floor, if it is not, then before the initial of the catalogue in described parent directory path, add identifier, identifying described parent directory path is lowermost layer, and stores the catalogue in described parent directory path.It is thereby achieved that the object of same layer and catalogue centralized stores, and then improve efficiency when retrieval.
An alternative embodiment of the invention, object or catalogue are as the key (key) of Large Copacity table, this Large Copacity table is object directory Bedding storage table, using object number corresponding for described catalogue next layer as the value (value) corresponding to described catalogue.
When adding object, the value that the upper directory of this object is corresponding is incremented by, if the upper directory of this object is absent from, then first creaties directory, and value corresponding for described catalogue is set to 1.
When deleting object, first delete the key-value pair record of this object, and the value of the upper directory of described object is successively decreased, if the value of the upper directory of this object is 0 after successively decreasing, then by described directory delete.
In an embodiment of the present invention, indexing at TOC level, when deleting the object under a catalogue, if being empty under this catalogue, then this catalogue can be deleted in the lump；When increasing or delete object, undertaken cumulative by the number of objects under the catalogue after each layer is decomposed or successively decrease, and the number of objects under catalogue deletes this catalogue when being 0, it is simultaneously achieved the function to catalogue file additions and deletions maintenance management what improve retrieval performance and memory capacity.
Fig. 2 is the present invention structural representation based on an embodiment of the storage system of the gradation directory of Large Copacity table.This system includes: processing module 210 and memory module 220.Wherein:
Processing module 210, for adding identifier before the initial by given path lowermost layer object or catalogue, identifies described object or catalogue is lowermost layer；Obtaining the parent directory path of described object or catalogue, and judge whether described parent directory path is ground floor, if it is not, then add identifier before the initial of the catalogue in described parent directory path, identifying described parent directory path is lowermost layer.
Memory module 220, is used for storing object or catalogue.
Wherein, described identifier can be leading character, such as, character minima (Character.MIN-VALUE), Character.MIN-VALUE is a unprintable character with display output in a computer, it is easy to represent with Δ for the purpose of resolution, owing to system default presses endianness order, by adding leading character before object or catalogue initial, can be achieved with the object of same layer or directory sorting is preposition, and store together continuously.It will be understood by those of skill in the art that Δ is only intended to citing, can identify by other any shapes in a computer, should not be construed as limitation of the present invention.
For object/bucketname1/a_depth1/z_depth2/z, bucketname1 is ground floor, a_depth1 is the second layer, z_depth2 is third layer, z is lowermost layer, that is, the path of object or catalogue be from left to right followed successively by the ground floor/second layer/third layer/four layer/.../n-th layer/lowermost layer, then object/bucketname1/a_depth1/z_depth2/z is output as through calculating:
/bucketname1/a_depth1/z_depth2/Δz
/bucketname1/a_depth1/Δz_depth2
/bucketname1/Δa_depth1
Due to, ground floor is memory paragraph (bucketname) layer, is not object, so not adding identifier at ground floor.
Same layer object or catalogue are stored together by the present invention, for instance:
/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, catalogue is represented with what "/" ended up, without the expression object of "/" ending.
This system also includes logging modle 230, and for preserving the home record of data block and terminating record and the stored server of described data block, wherein, described data block includes the record of the object in Large Copacity table or catalogue.Described logging modle 230 can be metadata table.Such as, a data block size is 128M, and metadata table can record the server at data block place and the home record of data block and terminate record, can quickly be navigated to the object or catalogue that need inquiry by the retrieval of metadata table.Wherein, metadata table can individually be placed on a station server, it is also possible to is placed on multiple servers.
Such as when the next stage object of retrieval/bn1/a_dp1/ or catalogue, first pass through the home record of data block in metadata table and find the data block corresponding with the catalogue to retrieve or object with terminating record, find the stored server of described data block again, retrieve described server.
If there being 100,000,000,000 records in server, three layers catalogue has 1,000,000 records, wants I/O operation 100,000,000,000 times, and the I/O operation to do required for the present invention is 1,000,000 times in prior art.
It addition, 100,000,000,000 object record are done in prior art the multiple computings such as character string intercepting, coupling, duplicate removal, and the object record of the present invention only needs to remove leading character operation.
In an embodiment of the present invention, by adding identifier before the initial of given path lowermost layer object or catalogue, identify described object or catalogue is lowermost layer；Obtaining the parent directory path of described object or catalogue, and judge whether described parent directory path is ground floor, if it is not, then add identifier before the initial of the catalogue in described parent directory path, identifying described parent directory path is lowermost layer.It is thereby achieved that the object of same layer and catalogue centralized stores, and then improve efficiency when retrieval.
Another embodiment of the present invention, this system also includes maintenance module 240, for using key as Large Copacity table of object or catalogue, this Large Copacity table is object directory Bedding storage table, using object number corresponding for described catalogue next layer as the value (value) corresponding to described catalogue, when adding object, the value that the upper directory of this object is corresponding is incremented by, if the upper directory of this object is absent from, then first create directory, and value corresponding for described catalogue is set to 1, when deleting object, first delete the key-value pair record of this object, and the value of the upper directory of described object is successively decreased, if the value of the upper directory of this object is 0 after successively decreasing, then by described directory delete.
In an embodiment of the present invention, indexing at TOC level, when deleting the object under a catalogue, if being empty under this catalogue, then this catalogue can be deleted in the lump；When increasing or delete object, undertaken cumulative by the number of objects under the catalogue after each layer is decomposed or successively decrease, and the number of objects under catalogue deletes this catalogue when being 0, it is simultaneously achieved the function to catalogue file additions and deletions maintenance management what improve retrieval performance and memory capacity.
With a specific embodiment, the present invention will be further described below.
As it is shown on figure 3, first dispose distributed data base on 10 servers being configured to 2 road intelE5-2640v2,128GB internal memories, 4T hard drive space, then create object directory Bedding storage table thereon.
When cloud storage user's upload object, first carry out escape to adding leading character before the initial of path lowermost layer object or catalogue, then the parent directory path of described object or catalogue is obtained, and judge whether described parent directory path is ground floor, if not, before the initial of the catalogue in described parent directory path, then add leading character carry out escape, and store the catalogue in described parent directory path, by the object of same layer and catalogue centralized stores.
When adding object, the value that the upper directory of this object is corresponding is incremented by, if the upper directory of this object is absent from, then first create directory, and value corresponding for described catalogue is set to 1, when deleting object, first delete the key-value pair record of this object, and the value of the upper directory of described object is successively decreased, if the value of the upper directory of this object is 0 after successively decreasing, then by described directory delete.
Wherein, utilize metadata table, the situation of object directory Bedding storage table be recorded, for instance, in record object directory Bedding storage table, object or catalogue are at server and the storage condition in the data block of server.When catalog or object, first pass through the home record of data block in metadata table and find the data block corresponding with the catalogue to retrieve or object with terminating record, then find the stored server of described data block, retrieve described server.
In prior art, when catalog or object, it is necessary to a full scan is done in the storage of server, and the catalogue retrieved or object are done the multiple computings such as character string intercepting, coupling, duplicate removal.
In an embodiment of the present invention, compared with traditional database, the present invention only need to travel through the data of a certain catalogue or the object layer to inquire about, and, catalogue or object record only need to remove leading character operation.Therefore, the present invention calculates and storage capacity is extending transversely 10 times, and can do horizontal dilatation easily, and compared to Large Copacity table default storage approach, its recall precision improves 5 orders of magnitude.
So far, the present invention is described in detail.In order to avoid covering the design of the present invention, it does not have describe details more known in the field.Those skilled in the art are as described above, complete it can be appreciated how implement technical scheme disclosed herein.
It is likely to be achieved in many ways the method for the present invention and device.Such as, can by software, hardware, firmware or software, hardware, firmware any combination realize method and the device of the present invention.For the said sequence of step of described method merely to illustrate, the step of the method for the present invention is not limited to order described in detail above, unless specifically stated otherwise.Additionally, in certain embodiments, can being also record program in the recording medium by the invention process, these programs include the machine readable instructions for realizing the method according to the invention.Thus, the present invention also covers the record medium of the storage program for performing the method according to the invention.
Although some specific embodiments of the present invention being described in detail already by example, but it should be appreciated by those skilled in the art, above example is merely to illustrate, rather than in order to limit the scope of the present invention.It should be appreciated by those skilled in the art, can without departing from the scope and spirit of the present invention, above example be modified.The scope of the present invention be defined by the appended claims.
Claims (10)
1. based on a storage method for the gradation directory of Large Copacity table, including:
Before the initial of given path lowermost layer object or catalogue, add identifier, identify described object or catalogue is lowermost layer, and store described object or catalogue；
Obtain the parent directory path of described object or catalogue, and judge whether described parent directory path is ground floor, if it is not, then before the initial of the catalogue in described parent directory path, add identifier, identifying described parent directory path is lowermost layer, and stores the catalogue in described parent directory path.
2. the storage method of the gradation directory based on Large Copacity table according to claim 1, also includes:
Object or catalogue are as the key (key) of Large Copacity table, using object number corresponding for described catalogue next layer as the value (value) corresponding to described catalogue；
When adding object, the value that the upper directory of this object is corresponding is incremented by；
When deleting object, first delete the key-value pair record of this object, and the value of the upper directory of described object is successively decreased.
3. the storage method of the gradation directory based on Large Copacity table according to claim 2, including:
When adding object, if the upper directory of this object is absent from, then first create directory, and value corresponding for described catalogue is set to 1；
When deleting object, if the value of the upper directory of this object is 0 after successively decreasing, then by described directory delete.
4. the storage method according to the arbitrary described gradation directory based on Large Copacity table of claims 1 to 3, including:
Preserving the home record of data block and terminate record and the stored server of described data block, wherein, described data block includes the record of the object in Large Copacity table or catalogue；
When catalog or object, first pass through the home record of data block in metadata table and find the data block corresponding with the catalogue to retrieve or object with terminating record, then find the stored server of described data block, retrieve described server.
5. the storage method according to the arbitrary described gradation directory based on Large Copacity table of Claims 1-4, including:
Described identifier is leading character, and object or the directory sorting of mark same layer are preposition.
6. based on a storage system for the gradation directory of Large Copacity table, including:
Processing module, for adding identifier before the initial by given path lowermost layer object or catalogue, identifies described object or catalogue is lowermost layer；Obtaining the parent directory path of described object or catalogue, and judge whether described parent directory path is ground floor, if it is not, then add identifier before the initial of the catalogue in described parent directory path, identifying described parent directory path is lowermost layer；
Memory module, is used for storing object or catalogue.
7. the storage system of the gradation directory based on Large Copacity table according to claim 6, also includes:
Maintenance module, for using key as Large Copacity table of object or catalogue, using object number corresponding for described catalogue next layer as the value corresponding to described catalogue；When adding object, the value that the upper directory of this object is corresponding is incremented by；When deleting object, first delete the key-value pair record of this object, and the value of the upper directory of described object is successively decreased.
8. the storage system of the gradation directory based on Large Copacity table according to claim 7, including:
Maintenance module is for when adding object, if the upper directory of this object is absent from, then first createing directory, and value corresponding for described catalogue is set to 1；When deleting object, if the value of the upper directory of this object is 0 after successively decreasing, then by described directory delete.
9. the storage system according to the arbitrary described gradation directory based on Large Copacity table of claim 6 to 8, also includes:
Logging modle, for preserving the home record of data block and terminating record and the stored server of described data block, wherein, described data block includes the record of the object in Large Copacity table or catalogue；
Wherein, when catalog or object, first pass through the home record of data block in metadata table and find the data block corresponding with the catalogue to retrieve or object with terminating record, then find the stored server of described data block, retrieve described server.
10. the storage system according to the arbitrary described gradation directory based on Large Copacity table of claim 6 to 9, including:
Described identifier is leading character, and object or the directory sorting of mark 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 true CN105786916A (en) | 2016-07-20 |
| CN105786916B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109144991A (en) * | 2017-06-15 | 2019-01-04 | 北京京东尚科信息技术有限公司 | Dynamic divides method, apparatus, electronic equipment and the computer of table can storage medium |
| CN110797082A (en) * | 2019-10-24 | 2020-02-14 | 福建和瑞基因科技有限公司 | Method and system for storing and reading gene sequencing data |
Citations (3)
| 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 |
| 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 |
-
2014
- 2014-12-26 CN CN201410827977.0A patent/CN105786916B/en active Active
Patent Citations (3)
| 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 |
| 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 |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109144991A (en) * | 2017-06-15 | 2019-01-04 | 北京京东尚科信息技术有限公司 | Dynamic divides method, apparatus, electronic equipment and the computer of table can storage medium |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105786916B (en) | 2019-11-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109669934B (en) | Data warehouse system suitable for electric power customer service and construction method thereof | |
| US10311048B2 (en) | Full and partial materialization of data from an in-memory array to an on-disk page structure | |
| CN103812939B (en) | Big data storage system | |
| US9639542B2 (en) | Dynamic mapping of extensible datasets to relational database schemas | |
| US10296611B2 (en) | Optimized rollover processes to accommodate a change in value identifier bit size and related system reload processes | |
| US9672241B2 (en) | Representing an outlier value in a non-nullable column as null in metadata | |
| US8280907B2 (en) | System and method for managing access to data in a database | |
| Pröll et al. | Scalable data citation in dynamic, large databases: Model and reference implementation | |
| CN110291518A (en) | Merge tree garbage index | |
| US20140337287A1 (en) | Virtual repository management | |
| US10157211B2 (en) | Method and system for scoring data in a database | |
| CN104572670A (en) | Small file storage, query and deletion method and system | |
| CN107491487A (en) | A kind of full-text database framework and bitmap index establishment, data query method, server and medium | |
| CN104063487A (en) | File data management method based on relational database and K-D tree indexes | |
| CN110888837B (en) | Object storage small file merging method and device | |
| CN102332004B (en) | Data processing method and system for managing mass data | |
| CN106599292A (en) | Method and system for storing real-time video data and image data | |
| CA3066254A1 (en) | Systems and methods of creation and deletion of tenants within a database | |
| CN103870557A (en) | Database-based electronic file storage system | |
| CN103473324A (en) | Multi-dimensional service attribute retrieving device and method based on unstructured data storage | |
| CN105786916A (en) | High-capacity table-based hierarchical directory storage method and system | |
| CN111680030A (en) | Data fusion method and device, and data processing method and device based on meta information | |
| US8135760B1 (en) | Determining the lineage of a content unit on an object addressable storage system | |
| KR101451280B1 (en) | Distributed database management system and method | |
| CN102521383A (en) | Method for storing and accessing mass files in distributed system |
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: 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. |