CN1255748C - Metadata hierarchy management method and system of storage virtualization system - Google Patents
Metadata hierarchy management method and system of storage virtualization system Download PDFInfo
- Publication number
- CN1255748C CN1255748C CN 200310111436 CN200310111436A CN1255748C CN 1255748 C CN1255748 C CN 1255748C CN 200310111436 CN200310111436 CN 200310111436 CN 200310111436 A CN200310111436 A CN 200310111436A CN 1255748 C CN1255748 C CN 1255748C
- Authority
- CN
- China
- Prior art keywords
- list
- server
- metadata
- matching
- list server
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention discloses a metadata hierarchy management method storing a virtualization system and a system thereof. The method manages a metadata logic tree in a hierarchy way, and a matching table is introduced to lighten the pressure of a root directory server; therefore, directories required for access by users can be rapidly and accurately oriented, and the system can reach to better expandability. The matching table is resident in a memory and because the matching table only records a root entry address of each directory server, the occupation space is extremely small, and the management is convenient. Because the matching table does not have a plurality of items, the matching efficiency to the user required directories by searching the matching table is also higher. The system of the metadata hierarchy management method comprises a metadata server and the directory server, wherein the metadata server is provided with the matching table and a matching table management module, and the matching table at least comprises directory server names and a root directory of a metadata logic sub-tree stored on the directory server. The present invention has the characteristics of high efficiency, good expandability, easy management, etc.
Description
Technical field
The invention belongs to the Computer Storage field, be specifically related to a kind of metadata layer management method and system thereof of memory virtualization system.
Background technology
In modern high performance is calculated, science calculate and Military Application more and more higher to the requirement of storing, comprise high capacity, distributed, high-performance and high reliability.The virtual storage administration mode of wide area network becomes one the various High Performance Cache and Memory System that distribute on the geography, form huge distributed store space, fully realize resource sharing, improve resource utilization, effectively solve the explosive increase of storage data and the contradiction between the storage administration ability relative deficiency.
In a wide area storage system, the storage resources of these magnanimity must effectively be managed, thereby introduces the notion of metadata.Metadata is the data of data of description, and it provides mapping between object physical location and its logical name for system, and a logical file can corresponding a plurality of physical file copies.In addition, metadata also comprises file directory information, fileinfo, and storing device information reaches relevant system information or the like.
In many systems,, all adopt the hierarchical directory structure management of metadata such as SRB or GridFTP.When metadata becomes huge, system can enable a plurality of meta data servers simultaneously, can cause the generation of following problem like this: on the one hand, logic tree must be distributed on these meta data servers, and on the other hand, necessary co-operating between the LIST SERVER, because the metadata that will return may be distributed on the different meta data servers, so just the root directory server to metadata has caused pressure.The 3rd, if the root directory server breaks down, whole NetWare directory services NetWare also just can not run well again, is difficult to the high available of the system of accomplishing.At last, this structure makes the expansion of meta data server also become very difficult.
Summary of the invention
The object of the present invention is to provide a kind of metadata layer management method that can overcome the memory virtualization system of above-mentioned defective.This method has higher efficient, better expansibility, and is easier to management.The present invention also provides the system that realizes this method.
The metadata layer management method of a kind of memory virtualization system provided by the invention the steps include:
(1) whole memory virtualization system is divided into a plurality of domain logics, the metadata in each domain logic is distributed on a plurality of LIST SERVER;
(2) meta data server, the LIST SERVER that is used for managing this territory are set in each domain logic;
(3) matching list is set in each meta data server, this matching list comprises two fields at least: the root directory of the sub-logic tree of being preserved on LIST SERVER title and the LIST SERVER of metadata is used for the direct LIST SERVER that user's request is directed to its place;
(4) when the user files a request, from user's request, extract and to visit the path of catalogue;
(5) in the matching list in this territory, coupling is grown in the path, judged in matching list, whether there is the LIST SERVER that meets;
(6) if there is the LIST SERVER that meets, the LIST SERVER of directly visit coupling, and return results; Otherwise demonstration error message.
Realize system for carrying out said process, be divided into a plurality of domain logics, metadata in each domain logic is distributed on a plurality of LIST SERVER, it is characterized in that: each domain logic specifies a station server as meta data server, specifies multiple servers as the LIST SERVER of preserving metadata information; Be provided with matching list and matching table management module in the meta data server, matching list comprises the root directory of the sub-logic tree of being preserved on LIST SERVER title and the LIST SERVER of metadata at least, matching table management module is used for that the record of matching list is safeguarded, the parsing of matching list file and according to the route matching of user's request to suitable LIST SERVER or show error message.
Metadata layer management of the present invention system has the following advantages and effect.
(1) higher efficient: matching list is a core resident, and the entry number that its is preserved is limit by territory in-list number of servers, so it is also very fast to the speed that the user asks catalogue to be mated to travel through matching list.The direct LIST SERVER at request of access catalogue place after the traversal, and need not be again by way of the root directory LIST SERVER, this will alleviate the load of the LIST SERVER at root directory place greatly, and the speed that improves the search of metadata improves overall system efficiency then.
(2) better expansibility: the tree type management mode of layering makes maintenance and management be easy to expansion; When the system load rising needs to increase LIST SERVER, only need in matching list, increase several clauses and subclauses, indicate the LIST SERVER and the corresponding root directory thereof that increase newly in the system and get final product.Because the scheduling of matching list has been arranged, it is separate that LIST SERVER can reach, and do not need the existence of other LIST SERVER in the perception territory.Like this, system effectiveness can not reach the extensibility of system effectiveness with the increasing and descend of LIST SERVER number.
(3) be easy to management: the structure of matching list is very simple, has only write down the name of each LIST SERVER and has deposited the root directory of metadata thereon.Revise all very convenient so it adds deletion.
When invention adopts JAVA as developing instrument, can the implementation platform independence; When memory virtualization system increases the metadata copy, because the copy distribution situation can show in matching list fully, can select a suitable LIST SERVER by matching list, thereby effectively utilize copy, improve system effectiveness.
Description of drawings
Fig. 1 is a metadata logic tree exemplary plot in the territory;
Fig. 2 is a metadata access flow process of the present invention;
Fig. 3 is the access mode of existing metadata logic tree;
Fig. 4 is the access mode of metadata logic tree of the present invention;
Fig. 5 is the structural drawing of metadata management.
Embodiment
In our memory virtualization system GSP (G1obal Storage Provider), total system is carried out layer management by dividing domain logic.In each territory, metadata be distributed on a plurality of LIST SERVER and, and form one " this territory metadata logic tree " according to the organizational form of similar Linux file system, Fig. 1 is a territory metadata logic tree example.Among the figure, the LIST SERVER in 1.1,1.2,1.3,1.4 representative domains; The root directory of metadata logic tree in the A0 representative domain; A1, A2 ..., the sub-directory of metadata logic tree in the representative domain.
Each user is under the jurisdiction of a territory, and user's root directory is tied in the territory on the sub-directory, and during User login, system's self-orientation goes to user's root directory.
Foundation comes storing metadata and copy thereof based on the metadata catalog server (Directory Server) of directory tree structure.But in the scope of wide area network, along with the growth of resource in the system, it is more and more huger that the information of file and catalogue can become, and obviously, LIST SERVER is organized badly, will become the bottleneck of system.So how to be directed to user's root directory fast and accurately is exactly very distinct issues, and this will have influence on the search speed of metadata and then influence overall system efficiency.In our system, introduce matching list and solve the problems referred to above.
A plurality of LIST SERVER in the meta data server management domain are set in each territory, and matching list is kept on the meta data server.Matching list is a core resident data structure, has write down the name of each LIST SERVER and has deposited the root directory of metadata thereon; If a copy of preserving certain catalogue above the LIST SERVER also is put into this catalogue in the matching list and goes.In matching list, index field can also be set, as the unique identification of certain clauses and subclauses in matching list.
When user's request is received by system, at first on meta data server, travel through matching list, a coupling the longest is done in all paths that the path of asking according to the user to visit comprises matching list, find the LIST SERVER at the catalogue place that the user will visit, directly visit this LIST SERVER, and need not search successively by the LIST SERVER at metadata root directory place in the territory; If there is copy in metadata, can also from matching list, select a suitable LIST SERVER to give user capture.Metadata access flow process such as Fig. 2 institute are not.
Fig. 1 has enumerated the example of a logic tree.This logic tree is represented a document directory structure in the territory, is distributed on four LIST SERVER.Wherein, root/the A0 of logic tree leaves on the LIST SERVER 1.1, catalogue/A0/B1 leaves on the LIST SERVER 1.2, and catalogue/A0/A1/A2/C11 and catalogue/A0/A1/A2/C12 are placed on the LIST SERVER 1.3, and catalogue/A0/B1/B2/B3/B4/D1 is placed on the LIST SERVER 1.4.Table 2 has shown the matching list corresponding with Fig. 1 logic tree.
Suppose that the user thinks visit/A0/B1/B2/B3/B4/D1/D2, if according to existing metadata access mode, at first can begin to search from the LIST SERVER 1.1 at the root directory place of logic tree in the territory, go through LIST SERVER 1.3, arrive LIST SERVER 1.4, and then the result returned to the user, as shown in Figure 3.Among the figure, R represents that the user asks the path of the file/catalogue of visiting; 1.1, the LIST SERVER in 1.2,1.3,1.4 these territories of expression; The root directory of metadata logic tree in the A0 representative domain; B1, D1 ..., the catalogue in the representative domain in the metadata logic tree; Dotted arrow and r1, r2 ... expression user capture step.If but take the used matching list mode of the present invention, after user's request is received by system, will at first search matching list, do a coupling the longest according to the path of user's request, so just can obtain metadata on LIST SERVER 1.4.System will directly visit LIST SERVER 1.4, and not need again by root directory inlet 1.1, as shown in Figure 4.Among the figure, all LIST SERVER in 1 representative domain, meta data server GNS in 2 representative domains, 3 expression matching list, dotted arrow and r1, r2 represent the user capture step.
In order to reach the purpose that efficient search is arranged, all LIST SERVER all must oneself be preserved the logical organization of metadata tree in the territory.For example, LIST SERVER 1.4 still can be preserved the root of metadata tree in the territory, but it is a path, and the content of not preserving root does not just need any conversion is done in request like this when a searching request arrives 1.4.These root clauses and subclauses only need take few storage space because content is empty, and safeguard also very convenient.
The content of matching list leaves in the file, when total system starts, the matching list of preserving in the file is read in internal memory.The 26S Proteasome Structure and Function of matching list has determined it all is in internal memory matching list to be carried out read operation generally speaking, and this just can not relate to the read-write to the matching list file.Only under the situation that the root directory that increases LIST SERVER or existing LIST SERVER newly changes, just matching list is made amendment, and then file is made amendment, do not need frequently to read and write the file of matching list, saved the time of visit matching list greatly.
In meta data server, add a matching table management module, record in the matching list is safeguarded, concrete operations comprise interpolation, deletion, the renewal operation of record, the parsing of matching list file and according to the route matching of user request to suitable LIST SERVER or the like, specific explanations is as follows.
The interpolation of matching list record: when increasing a LIST SERVER newly in the territory, in matching list, add a record; If a sub-directory in certain LIST SERVER is excessive, need move to the another one LIST SERVER and go, also to notify matching list, increase a relative recording, to write down this sub-directory and its LIST SERVER of moving to.
The deletion of matching list record: when certain LIST SERVER is no longer served certain territory, from the corresponding record of matching list deletion;
The modification of matching list record: when the directory tree root directory of preserving on certain LIST SERVER changes, revise corresponding record;
The parsing of matching list file: in the time of system start-up, the content in the matching list file is read in the character string array memory-resident;
The path of match user request: in matching list, search the LIST SERVER that the user asks the place, path visited.
Use 5 nodes in the group system to make up a metadata layer management system, its basic configuration is as shown in table 1.
| CPU | Internal memory | Hard disk | Network interface card | Operating system | Network |
| Two PIII 866 | 256M | 30G | 3C905B | Linux 6.2 | The 100M switch |
The hardware of each node of table 1 and network configuration
Wherein, one as meta data server, other 4 as LIST SERVER.Meta data server is responsible for the maintenance of matching list, comprises generating a series of operations such as adding the deletion renewal.LIST SERVER is responsible for preserving metadata information.
Concrete enforcement is as follows: one of them node serves as meta data server, loads the file and the matching table management module of preserving matching list; All the other four nodes serve as 1.1,1.2,1.3,1.4, load ldap database, preserve the metadata in the territory.
According to Fig. 5, domain logic Domain of 4.1 expressions, dash area 4.2 thereafter and the 4.3 representatives a plurality of domain logics identical with 4.1 structures; 5 expression matching table management module, the exchanging visit between dotted arrow representation element data server and the LIST SERVER.
The configuration instruction of total system is as follows:
(1) matching list comprises two fields, its example such as table 2.
| The root directory path | LIST SERVER |
| /A0 | 1.1 |
| /A0/B1 | 1.2 |
| /A0/A1/A2/C11 | 1.3 |
| /A0/A1/A2/C12 | 1.3 |
| /A0/B1/B2/B3/B4/D1 | 1.4 |
Table 2 matching list example
Each field is explained as follows:
Path: the root directory path of the sub-logic tree of metadata that LIST SERVER is preserved;
The LIST SERVER title: the name of this LIST SERVER, each LIST SERVER title is unique in the territory.
(2) metadata is kept on four LIST SERVER in the territory, concrete distribution example such as table 3.
| The LIST SERVER title | The metadata information that LIST SERVER is preserved |
| 1.1 | Metadata under the/A0, but do not comprise catalogue/A0/B1, / A0/A1/A2/C11 ,/A0/A1/A2/C12 and/ content under the A0/B1/B2/B3/B4/D1 |
| 1.2 | Metadata under the/A0/B1, but do not comprise content under catalogue/A0/B1/B2/B3/B4/D1 |
| 1.3 | Catalogue/A0/A1/A2/C11 and/ metadata under the A0/A1/A2/C12 |
| 1.4 | Metadata under catalogue/A0/B1/B2/B3/B4/D1 |
Table 3 matching list example
(3) matching list runs the example
Resolve the file of preserving matching list during system start-up, read to following three character string arrays memory-resident:
Sindex[i]: preserve the index value of i record in the matching list, the index value in the matching list increases progressively.It is also nonessential, but can simplify and make things convenient for writing of program;
Spath[i]: the content of preserving field " path " in i the clauses and subclauses;
SDS[i]: the content of preserving field in i the clauses and subclauses " LIST SERVER title ".
Sindex[i], spath[i], sDS[i] and be a corresponding mutually cover.From array [1] opening entry file.Sindex[0] the entry number of value for existing in the table; Spath[0] be empty; SDS[0] be empty.
After receiving the file or directory path path that the user asks to visit, at first travel through array spath, if spath[i] value be path, return sDS[i]; If there is not path among the spath, then return the LIST SERVER at the parent directory place of path, perhaps father's parent directory is until the root directory of entire domain.
Claims (4)
1, a kind of metadata layer management method of memory virtualization system the steps include:
(1) whole memory virtualization system is divided into a plurality of domain logics, the metadata in each domain logic is distributed on a plurality of LIST SERVER;
(2) meta data server, the LIST SERVER that is used for managing this territory are set in each domain logic;
(3) matching list is set in each meta data server, this matching list comprises two fields at least: the root directory of the sub-logic tree of being preserved on LIST SERVER title and the LIST SERVER of metadata is used for the direct LIST SERVER that user's request is directed to its place;
(4) when the user files a request, from user's request, extract and to visit the path of catalogue;
(5) in the matching list in this territory, coupling is grown in the path, judged in matching list, whether there is the LIST SERVER that meets;
(6) if there is the LIST SERVER that meets, the LIST SERVER of directly visit coupling, and return results; Otherwise demonstration error message.
2, method according to claim 1 is characterized in that: also be provided with the catalogue copy in the described matching list.
3, method according to claim 1 is characterized in that: also be provided with index field in the described matching list.
4, a kind of metadata layer management system of memory virtualization system, this system is divided into a plurality of domain logics, metadata in each domain logic is distributed on a plurality of LIST SERVER, it is characterized in that: each domain logic specifies a station server as meta data server (2), specifies multiple servers as the LIST SERVER of preserving metadata information; Be provided with matching list (3) and matching table management module (5) in the meta data server (2), matching list (3) comprises the root directory of the sub-logic tree of being preserved on LIST SERVER title and the LIST SERVER of metadata at least, matching table management module (5) is used for that the record of matching list (3) is safeguarded, the parsing of matching list file and according to the route matching of user's request to suitable LIST SERVER or show error message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200310111436 CN1255748C (en) | 2003-11-24 | 2003-11-24 | Metadata hierarchy management method and system of storage virtualization system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200310111436 CN1255748C (en) | 2003-11-24 | 2003-11-24 | Metadata hierarchy management method and system of storage virtualization system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1545047A CN1545047A (en) | 2004-11-10 |
| CN1255748C true CN1255748C (en) | 2006-05-10 |
Family
ID=34336101
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200310111436 Expired - Fee Related CN1255748C (en) | 2003-11-24 | 2003-11-24 | Metadata hierarchy management method and system of storage virtualization system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1255748C (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101826054B (en) * | 2009-03-04 | 2011-12-07 | 安凯(广州)微电子技术有限公司 | Memory management method of micromemory system |
| US10324903B1 (en) | 2017-12-28 | 2019-06-18 | Dropbox, Inc. | Content management client synchronization service |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4808409B2 (en) * | 2005-01-14 | 2011-11-02 | 株式会社日立製作所 | Sensor network system, sensor data search method and program |
| KR100610904B1 (en) * | 2005-03-03 | 2006-08-09 | 엘지전자 주식회사 | Meta data parsing method for providing multimedia service and handset using thereof |
| JP2008078713A (en) * | 2006-09-19 | 2008-04-03 | Sony Corp | Recording apparatus and method, program, and reproducing apparatus and method |
| CN100595761C (en) * | 2007-12-29 | 2010-03-24 | 中国科学院计算技术研究所 | Metadata management method for splitting name space |
| US8423581B2 (en) | 2009-10-07 | 2013-04-16 | International Business Machines Corporation | Proxy support for special subtree entries in a directory information tree using attribute rules |
| CN101697168B (en) * | 2009-10-22 | 2011-10-19 | 中国科学技术大学 | Method and system for dynamically managing metadata of distributed file system |
| CN102024016B (en) * | 2010-11-04 | 2013-03-13 | 曙光信息产业股份有限公司 | Rapid data restoration method for distributed file system (DFS) |
| CN102982151B (en) * | 2012-11-27 | 2015-04-01 | 南开大学 | Method for merging multiple physical files into one logic file |
| WO2014101000A1 (en) * | 2012-12-26 | 2014-07-03 | 华为技术有限公司 | Metadata management method and system |
| CN103870588B (en) * | 2014-03-27 | 2016-08-31 | 杭州朗和科技有限公司 | A kind of method and device used in data base |
| CN106980697A (en) * | 2017-04-07 | 2017-07-25 | 广东浪潮大数据研究有限公司 | A kind of catalogue distribution querying method and device |
-
2003
- 2003-11-24 CN CN 200310111436 patent/CN1255748C/en not_active Expired - Fee Related
Cited By (38)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101826054B (en) * | 2009-03-04 | 2011-12-07 | 安凯(广州)微电子技术有限公司 | Memory management method of micromemory system |
| US10324903B1 (en) | 2017-12-28 | 2019-06-18 | Dropbox, Inc. | Content management client synchronization service |
| US10599673B2 (en) | 2017-12-28 | 2020-03-24 | Dropbox, Inc. | Content management client synchronization service |
| US10671638B2 (en) | 2017-12-28 | 2020-06-02 | Dropbox, Inc. | Allocation and reassignment of unique identifiers for synchronization of content items |
| US10691720B2 (en) | 2017-12-28 | 2020-06-23 | Dropbox, Inc. | Resynchronizing metadata in a content management system |
| US10726044B2 (en) | 2017-12-28 | 2020-07-28 | Dropbox, Inc. | Atomic moves with lamport clocks in a content management system |
| US10733205B2 (en) | 2017-12-28 | 2020-08-04 | Dropbox, Inc. | Violation resolution in client synchronization |
| US10762104B2 (en) | 2017-12-28 | 2020-09-01 | Dropbox, Inc. | File journal interface for synchronizing content |
| US10776386B2 (en) | 2017-12-28 | 2020-09-15 | Dropbox, Inc. | Content management client synchronization service |
| US10789269B2 (en) | 2017-12-28 | 2020-09-29 | Dropbox, Inc. | Resynchronizing metadata in a content management system |
| US10866964B2 (en) | 2017-12-28 | 2020-12-15 | Dropbox, Inc. | Updating a local tree for a client synchronization service |
| US10872098B2 (en) | 2017-12-28 | 2020-12-22 | Dropbox, Inc. | Allocation and reassignment of unique identifiers for synchronization of content items |
| US10877993B2 (en) | 2017-12-28 | 2020-12-29 | Dropbox, Inc. | Updating a local tree for a client synchronization service |
| US10922333B2 (en) | 2017-12-28 | 2021-02-16 | Dropbox, Inc. | Efficient management of client synchronization updates |
| US10929427B2 (en) | 2017-12-28 | 2021-02-23 | Dropbox, Inc. | Selective synchronization of content items in a content management system |
| US10936622B2 (en) | 2017-12-28 | 2021-03-02 | Dropbox, Inc. | Storage interface for synchronizing content |
| US10949445B2 (en) | 2017-12-28 | 2021-03-16 | Dropbox, Inc. | Content management client synchronization service |
| US11003685B2 (en) | 2017-12-28 | 2021-05-11 | Dropbox, Inc. | Commit protocol for synchronizing content items |
| US11010402B2 (en) | 2017-12-28 | 2021-05-18 | Dropbox, Inc. | Updating a remote tree for a client synchronization service |
| US11016991B2 (en) | 2017-12-28 | 2021-05-25 | Dropbox, Inc. | Efficient filename storage and retrieval |
| US11048720B2 (en) | 2017-12-28 | 2021-06-29 | Dropbox, Inc. | Efficiently propagating diff values |
| US11080297B2 (en) | 2017-12-28 | 2021-08-03 | Dropbox, Inc. | Incremental client synchronization |
| US11120039B2 (en) | 2017-12-28 | 2021-09-14 | Dropbox, Inc. | Updating a remote tree for a client synchronization service |
| US11176164B2 (en) | 2017-12-28 | 2021-11-16 | Dropbox, Inc. | Transition to an organization directory |
| US11188559B2 (en) | 2017-12-28 | 2021-11-30 | Dropbox, Inc. | Directory snapshots with searchable file paths |
| US11423048B2 (en) | 2017-12-28 | 2022-08-23 | Dropbox, Inc. | Content management client synchronization service |
| US11429634B2 (en) | 2017-12-28 | 2022-08-30 | Dropbox, Inc. | Storage interface for synchronizing content |
| US11461365B2 (en) | 2017-12-28 | 2022-10-04 | Dropbox, Inc. | Atomic moves with lamport clocks in a content management system |
| US11475041B2 (en) | 2017-12-28 | 2022-10-18 | Dropbox, Inc. | Resynchronizing metadata in a content management system |
| US11500899B2 (en) | 2017-12-28 | 2022-11-15 | Dropbox, Inc. | Efficient management of client synchronization updates |
| US11500897B2 (en) | 2017-12-28 | 2022-11-15 | Dropbox, Inc. | Allocation and reassignment of unique identifiers for synchronization of content items |
| US11514078B2 (en) | 2017-12-28 | 2022-11-29 | Dropbox, Inc. | File journal interface for synchronizing content |
| US11657067B2 (en) | 2017-12-28 | 2023-05-23 | Dropbox Inc. | Updating a remote tree for a client synchronization service |
| US11669544B2 (en) | 2017-12-28 | 2023-06-06 | Dropbox, Inc. | Allocation and reassignment of unique identifiers for synchronization of content items |
| US11704336B2 (en) | 2017-12-28 | 2023-07-18 | Dropbox, Inc. | Efficient filename storage and retrieval |
| US11782949B2 (en) | 2017-12-28 | 2023-10-10 | Dropbox, Inc. | Violation resolution in client synchronization |
| US11836151B2 (en) | 2017-12-28 | 2023-12-05 | Dropbox, Inc. | Synchronizing symbolic links |
| US12061623B2 (en) | 2017-12-28 | 2024-08-13 | Dropbox, Inc. | Selective synchronization of content items in a content management system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1545047A (en) | 2004-11-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104850572A (en) | HBase non-primary key index building and inquiring method and system | |
| CN101567003B (en) | Method for managing and allocating resource in parallel file system | |
| CN1255748C (en) | Metadata hierarchy management method and system of storage virtualization system | |
| CN103067461B (en) | A kind of metadata management system of file and metadata management method | |
| US9367569B1 (en) | Recovery of directory information | |
| CN108021717B (en) | Method for implementing lightweight embedded file system | |
| CN106874383A (en) | A kind of decoupling location mode of metadata of distributed type file system | |
| CN106682110B (en) | Image file storage and management system and method based on Hash grid index | |
| WO2013188168A1 (en) | Elimination of duplicate objects in storage clusters | |
| CN104899297A (en) | Hybrid index structure with storage perception | |
| CN104239377A (en) | Platform-crossing data retrieval method and device | |
| CN102024019B (en) | Suffix tree based catalog organizing method in distributed file system | |
| CN106570113B (en) | Mass vector slice data cloud storage method and system | |
| CN101051309A (en) | Researching system and method used in digital labrary | |
| CN101079036A (en) | Storage method and system for mass file | |
| CN1845093A (en) | Attribute extensible object file system | |
| WO2021016050A1 (en) | Multi-record index structure for key-value stores | |
| CN1547137A (en) | Mass file management system and method based on database | |
| Xu et al. | Enhancing HDFS with a full-text search system for massive small files | |
| CN1614591A (en) | Method for organizing and accessing distributive catalogue of document system | |
| CN1791873A (en) | Undrop objects and dependent objects in a database system | |
| Zhang et al. | FlameDB: A key-value store with grouped level structure and heterogeneous Bloom filter | |
| CN105468599A (en) | Metadata hierarchy management method for storage virtualization system | |
| CN111831423A (en) | Method and system for realizing Redis memory database on nonvolatile memory | |
| van Staereling et al. | Efficient, modular metadata management with loris |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |