CN107220323A - A kind of file delet method and system - Google Patents
A kind of file delet method and system Download PDFInfo
- Publication number
- CN107220323A CN107220323A CN201710363718.0A CN201710363718A CN107220323A CN 107220323 A CN107220323 A CN 107220323A CN 201710363718 A CN201710363718 A CN 201710363718A CN 107220323 A CN107220323 A CN 107220323A
- Authority
- CN
- China
- Prior art keywords
- reference count
- distributed memory
- memory system
- pointer
- file
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
- G06F16/1824—Distributed file systems implemented using Network-attached Storage [NAS] architecture
- G06F16/1827—Management specifically adapted to NAS
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
- G06F16/162—Delete operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5022—Mechanisms to release resources
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a kind of file delet method, applied to distributed memory system, method includes：It regard distributed memory system as the rear end of storage system, the interface reading and writing of files of client call distributed memory system；Distributed memory system distribution index node pointer is to client；File in distributed memory system is deleted based on index node pointer.The present invention can be deleted effectively the file in distributed memory system, can effectively solve the problem that the problem of system space does not discharge.The invention also discloses a kind of file deleting system.
Description
Technical field
The present invention relates to distributed memory system technical field, more specifically to a kind of file delet method and it is
System.
Background technology
With the arrival of Internet era, microblogging, wechat, net purchase etc. are flourishing towards the website of ordinary internet users
Rise, the giant company of Internet circles provides the various services based on internet to hundreds of millions of users.Throughout world is each
The Internet user on ground is daily in Web realease information, and these data that they produce are the numbers of the data volume of personal computer
Times.
In order to which the user for tackling surge at any time asks, increasing company uses distributed memory system.Distribution is deposited
Storage system has high reliability, high availability and high scalability, can avoid because individual node fails and collapses whole system
Routed danger.In traditional scheme, when multiple client accesses distributed file system simultaneously, file system can record each text
The counting of the index node of part, when index node reference count is 0, this document can be deleted by reclaiming thread.But if compile
The developer of client-side program is write because some reasons have forgotten release and quote, it will causing the file of rear end can not delete forever
Remove.Therefore, it is a urgent problem to be solved that how the effective file in distributed memory system, which carries out deletion,.
The content of the invention
In view of this, can be effectively to distribution it is an object of the invention to provide a kind of file delet method and system
File in formula storage system is deleted, and can effectively solve the problem that the problem of system space does not discharge.
To achieve the above object, the present invention provides following technical scheme：
A kind of file delet method, applied to distributed memory system, methods described includes：
Using the distributed memory system as the rear end of storage system, distributed memory system described in client call
Interface reading and writing of files；
The distributed memory system distribution index node pointer is to the client；
File in the distributed memory system is deleted based on the index node pointer.
Preferably, the index node pointer is intelligent pointer.
Preferably, the file in the distributed memory system based on index node pointer deletion is specially：
Intelligent pointer class is associated with the object that class is pointed to by a counter, and reference count tracks such shared same finger
The object of pin；
When creating the new object of class, reference count is simultaneously set to 1 by initialization pointers, when copy of the object as another pair elephant
And when creating, copy-constructor function copy pointer simultaneously increases corresponding reference count；
Carrying out assignment to an object is, assignment operator reduces the reference count of left operand referent, and increases
The reference count of right operand referent, when reference count reduces to 0, deletes object；
When calling destructor function, constructed fuction reduces reference count, when reference count reduces to 0, deletes fundamental objects.
A kind of file deleting system, applied to distributed memory system, the system includes：
Calling module, for using the distributed memory system as the rear end of storage system, described in client call point
The interface reading and writing of files of cloth storage system；
Distribute module, for the distributed memory system distribution index node pointer to the client；
Removing module, for deleting the file in the distributed memory system based on the index node pointer.
Preferably, the index node pointer is intelligent pointer.
Preferably, the removing module specifically for：
Intelligent pointer class is associated with the object that class is pointed to by a counter, and reference count tracks such shared same finger
The object of pin；
When creating the new object of class, reference count is simultaneously set to 1 by initialization pointers, when copy of the object as another pair elephant
And when creating, copy-constructor function copy pointer simultaneously increases corresponding reference count；
Carrying out assignment to an object is, assignment operator reduces the reference count of left operand referent, and increases
The reference count of right operand referent, when reference count reduces to 0, deletes object；
When calling destructor function, constructed fuction reduces reference count, when reference count reduces to 0, deletes fundamental objects.
As shown from the above technical solution, the invention provides a kind of file delet method, when needing to distributed storage system
When file in system is deleted, first using distributed memory system as the rear end of storage system, client call is distributed
The interface reading and writing of files of storage system, then distributed memory system distribution index node pointer be then based on rope to client
Draw the file in node pointer deletion distributed memory system, effectively the file in distributed memory system can be deleted
Remove, can effectively solve the problem that the problem of system space does not discharge.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the accompanying drawing used required in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is a kind of method flow diagram of file delet method embodiment 1 disclosed by the invention；
Fig. 2 is a kind of method flow diagram of file delet method embodiment 2 disclosed by the invention；
Fig. 3 is a kind of structural representation of file deleting system embodiment 1 disclosed by the invention；
Fig. 4 is a kind of structural representation of file deleting system embodiment 2 disclosed by the invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.It is based on
Embodiment in the present invention, it is all other that those of ordinary skill in the art are obtained under the premise of creative work is not made
Embodiment, belongs to the scope of protection of the invention.
In order to more specifically emphasize the independence implemented, this specification is related to number of modules or unit.For example, mould
Block or unit can be realized that the hardware circuit includes special VLSI circuits OR gate array, such as logic chip, crystal by hardware circuit
Pipe, or other components.Module or unit can also realize that such as field is imitated programmable gate array, can compiled in programmable computer hardware
Journey array logic, programmable logic device etc..
Module or unit can also be realized in by the software performed by various forms of processors.Such as, one can hold
Row code module may include one or more entities or logic computer instruction block, and the block is formed into, such as,
Object, program or function.However, the executable part of identification module or unit need not physically be put together, but can be by
The different instruction for being stored in diverse location is constituted, when combining in logic, is formed module or unit and is reached the module
Or the purpose required by unit.
In fact, executable code module or unit can be a single instruction or multiple instruction, it might even be possible to which distribution is in place
In several different code sections of different programs, and across several storage devices.Similarly, peration data can be identified and
It is shown in this module or unit, and can implements in any suitable form and in any suitable data structure form
Tissue.Peration data can assemble single data set, or can be distributed in the different positions with different storage devices, and
A system or network are only present in electronic signal mode at least in part.
" embodiment " or similar term mentioned by this specification represent characteristic, structure or the feature relevant with embodiment,
In at least embodiment for being included in the present invention.Therefore, this specification occurs term " in one embodiment ", " implementing
Example in " and similar term may but be not necessarily all sensing phase be the same as Example.
Furthermore, characteristic of the present invention, structure or feature can be combined in one or more embodiments in any way.
Explanation will provide many specific details below, such as programming, software module, user's selection, network trading, database are looked into
The examples such as inquiry, database structure, hardware module, hardware circuit, hardware chip, to provide the understanding to the embodiment of the present invention.So
And those of ordinary skill in the related art will be seen that the present invention, though wherein one or more specific details are not utilized, or profit
It can also be implemented with other methods, component, material etc..On the other hand, it is the present invention that avoids confusion, known structure, material or behaviour
Do not have a detailed description.
As shown in figure 1, for a kind of flow chart of file delet method embodiment 1 disclosed by the invention, this method is applied to
Distributed memory system, this method comprises the following steps：
S101, using distributed memory system as the rear end of storage system, client call distributed memory system connects
Mouth reading and writing of files；
When needing to delete the file in distributed memory system, distributed memory system is regard as storage first
The interface reading and writing of files of the rear end of system, then client call distributed memory system.
S102, distributed memory system distribution index node pointer to client；
Then distributed memory system distributes Inode pointers to client.
S103, based on index node pointer delete distributed memory system in file.
Then referred to according to the Inode of distribution and carry out delete processing for the file in distributed memory system, wherein, distribution
Inode pointers be intelligent pointer.Intelligent pointer is the class that dynamically distributes pointer to object is pointed in storage, for life cycle control,
The automatic correct object for destroying dynamically distributes is able to ensure that, RAM leakage is prevented, a kind of of it general realizes that technology is to use
Reference count.
In summary, in the above-described embodiments, when needing to delete the file in distributed memory system, first
Using distributed memory system as the rear end of storage system, the interface reading and writing of files of client call distributed memory system, so
Distributed memory system distribution index node pointer is then based on index node pointer and deletes distributed storage system to client afterwards
File in system, can effectively delete the file in distributed memory system, can effectively solve the problem that system space not
The problem of release.
As shown in Fig. 2 for a kind of flow chart of file delet method embodiment 2 disclosed by the invention, this method is applied to
Distributed memory system, this method comprises the following steps：
S201, using distributed memory system as the rear end of storage system, client call distributed memory system connects
Mouth reading and writing of files；
When needing to delete the file in distributed memory system, distributed memory system is regard as storage first
The interface reading and writing of files of the rear end of system, then client call distributed memory system.
S202, distributed memory system distribution index node pointer to client；
Then distributed memory system distributes Inode pointers to client.
S203, intelligent pointer class are associated with the object that class is pointed to by a counter, and reference count tracks such and shared
The object of same pointer；
When creating the new object of class, reference count is simultaneously set to 1 by initialization pointers, when copy of the object as another pair elephant
And when creating, copy-constructor function copy pointer simultaneously increases corresponding reference count；
Carrying out assignment to an object is, assignment operator reduces the reference count of left operand referent, and increases
The reference count of right operand referent, when reference count reduces to 0, deletes object；
When calling destructor function, constructed fuction reduces reference count, when reference count reduces to 0, deletes fundamental objects.
Intelligent pointer class is associated with the object that class is pointed to by a counter, and reference count tracks such, and how many is individual right
As sharing same pointer.When creating the new object of class every time, reference count is simultaneously set to 1 by initialization pointers；When object is as another
The copy of one object and when creating, copy-constructor function copy pointer simultaneously increases corresponding reference count；To an object
When carrying out assignment, assignment operator reduces the reference count of left operand referent, if reference count is deleted to reduce to 0
Except object, and increase the reference count of right operand referent；When calling destructor function, constructed fuction reduces reference count,
If reference count reduces to 0, fundamental objects are deleted.
File system rear end first passes through intelligent pointer and distributes a global Inode, when client accesses file system,
The client obtains the reference of the intelligent pointer, i.e. reference count and Jia 1 automatically.When client discharges or and file system automatically
Link disconnect when, Inode reference subtracts 1 automatically.
The state so Inode is preserved by defining a global space.For example, by the way of following：
shared_ptr<Inode>factory(T arg){
return make_shared<Inode>(arg)；
}
Factory is the function that file system distributes Inode for all clients, and all clients can be shared.
void use_inode(T arg){
shared_ptr<Inode>I=factory (arg)；
}
Use_inode is file system distributed for some client between Inode function, client be it is independent, i.e.,
Arg includes client end information, such as ip, socket etc..
In summary, a kind of file delet method that the present invention is provided, based on intelligent pointer, can effectively solve space not
The problem of release.
As shown in figure 3, being a kind of structural representation of file deleting system embodiment 1 disclosed by the invention, the system should
For distributed memory system, the system includes：
Calling module 301, for, as the rear end of storage system, client call distribution to be deposited using distributed memory system
The interface reading and writing of files of storage system；
When needing to delete the file in distributed memory system, distributed memory system is regard as storage first
The interface reading and writing of files of the rear end of system, then client call distributed memory system.
Distribute module 302, for distributed memory system distribution index node pointer to client；
Then distributed memory system distributes Inode pointers to client.
Removing module 303, for deleting the file in distributed memory system based on index node pointer.
Then referred to according to the Inode of distribution and carry out delete processing for the file in distributed memory system, wherein, distribution
Inode pointers be intelligent pointer.Intelligent pointer is the class that dynamically distributes pointer to object is pointed in storage, for life cycle control,
The automatic correct object for destroying dynamically distributes is able to ensure that, RAM leakage is prevented, a kind of of it general realizes that technology is to use
Reference count.
In summary, in the above-described embodiments, when needing to delete the file in distributed memory system, first
Using distributed memory system as the rear end of storage system, the interface reading and writing of files of client call distributed memory system, so
Distributed memory system distribution index node pointer is then based on index node pointer and deletes distributed storage system to client afterwards
File in system, can effectively delete the file in distributed memory system, can effectively solve the problem that system space not
The problem of release.
As shown in figure 4, being a kind of structural representation of file deleting system embodiment 2 disclosed by the invention, the system should
For distributed memory system, the system includes：
Calling module 401, for, as the rear end of storage system, client call distribution to be deposited using distributed memory system
The interface reading and writing of files of storage system；
When needing to delete the file in distributed memory system, distributed memory system is regard as storage first
The interface reading and writing of files of the rear end of system, then client call distributed memory system.
Distribute module 402, for distributed memory system distribution index node pointer to client；
Then distributed memory system distributes Inode pointers to client.
Removing module 403, it is for intelligent pointer class that one counter is associated with the object that class is pointed to, reference count with
The object of such shared same pointer of track；
When creating the new object of class, reference count is simultaneously set to 1 by initialization pointers, when copy of the object as another pair elephant
And when creating, copy-constructor function copy pointer simultaneously increases corresponding reference count；
Carrying out assignment to an object is, assignment operator reduces the reference count of left operand referent, and increases
The reference count of right operand referent, when reference count reduces to 0, deletes object；
When calling destructor function, constructed fuction reduces reference count, when reference count reduces to 0, deletes fundamental objects.
Intelligent pointer class is associated with the object that class is pointed to by a counter, and reference count tracks such, and how many is individual right
As sharing same pointer.When creating the new object of class every time, reference count is simultaneously set to 1 by initialization pointers；When object is as another
The copy of one object and when creating, copy-constructor function copy pointer simultaneously increases corresponding reference count；To an object
When carrying out assignment, assignment operator reduces the reference count of left operand referent, if reference count is deleted to reduce to 0
Except object, and increase the reference count of right operand referent；When calling destructor function, constructed fuction reduces reference count,
If reference count reduces to 0, fundamental objects are deleted.
File system rear end first passes through intelligent pointer and distributes a global Inode, when client accesses file system,
The client obtains the reference of the intelligent pointer, i.e. reference count and Jia 1 automatically.When client discharges or and file system automatically
Link disconnect when, Inode reference subtracts 1 automatically.
The state so Inode is preserved by defining a global space.For example, by the way of following：
shared_ptr<Inode>factory(T arg){
return make_shared<Inode>(arg)；
}
Factory is the function that file system distributes Inode for all clients, and all clients can be shared.
void use_inode(T arg){
shared_ptr<Inode>I=factory (arg)；
}
Use_inode is file system distributed for some client between Inode function, client be it is independent, i.e.,
Arg includes client end information, such as ip, socket etc..
In summary, a kind of file deleting system that the present invention is provided, based on intelligent pointer, can effectively solve space not
The problem of release.
The embodiment of each in this specification is described by the way of progressive, what each embodiment was stressed be with it is other
Between the difference of embodiment, each embodiment identical similar portion mutually referring to.
The foregoing description of the disclosed embodiments, enables professional and technical personnel in the field to realize or using the present invention.
A variety of modifications to these embodiments will be apparent for those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, it is of the invention
The embodiments shown herein is not intended to be limited to, and is to fit to and principles disclosed herein and features of novelty phase one
The most wide scope caused.
Claims (6)
1. a kind of file delet method, it is characterised in that applied to distributed memory system, methods described includes：
Using the distributed memory system as the rear end of storage system, the interface of distributed memory system described in client call
Reading and writing of files；
The distributed memory system distribution index node pointer is to the client；
File in the distributed memory system is deleted based on the index node pointer.
2. according to the method described in claim 1, it is characterised in that the index node pointer is intelligent pointer.
3. method according to claim 2, it is characterised in that described that the distribution is deleted based on the index node pointer
File in formula storage system is specially：
Intelligent pointer class is associated with the object that class is pointed to by a counter, and reference count tracks such and shares same pointer
Object；
When creating the new object of class, reference count is simultaneously set to 1 by initialization pointers, when object is created as the copy of another pair elephant
When building, copy-constructor function copy pointer simultaneously increases corresponding reference count；
Carrying out assignment to an object is, assignment operator reduces the reference count of left operand referent, and increases right behaviour
Count the reference count of referent, when reference count reduces to 0, delete object；
When calling destructor function, constructed fuction reduces reference count, when reference count reduces to 0, deletes fundamental objects.
4. a kind of file deleting system, it is characterised in that applied to distributed memory system, the system includes：
Calling module, for using the distributed memory system as the rear end of storage system, it is distributed described in client call
The interface reading and writing of files of storage system；
Distribute module, for the distributed memory system distribution index node pointer to the client；
Removing module, for deleting the file in the distributed memory system based on the index node pointer.
5. system according to claim 4, it is characterised in that the index node pointer is intelligent pointer.
6. system according to claim 5, it is characterised in that the removing module specifically for：
Intelligent pointer class is associated with the object that class is pointed to by a counter, and reference count tracks such and shares same pointer
Object；
When creating the new object of class, reference count is simultaneously set to 1 by initialization pointers, when object is created as the copy of another pair elephant
When building, copy-constructor function copy pointer simultaneously increases corresponding reference count；
Carrying out assignment to an object is, assignment operator reduces the reference count of left operand referent, and increases right behaviour
Count the reference count of referent, when reference count reduces to 0, delete object；
When calling destructor function, constructed fuction reduces reference count, when reference count reduces to 0, deletes fundamental objects.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710363718.0A CN107220323A (en) | 2017-05-22 | 2017-05-22 | A kind of file delet method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710363718.0A CN107220323A (en) | 2017-05-22 | 2017-05-22 | A kind of file delet method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107220323A true CN107220323A (en) | 2017-09-29 |
Family
ID=59944323
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710363718.0A Pending CN107220323A (en) | 2017-05-22 | 2017-05-22 | A kind of file delet method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107220323A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107766155A (en) * | 2017-10-23 | 2018-03-06 | 北京京东尚科信息技术有限公司 | Object processing method and system |
| CN109766317A (en) * | 2019-01-08 | 2019-05-17 | 浪潮电子信息产业股份有限公司 | A kind of delet method of file, device, equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1512340A (en) * | 2002-12-31 | 2004-07-14 | 北京科泰世纪科技有限公司 | Packaging method for intelligent pointer of calling structure object function |
| CN102855435A (en) * | 2011-06-27 | 2013-01-02 | 奇智软件（北京）有限公司 | File unlocking and shredding method and device |
| CN103635902A (en) * | 2011-05-13 | 2014-03-12 | 森普利维蒂公司 | Reference count propagation |
-
2017
- 2017-05-22 CN CN201710363718.0A patent/CN107220323A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1512340A (en) * | 2002-12-31 | 2004-07-14 | 北京科泰世纪科技有限公司 | Packaging method for intelligent pointer of calling structure object function |
| CN103635902A (en) * | 2011-05-13 | 2014-03-12 | 森普利维蒂公司 | Reference count propagation |
| CN102855435A (en) * | 2011-06-27 | 2013-01-02 | 奇智软件（北京）有限公司 | File unlocking and shredding method and device |
Non-Patent Citations (2)
| Title |
|---|
| ABNOR: "Linux设备文件三大结构：inode，file，file_operations", 《HTTP://T.CN/EKM0DPP》 * |
| HACKBUTEER1: "C++中智能指针的设计和使用", 《HTTP://T.CN/EKMK2GA》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107766155A (en) * | 2017-10-23 | 2018-03-06 | 北京京东尚科信息技术有限公司 | Object processing method and system |
| CN109766317A (en) * | 2019-01-08 | 2019-05-17 | 浪潮电子信息产业股份有限公司 | A kind of delet method of file, device, equipment and storage medium |
| CN109766317B (en) * | 2019-01-08 | 2022-04-22 | 浪潮电子信息产业股份有限公司 | File deletion method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11055703B2 (en) | Smart contract lifecycle management | |
| DE112012005037B4 (en) | Manage redundant immutable files using deduplications in storage clouds | |
| Tian et al. | Optimized cloud resource management and scheduling: theories and practices | |
| DE202015009267U1 (en) | Prioritization of data reconstruction in distributed storage systems | |
| CN103443781A (en) | Data delivery | |
| CN108509209A (en) | A kind of generation method, device, computer equipment and the storage medium of resource packet | |
| CN111506511A (en) | Test case generation method and device, electronic equipment and medium | |
| US10783112B2 (en) | High performance compliance mechanism for structured and unstructured objects in an enterprise | |
| CN103870536A (en) | Systems and Methods for In-Memory Database Processing | |
| CN105471989A (en) | Data storage method | |
| CN109906597A (en) | To with data set that restricted data set and untethered system are stored and fetched from cloud network | |
| Tang et al. | Achieving convergent causal consistency and high availability for cloud storage | |
| CN111352592B (en) | Disk read-write control method, device, equipment and computer readable storage medium | |
| CN107220323A (en) | A kind of file delet method and system | |
| CN109739906A (en) | A kind of report form generation method and system | |
| US20230109530A1 (en) | Synchronous object placement for information lifecycle management | |
| CN106126427A (en) | A kind of method and system of fast quick-recovery test | |
| CN108920566A (en) | Operating method, device and the equipment of a kind of pair of SQLite database | |
| CN110362590A (en) | Data managing method, device, system, electronic equipment and computer-readable medium | |
| US11734432B2 (en) | Detecting second-order security vulnerabilities via modelling information flow through persistent storage | |
| Ali et al. | Petri Net based modeling and analysis for improved resource utilization in cloud computing | |
| Yuan et al. | Computation and Storage in the Cloud: Understanding the Trade-offs | |
| US9244630B2 (en) | Identifying and accessing reference data in an in-memory data grid | |
| CN111552847B (en) | Method and device for changing number of objects | |
| CN115485677A (en) | Secure data replication in a distributed data storage environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170929 |