CN106990914A - Data-erasure method and device - Google Patents
Data-erasure method and device Download PDFInfo
- Publication number
- CN106990914A CN106990914A CN201710091431.7A CN201710091431A CN106990914A CN 106990914 A CN106990914 A CN 106990914A CN 201710091431 A CN201710091431 A CN 201710091431A CN 106990914 A CN106990914 A CN 106990914A
- Authority
- CN
- China
- Prior art keywords
- data
- stored
- mutually matched
- pending
- deleted
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0608—Saving storage space on storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
- G06F3/0613—Improving I/O performance in relation to throughput
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
- G06F3/0641—De-duplication techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of data-erasure method, including step：Obtain pending data；Determine the object being mutually matched in pending data；The corresponding data of object being mutually matched are compared, it is determined that the data repeated between the object being mutually matched；The data of identified repetition are deleted.The invention also discloses a kind of data deletion apparatus.The effective and reasonable deletion data of the present invention, improve memory space.
Description
Technical field
The present invention relates to technical field of data processing, more particularly to data-erasure method and device.
Background technology
With the continuous propulsion of social digital network IT application process, the data quantity set of global IT enterprises management, which increases severely, to be grown,
Current management of the large-scale data center to complex data requires constantly carrying in terms of autgmentability, performance and cost
Rise.In order to slow down the growth of enterprise's memory capacity, traditional data de-duplication storage management technique and method can not be met
The QoS requirement of big data back-up application, new software and hardware technology progress carrys out machine for the elevator belt of big data managerial ability
Meet.
Most data deduplication system in the market, must in order to recognize redundant data block and location data block
The index of metadata algorithm based on fingerprint must be relied on, especially under big data storage environment, the fingerprint quantity of data is represented
Compare huge, system needs to pay costliness and ensures to delete performance again into safeguarding the finger print data structure originally.Although these skills
Art can be effectively in reduction system redundant data, but its main thought is to improve deleting property again using data source locality characteristic
Can, locality characteristic is not obvious in distributed storage, it is impossible to effective and reasonable deletion data, causes redundant data to be deleted not
It is enough thorough, take memory space.
The above is only used for auxiliary and understands technical scheme, does not represent and recognizes that the above is existing skill
Art.
The content of the invention
It is a primary object of the present invention to provide a kind of data-erasure method and device, it is intended to solve current repeated data and delete
The main thought removed is to improve to delete performance again using data source locality characteristic, and locality characteristic is not in distributed storage
Substantially, it is impossible to effective and reasonable deletion data, redundant data is caused to be deleted not thorough enough, the problem of taking memory space.
To achieve the above object, a kind of data-erasure method that the present invention is provided, including step：
Obtain pending data；
Determine the object being mutually matched in pending data；
The corresponding data of object being mutually matched are compared, it is determined that the data repeated between the object being mutually matched；
The data of identified repetition are deleted.
Preferably, the step of acquisition pending data includes：
Determine the pattern that data are deleted；
When the pattern that data are deleted is real-time puncturing pattern, the number of the data being currently stored in and history deposit is obtained
According to the data for being stored in the data being currently stored in and history are used as pending data；
When the pattern that data are deleted is timing puncturing pattern, the current data stored are obtained, by what is currently stored
Data are used as pending data.
Preferably, before the acquisition pending data, in addition to：
Data to be stored are received, by the data slicer to be stored, the slice of data block of default size are cut into；
Each slice of data block is stored in the way of object, the object of each slice of data and fingerprint index are constituted into number
Stored according to structure.
Preferably, the step of object being mutually matched in the determination pending data, includes：
Determine the object included in the data to be stored；
Identified object is added into fingerprint index queue, object fingerprint comparison is carried out, is determined by hash algorithm mutual
The object of matching.
Preferably, it is described to compare the corresponding data of object being mutually matched, it is determined that the number repeated between the object being mutually matched
According to the step of include：
The corresponding data of object being mutually matched are compared, the correctness for calculating data by MD5 algorithms obtains valid data；
The data repeated between the object being mutually matched are determined from valid data.
In addition, to achieve the above object, the present invention also provides a kind of data deletion apparatus, including：
Acquisition module, for obtaining pending data；
Determining module, the object being mutually matched for extracting in pending data；
Comparing module, for comparing the corresponding data of object being mutually matched, it is determined that repeated between the object being mutually matched
Data；
Removing module, for the data of identified repetition to be deleted.
Preferably, the acquisition module includes
Determining unit, for determining the pattern that data are deleted；
When acquiring unit for the pattern deleted in data is real-time puncturing pattern, obtain the data that are currently stored in and
The data of history deposit, the data that the data being currently stored in and history are stored in are used as pending data；Acquiring unit is also used
In
When the pattern that data are deleted is timing puncturing pattern, the current data stored are obtained, by what is currently stored
Data are used as pending data.
Preferably, described device also includes：
Processing module, for receiving data to be stored, by the data slicer to be stored, is cut into the number of slices of default size
According to block；
Memory module, for each slice of data block to be stored in the way of object, by the object of each slice of data and
Fingerprint index composition data structure is stored.
Preferably, the determining module, is additionally operable to the object for determining to include in the data to be stored；Determining module is also used
In
Identified object is added into fingerprint index queue, object fingerprint comparison is carried out, is determined by hash algorithm mutual
The object of matching.
Preferably, the comparing module, is additionally operable to compare the corresponding data of the object being mutually matched, passes through MD5 algorithm meters
The correctness for the evidence that counts obtains valid data；Comparing module is additionally operable to
The data repeated between the object being mutually matched are determined from valid data.
The present invention proposes a kind of object-based data de-duplication mode, efficiently solves lacking for local feature deficiency
Fall into, the data repeated between the object being mutually matched are found out using object, the data repeated is deleted, realizes high-performance in individual node
Parallel data delete processing, the handling capacity that growth data is deleted again again.Effective and reasonable deletion data, improve memory space.
Brief description of the drawings
Fig. 1 is the schematic flow sheet of an embodiment of data-erasure method of the present invention；
Fig. 2 is the schematic flow sheet of acquisition pending data in one embodiment of the invention；
Fig. 3 is the schematic flow sheet of data storage in one embodiment of the invention；
Fig. 4 is the schematic flow sheet of determination repeated data in one embodiment of the invention；
Fig. 5 is the Organization Chart of data de-duplication in one embodiment of the invention；
Fig. 6 is the schematic diagram of data deletion in one embodiment of the invention；
Fig. 7 is the high-level schematic functional block diagram of an embodiment of data deletion apparatus of the present invention；
Fig. 8 is the refinement high-level schematic functional block diagram of the embodiment of acquisition module one in Fig. 7 of the present invention.
The realization, functional characteristics and advantage of the object of the invention will be described further referring to the drawings in conjunction with the embodiments.
Embodiment
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention.
The present invention provides a kind of data-erasure method.
Reference picture 1, Fig. 1 is the schematic flow sheet of an embodiment of data-erasure method of the present invention.
In one embodiment, the data-erasure method includes：
Step S10, obtains pending data；
In the present embodiment, when there is data to need processing, processed data are pending data, for example, needing
When deleting data, the data of processing to be deleted are pending data；Or, for another example when needing to delete data, historical data
Data with current processing to be deleted are pending data.With reference to Fig. 2, the mode of the acquisition pending data includes：
Step S11, determines the pattern that data are deleted；
Step S12, when the pattern that data are deleted is real-time puncturing pattern, obtains the data being currently stored in and history is deposited
The data entered, the data that the data being currently stored in and history are stored in are used as pending data；
Step S13, when the pattern that data are deleted is timing puncturing pattern, obtains the current data stored, will be current
The data stored are as pending data.
Data puncturing pattern includes timing puncturing pattern and real-time puncturing pattern.The system that is arranged on of data puncturing pattern is opened
Set, or run with the puncturing pattern of acquiescence by user after opening.When needing to delete data, the pattern that data are deleted is determined,
For example, being defined as timing puncturing pattern, or it is defined as real-time puncturing pattern.When being defined as real-time puncturing pattern, by history
Data, as pending data, directly can regard current data as pending data in other words with current data；It is determined that
It is pending data by currently stored all data during for timing puncturing pattern, or to existing before a upper timing node
The data stored between timing node are as pending data.Pending data under above-mentioned real-time and timing puncturing pattern
It is defined as user to set or system default, is a kind of wherein corresponding definition mode.When needing to delete data, according to setting
Mode obtains pending data.
Step S20, determines the object being mutually matched in pending data；
In data storage, the mode of data storage is to be stored in the way of object, i.e. returned according to objects on data
Class, then stores the data of corresponding objects respectively, i.e. receive the data of client, classifies according to the object of the data of reception, point
It is not stored in distributed memory system.With reference to Fig. 3, the process of data storage includes：
Step S21, receives data to be stored, by the data slicer to be stored, is cut into the slice of data block of default size；
Step S22, each slice of data block is stored in the way of object, by the object of each slice of data and fingerprint rope
Draw the storage of composition data structure.
The data that client is sent are received, by the data slicer of client, i.e. the data point that client transmissions come
Into several small data blocks, in our distributed memory system can by each data block cutting be 128M (according to demand not
Same or systematic function sets or set according to the total size of transmission data, for example, 64M or 256M etc. can be also configured to), send
To data-storage system.After by data slicer, data transmission stability and reliability increase, because in the bad feelings of network condition
Under condition, if being not several data blocks by data cutting, substantial amounts of data are disposably transmitted, data can be entered in transmitting procedure
The multiple data check of row, adds the time of transmission, while can also cause the loss or data north obstruction of data, have impact on number
According to stability and reliability.
In the way of object by slice of data storage into distributed system, the characteristics of object is stored is by effective data
Stored with the form of fingerprint index composition data structure and pass through network transmission to storage system into caching, then by whole object
In, the correlation between data and fingerprint index is so just established, facilitates the lookup of follow-up data with obtaining the behaviour such as data
Make.
Step S30, compares the corresponding data of object being mutually matched, it is determined that the data repeated between the object being mutually matched；
In real-time puncturing pattern, the data being currently received are verified when data is received, history number is contrasted
According to the data being currently received, find out the similitude of current data and historical data, i.e. find similar data；For calmly
When puncturing pattern when, when reaching the time of timing, determine that the mode of set of metadata of similar data is identical with the mode deleted in real time, but contrast
Data be pending data, for example, be the data entirely stored, or by a upper timing node to currently having stored
The data comparison stored before data, with a upper timing node, finds similar data.
Specifically, determining the process of repeated data includes：
Step S31, determines the object included in the data to be stored；
Step S32, fingerprint index queue is added by identified object, is carried out object fingerprint comparison, is passed through hash algorithm
It is determined that the object being mutually matched；
Step S33, compares the corresponding data of object being mutually matched, and the correctness for calculating data by MD5 algorithms is obtained
Valid data；
Step S34, determines the data repeated between the object being mutually matched from valid data.
Doing in real time or during timing data deletion, different objects be added in an index fingerprint queue,
First carry out object fingerprint comparison, by similarity it is higher (similarity be more than predetermined threshold value, for example, predetermined threshold value be 80% it is similar or
70% is similar etc.) object extracted by hash algorithm, the correctness of data is then calculated according to MD5 algorithms, is found
Data are in the case of no modification, and data have identical copy, then show to find the data of repetition, by the repetition found
Data be used as between the object being mutually matched repeat data.
Step S40, the data of identified repetition are deleted.
The data repeated are deleted, i.e. the data of redundancy are deleted, substantial amounts of memory space is saved, improves disk
Memory capacity, because memory capacity improve, improve storage efficiency.
It is the Organization Chart of data de-duplication of the present invention with reference to Fig. 5 to preferably describe the embodiment of the present invention, reference
Fig. 6, is the schematic diagram that data are deleted.
The present embodiment proposes a kind of object-based data de-duplication mode, efficiently solves lacking for local feature deficiency
Fall into, the data repeated between the object being mutually matched are found out using object, the data repeated is deleted, realizes high-performance in individual node
Parallel data delete processing, the handling capacity that growth data is deleted again again.Effective and reasonable deletion data, improve memory space.
The present invention further provides a kind of data deletion apparatus.
Reference picture 7, Fig. 7 is the high-level schematic functional block diagram of an embodiment of data deletion apparatus of the present invention.
In one embodiment, the data deletion apparatus includes：Acquisition module 10, determining module 20, processing module 30, deposit
Store up module 40, comparing module 50 and removing module 60.
The acquisition module 10, for obtaining pending data；
In the present embodiment, when there is data to need processing, processed data are pending data, for example, needing
When deleting data, the data of processing to be deleted are pending data；Or, for another example when needing to delete data, historical data
Data with current processing to be deleted are pending data.With reference to Fig. 8, the acquisition module 10 includes：Determining unit 11 and obtain
Unit 12 is taken,
The determining unit 11, for determining the pattern that data are deleted；
The acquiring unit 12, when the pattern for being deleted in data is real-time puncturing pattern, obtains the number being currently stored in
According to this and history deposit data, the data that the data being currently stored in and history are stored in are used as pending data；Obtain single
Member 12 is additionally operable to
When the pattern that data are deleted is timing puncturing pattern, the current data stored are obtained, by what is currently stored
Data are used as pending data.
Data puncturing pattern includes timing puncturing pattern and real-time puncturing pattern.The system that is arranged on of data puncturing pattern is opened
Set, or run with the puncturing pattern of acquiescence by user after opening.When needing to delete data, the pattern that data are deleted is determined,
For example, being defined as timing puncturing pattern, or it is defined as real-time puncturing pattern.When being defined as real-time puncturing pattern, by history
Data, as pending data, directly can regard current data as pending data in other words with current data；It is determined that
It is pending data by currently stored all data during for timing puncturing pattern, or to existing before a upper timing node
The data stored between timing node are as pending data.Pending data under above-mentioned real-time and timing puncturing pattern
It is defined as user to set or system default, is a kind of wherein corresponding definition mode.When needing to delete data, according to setting
Mode obtains pending data.
The determining module 20, for determining the object being mutually matched in pending data；
In data storage, the mode of data storage is to be stored in the way of object, i.e. returned according to objects on data
Class, then stores the data of corresponding objects respectively, i.e. receive the data of client, classifies according to the object of the data of reception, point
It is not stored in distributed memory system.
The processing module 30, for receiving data to be stored, by the data slicer to be stored, is cut into default size
Slice of data block；
The memory module 40, for each slice of data block to be stored in the way of object, by each slice of data
Object and the storage of fingerprint index composition data structure.
The data that client is sent are received, by the data slicer of client, i.e. the data point that client transmissions come
Into several small data blocks, in our distributed memory system can by each data block cutting be 128M (according to demand not
Same or systematic function sets or set according to the total size of transmission data, for example, 64M or 256M etc. can be also configured to), send
To data-storage system.After by data slicer, data transmission stability and reliability increase, because in the bad feelings of network condition
Under condition, if being not several data blocks by data cutting, substantial amounts of data are disposably transmitted, data can be entered in transmitting procedure
The multiple data check of row, adds the time of transmission, while can also cause the loss or data north obstruction of data, have impact on number
According to stability and reliability.
In the way of object by slice of data storage into distributed system, the characteristics of object is stored is by effective data
Stored with the form of fingerprint index composition data structure and pass through network transmission to storage system into caching, then by whole object
In, the correlation between data and fingerprint index is so just established, facilitates the lookup of follow-up data with obtaining the behaviour such as data
Make.
The comparing module 50, for comparing the corresponding data of object being mutually matched, it is determined that between the object being mutually matched
The data repeated；
In real-time puncturing pattern, the data being currently received are verified when data is received, history number is contrasted
According to the data being currently received, find out the similitude of current data and historical data, i.e. find similar data；For calmly
When puncturing pattern when, when reaching the time of timing, determine that the mode of set of metadata of similar data is identical with the mode deleted in real time, but contrast
Data be pending data, for example, be the data entirely stored, or by a upper timing node to currently having stored
The data comparison stored before data, with a upper timing node, finds similar data.
The determining module 20, is additionally operable to the object for determining to include in the data to be stored；Determining module 20 is additionally operable to
Identified object is added into fingerprint index queue, object fingerprint comparison is carried out, is determined by hash algorithm mutual
The object of matching；
The comparing module 50, is additionally operable to compare the corresponding data of the object being mutually matched, and data are calculated by MD5 algorithms
Correctness obtain valid data；Comparing module 50 is additionally operable to
The data repeated between the object being mutually matched are determined from valid data.
Doing in real time or during timing data deletion, different objects be added in an index fingerprint queue,
First carry out object fingerprint comparison, by similarity it is higher (similarity be more than predetermined threshold value, for example, predetermined threshold value be 80% it is similar or
70% is similar etc.) object extracted by hash algorithm, the correctness of data is then calculated according to MD5 algorithms, is found
Data are in the case of no modification, and data have identical copy, then show to find the data of repetition, by the repetition found
Data be used as between the object being mutually matched repeat data.
The removing module 60, for the data of identified repetition to be deleted.
The data repeated are deleted, i.e. the data of redundancy are deleted, substantial amounts of memory space is saved, improves disk
Memory capacity, because memory capacity improve, improve storage efficiency.
It is the Organization Chart of data de-duplication of the present invention with reference to Fig. 5 to preferably describe the embodiment of the present invention, reference
Fig. 6, is the schematic diagram that data are deleted.
The present embodiment proposes a kind of object-based data de-duplication mode, efficiently solves lacking for local feature deficiency
Fall into, the data repeated between the object being mutually matched are found out using object, the data repeated is deleted, realizes high-performance in individual node
Parallel data delete processing, the handling capacity that growth data is deleted again again.Effective and reasonable deletion data, improve memory space.
The preferred embodiments of the present invention are these are only, are not intended to limit the scope of the invention, it is every to utilize this hair
Equivalent structure or equivalent flow conversion that bright specification and accompanying drawing content are made, or directly or indirectly it is used in other related skills
Art field, is included within the scope of the present invention.
Claims (10)
1. a kind of data-erasure method, it is characterised in that including step：
Obtain pending data；
Determine the object being mutually matched in pending data；
The corresponding data of object being mutually matched are compared, it is determined that the data repeated between the object being mutually matched；
The data of identified repetition are deleted.
2. data-erasure method as claimed in claim 1, it is characterised in that include the step of the acquisition pending data：
Determine the pattern that data are deleted；
When the pattern that data are deleted is real-time puncturing pattern, the data of the data being currently stored in and history deposit are obtained, will
The data for data and the history deposit being currently stored in are as pending data；
When the pattern that data are deleted is timing puncturing pattern, the current data stored are obtained, by the data currently stored
It is used as pending data.
3. data-erasure method as claimed in claim 1 or 2, it is characterised in that before the acquisition pending data, also wrap
Include：
Data to be stored are received, by the data slicer to be stored, the slice of data block of default size are cut into；
Each slice of data block is stored in the way of object, by the object of each slice of data and fingerprint index composition data knot
Structure is stored.
4. data-erasure method as claimed in claim 3, it is characterised in that be mutually matched in the determination pending data
The step of object, includes：
Determine the object included in the data to be stored；
Identified object is added into fingerprint index queue, object fingerprint comparison is carried out, determines to be mutually matched by hash algorithm
Object.
5. data-erasure method as claimed in claim 4, it is characterised in that the corresponding number of object that the comparison is mutually matched
According to, it is determined that between the object being mutually matched repeat data the step of include：
The corresponding data of object being mutually matched are compared, the correctness for calculating data by MD5 algorithms obtains valid data；
The data repeated between the object being mutually matched are determined from valid data.
6. a kind of data deletion apparatus, it is characterised in that including：
Acquisition module, for obtaining pending data；
Determining module, the object being mutually matched for extracting in pending data；
Comparing module, for comparing the corresponding data of object being mutually matched, it is determined that the data repeated between the object being mutually matched；
Removing module, for the data of identified repetition to be deleted.
7. data deletion apparatus as claimed in claim 6, it is characterised in that the acquisition module includes
Determining unit, for determining the pattern that data are deleted；
Acquiring unit, when the pattern for being deleted in data is real-time puncturing pattern, obtains the data and history being currently stored in
The data of deposit, the data that the data being currently stored in and history are stored in are used as pending data；Acquiring unit is additionally operable to
When the pattern that data are deleted is timing puncturing pattern, the current data stored are obtained, by the data currently stored
It is used as pending data.
8. data deletion apparatus as claimed in claim 7, it is characterised in that described device also includes：
Processing module, for receiving data to be stored, by the data slicer to be stored, is cut into the slice of data of default size
Block；
Memory module, for each slice of data block to be stored in the way of object, by the object and fingerprint of each slice of data
Index the storage of composition data structure.
9. data deletion apparatus as claimed in claim 8, it is characterised in that the determining module, is additionally operable to treat described in determination
The object included in data storage；Determining module is additionally operable to
Identified object is added into fingerprint index queue, object fingerprint comparison is carried out, determines to be mutually matched by hash algorithm
Object.
10. data deletion apparatus as claimed in claim 9, it is characterised in that the comparing module, is additionally operable to compare mutual
The corresponding data of object matched somebody with somebody, the correctness for calculating data by MD5 algorithms obtains valid data；Comparing module is additionally operable to
The data repeated between the object being mutually matched are determined from valid data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710091431.7A CN106990914B (en) | 2017-02-17 | 2017-02-17 | Data deleting method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710091431.7A CN106990914B (en) | 2017-02-17 | 2017-02-17 | Data deleting method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106990914A true CN106990914A (en) | 2017-07-28 |
| CN106990914B CN106990914B (en) | 2020-06-12 |
Family
ID=59414503
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710091431.7A Active CN106990914B (en) | 2017-02-17 | 2017-02-17 | Data deleting method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106990914B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108037895A (en) * | 2017-12-06 | 2018-05-15 | Tcl移动通信科技（宁波）有限公司 | A kind of mobile terminal and data information memory control method and storage medium |
| CN109544931A (en) * | 2018-12-18 | 2019-03-29 | 广东赛诺科技股份有限公司 | One kind is based on effective judgment method in traffic overrun and overload data 24 hours |
| CN110442404A (en) * | 2019-08-13 | 2019-11-12 | 武汉斗鱼鱼乐网络科技有限公司 | A kind of object method for releasing, device, equipment and storage medium |
| CN110618789A (en) * | 2019-08-14 | 2019-12-27 | 华为技术有限公司 | Method and device for deleting repeated data |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102202098A (en) * | 2011-05-25 | 2011-09-28 | 成都市华为赛门铁克科技有限公司 | Data processing method and device |
| US8041641B1 (en) * | 2006-12-19 | 2011-10-18 | Symantec Operating Corporation | Backup service and appliance with single-instance storage of encrypted data |
| CN102629258A (en) * | 2012-02-29 | 2012-08-08 | 浪潮(北京)电子信息产业有限公司 | Repeating data deleting method and device |
| CN102831222A (en) * | 2012-08-24 | 2012-12-19 | 华中科技大学 | Differential compression method based on data de-duplication |
| CN102915278A (en) * | 2012-09-19 | 2013-02-06 | 浪潮(北京)电子信息产业有限公司 | Data deduplication method |
| CN103870514A (en) * | 2012-12-18 | 2014-06-18 | 华为技术有限公司 | Repeating data deleting method and device |
-
2017
- 2017-02-17 CN CN201710091431.7A patent/CN106990914B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8041641B1 (en) * | 2006-12-19 | 2011-10-18 | Symantec Operating Corporation | Backup service and appliance with single-instance storage of encrypted data |
| CN102202098A (en) * | 2011-05-25 | 2011-09-28 | 成都市华为赛门铁克科技有限公司 | Data processing method and device |
| CN102629258A (en) * | 2012-02-29 | 2012-08-08 | 浪潮(北京)电子信息产业有限公司 | Repeating data deleting method and device |
| CN102831222A (en) * | 2012-08-24 | 2012-12-19 | 华中科技大学 | Differential compression method based on data de-duplication |
| CN102915278A (en) * | 2012-09-19 | 2013-02-06 | 浪潮(北京)电子信息产业有限公司 | Data deduplication method |
| CN103870514A (en) * | 2012-12-18 | 2014-06-18 | 华为技术有限公司 | Repeating data deleting method and device |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108037895A (en) * | 2017-12-06 | 2018-05-15 | Tcl移动通信科技（宁波）有限公司 | A kind of mobile terminal and data information memory control method and storage medium |
| CN108037895B (en) * | 2017-12-06 | 2021-06-22 | Tcl移动通信科技（宁波）有限公司 | Mobile terminal, data information storage control method and storage medium |
| CN109544931A (en) * | 2018-12-18 | 2019-03-29 | 广东赛诺科技股份有限公司 | One kind is based on effective judgment method in traffic overrun and overload data 24 hours |
| CN110442404A (en) * | 2019-08-13 | 2019-11-12 | 武汉斗鱼鱼乐网络科技有限公司 | A kind of object method for releasing, device, equipment and storage medium |
| CN110442404B (en) * | 2019-08-13 | 2022-07-05 | 武汉斗鱼鱼乐网络科技有限公司 | Object release method, device, equipment and storage medium |
| CN110618789A (en) * | 2019-08-14 | 2019-12-27 | 华为技术有限公司 | Method and device for deleting repeated data |
| WO2021027541A1 (en) * | 2019-08-14 | 2021-02-18 | 华为技术有限公司 | Data deduplication method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106990914B (en) | 2020-06-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106990914A (en) | Data-erasure method and device | |
| US11068442B1 (en) | Systems and methods for automatically organizing files and folders | |
| US9069956B2 (en) | Method for scanning file, client and server thereof | |
| CN109873904B (en) | User message state reporting processing method, device and storage medium for message pushing | |
| US9043660B2 (en) | Data store capable of efficient storing of keys | |
| US20120259825A1 (en) | Data management method and data management system | |
| CN106202416A (en) | Table data write method and device, table data read method and device | |
| CN104956340B (en) | Expansible Data duplication is deleted | |
| CN103995863B (en) | A kind of method and device of data de-duplication | |
| US20220383157A1 (en) | Interpretable machine learning for data at scale | |
| CA3038649A1 (en) | Systems and methods for providing a social media knowledge base | |
| EP3475852A1 (en) | Method and system for flexible, high performance structured data processing | |
| CN112463542B (en) | Log abnormality cause diagnosis method, device, computer equipment and storage medium | |
| CN108093024B (en) | Classified routing method and device based on data frequency | |
| EP4173229A1 (en) | Clustering and cluster tracking of categorical data | |
| CN105975521A (en) | Stream data uploading method and device | |
| US9424269B1 (en) | Systems and methods for deduplicating archive objects | |
| US8954679B2 (en) | Management of cached data based on user engagement | |
| CN116628068A (en) | Data handling method, system and readable storage medium based on dynamic window | |
| CN103841006A (en) | Method and device for intercepting junk mails in cloud computing system | |
| CN109165325B (en) | Method, apparatus, device and computer-readable storage medium for segmenting graph data | |
| CN116132448A (en) | Data distribution method based on artificial intelligence and related equipment | |
| CN115470186A (en) | Data slicing method, device and system | |
| CN113590322A (en) | Data processing method and device | |
| CN111143161B (en) | Log file processing method and device, storage medium and electronic equipment |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190823 Address after: 100089 Floor 1-4, No. 2 Building, No. 9 Courtyard, Dijin Road, Haidian District, Beijing Applicant after: Beijing Toyou Feiji Electronics Co., Ltd. Address before: 518000 Feiyada Science and Technology Building, Yuehai Street, Nanshan District, Shenzhen City, Guangdong Province, 1402E Applicant before: Shenzhen City Rui Bo deposit information technology Co. Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210721 Address after: Room g0552, headquarters building, Changsha Zhongdian Software Park Co., Ltd., 39 Jianshan Road, Changsha hi tech Development Zone, Changsha, Hunan 410000 Patentee after: Hunan Tongyou feiji Technology Co.,Ltd. Address before: 100089 floor 1-4, building 2, yard 9, Dijin Road, Haidian District, Beijing Patentee before: BEIJING TOYOU FEIJI ELECTRONICS Co.,Ltd. |