CN104166721B - A kind of registry file method for sorting and device - Google Patents

A kind of registry file method for sorting and device Download PDF

Info

Publication number
CN104166721B
CN104166721B CN201410418573.6A CN201410418573A CN104166721B CN 104166721 B CN104166721 B CN 104166721B CN 201410418573 A CN201410418573 A CN 201410418573A CN 104166721 B CN104166721 B CN 104166721B
Authority
CN
China
Prior art keywords
file
registry
sorting
original
new
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
Application number
CN201410418573.6A
Other languages
Chinese (zh)
Other versions
CN104166721A (en
Inventor
唐智
陈耀攀
于天佐
陈佃晓
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Qihoo Technology Co Ltd
Original Assignee
Beijing Qihoo Technology Co Ltd
Qizhi Software Beijing Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Qihoo Technology Co Ltd, Qizhi Software Beijing Co Ltd filed Critical Beijing Qihoo Technology Co Ltd
Priority to CN201410418573.6A priority Critical patent/CN104166721B/en
Priority claimed from CN201110280181.4A external-priority patent/CN102346769B/en
Publication of CN104166721A publication Critical patent/CN104166721A/en
Application granted granted Critical
Publication of CN104166721B publication Critical patent/CN104166721B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/18File system types
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/17Details of further file system functions
    • G06F16/1724Details of de-fragmentation performed by the file system

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (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 kind of registry file method for sorting and device, wherein, methods described includes:When needing to arrange registry file, file destination is obtained;Valid data in former registry file are saved in the file destination, generate new registry file;Notify operating system using the new registry file as registry file.By means of the invention it is possible to the fragment in registry file is reduced, so as to improve systematic function.

Description

Registry file sorting method and device
Technical Field
The invention relates to the technical field of computers, in particular to a registry file sorting method and device.
Background
The registry is a data file of all 32-bit hardware/drivers and 32-bit applications in the Windows operating system, and is a database of system information, in which all configuration information of the applications and the computer system, the association relationship between the applications and the document files, the description, status and attribute of the hardware devices, and various status information and data are accommodated. The registry file is also called a HIVE file. Which is a physical storage form of registry information. The registry structure we see is presented to us after reading by the registry editor, and is made up of a set of files called HIVE. The Chinese name of HIVE is 'storage nest'. Each HIVE file may be understood as a separate registry tree.
The registry information is composed of a plurality of files stored on the hard disk according to a certain format. Modifying a registry entry is essentially modifying the corresponding file. When a user installs new hardware, installs uninstalled software, and modifies system settings, the operations of registry reading, writing, adding, and deleting are involved. When deleting the registry information item, the corresponding physical storage space is marked with a deletion mark. There is much space in the registry file that is set as a delete marker. With the multiple writing and deleting, a large amount of fragments are generated in the registry file. Such fragmentation generally does not cause problems in the system, but too much fragmentation causes the system to seek back and forth when reading and writing the registry, causing system performance degradation. In addition, excessive fragmentation may also result in loss of registry information.
Therefore, a technical problem to be solved by those skilled in the art is how to effectively arrange the registry file so as to reduce fragmentation thereof.
Disclosure of Invention
The invention provides a registry file sorting method and device, which can reduce fragments in registry files and improve system performance.
The invention provides the following scheme:
a registry file sorting method comprises the following steps:
when the registry file needs to be sorted, acquiring a target file;
storing effective data in the original registry file into the target file to generate a new registry file;
and informing the operating system to use the new registry file as a registry file.
Wherein: when the registry file needs to be sorted, the obtaining of the target file comprises the following steps:
when the registry file needs to be sorted, a file is newly created, and the newly created file is used as the target file.
Wherein:
when the registry file needs to be sorted, the newly-built file comprises the following steps:
when the registry file needs to be sorted, searching registry entries in the original registry file and the HIVE files corresponding to the registry entries, and respectively creating a file for each registry entry;
the storing the valid data in the original registry file into the target file, and the generating a new registry file comprises:
and for each registry key, storing effective data in the original HIVE file into the newly-built file corresponding to each registry key, and synthesizing the newly-built file corresponding to each registry key to generate a new registry file.
Preferably, after the registry key in the original registry file and the HIVE file corresponding to the registry key are found, the method further comprises the following steps:
determining the space occupied by each registry key after sorting and the optimized proportion after sorting according to the space actually occupied by the HIVE file of each registry key and the space occupied by the effective data in the HIVE file;
and displaying the space occupied by each registry key before and after sorting and the optimized proportion after sorting to a user.
Preferably, the method further comprises the following steps:
and continuously storing the data of the same registry information which is dispersedly stored in different positions of the disk in the original registry file.
Wherein, when the registry file needs to be sorted, the method comprises the following steps:
detecting whether a user sends a request for sorting registry files, if so, sorting the registry files;
or,
and detecting whether the space occupied by the original registry file reaches a preset threshold value, and if so, sorting the registry file.
A registry file collating apparatus comprising:
the target file acquisition unit is used for acquiring a target file when the registry file needs to be sorted;
the new registry file generating unit is used for storing the effective data in the original registry file into the target file and generating a new registry file;
and the notification unit is used for notifying the operating system to take the new registry file as the registry file.
Wherein the target file acquiring unit includes:
and the new file creating unit is used for creating a new file when the registry file needs to be sorted, and taking the created file as the target file.
Wherein:
the new file unit is specifically configured to:
when the registry file needs to be sorted, searching registry entries in the original registry file and the HIVE files corresponding to the registry entries, and respectively creating a file for each registry entry;
the new registry generating unit is specifically configured to:
and for each registry key, storing effective data in the original HIVE file into the newly-built file corresponding to each registry key, and synthesizing the newly-built file corresponding to each registry key to generate a new registry file.
Preferably, the method further comprises the following steps:
the determining unit is used for determining the space occupied by each registry key after arrangement and the optimized proportion after arrangement according to the space actually occupied by the HIVE file of each registry key and the space occupied by the effective data in the HIVE file after the registry key in the original registry key file and the HIVE file corresponding to the registry key are searched;
and the display unit is used for displaying the space occupied by each registry key before and after sorting and the optimized proportion after sorting to a user.
Preferably, the method further comprises the following steps:
and a continuous storage unit for continuously storing the data of the same registry information dispersedly stored in different positions of the disk in the original registry file.
Wherein the target file acquiring unit includes:
the first detection subunit is used for detecting whether a user sends a request for sorting the registry files, and if so, the registry files need to be sorted to obtain the target files;
or,
and the second detection subunit is used for detecting whether the space occupied by the original registry file reaches a preset threshold value, and if so, the registry file needs to be sorted to obtain the target file.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
in the embodiment of the invention, if the registry file needs to be sorted, the target file is obtained, and then the effective data in the original registry file is stored in the target file, so that a new registry file can be generated and then used as the registry file. In the process, only valid data is saved in a new file, so that invalid data can not exist in the new registry file any more, and therefore, the method is equivalent to sorting registry fragments and is beneficial to improving the system performance.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
FIG. 1 is a flow chart of a method provided by an embodiment of the present invention;
FIG. 2 is a schematic view of a first interface in an embodiment of the invention;
FIG. 3 is a second interface diagram in an embodiment of the invention;
FIG. 4 is a third interface diagram in an embodiment of the invention;
fig. 5 is a schematic diagram of an apparatus provided by an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments that can be derived by one of ordinary skill in the art from the embodiments given herein are intended to be within the scope of the present invention.
Referring to fig. 1, the method for sorting registry files provided in the embodiment of the present invention includes the following steps:
s101: when the registry file needs to be sorted, acquiring a target file;
in practical application, in order to determine whether to need to sort the registry files, a starting entry may be provided for the user, when the user sends a request for sorting the registry files through the entry, the user takes the request as an instruction for sorting the registry files, and then a process for sorting the registry files is started. Or, an automatic monitoring program may also be set, for example, the space occupied by the registry file may be monitored, and when the space occupied by the registry file reaches a preset threshold, the process of sorting the registry file may be started. Of course, the two methods can be combined, for example, when the space occupied by the registry file reaches a preset threshold value, a prompt is popped up to the user to inform the user that the space occupied by the registry file is too large, the user is inquired whether the registry file needs to be sorted, and if the user selects the required registry file, the process of sorting the registry file is started. Once it is determined that the registry file needs to be collated, the target file may be obtained first, in preparation for subsequent collation.
Specifically, when the target file is acquired, an empty file may be newly created, and the empty file is used as the target file (of course, the empty file may be created in advance, or may be created when the registry file needs to be sorted). Or, in practical applications, the target file may also be a file obtained in advance and storing basic configuration information, where the basic configuration information refers to some basic configurations for the user computer, and such basic configurations may correspond to version numbers of operating systems installed on the user computer (e.g., Windows XP SP3, etc.), that is, for a computer installed with a certain version of an operating system, some basic configurations in a registry are usually the same, so that standard files may be preset for different version numbers of the operating system, and when the registry files need to be sorted, such standard files may be used as the target file. In specific implementation, the standard file may be pre-stored locally in the user computer, or when the registry file needs to be sorted, the corresponding standard file is downloaded to the server side according to the system version number of the computer, and then the standard file is used as the target file.
S102: storing effective data in the original registry file into the target file to generate a new registry file;
due to the acquired target file, the effective data in the original registry file can be transferred to the target file and stored when the registry file is sorted. It should be noted that, there are both valid data and some invalid data in the original registry file (after an application is uninstalled, the data about the application previously written in the registry may not be deleted, at this time, since the application has been uninstalled, such data becomes invalid data, which may also be referred to as fragmentation), and when transferring data into the target file, only the valid data is transferred into the target file, and therefore, the newly generated registry file will not contain invalid data any more. In other words, for the data in the original registry file, it is first determined whether the data is valid data or invalid data (specifically, it may be determined according to whether the data has a deletion flag, or because the data set to be deleted generally does not have a display characteristic, the data that can be seen by opening the corresponding HIVE file with the registry editor is valid, in this case, since the purpose of the present invention is to only store the valid data in the target file, it is not necessary to identify the invalid data therein any more), and if the data is valid, the data is stored in the target file, which is equivalent to clearing the fragments, and avoiding affecting the system performance.
It should be noted that, if the target file is a newly created empty file, all valid data in the original registry file may be directly transferred to the target file for storage. If the target file is the file stored with the basic configuration information, only valid information other than the basic configuration information can be transferred and stored into the basic configuration file, so that the file sorting efficiency is improved, and the time and system resources are saved.
It should be noted that the valid data described in the embodiment of the present invention may also be data related to some optimized configurations of the current system, which is obtained after analysis is performed according to features such as a system version number of a user and an installed application program, so that, while sorting the registry file, the valid data in the original registry file may be saved in the target file, and the optimized configuration data may also be saved in the target file, so that the system configuration is optimized while a new registry file is sorted, and system performance is further improved.
S103: and informing the operating system to use the new registry file as a registry file.
After a new registry file is generated, the operating system may be notified to treat the file as a registry file. In particular, after a new registry file is generated, the computer can be restarted (or the user is prompted to restart), and after the restart, the computer can be operated with the new registry file. Of course, the original registry file may be deleted since it has no more value to exist. The deletion timing of the original registry file can be deleted after a new registry file is generated, or the deletion can be performed after the computer is restarted.
It can be seen that, in the method for collating registry files provided in the embodiment of the present invention, if the registry files need to be collated, the target file is obtained, and then the valid data in the original registry file is stored in the target file, so that a new registry file can be generated and then used as the registry file. In the process, only valid data is saved in a new file, so that invalid data can not exist in the new registry file any more, and therefore, the method is equivalent to sorting registry fragments and is beneficial to improving the system performance.
In practical applications, because the REGISTRY file is usually composed of a plurality of HIVE files, each REGISTRY entry corresponds to one HIVE file, and one REGISTRY entry corresponds to one group, for example, a HIVE file with a group name of "\ regenstry \ MACHINE \ SOFTWARE", which is equivalent to a REGISTRY entry corresponding to an application program, when an application program is newly installed, the generated REGISTRY information is written into the HIVE file. Or, the HIVE file with the group name of "\ REGISTRY \ MACHINE \ SYSTEM" is equivalent to the REGISTRY entry corresponding to the SYSTEM, and when the configuration of hardware and the like in the SYSTEM changes, the generated REGISTRY information is written into the HIVE file. That is to say, in the registry file, different pieces of registry information are actually stored in a classified manner, one HIVE file corresponding to the same type of registry information, and each HIVE file contains a plurality of pieces of registry information, and with operations such as new loading and unloading of an application program, change of system configuration, and the like, invalid data may be generated in each HIVE file.
Therefore, in the embodiment of the present invention, if the newly created file is used as the target file, before the file is newly created, the registry key in the original registry file and the HIVE file corresponding to the registry key may be first searched, and then a file is newly created for each registry key. Specifically, when the registry file is sorted, the sorting can be performed for each registry entry. And storing the effective data in the original HIVE file into the newly-built file corresponding to each registry key aiming at each registry key. Therefore, a newly-built file can be obtained for each registry key finally, and only effective data is stored in the newly-built file, at the moment, the newly-built files are integrated together, and a new registry file can be generated.
It should be noted that, in practical applications, the following phenomena may also occur: when writing the registry, the computer will preferentially store the information on a contiguous available space that is large enough to be found in the HIVE file. If there is not enough contiguous available space, then several blocks are typically selected from the available storage space to store the data. This causes discontinuity of the same registry information in the physical storage space, and the registry information is stored in different places in a distributed manner due to the discontinuity in the physical storage space, which also causes slow data reading of the system.
In view of the above phenomenon, in the embodiment of the present invention, when the registry file is sorted, in addition to removing the invalid data, it may also be determined whether the original registry file has a phenomenon that the same registry information is discontinuously stored in the physical space, and if so, in the process of transferring the valid data to the newly created file, the data of the same registry information, which is dispersedly stored in different locations of the disk, in the original registry file may also be continuously stored. In this way, the performance of the system can be further improved.
In addition, under the condition that the user manually starts the sorting of the registry files, in order to provide the reference for the user whether to sort the registry files, the registry files can be analyzed firstly before sorting, the space occupied by each registry entry after sorting (namely the space occupied by the valid data) and the optimized proportion after sorting (which is equivalent to the ratio of the space occupied by the invalid data to the total space occupied by the original files) are determined according to the space actually occupied by the HIVE file of each registry entry and the space occupied by the valid data in the HIVE file, and the space occupied by each registry entry before and after sorting and the optimized proportion after sorting are displayed to the user. That is, the user can intuitively know how much optimization is available if the registry files are sorted, and then decide whether to sort the registry files.
For example, all the HIVE files can be found in the Windows system, and listed one by one, as shown in fig. 2, where the "group name" represents the name of the HIVE file corresponding to each registry entry, and the "current size" represents the size of the space currently occupied by each HIVE file (including the space occupied by invalid data). After the user clicks the "analysis registry" in the upper right corner, each HIVE file can be analyzed, the size and the ratio capable of being optimized of each HIVE file after being sorted are calculated, and the size and the ratio are displayed to the user, as shown in fig. 3. Next, if the user clicks on the "optimize immediately" button, a prompt may be given in the interface to restart the computer, as shown in FIG. 4. If the user clicks "yes", which is equivalent to the user sending a request for sorting the registry file, at this time, steps S101 to S103 may be executed, the physical storage structure is reassembled, the unusable small storage area is completely released, then the system is restarted, and the registry defragmentation is completed.
Corresponding to the method for sorting registry files provided in the embodiment of the present invention, an embodiment of the present invention further provides a device for sorting registry files, referring to fig. 5, where the device includes:
a target file obtaining unit 501, configured to obtain a target file when the registry file needs to be sorted;
a new registry file generating unit 502, configured to store valid data in the original registry file in the target file, and generate a new registry file;
a notifying unit 503, configured to notify the operating system to use the new registry file as the registry file.
In a specific implementation, the target file obtaining unit 501 may specifically include:
and the new file creating unit is used for creating a new file when the registry file needs to be sorted, and taking the created file as the target file.
Since the registry information is generally classified and stored, a file can be created for different registry entries, and at this time, the new file creating unit can be specifically configured to:
when the registry file needs to be sorted, searching registry entries in the original registry file and the HIVE files corresponding to the registry entries, and respectively creating a file for each registry entry;
correspondingly, the new registry generating unit 502 may specifically be configured to:
and for each registry key, storing the effective data in the original HIVE file into a newly-built file, and synthesizing the newly-built file corresponding to each registry key to generate a new registry file.
In order to provide a reference to the user before the user decides whether the registry file needs to be collated, the apparatus may further comprise:
the determining unit is used for determining the space occupied by each registry key after arrangement and the optimized proportion after arrangement according to the space actually occupied by the HIVE file of each registry key and the space occupied by the effective data in the HIVE file after the registry key in the original registry key file and the HIVE file corresponding to the registry key are searched;
and the display unit is used for displaying the space occupied by each registry key before and after sorting and the optimized proportion after sorting to a user.
In order to further improve the system performance, the apparatus may further include:
and a continuous storage unit for continuously storing the data of the same registry information dispersedly stored in different positions of the disk in the original registry file.
Furthermore, the apparatus may further include:
and a deletion unit configured to delete the original registration table file.
In practical applications, whether to sort the registry file may be determined in a variety of ways, and specifically, the target file obtaining unit 501 may include:
the first detection subunit is used for detecting whether a user sends a request for sorting the registry files, and if so, the registry files need to be sorted to obtain the target files;
or,
and the second detection subunit is used for detecting whether the space occupied by the original registry file reaches a preset threshold value, and if so, the registry file needs to be sorted to obtain the target file.
In summary, with the registry file arrangement device provided in the embodiment of the present invention, if the registry file needs to be arranged, the target file is obtained, and then the valid data in the original registry file is stored in the target file, so that a new registry file can be generated and then used as the registry file. In the process, only valid data is saved in a new file, so that invalid data can not exist in the new registry file any more, and therefore, the method is equivalent to sorting registry fragments and is beneficial to improving the system performance.
It should be noted that the apparatus according to the embodiment of the present invention corresponds to the method embodiment described above, and therefore, portions of the apparatus embodiment that are not described in detail may refer to descriptions in the method embodiment, and are not described again here.
The method and the device for sorting the registry files provided by the invention are described in detail, a specific example is applied in the text to explain the principle and the implementation mode of the invention, and the description of the embodiment is only used for helping to understand the method and the core idea of the invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed. In view of the above, the present disclosure should not be construed as limiting the invention.

Claims (12)

1. A method for sorting registry files is characterized in that the method applied to Windows operating system comprises the following steps:
when the registry file needs to be sorted, acquiring a target file;
storing effective data in the original registry file into the target file to generate a new registry file;
and informing an operating system to use the new registry file as the registry file of the operating system.
2. The method of claim 1, wherein: when the registry file needs to be sorted, the obtaining of the target file comprises the following steps:
when the registry file needs to be sorted, a file is newly created, and the newly created file is used as the target file.
3. The method of claim 2, wherein:
when the registry file needs to be sorted, the newly-built file comprises the following steps:
when the registry file needs to be sorted, searching registry entries in the original registry file and the HIVE files corresponding to the registry entries, and respectively creating a file for each registry entry;
the storing the valid data in the original registry file into the target file, and the generating a new registry file comprises:
and for each registry key, storing effective data in the original HIVE file into the newly-built file corresponding to each registry key, and synthesizing the newly-built file corresponding to each registry key to generate a new registry file.
4. The method of claim 3, wherein after finding the registry key and the HIVE file corresponding to the registry key in the original registry file, further comprising:
determining the space occupied by each registry key after sorting and the optimized proportion after sorting according to the space actually occupied by the HIVE file of each registry key and the space occupied by the effective data in the HIVE file;
and displaying the space occupied by each registry key before and after sorting and the optimized proportion after sorting to a user.
5. The method of claim 1, further comprising:
and continuously storing the data of the same registry information which is dispersedly stored in different positions of the disk in the original registry file.
6. The method according to claim 1, wherein when the registry file needs to be sorted, the method comprises:
detecting whether a user sends a request for sorting registry files, if so, sorting the registry files;
or,
and detecting whether the space occupied by the original registry file reaches a preset threshold value, and if so, sorting the registry file.
7. A registry file collating device is applied to a Windows operating system and comprises the following components:
the target file acquisition unit is used for acquiring a target file when the registry file needs to be sorted;
the new registry file generating unit is used for storing the effective data in the original registry file into the target file and generating a new registry file;
and the notification unit is used for notifying an operating system to use the new registry file as the registry file of the operating system.
8. The apparatus according to claim 7, wherein the target file acquiring unit includes:
and the new file creating unit is used for creating a new file when the registry file needs to be sorted, and taking the created file as the target file.
9. The apparatus of claim 8, wherein:
the new file unit is specifically configured to:
when the registry file needs to be sorted, searching registry entries in the original registry file and the HIVE files corresponding to the registry entries, and respectively creating a file for each registry entry;
the new registry generating unit is specifically configured to:
and for each registry key, storing effective data in the original HIVE file into the newly-built file corresponding to each registry key, and synthesizing the newly-built file corresponding to each registry key to generate a new registry file.
10. The apparatus of claim 9, further comprising:
the determining unit is used for determining the space occupied by each registry key after arrangement and the optimized proportion after arrangement according to the space actually occupied by the HIVE file of each registry key and the space occupied by the effective data in the HIVE file after the registry key in the original registry key file and the HIVE file corresponding to the registry key are searched;
and the display unit is used for displaying the space occupied by each registry key before and after sorting and the optimized proportion after sorting to a user.
11. The apparatus of claim 7, further comprising:
and a continuous storage unit for continuously storing the data of the same registry information dispersedly stored in different positions of the disk in the original registry file.
12. The apparatus according to claim 7, wherein the target file acquiring unit includes:
the first detection subunit is used for detecting whether a user sends a request for sorting the registry files, and if so, the registry files need to be sorted to obtain the target files;
or,
and the second detection subunit is used for detecting whether the space occupied by the original registry file reaches a preset threshold value, and if so, the registry file needs to be sorted to obtain the target file.
CN201410418573.6A 2011-09-20 2011-09-20 A kind of registry file method for sorting and device Active CN104166721B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410418573.6A CN104166721B (en) 2011-09-20 2011-09-20 A kind of registry file method for sorting and device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201110280181.4A CN102346769B (en) 2011-09-20 2011-09-20 Method and device for consolidating registry file
CN201410418573.6A CN104166721B (en) 2011-09-20 2011-09-20 A kind of registry file method for sorting and device

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN201110280181.4A Division CN102346769B (en) 2011-09-20 2011-09-20 Method and device for consolidating registry file

Publications (2)

Publication Number Publication Date
CN104166721A CN104166721A (en) 2014-11-26
CN104166721B true CN104166721B (en) 2018-03-27

Family

ID=51910534

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410418573.6A Active CN104166721B (en) 2011-09-20 2011-09-20 A kind of registry file method for sorting and device

Country Status (1)

Country Link
CN (1) CN104166721B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101000634A (en) * 2007-01-05 2007-07-18 北京握奇数据***有限公司 Method for realizing arbitrary catalog applied management to telecommunication smart card

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050131960A1 (en) * 2003-12-15 2005-06-16 Reed Benjamin C. Method and system of accessing at least one target file in a computer system with an operating system with file locking implemented at file-open time
CN101777018B (en) * 2010-02-08 2012-04-25 北京同有飞骥科技股份有限公司 Copying and snapshot combined Windows system protection method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101000634A (en) * 2007-01-05 2007-07-18 北京握奇数据***有限公司 Method for realizing arbitrary catalog applied management to telecommunication smart card

Also Published As

Publication number Publication date
CN104166721A (en) 2014-11-26

Similar Documents

Publication Publication Date Title
JP4786945B2 (en) Indexing forced query
US10452620B2 (en) Automatic file version verification within electronic mail
US20170303063A1 (en) Updating Web Resources
US7908276B2 (en) Filesystem having a filename cache
US20140006355A1 (en) Information processing system, backup management method and program
CN106874366B (en) Software information processing method and device
JP5652220B2 (en) File management apparatus and program
JP2004280780A (en) Back up method, system, and program
KR20120027179A (en) Bios image manager
JP2015510174A (en) Location independent files
JP2006294023A (en) Apparatus and method for managing file system
US20170024202A1 (en) Information processing apparatus, method, and program
CN102346769B (en) Method and device for consolidating registry file
US20170161050A1 (en) Methods for Downloading and Installing Computer Software Applications on Demand
US20110016194A1 (en) Connecting galleries to dynamic server-hosted content
WO2019223172A1 (en) Kettle task scheduling method and system, computer device, and storage medium
CN103677931A (en) Software moving method and device
CN110941516A (en) Operating system restoration method, device, equipment and storage medium
CN104166721B (en) A kind of registry file method for sorting and device
CN110955449B (en) Gray scale release method and device for client
CN102346696B (en) A kind of file access pattern method and device
CN102346776B (en) Method and device for arranging registry file
KR20130002692A (en) Optimization method, optimization server and computer readable recording medium for providing service with vaccine and optimization functions
US8429331B2 (en) Storage optimizations by directory compaction in a fat file system
JP2007193408A (en) Disk operation control method in document management system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20220712

Address after: Room 801, 8th floor, No. 104, floors 1-19, building 2, yard 6, Jiuxianqiao Road, Chaoyang District, Beijing 100015

Patentee after: BEIJING QIHOO TECHNOLOGY Co.,Ltd.

Address before: 100088 room 112, block D, 28 new street, new street, Xicheng District, Beijing (Desheng Park)

Patentee before: BEIJING QIHOO TECHNOLOGY Co.,Ltd.

Patentee before: Qizhi software (Beijing) Co., Ltd

TR01 Transfer of patent right