CN106844607A - A kind of SQLite data reconstruction methods suitable for non-integer major key and idle merged block - Google Patents
A kind of SQLite data reconstruction methods suitable for non-integer major key and idle merged block Download PDFInfo
- Publication number
- CN106844607A CN106844607A CN201710032669.2A CN201710032669A CN106844607A CN 106844607 A CN106844607 A CN 106844607A CN 201710032669 A CN201710032669 A CN 201710032669A CN 106844607 A CN106844607 A CN 106844607A
- Authority
- CN
- China
- Prior art keywords
- data
- free block
- block
- free
- interim
- 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
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1458—Management of the backup or restore process
- G06F11/1469—Backup restoration techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- G06F2201/80—Database-specific techniques
Abstract
The present invention is claimed a kind of suitable for non-integer major key and the SQLite data reconstruction methods of idle merged block, is related to computer forensics field, including step：1st, from root page and file header, all free blocks and free page are collected.2nd, cell layout's difference of analysis integer major key and non-integer major key and the difference of the meaning of each byte, temporarily assume that free block includes a unit, calculates the information of capped type, parse type information and data field, carry out data recovery.3rd, for that can not assert that it includes multiple units by the free block of step 2.Then based on splitting and verifying, the element length that pre-estimation is present in free block is 4 to idle block length.Each value to estimating is judged using single free block extraction module.4th, for reply B+tree re-organizeds cause the situation of free block reduction, data are extracted in the free page being collected into from step one.The method that the present invention is provided can readily recover deleted data from SQLite3 database files, for Subsequent electronic evidence obtaining work provides data.
Description
Technical field
The present invention relates to computer forensics field, the data recovery to SQLite databases, more particularly to one are related generally to
Plant based on SQLite file structures and deletion, the database restoring method of recombination mechanism.
Background technology
Pointed out according to Trend Force research reports, only 2016 third season, the production quantity of smart mobile phone reaches
3.5 hundred million, and keep growth trend.In electronic evidence-collecting, intelligent machine evidence obtaining is particularly significant, and it is that evidence obtaining work launches that data are extracted
Basis.Substantial amounts of user profile such as short message, browse record, address list and be stored in SQLite, how to extract deleted
Data to evidence obtaining work important in inhibiting.
Since nineteen eighty-three, recovery of many scholars all to being deleted data in SQLite is studied.Existing research
It is concentrated mainly on four aspects.First, from the angle of secondary file, transaction file, WAL and index file can be analyzed.The party
Method can be independent of database file, and deleted data are extracted from secondary file.In addition, from concrete application combination SQLite
The angle of deleting mechanism, is limited in certain specific application, can labor its logical storage structure, can obtain relatively good
Recovery efficiency, but this method heavy dependence is specifically applied, the scope of application is not extensive.3rd, from file system level
Angle, the database file of old version can be obtained, carry out data extraction for each history file, it might even be possible to build
User operation time axle.Finally, research the most basic is then the angle from SQLite file structures and memory allocation mechanism
Degree, analyzes its binary structure and deletion, recombination mechanism, proposes widely used restoration methods.
To binary structure and mechanism analysis, the mechanism of data storage can be analyzed, directly extract data.Can also analyze
Free block and the transfer principle of unit, carry out type estimation.But in most cases, unit quilt in the table of non-integer major key
The key message of type is lost after deletion, and the information needs to be precisely determined.Carry out with deletion in addition, B+tree can group again
Knit, cause available free merged block to be reduced with quantity.
Therefore, how to consider and solve the above problems, proposition is a kind of comprehensive, and the SQLite data of recovery rate high are extensive
Compound case is significant to computer forensics.
The content of the invention
Present invention seek to address that above problem of the prior art.Propose one kind and compensate for existing method to non-master key type
The not enough problem of data analytic ability, it is also considered that arrived the situation for splitting free block raising recovery rate, and considered sky
Not busy number of pages increases the phenomenon of this influence recovery rate, improves the recovery rate method that SQLite is deleted data.Skill of the invention
Art scheme is as follows：
A kind of SQLite data reconstruction methods suitable for non-integer major key and idle merged block, it is comprised the following steps：
Step 1：The SQLite files of data to be recovered are obtained, the system table sqlite_master included according to it determines
The root page number of tables of data to be recovered and the field structure information of table, from root page and file header, collect all free blocks with
Free page；
Step 2, assume each free block be deleted before comprising an element analysis for deleted data-base recording
Cell layout difference of the integer major key with non-integer major key and the meaning of each byte, calculate capped field type information,
Parsing type information and data field, carry out data recovery, judge whether single free block can recover valid data；
Step 3：For the free block that valid data can not be recovered by step 2, assert that it includes what multiple was deleted
Unit, then draw interim free block collection based on fractionation and proof method, judges that can interim free block recover valid data, if energy
The interim free block of all brothers is then deleted, data are then added into restoration result collection, continuation judges next interim free block；It is no
Then continue to judge next interim free block, until interim free time set of blocks is sky；
Step 4：Free page set is obtained by free page chained list, each free page is traveled through, by this page of all of storage
The unit of data-base recording adds unit set.For each unit in unit set, according to Type information analysis data fields
Data are obtained, restoration result collection is added.
Further, the step 2) process step during for comprising a deleted unit is：For
Type capped situation, using the method based on estimating with the capped value of information of the calculating of checking.
It is assumed that each free block just includes a deleted unit, current idle block is judged, due to
Payloadsize, rowId and headersizes at least account for 3 bytes altogether, and unit is changed into preceding four bytes after free block
It is capped, therefore Type domains first character section is possible to capped, is divided into two kinds of situation discussion, that is, record the class of first character section
The Type1 of type information capped situation and uncovered situation, it is assumed that Type domains starting point is i, respectively with the 4th to most
Latter byte is starting point i, is judged, if i=4, it is believed that Type1 loss of datas, then individually judged, if i ＞=5,
Think all Type information completelies, jump procedure 2.2；
If step 2.1, starting point are the 4th byte, the 4th value of byte is made to be incremented by from 0x00 to 0xFF, for current
Each corresponding state of value in 256 values that free block is obtained, performs step 2.2-2.2.4, and any one value is corresponding
State obtains deleted cell data by verifying, then the data that will be recovered add restoration result collection, terminate the free time
Block judges that continuation judges next free block；
Step 2.2, it is first original position of Type with i, according to the variable long storage rule of Type, parses institute
There is Type, and according to the data length of its value computational theory
Step 2.3, according to step 2.2 result, byte number len (T) shared by Type domains can be obtained, can obtain this free block residue word
Joint number realDLen, if readlDLen=theoryDLen, data is extracted according to Type-Data corresponding relations, is recovered
By adding restoration result collection after checking, jump procedure 2.5 otherwise, performs step 2.4 to the data come；
Step 2.4, makes i=i+1, jump procedure 2.1, if i is last byte position of free block, by the free block
Failure free block collection is added, step 2.5 is performed；
Step 2.5, continuation judges next free block, jumps to step 2.1, is last free block until currently.
Go for the table of any type of major key；Based on the method, deleted data are obtained.
Further, the step 3) carry out what data recovery failure free block collection was carried out based on the method for splitting with verify
Recovery operation includes step：
S31：First by circulating the interim free block collection of acquisition：(1) since the idle block length len=4 for estimating, interception
Current failure free block, adds interim free block collection.len++；(2) if len is equal to the idle block length of current failure, judge
Next failure free block, redirects (1), if being currently last failure free block, terminates previous cycle, obtains interim idle
Block collection；
S32：Each interim free block is performed carries out data recovery, if not obtaining recovery data, continuation judges next
Individual interim free block；If obtaining the data recovered, the brother that the interim free block is derived from same failure free block with it is deleted
Then data are added restoration result collection by the interim free block of younger brother, and continuation judges next interim free block, until interim free block
It is sky；
Advantages of the present invention and have the beneficial effect that：
The present invention can be applicable the situation that the table of various major key types is deleted, idle after being also applied for B+tree restructuring
The situation that merged block is reduced with quantity.This method compensate for existing method and non-primary key categorical data analytic ability deficiency asked
Topic, it is also considered that having arrived the situation for splitting free block raising recovery rate, and considered idle number of pages increases this influence
The phenomenon of recovery rate.This method carries out recovery checking from byte rank, considers various situations, can improve SQLite and be deleted
Except the recovery rate of data.
Brief description of the drawings
Fig. 1 is that the present invention provides preferred embodiment collection free block and the overall flow recovered to its non-disassembled form
Figure.
Fig. 2 is the operational flowchart for not split recovery in the present invention to each free block.
Fig. 3 is the flow chart of the basic recovery operation of each original position i to each free block in the present invention.
Fig. 4 is the flow chart of the recovery operation carried out to failure free block collection in the present invention.
Fig. 5 is the flow chart of the preferred embodiment of the present invention.
Specific 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, detailed
Carefully describe.Described embodiment is only a part of embodiment of the invention.
The present invention solve above-mentioned technical problem technical scheme be,
For the problem that idle block type key message is lost, this method is noticed for integer major key and non-integer master
Key, the binary system layout of unit is different from the meaning of each byte, it is proposed that estimate the numerical computation method being combined with checking.
For idle merged block and situation about reducing, have studied and cause B+tree to reorganize, idle merged block and idle number of blocks
The defragment mechanism of reduction, it is proposed that a kind of based on the restoration methods for splitting free block and idle page data extraction.
The present invention sets up a kind of SQLite data reconstruction methods suitable for non-integer major key and idle merged block, its method
Including following four implementation steps：
Step 1, the SQLite files for obtaining from mobile device data to be recovered, according to the system table that it is included
Sqlite_master determines the root page number of tables of data to be recovered and the field structure information of table.With reference to depositing for SQLite files
Storage structure, since root page number and file header, travels through to B+tree, collects wherein all of free page and free block, right
Step 2 is performed in each free block.
Assume each free block just comprising a deleted unit in step 2, this step.Current idle block is sentenced
It is disconnected.Because payloadsize, rowId and headersizes at least account for altogether 3 bytes, before unit is changed into free block covering
4 bytes, therefore Type domains first character section is possible to capped.It is divided into two kinds of situation discussion, i.e. Type1 capped situation
With uncovered situation.Because this method is judged Type1, therefore suitable for the table of any major key type.It is assumed that
Type domains starting point is i.It is respectively starting point i with the 4th to last byte, is judged.If i=4, it is believed that Type1 data
Lose, jump procedure 2.1, if i ＞=5, it is believed that all Type information completelies, jump procedure 2.2.
If step 2.1, starting point are the 4th byte, the 4th value of byte is made to be incremented by from 0x00 to 0xFF, for current
Each corresponding state of value in 256 values that free block is obtained, performs step 2.2-2.2.4, and any one value is corresponding
State obtains deleted cell data by verifying, then the data that will be recovered add restoration result collection, terminate the free time
Block judges that continuation judges next free block.If 256 are worth corresponding state and cannot make i=4 by checking, step is performed
Rapid 2.
Step 2.2, it is first original position of Type with i, according to the variable long storage rule of Type, parses institute
There is Type, and according to the data length of its value computational theory
Step 2.3, according to step 2.2 result, byte number len (T) shared by Type domains can be obtained.This free block residue word can be obtained
Joint number realDLen.If readlDLen=theoryDLen, data are extracted according to Type-Data corresponding relations, recovered
The data come are by adding restoration result collection, jump procedure 2.5 after checking.Otherwise, step 2.4 is performed.
Step 2.4, makes i=i+1, jump procedure 2.If i is last byte position of free block, the free block is added
Enter unsuccessfully free block collection, perform step 2.5.
Step 2.5 continuation judges next free block, jumps to step 2, if being currently last free block, performs step
Rapid 3.
Step 3, this step are that the fractionation of the free block collection that fails in step 2 is judged, make the data length j for estimating be passed from 4
Increase to idle block length len (fb), a free block intercepts the j data of byte length to each j value, produce a length
It is the interim free block of j, each failure free block can generate len-3 interim free block.Faced by failure free block collection
When free block collection, following operation is performed with interim free block collection.
Step 3.1, step 2.5 is replaced with into step 3.2.Step 2 is performed to each interim free block.
Step 3.2, concentrated from interim free block delete with current interim free block and brother temporarily free block (i.e. by same
The interim free block that individual failure free block map is obtained).Continuation judges next interim free block, jumps to step 3.1, if working as
Preceding is last interim free block, performs step 4.
Step 4, the free page collection collected for each step 1, according to the value of page first character section, brush selects leaf
Page, the i.e. page of 0x0D.For each leaf page, cell value therein is extracted.Generally, the value of the unit is not coated to
Lid, can directly extract data, be added to restoration result concentration.
It is to collect free block and the overall flow figure recovered to its non-disassembled form in the present invention referring to Fig. 1, including
Following steps.
S1：According to sqlite_master and database file head, all of free block and free page are collected.Owned
Idle set of blocks Setfbs={ fbi| i=1,2 ..., n }.
S2：Further, Fig. 2 is performed to each free block.If the operation recovery goes out data, result is added and is recovered
Result set, then proceedes to judge next free block.
S3：If being currently last free block, terminate algorithm, continue executing with the interior of the operation of Fig. 3, i.e. step 3
Hold.
It is the data recovery operational flowchart to each free block in the present invention referring to Fig. 2.For the specific implementation of S2 is walked
Suddenly.
Since i=4, i.e. byte number before Type1 is for pre=3 proceeds by judgement and recovers.If i=4, pre
=3, then perform RC (fb, i), i.e., following to circulate, j=0x00：
S21：(1) value for making i-th byte of free block is j；(2) it is Fig. 3 to perform rc (fb, 3), if successfully recovering data,
The data are exported, terminates current idle block.(3) if failed, j++, if j ＜=0xFF, redirects (1), otherwise, terminates this
Circulation, makes i=5.
S22：If i ＞=5, following circulation is done in pre ＞=4：(1) rc (fb, pre) (2) is performed if successfully recovering number
According to, export the data, then terminate current idle block.(3) otherwise, if i is last position of free block, by current idle block
Failure free block collection is added, is terminated current idle block and is judged.Otherwise, i++, pre++ are made, is redirected (1).
It is the flow chart of the basic recovery operation of each original position i in the present invention to each free block referring to Fig. 3,
It is operation most basic in data recovery.I.e. one time rc (fb, pre).
S23：In this operation, byte-by-byte with incoming i as starting point, the rule parsing according to variable long is all of
Type, can obtain Type domains byte quantity.The length of the length of the data field Data of theory and the Data of reality can be calculated.
S24：If theoretical length is equal with physical length, then it is assumed that this free block original cell data can be resumed.Recover
Data, and export correct data.If can not, do not export, terminate current operation.Treat that next input i continues.
S3：It is the flow chart of the recovery operation carried out to failure free block collection in the present invention referring to Fig. 4, belongs to merging empty
Not busy block extraction module content.By preposition algorithm, can fail free block collection.
S31：First by circulating the interim free block collection of acquisition：(1) current failure free block is intercepted since len=4, plus
Enter interim free block collection.len++.(2) if len is equal to the idle block length of current failure, next failure free block is judged,
Redirect (1).If being currently last failure free block, terminate previous cycle.
S32：Each interim free block is performed and operated shown in Fig. 2, if not obtaining recovery data, continuation judges next
Individual interim free block.The data of recovery are such as obtained, is then deleted the interim free block of all brothers and (is obtained by same failure free block map
To), data are then added into restoration result collection, continuation judges next interim free block.
S4：Finally, using all free pages being collected into, all of leaf page is filtered out, further according to data library text
Part structure, reads cell data present in it, is added in the lump in recovery data set.
Recover data set and be the final recovery data output result of this method.
The above embodiment is interpreted as being merely to illustrate the present invention rather than limits the scope of the invention.
Read after the content of record of the invention, technical staff can make various changes or modifications to the present invention, these equivalent changes
Change and modification equally falls into the scope of the claims in the present invention.
Claims (3)
1. a kind of SQLite data reconstruction methods suitable for non-integer major key and idle merged block, it is characterised in that including with
Lower step：
Step 1：The SQLite files of data to be recovered are obtained, the system table sqlite_master determinations included according to it are intended to extensive
The root page number of multiple tables analysis and the field structure information of table, from root page and file header, collect all free blocks with the free time
Page；
Step 2：Assuming that each free block included a unit for deleted data-base recording before being deleted, integer is analyzed
Major key and the meaning of different and each byte of the cell layout of non-integer major key, calculate capped field type information, solution
Analysis type information and data field, by estimating to carry out data recovery with the method for checking, judge whether single free block can recover
Go out valid data, if can be so that according to Type information extraction data numeric field datas, the meaning according to each Type is to data domain information
Parsed, extracted data；
Step 3：For the free block that valid data can not be recovered by step 2, assert that it includes multiple deleted units,
Then based on split with proof method draw interim free block collection, judge that can interim free block recover valid data, if can if delete
Except the interim free block of all brothers, data are then added into restoration result collection, continuation judges next interim free block；Otherwise after
It is continuous to judge next interim free block, until interim free time set of blocks is sky；
Step 4：Free page set is obtained by free page chained list, each free page is traveled through, by this page of all of data storage storehouse
The unit of record adds unit set, for each unit in unit set, number is obtained according to Type information analysis data field
According to addition restoration result collection.
2. SQLite data reconstruction methods suitable for non-integer major key and idle merged block according to claim 1, its
It is characterised by, the step 2) process step during for comprising a deleted unit is：It is capped for Type
Situation, using the method based on estimating with the capped value of information of calculating of checking.
It is assumed that each free block just includes a deleted unit, current idle block is judged, due to
Payloadsize, rowId and headersizes at least account for 3 bytes altogether, and unit is changed into preceding four bytes after free block
It is capped, therefore Type domains first character section is possible to capped, is divided into two kinds of situation discussion, that is, record the class of first character section
The Type1 of type information capped situation and uncovered situation, it is assumed that Type domains starting point is i, respectively with the 4th to most
Latter byte is starting point i, is judged, if i=4, it is believed that Type1 loss of datas, then individually judged, if i ＞=5,
Think all Type information completelies, jump procedure 2.2；
If step 2.1, starting point are the 4th byte, the 4th value of byte is made to be incremented by from 0x00 to 0xFF, for current idle
Each corresponding state of value in 256 values that block is obtained, performs step 2.2-2.2.4, any one corresponding state of value
Deleted cell data is obtained by verifying, then the data that will be recovered add restoration result collection, terminate the free block and sentence
Disconnected, continuation judges next free block；
Step 2.2, it is first original position of Type with i, according to the variable long storage rule of Type, parsing is all
Type, and according to the data length of its value computational theory
Step 2.3, according to step 2.2 result, byte number len (T) shared by Type domains can be obtained, this free block remainder bytes number can be obtained
RealDLen, if readlDLen=theoryDLen, data is extracted according to Type-Data corresponding relations, is recovered
By adding restoration result collection after checking, jump procedure 2.5 otherwise, performs step 2.4 to data；
Step 2.4, i=i+1 is made, jump procedure 2.1, if i is last byte position of free block, the free block is added
Failure free block collection, performs step 2.5；
Step 2.5, continuation judge next free block, jump to step 2.1, are last free block until currently.
3. SQLite data reconstruction methods suitable for non-integer major key and idle merged block according to claim 1, its
It is characterised by, the step 3) step is included to the recovery operation that failure free block collection is carried out based on the method for splitting and verifying：
Step 3.1, interim free block collection is obtained by circulating first：(1) since the idle block length len=4 for estimating, interception
Current failure free block, adds interim free block collection len++；(2) if len is equal to the idle block length of current failure, judge
Next failure free block, redirects (1), if being currently last failure free block, terminates previous cycle, obtains interim idle
Block collection；
Step 3.2, each interim free block is performed carry out data recovery, if not obtaining recovery data, continuation judges next
Individual interim free block；If obtaining the data recovered, the brother that the interim free block is derived from same failure free block with it is deleted
Then data are added restoration result collection by the interim free block of younger brother, and continuation judges next interim free block, until interim free block
It is sky.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710032669.2A CN106844607B (en) | 2017-01-16 | 2017-01-16 | SQLite data recovery method suitable for non-integer main key and idle block combination |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710032669.2A CN106844607B (en) | 2017-01-16 | 2017-01-16 | SQLite data recovery method suitable for non-integer main key and idle block combination |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106844607A true CN106844607A (en) | 2017-06-13 |
| CN106844607B CN106844607B (en) | 2020-05-12 |
Family
ID=59123504
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710032669.2A Active CN106844607B (en) | 2017-01-16 | 2017-01-16 | SQLite data recovery method suitable for non-integer main key and idle block combination |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106844607B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108563714A (en) * | 2018-03-29 | 2018-09-21 | 苏州开心盒子软件有限公司 | A kind of SQLite3 databases have deleted the extracting method of data block |
| CN109582504A (en) * | 2018-12-05 | 2019-04-05 | 深圳软牛科技有限公司 | A kind of data reconstruction method and device for apple equipment |
| CN109828865A (en) * | 2019-01-24 | 2019-05-31 | 北京三快在线科技有限公司 | Data reconstruction method, device and electronic equipment |
| CN112052120A (en) * | 2020-08-27 | 2020-12-08 | 厦门市美亚柏科信息股份有限公司 | Database deleted data recovery method and device |
| CN112698984A (en) * | 2020-12-17 | 2021-04-23 | 宁波三星医疗电气股份有限公司 | Database recovery method of embedded device, electronic device and medium |
| CN113407375A (en) * | 2020-03-16 | 2021-09-17 | 浙江宇视科技有限公司 | Recovery method, device, equipment and storage medium for deleted data of database |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120310895A1 (en) * | 2011-06-03 | 2012-12-06 | Chicago Electronic Discovery LLC d/b/a viaForensics | Methods, apparatuses, and computer program products for database record recovery |
| CN102937926A (en) * | 2012-10-30 | 2013-02-20 | 厦门市美亚柏科信息股份有限公司 | Method and device for recovering deleted sqlite files on mobile terminal |
| CN103778259A (en) * | 2014-03-03 | 2014-05-07 | 公安部第三研究所 | Method for realizing data recovery of smart phone on basis of Sqlite3 |
| CN104035839A (en) * | 2014-06-12 | 2014-09-10 | 上海交通大学 | Method for implementation of recovery of Android system private data |
| CN104376091A (en) * | 2014-11-20 | 2015-02-25 | 厦门市美亚柏科信息股份有限公司 | Method and device for recovering deleted data in SQLite |
| CN105426542A (en) * | 2015-12-24 | 2016-03-23 | 厦门市美亚柏科信息股份有限公司 | Recording and analyzing method and device of deleted data table on SQLite free page |
-
2017
- 2017-01-16 CN CN201710032669.2A patent/CN106844607B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120310895A1 (en) * | 2011-06-03 | 2012-12-06 | Chicago Electronic Discovery LLC d/b/a viaForensics | Methods, apparatuses, and computer program products for database record recovery |
| CN102937926A (en) * | 2012-10-30 | 2013-02-20 | 厦门市美亚柏科信息股份有限公司 | Method and device for recovering deleted sqlite files on mobile terminal |
| CN103778259A (en) * | 2014-03-03 | 2014-05-07 | 公安部第三研究所 | Method for realizing data recovery of smart phone on basis of Sqlite3 |
| CN104035839A (en) * | 2014-06-12 | 2014-09-10 | 上海交通大学 | Method for implementation of recovery of Android system private data |
| CN104376091A (en) * | 2014-11-20 | 2015-02-25 | 厦门市美亚柏科信息股份有限公司 | Method and device for recovering deleted data in SQLite |
| CN105426542A (en) * | 2015-12-24 | 2016-03-23 | 厦门市美亚柏科信息股份有限公司 | Recording and analyzing method and device of deleted data table on SQLite free page |
Non-Patent Citations (1)
| Title |
|---|
| JIANG DU等: "A SQLite Recovery Method for Various Primary Key and B+tree Reorganization", 《INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND COMMUNICATION TECHNOLOGY (CNCT2016)》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108563714A (en) * | 2018-03-29 | 2018-09-21 | 苏州开心盒子软件有限公司 | A kind of SQLite3 databases have deleted the extracting method of data block |
| CN108563714B (en) * | 2018-03-29 | 2021-08-03 | 苏州开心盒子软件有限公司 | Method for extracting deleted data blocks of SQLite3 database |
| CN109582504A (en) * | 2018-12-05 | 2019-04-05 | 深圳软牛科技有限公司 | A kind of data reconstruction method and device for apple equipment |
| CN109828865A (en) * | 2019-01-24 | 2019-05-31 | 北京三快在线科技有限公司 | Data reconstruction method, device and electronic equipment |
| CN113407375A (en) * | 2020-03-16 | 2021-09-17 | 浙江宇视科技有限公司 | Recovery method, device, equipment and storage medium for deleted data of database |
| CN113407375B (en) * | 2020-03-16 | 2024-03-29 | 浙江宇视科技有限公司 | Database deleted data recovery method, device, equipment and storage medium |
| CN112052120A (en) * | 2020-08-27 | 2020-12-08 | 厦门市美亚柏科信息股份有限公司 | Database deleted data recovery method and device |
| CN112052120B (en) * | 2020-08-27 | 2022-08-05 | 厦门市美亚柏科信息股份有限公司 | Database deleted data recovery method and device |
| CN112698984A (en) * | 2020-12-17 | 2021-04-23 | 宁波三星医疗电气股份有限公司 | Database recovery method of embedded device, electronic device and medium |
| CN112698984B (en) * | 2020-12-17 | 2023-07-04 | 宁波三星医疗电气股份有限公司 | Database recovery method of embedded device, electronic device and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106844607B (en) | 2020-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106844607A (en) | A kind of SQLite data reconstruction methods suitable for non-integer major key and idle merged block | |
| CN100541495C (en) | A kind of searching method of individual searching engine | |
| US11514014B2 (en) | Staggered merging in log-structured merge forests | |
| EP2344959B1 (en) | Index compression in databases | |
| Koudas | Space efficient bitmap indexing | |
| CN102915365A (en) | Hadoop-based construction method for distributed search engine | |
| CN104915450A (en) | HBase-based big data storage and retrieval method and system | |
| CN102831222A (en) | Differential compression method based on data de-duplication | |
| CN102033748A (en) | Method for generating data processing flow codes | |
| CN104331446A (en) | Memory map-based mass data preprocessing method | |
| CN104391908A (en) | Locality sensitive hashing based indexing method for multiple keywords on graphs | |
| Bramandia et al. | On incremental maintenance of 2-hop labeling of graphs | |
| CN111625596B (en) | Multi-source data synchronous sharing method and system for real-time new energy consumption scheduling | |
| CN107818145A (en) | A kind of user behavior tag along sort extracting method based on dynamic reptile | |
| CN110349635A (en) | A kind of parallel compression method of gene sequencing quality of data score | |
| CN110162513A (en) | Tables of data connection method and computer readable storage medium for the processing of smart grid big data | |
| CN110008236A (en) | A kind of data distribution formula is from increasing coding method, system, equipment and medium | |
| CN103353864A (en) | Method and system for excavating approximate dictionary rule of database, and database terminal | |
| CN115098486A (en) | Real-time data acquisition method based on customs service big data | |
| WO2020238750A1 (en) | Data processing method and apparatus, electronic device, and computer storage medium | |
| CN110795409B (en) | Implementation method for importing parameters of conventional generator set into PSASP | |
| CN112395286B (en) | Chained data table connection method, device, equipment and storage medium | |
| CN103544139A (en) | Forward word segmentation method and device based on Chinese retrieval | |
| CN112650797A (en) | Isomerous DBMS data exchange method and system applying same | |
| KR102013839B1 (en) | Method and System for Managing Database, and Tree Structure for Database |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |