CN107729451B - Method for searching data in EDB database source file - Google Patents
Method for searching data in EDB database source file Download PDFInfo
- Publication number
- CN107729451B CN107729451B CN201710928197.9A CN201710928197A CN107729451B CN 107729451 B CN107729451 B CN 107729451B CN 201710928197 A CN201710928197 A CN 201710928197A CN 107729451 B CN107729451 B CN 107729451B
- Authority
- CN
- China
- Prior art keywords
- page
- data
- pointer
- bytes
- address
- 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.)
- Active
Links
Images
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/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24553—Query execution of query operations
- G06F16/24562—Pointer or reference processing operations
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (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 method for searching data in an EDB database source file, which is characterized by comprising the following steps of S100, searching an identifier and a page length of an EDB database; s200, acquiring a root node page, wherein the root node page is fixed as the 5 th page of the EDB database, and addresses the initial address of the root node page by multiplying the page length by 5; s300, analyzing the root node page; s400, analyzing the data page; s500, whether the data page is analyzed completely, if so, the process is ended, otherwise, the step S400 is executed. The invention solves the technical problem that no method for searching and acquiring data in the EDB database source file exists in the prior art.
Description
Technical Field
The invention belongs to the field of data recovery, relates to a method for searching data in a database source file, and particularly relates to a method for searching data in an EDB database source file.
Background
The EDB database is an embedded database engine based on SQL Server CE, provides core functions for Windows CE-based application programs, and is used for Microsoft exchange mailbox storage and storage of browsing records of IE10 browser. Using the EDB, a developer can create an object store, called a database volume (volume), that can contain multiple databases. The database volume is file-based and therefore can be easily copied and moved.
When an EDB database source file is damaged or cannot be opened due to other reasons, a method is needed for searching and acquiring data in the EDB database source file so as to achieve the purpose of recovering the data, and the prior art does not have a method for searching and acquiring the data in the EDB database source file.
Disclosure of Invention
The invention provides a method for searching data in an EDB database source file aiming at the defects and the problems in the prior art, wherein the data is addressed and obtained by analyzing the structure of a root node page in the EDB database source file, addressing a data page and analyzing the structure of the data page; the method comprises the following steps:
s100, searching the identifier and the page length of the EDB database, namely, backward jumping to 0x04 bytes by taking the initial address of the EDB database as a starting address and reading the content of continuous 4 bytes as the identifier of the EDB database; taking the initial address of the EDB database as a starting address, jumping backwards by 0xEC bytes and reading the content of continuous 2 bytes as the page length, wherein the identifier of the EDB database and the page length are stored in a small-end format;
s200, acquiring a root node page, wherein the root node page is fixed as the 5 th page of the EDB database, and addresses the initial address of the root node page by multiplying the page length by 5;
s300, analyzing the root node page;
s400, analyzing the data page;
s500, whether the data page is analyzed completely, if so, the process is ended, otherwise, the step S400 is executed.
Preferably, the step S300 includes the steps of:
s301, backward jumping to 0x24 bytes by taking the initial address of the root node page as a starting address and reading the content of the current byte as a page identifier;
s302, judging whether the page identifier is a data page identifier 0x03, if so, executing the step S400, otherwise, executing the step S303;
s303, searching and analyzing the pointer page management field, namely acquiring and verifying the page identifier as a pointer page identifier 0x 05; taking an address obtained by subtracting 0x04 from the page tail address of the root node page as a starting address, taking four bytes as a group, and sequentially reading and outputting the pointer page management field forward, wherein the low-2-byte content in the four bytes is the length of pointer page number information stored in a small-end format, and the high-2-byte content is the offset of the pointer page number information stored in the small-end format;
s304, acquiring the pointer page number information, namely, taking the initial address of the root node page as a starting address, jumping backwards by 0x50, adding the offset of the pointer page number information, and reading the pointer page number information, wherein the byte length is the length of the pointer page number information;
s305, acquiring the pointer page number, wherein the content of the first two bytes of the pointer page number information is the offset in the segment of the pointer page number information stored in a small-end format, the address of the third byte of the pointer page number information is taken as the initial position, the offset in the segment is jumped, the content from the current address to the tail address of the pointer page number information is read as the pointer page number, and the pointer page number is stored in the small-end format;
s306, reading and judging whether the content of the next pointer page management field is the end identifier 0x4F4F, if so, executing the step S307, otherwise, executing the step S304.
S307, outputting all pointer page numbers;
s308, addressing a data page according to the pointer page number, namely skipping by taking the initial address of the EDB database as an initial address, wherein the length of the skipped byte is equal to the sum of the pointer page number plus 1 and multiplied by the page length;
s309, acquiring the identifier of the data page, namely, taking the first address of the data page as a starting address, jumping backwards by 0x24 bytes and reading the content of the current byte, namely 0x02, as the identifier of the data page.
Preferably, the step S400 includes the steps of:
s401, acquiring the free area capacity in the data page, wherein the starting address of the data page jumps backwards by 0x1C bytes, and 4 bytes of content is read as the free area capacity, and the free area capacity is stored in a small-end format;
s402, acquiring the byte length of an effective data area in the data page, namely, jumping backwards by 0x20 bytes from the starting address of the data page, and reading 2 bytes of content as the byte length of the effective data area, wherein the byte length of the effective data area is stored in a small-end format;
s403, acquiring the number of data management fields of the data page, namely, skipping backward 0x22 bytes from the starting address of the data page, and reading 2 bytes of content as the number of the management fields of the data page, wherein the number of the management fields of the data page is stored in a small-end format;
s404, acquiring and verifying the page number, namely, jumping backwards by 0x40 bytes from the starting address of the data page, reading the content of 0x10 bytes as the page number, and storing the page number in a small-end format;
s405, searching and analyzing a data management field of the data page, wherein an address obtained by subtracting 0x04 from a page tail address of the data page is used as a starting address, four bytes are used as a group, and the data management field of the data page is sequentially read forward and output, wherein the low 2-byte content in the four bytes is the data information length stored in a small-end format, and the high 2-byte content is the data information offset stored in the small-end format;
s406, acquiring the data information, namely, taking the initial address of the data page as a starting address, backward jumping to 0x50 plus the offset of the data information, reading the content of the current address as the data information, wherein the length of the byte of the data information is the length of the data information;
s407, judging whether the content of the next data management field is the end identifier 0x4F4F, if so, executing the step S500, otherwise, executing the step S406.
Preferably, the EDB database has an identifier of 0 xefclab 89, and the page length is 0x0080, all stored in a small-end format.
The method has the beneficial effect of solving the technical problem that no method for searching and acquiring the data in the EDB database source file exists in the prior art.
Drawings
FIG. 1 is a main flow diagram of the present invention;
FIG. 2 is a diagram illustrating the data structure of the EDB database identifier and page length according to an embodiment of the present invention;
FIGS. 3A and 3B are schematic data structures of a root node page of an EDB database according to an embodiment of the present invention;
FIG. 4 is a detailed flowchart of step S300 according to the present invention;
FIG. 5 is a detailed flowchart of step S400 according to the present invention;
fig. 6A and 6B are schematic data structures of data pages of an EDB database according to an embodiment of the present invention.
Detailed Description
The invention is further illustrated with reference to the figures and examples. As shown in fig. 1, the method of the present invention comprises the steps of:
s100, searching the identifier and the page length of the EDB database, namely, as shown in FIG. 2, backward jumping to 0x04 bytes and reading the content 0xEFCDAB89 of continuous 4 bytes as the identifier of the EDB database by taking the first address 0x00000000 of the EDB database as a starting address, as shown in a black rectangular box part in FIG. 2; since the identifier is stored in a small-end format, the identifier of the EDB database is 0x89 ABCDEF;
similarly, with the first address of the EDB database as the starting address, 0xEC bytes are jumped backwards and the content 0x0080 of 2 consecutive bytes is read as the page length, as shown by the black underlined part in fig. 2; since the page length is stored in a small-end format, the page length of the EDB database is 0x 8000.
S200, acquiring a root node page, wherein the root node page is fixed as the 5 th page of the EDB database, is multiplied by 5 by the page length of 0x8000, and is addressed to the first address of 0x28000 of the root node page, as shown in the figure 3A.
S300, analyzing the root node page, comprising the following steps as shown in FIG. 4:
s301, as shown in FIG. 3A, with the first address 0x28000 of the root node page as the starting address, jumping backward 0x24 bytes and reading the content 0x05 of the current byte as the page identifier, as shown in the black oval box part in FIG. 3A;
s302, judging whether the page identifier is a data page identifier 0x03, if so, executing the step S400, otherwise, executing the step S303; in this embodiment, the page identifier is a pointer page identifier 0x05, which indicates that the data stored in the root node page is a pointer to a data page, and step S303 is executed according to the flow;
s303, searching and analyzing a pointer page management field, wherein as shown in FIG. 3B, the page tail address of the root node page is 0x2FFFF, and it is noted that the page length of 0x8000 means 0x0000 to 0x7FFF, and total 0x8000 bytes, so that the first address of 0x28000 plus 0x7FFF obtains the page tail address of the root node page as 0x2FFFF, and then the address of 0x2FFFB obtained by subtracting 0x04 is the starting address;
as shown in fig. 3B, the pointer page management field is sequentially read and output forward with four bytes as a group, where the lower 2 bytes of content in the four bytes is the length of the pointer page number information stored in the little-endian format, and the upper 2 bytes of content is the offset of the pointer page number information stored in the little-endian format; as shown in fig. 3B, there are two pointer page management fields in this embodiment, 0x06001000 and 0x13001600 respectively; taking 0x13001600 as an example, the lower 2 bytes of content 0x1300 in the four bytes is the length of the pointer page number information stored in the tip format, that is, the length is 0x0013, and the upper 2 bytes of content 0x1600 is the offset of the pointer page number information stored in the tip format, that is, the offset is 0x 0016;
s304, acquiring pointer page number information, namely, as shown in FIG. 3A, taking the first address 0x28000 of the root node page as the initial address, jumping backwards by 0x50 and adding the offset 0x0016 of the pointer page number information, addressing to the address 0x00028060, reading the pointer page number information, wherein the byte length is the length 0x0013 of the pointer page number information, and as shown in the black rectangular frame part of FIG. 3A;
s305, acquiring a pointer page number, wherein as shown in FIG. 3A, the first two bytes of content 0x0D00 of the pointer page number information is the intra-segment offset of the pointer page number information stored in the small-end format, namely, the offset is 0x 000D; reading the content 0x0D000000 from the current address 0x00028075 to the end address 0x00028078 of the pointer page number information as the pointer page number by using the address 0x00028068 of the third byte of the pointer page number information as the starting position and shifting the content by 0x000D in the backward jump section, as shown by the underlined part of the black rectangular box in fig. 3A, wherein the pointer page number is stored in a small end format, that is, the page number is 0x 0000000D;
s306, reading and judging whether the content of the next pointer page management field is the end identifier 0x4F4F, if so, executing the step S307, otherwise, executing the step S304.
S307, outputting all pointer page numbers, namely, in the embodiment, two pointer page management fields, namely, 0x06001000 and 0x13001600, in the same way, the pointer page number corresponding to the pointer page management field 0x06001000 is resolved to be 0x0E000000, as shown by an underlined part in FIG. 3A, the pointer page number is stored in a small-end format, namely, the page number is 0x0000000E, and all pointer page numbers, namely, 0x0000000D and 0x0000000E are output;
s308, addressing the data page according to the output pointer page number, in the embodiment, taking the page number 0x0E000000 as an example, taking the first address 0x00000000 of the EDB database as a starting address to jump backwards, wherein the byte length of the jump is equal to the sum of the pointer page number 0x0000000E plus 1, namely 0x0000000F, and then multiplied by the page length 0x8000, so as to obtain the first address 0x00078000 of the data page, as shown in FIG. 6A;
s309, acquiring the identifier of the data page, namely, taking the first address 0x00078000 of the data page as a starting address, jumping backwards by 0x24 bytes, addressing to the address 0x00078024 and reading the content 0x02 of the bytes as the identifier of the data page, as shown in a black box part in FIG. 6A.
S400, analyzing the data page, comprising the following steps as shown in FIG. 5:
s401, acquiring the free area capacity in the data page, wherein as shown in FIG. 6A, the starting address 0x00078000 of the data page jumps backward by 0x1C bytes, addresses to the address 0x0007801C and reads 2 bytes of content 0x0C32 to be the free area capacity, as shown in the rectangular box part with a round corner in FIG. 6A; the free area capacity is stored in a small-end format, that is, the page free area capacity is 0x320C bytes;
s402, acquiring the byte length of the effective data area in the data page, wherein the data page has a starting address of 0x00078000 jumping backward by 0x20 bytes as shown in FIG. 6A, addresses to 0x00078020 and reads 2 bytes of content 0xC848 as the byte length of the effective data area as shown in an oval box part in FIG. 6A; the byte length of the effective data area is stored in a small-end format, that is, the byte length of the effective data area is 0x48C8 bytes;
s403, acquiring the number of data management fields of the data page, namely, as shown in FIG. 6A, jumping backward by 0x22 bytes from the starting address of the data page of 0x00078000, addressing to the address of 0x00078022, and reading the content of 2 bytes of 0x3701 as the number of management fields of the data page, as shown by the bold underline in FIG. 6A; the number of management fields of the data page is stored in a small-end format, namely, the number of management fields of the data page is 0x 0137;
s404, acquiring and verifying page numbers, namely, as shown in FIG. 6A, jumping backward 0x40 bytes from the starting address 0x00078000 of the data page, addressing to the address 0x00078040 and reading the content of 0x10 bytes as page numbers, as shown by a dotted rectangle frame part in FIG. 6A; the page number is stored in a small format, i.e., page number 0x00000000000000000000000000000E, i.e., 0x 0E;
s405, searching and analyzing the data management field of the data page, wherein as shown in FIG. 6B, an address 0x0x0007FFFB obtained by subtracting 0x04 from a page tail address 0x0007FFFF of the data page is taken as a starting address, four bytes are taken as a group, and the data management field of the data page is sequentially read forward and output, as shown in a black rectangular frame part in FIG. 6B; note that only the first three data management fields 0x3a000D00, 0x39004700, and 0x3D008000 are shown in fig. 6B with black rectangular boxes; in this embodiment, taking the first data management field 0x3D008000 as an example, the lower 2 bytes of content 0x3a00 in the four bytes is the data information length stored in the small-end format, that is, the data information length is 0x 003A; the high 2-byte content 0x0D00 is the data information offset stored in the little-endian format, i.e., the data information offset is 0x 000D;
s406, acquiring data information, namely, as shown in FIG. 6A, backward jumping to 0x50 byte length by taking the first address 0x00078000 of the data page as a starting address, adding a data information offset 0x000D, addressing to the address 0x0007805D and reading the content of the current address as data information, wherein the byte length of the data information is the data information length 0x003A, and as shown in the black rectangular frame part in FIG. 6A, the acquired data is acquired;
s407, judging whether the content of the next data management field is the end identifier 0x4F4F, if so, executing the step S500, otherwise, executing the step S406.
S500, whether the data page is analyzed completely, if so, the process is ended, otherwise, the step S400 is executed.
By the method, the data in the EDB database source file can be searched and acquired.
It is to be understood that the invention is not limited to the examples described above, but that modifications and variations are possible to those skilled in the art in light of the above teachings, and that all such modifications and variations are intended to be included within the scope of the invention as defined in the appended claims.
Claims (4)
1. A method for searching data in an EDB database source file is characterized by comprising the following steps:
s100, searching the identifier and the page length of the EDB database, namely, backward jumping to 0x04 bytes by taking the initial address of the EDB database as a starting address and reading the content of continuous 4 bytes as the identifier of the EDB database; taking the initial address of the EDB database as a starting address, jumping backwards by 0xEC bytes and reading the content of continuous 2 bytes as the page length, wherein the identifier of the EDB database and the page length are stored in a small-end format;
s200, acquiring a root node page, wherein the root node page is fixed as the 5 th page of the EDB database, and addresses the initial address of the root node page by multiplying the page length by 5;
s300, analyzing the root node page: reading a page identifier, judging whether the page identifier is a data page identifier, searching and analyzing a pointer page management field, acquiring pointer page number information, acquiring a pointer page number, reading and judging whether the content of a next pointer page management field is an end identifier, outputting all pointer page numbers, addressing a data page, and acquiring an identifier of the data page;
s400, analyzing the data page;
s500, whether the data page is analyzed completely, if so, the process is ended, otherwise, the step S400 is executed.
2. The method of claim 1, wherein the step S300 comprises the steps of:
s301, backward jumping to 0x24 bytes by taking the initial address of the root node page as a starting address and reading the content of the current byte as a page identifier;
s302, judging whether the page identifier is a data page identifier 0x03, if so, executing the step S400, otherwise, executing the step S303;
s303, searching and analyzing the pointer page management field, namely acquiring and verifying the page identifier as a pointer page identifier 0x 05; taking an address obtained by subtracting 0x04 from the page tail address of the root node page as a starting address, taking four bytes as a group, and sequentially reading and outputting the pointer page management field forward, wherein the low-2-byte content in the four bytes is the length of pointer page number information stored in a small-end format, and the high-2-byte content is the offset of the pointer page number information stored in the small-end format;
s304, acquiring the pointer page number information, namely, taking the initial address of the root node page as a starting address, jumping backwards by 0x50, adding the offset of the pointer page number information, and reading the pointer page number information, wherein the byte length is the length of the pointer page number information;
s305, acquiring a pointer page number, wherein the content of the first two bytes of the pointer page number information is the offset in the segment of the pointer page number information stored in a small-end format, the address of the third byte of the pointer page number information is taken as the initial position, the offset in the segment is jumped backwards, the content from the current address to the tail address of the pointer page number information is read as the pointer page number, and the pointer page number is stored in the small-end format;
s306, reading and judging whether the content of the next pointer page management field is an end identifier 0x4F4F, if so, executing the step S307, otherwise, executing the step S304;
s307, outputting all pointer page numbers;
s308, addressing a data page according to the pointer page number, namely, jumping backwards by taking the initial address of the EDB database as an initial address, wherein the length of the jumping byte is equal to the sum of the pointer page number plus 1 and then multiplied by the page length;
s309, acquiring the identifier of the data page, namely, taking the first address of the data page as a starting address, jumping backwards by 0x24 bytes and reading the content of the current byte, namely 0x02, as the identifier of the data page.
3. The method for searching data in EDB database source file according to claim 2, wherein said step S400 comprises the following steps:
s401, acquiring the free area capacity in the data page, wherein the starting address of the data page jumps backwards by 0x1C bytes, and 2 bytes of content is read as the free area capacity, and the free area capacity is stored in a small-end format;
s402, acquiring the byte length of an effective data area in the data page, namely, jumping backwards by 0x20 bytes from the starting address of the data page, and reading 2 bytes of content as the byte length of the effective data area, wherein the byte length of the effective data area is stored in a small-end format;
s403, acquiring the number of data management fields of the data page, namely, skipping backward 0x22 bytes from the starting address of the data page, and reading 2 bytes of content as the number of the management fields of the data page, wherein the number of the management fields of the data page is stored in a small-end format;
s404, acquiring and verifying a page number, namely, jumping backwards by 0x40 bytes from the starting address of the data page, and reading the content of 0x10 bytes as the page number, wherein the page number is stored in a small-end format;
s405, searching and analyzing a data management field of the data page, wherein an address obtained by subtracting 0x04 from a page tail address of the data page is used as a starting address, four bytes are used as a group, and the data management field of the data page is sequentially read forward and output, wherein the low 2-byte content in the four bytes is the data information length stored in a small-end format, and the high 2-byte content is the data information offset stored in the small-end format;
s406, acquiring the data information, namely, taking the initial address of the data page as a starting address, backward jumping to 0x50 plus the offset of the data information, reading the content of the current address as the data information, wherein the length of the byte of the data information is the length of the data information;
s407, judging whether the content of the next data management field is the end identifier 0x4F4F, if so, executing the step S500, otherwise, executing the step S406.
4. The method of claim 3, wherein the EDB database identifier is 0xEFCDAB89, the page length is 0x0080, and all the EDB database identifiers are stored in a small end format.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710928197.9A CN107729451B (en) | 2017-10-09 | 2017-10-09 | Method for searching data in EDB database source file |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710928197.9A CN107729451B (en) | 2017-10-09 | 2017-10-09 | Method for searching data in EDB database source file |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107729451A CN107729451A (en) | 2018-02-23 |
| CN107729451B true CN107729451B (en) | 2021-02-23 |
Family
ID=61208510
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710928197.9A Active CN107729451B (en) | 2017-10-09 | 2017-10-09 | Method for searching data in EDB database source file |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107729451B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108763413B (en) * | 2018-05-23 | 2021-07-23 | 唐山高新技术产业园区兴荣科技有限公司 | Data searching and positioning method based on data storage format |
| CN109033438B (en) * | 2018-08-15 | 2022-06-21 | 邢鲁华 | Method and device for recording learning content of user |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1581156A (en) * | 2003-08-01 | 2005-02-16 | 索尼株式会社 | Information processing system, method,programe and recording medium |
| CN1862531A (en) * | 2005-05-13 | 2006-11-15 | 蒋宁 | Optimizing check method of cross-over node constraining on mobile terminal in mobile database |
| CN102375854A (en) * | 2010-08-23 | 2012-03-14 | 杭州华三通信技术有限公司 | Method and device for data processing for database |
| CN104331460A (en) * | 2014-10-31 | 2015-02-04 | 北京思特奇信息技术股份有限公司 | Hbase-based data read-write operation method and system |
| CN104679662A (en) * | 2013-04-25 | 2015-06-03 | 国际商业机器公司 | Method and system for managing shared memory |
| CN105824716A (en) * | 2016-03-15 | 2016-08-03 | 四川效率源信息安全技术股份有限公司 | Method for re-generating LDR file |
| CN105868287A (en) * | 2016-03-23 | 2016-08-17 | 南京南瑞集团公司 | Multisource data-based WAMS application system data integration method |
| CN107122311A (en) * | 2017-05-31 | 2017-09-01 | 四川艾特赢泰智能科技有限责任公司 | A kind of method for parsing Infineon's mobile phone character library |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7143021B1 (en) * | 2000-10-03 | 2006-11-28 | Cadence Design Systems, Inc. | Systems and methods for efficiently simulating analog behavior of designs having hierarchical structure |
| JP5858432B2 (en) * | 2009-06-02 | 2016-02-10 | サフロン・テクノロジー，インコーポレイテッド | Method, system, and computer program product for providing a distributed associative memory base |
-
2017
- 2017-10-09 CN CN201710928197.9A patent/CN107729451B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1581156A (en) * | 2003-08-01 | 2005-02-16 | 索尼株式会社 | Information processing system, method,programe and recording medium |
| CN1862531A (en) * | 2005-05-13 | 2006-11-15 | 蒋宁 | Optimizing check method of cross-over node constraining on mobile terminal in mobile database |
| CN102375854A (en) * | 2010-08-23 | 2012-03-14 | 杭州华三通信技术有限公司 | Method and device for data processing for database |
| CN104679662A (en) * | 2013-04-25 | 2015-06-03 | 国际商业机器公司 | Method and system for managing shared memory |
| CN104331460A (en) * | 2014-10-31 | 2015-02-04 | 北京思特奇信息技术股份有限公司 | Hbase-based data read-write operation method and system |
| CN105824716A (en) * | 2016-03-15 | 2016-08-03 | 四川效率源信息安全技术股份有限公司 | Method for re-generating LDR file |
| CN105868287A (en) * | 2016-03-23 | 2016-08-17 | 南京南瑞集团公司 | Multisource data-based WAMS application system data integration method |
| CN107122311A (en) * | 2017-05-31 | 2017-09-01 | 四川艾特赢泰智能科技有限责任公司 | A kind of method for parsing Infineon's mobile phone character library |
Non-Patent Citations (2)
| Title |
|---|
| 11.3.1 Using EDB*Wrap to Obfuscate Source Code;User Guides;《https://www.enterprisedb.com/edb-docs/d/edb-postgres-advanced-server/user-guides/database-compatibility-for-oracle-developers-guide/9.5/Database_Compatibility_for_Oracle_Developers_Guide.1.317.html》;20160802;1-4页 * |
| EDB数据库创建流程指南;绿林__;《https://blog.csdn.net/dixialieren/article/details/51272718》;20160428;1-6页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107729451A (en) | 2018-02-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20060190684A1 (en) | Reverse value attribute extraction | |
| CN107885501B (en) | Method and device for obtaining mutual reference relationship of components in Android | |
| CN107729451B (en) | Method for searching data in EDB database source file | |
| CN110347390B (en) | Method, storage medium, equipment and system for rapidly generating WEB page | |
| CN104111922A (en) | Processing method and device of streaming document | |
| CN102214244A (en) | Analytic method and system for docx file information | |
| CN110888645A (en) | Method, device and storage medium for converting into small program | |
| CN106547782A (en) | The acquisition methods and device of log information | |
| CN108874934B (en) | Page text extraction method and device | |
| CN111950247A (en) | Configuration-based Word document generation method | |
| CN109426496B (en) | Method for writing program log into file, storage medium, electronic device and system | |
| CN109445856A (en) | A kind of method and electronic equipment of the acceleration application starting based on educational system | |
| CN107169057B (en) | Method and device for detecting repeated pictures | |
| CN108090137B (en) | Method for analyzing overlong fields in EDB database source file | |
| CN112433995A (en) | File format conversion method, system, computer equipment and storage medium | |
| US20080201356A1 (en) | System and method of report representation | |
| JP2023101763A5 (en) | ||
| CN107862023B (en) | Method for analyzing data in EDB database source file | |
| CN105512237A (en) | Data introduction system with complex structure | |
| CN109948123B (en) | Image merging method and device | |
| CN112131183A (en) | Linear access method of OFD electronic file | |
| CN109657184B (en) | Rich text processing method, rich text processing device, server and computer readable medium | |
| CN105893512A (en) | Any version compatible data structure access method and device based on metadata | |
| CN113128175A (en) | Method and system for merging large batch of PDF (portable document format) files | |
| CN112800078A (en) | Lightweight text labeling method, system, equipment and storage medium based on javascript |
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 |