CN109189728A - Intelligent hardware devices, data in magnetic disk processing method and storage medium - Google Patents

Intelligent hardware devices, data in magnetic disk processing method and storage medium Download PDF

Info

Publication number
CN109189728A
CN109189728A CN201810791052.3A CN201810791052A CN109189728A CN 109189728 A CN109189728 A CN 109189728A CN 201810791052 A CN201810791052 A CN 201810791052A CN 109189728 A CN109189728 A CN 109189728A
Authority
CN
China
Prior art keywords
directory
node
file
tags
data
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
Application number
CN201810791052.3A
Other languages
Chinese (zh)
Other versions
CN109189728B (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.)
Shenzhen Onething Technology Co Ltd
Original Assignee
Shenzhen Onething Technology 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 Shenzhen Onething Technology Co Ltd filed Critical Shenzhen Onething Technology Co Ltd
Priority to CN201810791052.3A priority Critical patent/CN109189728B/en
Publication of CN109189728A publication Critical patent/CN109189728A/en
Application granted granted Critical
Publication of CN109189728B publication Critical patent/CN109189728B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The present invention discloses a kind of intelligent hardware devices, data in magnetic disk processing method and storage medium.The file directory of scan data file of the present invention;One or more directory tags are extracted from the file directory of scanning;Respectively by each data file and the corresponding directory tags relationship maps under each file directory, and establish corresponding relationship;After receiving the file query requests with directory tags that a user terminal is sent, the preset kind the file information that the corresponding each data file of the directory tags in inquiry request is determined according to corresponding relation data generates and feeds back the corresponding file polling result of the inquiry request to user terminal.Compared to the prior art, the present invention improves the efficiency and accuracy rate of file polling, and easy to operate.

Description

Intelligent hardware devices, data in magnetic disk processing method and storage medium
Technical field
The present invention relates to Intelligent hardware technical field, in particular to a kind of intelligent hardware devices, data in magnetic disk processing method And storage medium.
Background technique
As the improvement of people's living standards, people are to Intelligent hardware, (Intelligent hardware is referred to through software and hardware combining Mode is transformed traditional equipment, and then it is allowed to possess intelligentized function, and after intelligent, hardware has the energy of connection Power realizes the load of Internet service, has the surcharges such as big data, for example, smart phone, smartwatch, intelligence electricity Depending on, Intelligent bracelet etc.) demand it is also stronger and stronger.Intelligent hardware is the most convenient and fast function that user provides first is that can lead to The mode for crossing remote access realizes long-range control Intelligent hardware.For example, by intelligent hardware devices, server, user terminal group At communication system architecture in, user terminal generally require with intelligent hardware devices carry out data interaction (for example, file is looked into Ask, store, delete etc.).
However, data file is usually managed in the form of file directory in the disk of existing intelligent hardware devices (for example, the inquiry of file, storage, deletion etc.), for example, user wants, in disk, (disk refers to non-volatile memories Device, for example, hard disk) in carry out file polling.Common inquiry mode includes: mode one, based on disk directory structure goes for institute The data file needed, defect are that this mode needs the bibliographic structure of oneself very familiar disk of user, and put in order certainly Oneself disk directory, oneself is sorted out, cumbersome to be quickly found oneself desired thing, and is easy error;Mode Two, data file required for being searched by search key, this mode need user to know oneself desired data file Filename or keyword, otherwise cannot search, and speed is slow.
Therefore, after how data file being imported disk storage, desired data file can fast, be accurately inquired, Have become a technical problem urgently to be resolved.
Summary of the invention
The main object of the present invention is to provide a kind of intelligent hardware devices, data in magnetic disk processing method and storage medium, purport Desired data file can fast, be accurately inquired after solving the problem of how data file to be imported disk storage.
To achieve the above object, the present invention proposes that a kind of intelligent hardware devices, the intelligent hardware devices are deposited including first Reservoir and processor are stored with the data in magnetic disk processing routine that can be run on the processor, institute on the first memory It states when data in magnetic disk processing routine is executed by the processor and realizes following steps:
Scanning step: in real time or periodically, or after receiving classified and stored instruction, the file directory of scan data file, institute Data file is stated to be stored in the electronic equipment communicated to connect with the intelligent hardware devices;
Extraction step: according to predetermined tag extraction rule, extracted from the file directory of scanning one or Multiple directory tags;
Map establishment step: respectively by each data file and the corresponding directory tags under each file directory Relationship maps establish the corresponding pass between the preset kind the file information of each data file and the directory tags of relationship maps System;
Storing step: the corresponding relation data is stored;
Query steps: after the file query requests with directory tags that relative users terminal is sent, according to the correspondence Relation data determines the preset kind the file information of the corresponding each data file of the directory tags in the inquiry request, is based on Determining preset kind the file information generates the corresponding file polling of the inquiry request as a result, and by the file polling of generation As a result the user terminal is fed back to.
Preferably, the electronic equipment with intelligent hardware devices communication connection includes the first memory block and the second storage The file directory of area, the data file and the data file is stored in first memory block, the corresponding relationship number According to being stored in second memory block.
Preferably, the processor executes the data in magnetic disk processing routine, after the extraction step, also realize with Lower step:
Incidence relation is established between each directory tags.
Preferably, the predetermined tag extraction rule are as follows:
Node tree is established for each directory node of the file directory, the node tree includes multiple directory nodes point , it include master catalogue node and subdirectory node in each directory node branch, each higher level's directory node is under it The master catalogue node of grade directory node;
Determine that the most junior in each directory node branch shares directory node, the most junior of a directory node branch Shared directory node refer to other directory node branches share and in the directory node branch it is corresponding it is all under Grade subdirectory node is not the directory node of shared directory node;
The most junior of each determining directory node branch is shared into directory node and its corresponding all higher levels respectively The nodename of directory node is combined according to the sequence of positions of corresponding directory node branch, generates combination title, institute State the directory tags that combination title is corresponding directory node branch.
Preferably, the predetermined tag extraction rule are as follows:
Node tree is established for each directory node of file directory, the node tree includes multiple directory node branches, often It include master catalogue node and subdirectory node in one directory node branch, each higher level's directory node is its subprime directory The master catalogue node of node;
The i-stage directory node in each directory node branch is determined respectively, and i is the positive integer greater than 1;
Respectively by the i-stage directory node of each determining directory node branch and its corresponding all higher level's catalogue sections The nodename of point, is combined according to the sequence of positions of corresponding directory node branch, generates combination title, the combination Title is the directory tags of corresponding directory node branch.
Preferably, the processor executes the data in magnetic disk processing routine, before the storing step, also realize with Lower step:
The quantity of the corresponding data file of each directory tags is determined respectively;
Each directory tags are ranked up according to the size order of the quantity of corresponding data file;
When the size order is sequence from big to small, retain the directory tags for the preceding preset quantity that sorts, and Other directory tags other than the directory tags of reservation are deleted, alternatively, when the size order is sequence from small to large, Retain the directory tags for the posterior preset quantity that sorts, and other directory tags other than the directory tags of reservation are deleted.
Preferably, the processor executes the data in magnetic disk processing routine, before the storing step, also realize with Lower step:
The quantity of the corresponding data file of each directory tags is determined respectively;
When the quantity for having the corresponding data file of directory tags is less than preset threshold, the directory tags are deleted.
In addition, to achieve the above object, the present invention also proposes that a kind of intelligent hardware devices, the intelligent hardware devices include Second memory and processor are stored with the data in magnetic disk processing journey that can be run on the processor on the second memory Sequence, the data in magnetic disk processing routine realize following steps when being executed by the processor:
Scanning step: in real time or periodically, or after receiving classified and stored instruction, the file directory of scan data file, institute Data file is stated to be stored in the second memory;
Extraction step: according to predetermined tag extraction rule, extracted from the file directory of scanning one or Multiple directory tags;
Map establishment step: respectively by each data file and the corresponding directory tags under each file directory Relationship maps establish the corresponding pass between the preset kind the file information of each data file and the directory tags of relationship maps System;
Storing step: by the corresponding relation data store to;
Query steps: the file query requests with directory tags that response user terminal is sent, according to the corresponding pass Coefficient is based on true according to the preset kind the file information of the corresponding each data file of directory tags in the determination inquiry request Fixed preset kind the file information generates the corresponding file polling of the inquiry request as a result, and by the file polling knot of generation Fruit feeds back to the user terminal.
Preferably, the second memory further includes the first memory block and the second memory block, the data file and described The file directory of data file is stored in first memory block, and the corresponding relation data is stored in second memory block In.
Preferably, the processor executes the data in magnetic disk processing routine, after the extraction step, also realize with Lower step:
Incidence relation is established between each directory tags.
Preferably, the predetermined tag extraction rule are as follows:
Node tree is established for each directory node of the file directory, the node tree includes multiple directory nodes point , it include master catalogue node and subdirectory node in each directory node branch, each higher level's directory node is under it The master catalogue node of grade directory node;
Determine that the most junior in each directory node branch shares directory node, the most junior of a directory node branch Shared directory node refer to other directory node branches share and in the directory node branch it is corresponding it is all under Grade subdirectory node is not the directory node of shared directory node;
The most junior of each determining directory node branch is shared into directory node and its corresponding all higher levels respectively The nodename of directory node is combined according to the sequence of positions of corresponding directory node branch, generates combination title, institute State the directory tags that combination title is corresponding directory node branch.
Preferably, the predetermined tag extraction rule are as follows:
Node tree is established for each directory node of file directory, the node tree includes multiple directory node branches, often It include master catalogue node and subdirectory node in one directory node branch, each higher level's directory node is its subprime directory The master catalogue node of node;
The i-stage directory node in each directory node branch is determined respectively, and i is the positive integer greater than 1;
Respectively by the i-stage directory node of each determining directory node branch and its corresponding all higher level's catalogue sections The nodename of point, is combined according to the sequence of positions of corresponding directory node branch, generates combination title, the combination Title is the directory tags of corresponding directory node branch.
Preferably, the processor executes the data in magnetic disk processing routine, before the storing step, also realize with Lower step:
The quantity of the corresponding data file of each directory tags is determined respectively;
Each directory tags are ranked up according to the size order of the quantity of corresponding data file;
When the size order is sequence from big to small, retain the directory tags for the preceding preset quantity that sorts, and Other directory tags other than the directory tags of reservation are deleted, alternatively, when the size order is sequence from small to large, Retain the directory tags for the posterior preset quantity that sorts, and other directory tags other than the directory tags of reservation are deleted.
Preferably, the processor executes the data in magnetic disk processing routine, before the storing step, also realize with Lower step:
The quantity of the corresponding data file of each directory tags is determined respectively;
When the quantity for having the corresponding data file of directory tags is less than preset threshold, the directory tags are deleted.
In addition, to achieve the above object, the present invention also proposes that a kind of data in magnetic disk processing method, this method are suitable for storage There are the intelligent hardware devices of data file, alternatively, be suitable for communicating to connect with the electronic equipment for being stored with the data file Intelligent hardware devices, which is characterized in that the method comprising the steps of:
Scanning step: in real time or periodically, or after receiving classified and stored instruction, the file mesh of the data file is scanned Record;
Extraction step: according to predetermined tag extraction rule, extracted from the file directory of scanning one or Multiple directory tags;
Map establishment step: respectively by each data file and the corresponding directory tags under each file directory Relationship maps establish the corresponding pass between the preset kind the file information of each data file and the directory tags of relationship maps System;
Storing step: the corresponding relation data is stored;
Query steps: the file query requests with directory tags that response user terminal is sent, according to the corresponding pass Coefficient is based on true according to the preset kind the file information of the corresponding each data file of directory tags in the determination inquiry request Fixed preset kind the file information generates the corresponding file polling of the inquiry request as a result, and by the file polling knot of generation Fruit feeds back to the user terminal.
Preferably, after the extraction step, this method further include:
Incidence relation is established between each directory tags.
Preferably, the predetermined tag extraction rule are as follows:
Node tree is established for each directory node of the file directory, the node tree includes multiple directory nodes point , it include master catalogue node and subdirectory node in each directory node branch, each higher level's directory node is under it The master catalogue node of grade directory node;
Determine that the most junior in each directory node branch shares directory node, the most junior of a directory node branch Shared directory node refer to other directory node branches share and in the directory node branch it is corresponding it is all under Grade subdirectory node is not the directory node of shared directory node;
The most junior of each determining directory node branch is shared into directory node and its corresponding all higher levels respectively The nodename of directory node is combined according to the sequence of positions of corresponding directory node branch, generates combination title, institute State the directory tags that combination title is corresponding directory node branch.
Preferably, the predetermined tag extraction rule are as follows:
Node tree is established for each directory node of file directory, the node tree includes multiple directory node branches, often It include master catalogue node and subdirectory node in one directory node branch, each higher level's directory node is its subprime directory The master catalogue node of node;
The i-stage directory node in each directory node branch is determined respectively, and i is the positive integer greater than 1;
Respectively by the i-stage directory node of each determining directory node branch and its corresponding all higher level's catalogue sections The nodename of point, is combined according to the sequence of positions of corresponding directory node branch, generates combination title, the combination Title is the directory tags of corresponding directory node branch.
Preferably, before the storing step, this method further include:
The quantity of the corresponding data file of each directory tags is determined respectively;
Each directory tags are ranked up according to the size order of the quantity of corresponding data file;
When the size order is sequence from big to small, retain the directory tags for the preceding preset quantity that sorts, and Other directory tags other than the directory tags of reservation are deleted, alternatively, when the size order is sequence from small to large, Retain the directory tags for the posterior preset quantity that sorts, and other directory tags other than the directory tags of reservation are deleted.
Preferably, before the storing step, this method further include:
The quantity of the corresponding data file of each directory tags is determined respectively;
When the quantity for having the corresponding data file of directory tags is less than preset threshold, the directory tags are deleted.
In addition, to achieve the above object, the present invention also proposes a kind of computer readable storage medium, described computer-readable Storage medium is stored with data in magnetic disk processing routine, and the data in magnetic disk processing routine can be executed by least one processor, with The step of making at least one described processor execute data in magnetic disk processing method as described in any one of the above embodiments.
The file directory of scan data file of the present invention;One or more catalogue marks are extracted from the file directory of scanning Label;Respectively by each data file and the corresponding directory tags relationship maps under each file directory, and establish corresponding pass System;It is true according to corresponding relation data after receiving the file query requests with directory tags that a user terminal is sent The preset kind the file information for determining the corresponding each data file of directory tags in inquiry request generates and feeds back the inquiry and asks Ask corresponding file polling result to user terminal.Compared to the prior art, the catalogue mark that the present invention will extract in file directory Mapping relations are established between label and data file, when carrying out file polling, user terminal are only needed to provide directory tags, it can be fast Speed accurately inquires corresponding data file, improves the efficiency and accuracy rate of file polling, and easy to operate.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with The structure shown according to these attached drawings obtains other attached drawings.
Fig. 1 is the signal of the optional running environment of the first, second, third embodiment of inventive disk data processor one Figure;
Fig. 2 is another optional running environment signal of the first, second, third embodiment of inventive disk data processor Figure;
Fig. 3 is the Program modual graph of the first, second embodiment of inventive disk data processor;
Fig. 4 is the node tree schematic diagram of file directory;
Fig. 5 is the Program modual graph of inventive disk data processor 3rd embodiment;
Fig. 6 is the flow diagram of inventive disk data processing method first embodiment;
Fig. 7 is the flow diagram of inventive disk data processing method second embodiment;
Fig. 8 is the flow diagram of inventive disk data processing method 3rd embodiment.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific embodiment
The principle and features of the present invention will be described below with reference to the accompanying drawings, and the given examples are served only to explain the present invention, and It is non-to be used to limit the scope of the invention.
The present invention proposes a kind of data in magnetic disk processing routine.
Referring to Fig. 1, being the 10 first, second, third optionally operation of embodiment one of inventive disk data processor Environment schematic.
In the present embodiment, present invention can apply to include but are not limited to, intelligent hardware devices 1, user terminal 2 In application environment.It is communicated to connect between the intelligent hardware devices 1 and user terminal 2.
Wherein, intelligent hardware devices 1 are used to receive and respond the service request of the transmission of user terminal 2 (for example, file polling Request etc.), and back services request processing result to user terminal 2.
User terminal 2 receives the clothes of the feedback of intelligent hardware devices 1 for sending service request to intelligent hardware devices 1 Business request processing result.
In the present embodiment, data in magnetic disk processing routine 10 is installed and is run in intelligent hardware devices 1.Intelligent hardware is set Standby 1, which can be desktop PC, notebook, palm PC and server etc., calculates equipment.The intelligent hardware devices 1 can wrap It includes, but is not limited only to, memory 11, processor 12 and display 13.Fig. 2 illustrates only the Intelligent hardware with component 11-13 Equipment 1, it should be understood that being not required for implementing all components shown, the implementation that can be substituted is more or less Component.
Memory 11 can be the internal storage unit of intelligent hardware devices 1 in some embodiments, such as the intelligence is hard The hard disk or memory of part equipment 1.The external storage that memory 11 is also possible to intelligent hardware devices 1 in further embodiments is set Plug-in type hard disk that is standby, such as being equipped on intelligent hardware devices 1, intelligent memory card (Smart Media Card, SMC), safety Digital (Secure Digital, SD) card, flash card (Flash Card) etc..Further, memory 11 can also both include The internal storage unit of intelligent hardware devices 1 also includes External memory equipment.Memory 11 is installed on Intelligent hardware for storing Application software and Various types of data, such as the program code of data in magnetic disk processing routine 10 of equipment 1 etc..Memory 11 can also be used In temporarily storing the data that has exported or will export.In the present embodiment, above-mentioned memory 11 includes the first memory block 111 (for example, local data bases) and the second memory block 112, first memory block 111 file for storing data.
Processor 12 can be in some embodiments a central processing unit (Central Processing Unit, CPU), microprocessor or other data processing chips, program code or processing data for being stored in run memory 11, example Such as execute data in magnetic disk processing routine 10.
Display 13 can be in some embodiments light-emitting diode display, liquid crystal display, touch-control liquid crystal display and OLED (Organic Light-Emitting Diode, Organic Light Emitting Diode) touches device etc..Display 13 is for being shown in The information that is handled in intelligent hardware devices 1 and for showing visual user interface.The component 11- of intelligent hardware devices 1 13 are in communication with each other by program bus.
Referring to Fig. 2, being another optional fortune of 10 first, second, third embodiment of inventive disk data processor Row environment schematic.
In the present embodiment, it is also possible to apply the invention to include but are not limited to, intelligent hardware devices 1, user terminal 2, In the application environment of electronic equipment 3.The intelligent hardware devices 1 communicate to connect between user terminal 2, electronic equipment 3 respectively.
The difference of Fig. 2 and Fig. 1 is that the first memory block 111 and the second memory block 112 are set to and intelligent hardware devices 1 In the electronic equipment 3 (for example, personal computer, plug-in type hard disk, intelligent memory card etc.) of communication connection.
It should be noted that above-mentioned second memory block 112 may also be disposed on except intelligent hardware devices 1 and electronic equipment 3 with In other outer any applicable devices or equipment.
Referring to Fig. 3, being the Program modual graph of 10 first, second embodiment of inventive disk data processor.At this In embodiment, data in magnetic disk processing routine 10 can be divided into one or more modules, one or more module is stored In memory 11, and it is performed by one or more processors (the present embodiment is processor 12), to complete the present invention.Example Such as, in Fig. 3, data in magnetic disk processing routine 10 can be divided into scan module 101, extraction module 102, map and establish module 103, memory module 104 and enquiry module 105.The so-called module of the present invention is the series of computation for referring to complete specific function Machine program instruction section, the implementation procedure than program more suitable for description data in magnetic disk processing routine 10 in intelligent hardware devices 1, Wherein:
Scan module 101, for real-time or timing, or after receiving classified and stored instruction, the file of scan data file Catalogue.
Above-mentioned data file can be stored in above-mentioned first memory block 111, and the file directory of the data file can be stored in In above-mentioned second memory block 112.Extraction module 102, for regular according to predetermined tag extraction, from the text of scanning One or more directory tags are extracted in part catalogue.
Specifically, by file directory D: PDF for Setup Files, tag extraction is carried out to this document catalogue, is generated Directory tags " D " and " PDF ".
Preferably, in the present embodiment, above-mentioned predetermined tag extraction rule can refer to following two schemes:
Scheme one:
Firstly, each directory node for the file directory establishes node tree, the node tree includes multiple catalogue sections Point branch is (for example, the directory node branch " X1-X2-X3-X4 " in Fig. 4, " X1-X2-X5-X6 ", " X1-X2-X5-X7 ", " X1- Z1-Z2-Z3 ", " X1-Y1-Y2 " etc.).In each directory node branch include master catalogue node and subdirectory node, each Higher level's directory node is the master catalogue node of its subprime directory node, for example, nodes X 1 is nodes X 1, the master catalogue of Z1, Y1 Node, nodes X 2 are the master catalogue nodes of nodes X 3, X5.
Then, it is determined that most junior in each directory node branch shares directory node, directory node branch Most junior share directory node refer to other directory node branches share and in the directory node branch it is corresponding All junior's subdirectory nodes are not the directory node of shared directory node.For example, directory node branch " X1-X2-X3-X4 " It is nodes X 2 that corresponding most junior, which shares directory node, and " X1-X2-X5-X6 " and " X1-X2-X5-X7 " corresponding most junior is shared Directory node is nodes X 5.
Finally, the most junior of each determining directory node branch is shared directory node and its corresponding all respectively The nodename of higher level's directory node is combined according to the sequence of positions of corresponding directory node branch, generates combination name Claim.The combination title is the directory tags of corresponding directory node branch, for example, directory node branch " X1-X2-X3- The corresponding directory tags of X4 " are " X1-X2 ".
Scheme two:
Firstly, each directory node for file directory establishes node tree, the node tree includes multiple directory nodes point Branch is (for example, the directory node branch " X1-X2-X3-X4 " in Fig. 4, " X1-X2-X5-X6 ", " X1-X2-X5-X7 ", " X1-Z1- Z2-Z3 ", " X1-Y1-Y2 " etc.).It include master catalogue node and subdirectory node in each directory node branch, on each Grade directory node is the master catalogue node of its subprime directory node, for example, nodes X 1 is the master catalogue section of nodes X 1, Z1, Y1 Point, nodes X 2 are the master catalogue nodes of nodes X 3, X5.
Then, the i-stage directory node in each directory node branch is determined respectively, and i is the positive integer greater than 1, example Such as, i can be 2, and the 2nd grade of directory node of directory node branch " X1-X2-X3-X4 " is " X2 ".
Finally, respectively by the i-stage directory node of each determining directory node branch and its corresponding all higher levels The nodename of directory node is combined according to the sequence of positions of corresponding directory node branch, generates combination title.Institute The directory tags that combination title is corresponding directory node branch are stated, for example, directory node branch " X1-X2-X3-X4 " is corresponding Directory tags be " X1-X2 ".
Mapping establish module 103, for respectively by under each file directory each data file with it is corresponding Directory tags relationship maps are established between the preset kind the file information of each data file and the directory tags of relationship maps Corresponding relationship.
Specifically, the corresponding directory tags of each mark data files under respectively each file directory, example Such as, if the corresponding directory tags of file directory A1 are a1, the corresponding directory tags of file directory A2 are a2.Under file directory A1 Each data file is with directory tags a1 relationship maps, each data file under file directory A2 is and directory tags A2 relationship maps.And by the preset kind the file information of each data file it is corresponding with the foundation of the directory tags of relationship maps close System.
Above-mentioned preset kind the file information includes store path information, file name etc..
Memory module 104, for storing the corresponding relation data.For example, memory module 104 closes the correspondence Coefficient is according to storing into second memory block 112.
Enquiry module 105, for responding the file query requests with directory tags of user terminal transmission, according to described Corresponding relation data determines the preset kind the file information of the corresponding each data file of the directory tags in the inquiry request, Based on determining preset kind the file information, the corresponding file polling result of the inquiry request is generated (for example, file polling arranges Table), and the file polling result of generation is fed back into the user terminal.
The file directory of the present embodiment scan data file;One or more catalogue marks are extracted from the file directory of scanning Label;Respectively by each data file and the corresponding directory tags relationship maps under each file directory, and establish corresponding pass System;It is true according to corresponding relation data after receiving the file query requests with directory tags that a user terminal is sent The preset kind the file information for determining the corresponding each data file of directory tags in inquiry request generates and feeds back the inquiry and asks Ask corresponding file polling result to user terminal.Compared to the prior art, the catalogue that the present embodiment will extract in file directory Mapping relations are established between label and data file, when carrying out file polling, user terminal are only needed to provide directory tags Corresponding data file is fast and accurately inquired, improves the efficiency and accuracy rate of file polling, and easy to operate.
Referring once again to Fig. 3, in 10 second embodiment of inventive disk data processor, the present embodiment is implemented first On the basis of example, mapping establishes module 103 and is also used to establish incidence relation between each directory tags.
For example, catalogue level :/photo/shenzheng/nanshan/dsc_001.jpg, according to this dsc_ Upper two layers of directory name of 001.jpg file can propose two directory tags: shenzheng, nanshan, and when opening When this directory tags of shenzheng, also association shows an association directory tags: nanshan.
The scene of correlation tag can have several ways:
One, two label of mode is in the relationship of upper and lower level, such as previous example, two labels of shenzheng, Nanshan Belong to overlying relation, has same file dsc_001.jpg under two labels, be consequently belonging to correlation tag.
Two, two labels of mode are all associated with A file.Such as the manual right/photo/shenzheng/nanshan/ of user Dsc_001.jpg file has played the label of one " landscape " again, that label " shenzheng ", " nanshan ", " landscape " is all Correlation tag, when opening any one label, the correlation tag column on side all show other two correlation tags.
Mode three, label are of the same name: it can be extracted according to/photo/shenzheng/nanshan/dsc_001.jpg file: Two labels: shenzheng, nanshan also can extract according to/video/shenzheng/DJI_002.MOV: video, Two labels of shenzheng, wherein shenzheng label is existing, so shenzheng label is associated with dsc_001.jpg With DJI_002.MOV file, and also relevant both of these documents of nanshan, video, therefore: shenzheng, Nanshan, Video belongs to correlation tag.
The present embodiment can further improve user file inquiry and ask by establishing incidence relation between each directory tags The response accuracy asked effectively promotes the efficiency of inquiry.
As shown in figure 5, Fig. 5 is the Program modual graph of 10 3rd embodiment of inventive disk data processor.
For the present embodiment on the basis of the first, second embodiment, which further includes removing module 106, removing module 106 For:
Firstly, determining the quantity of the corresponding data file of each directory tags respectively.
Then, when the quantity for having the corresponding data file of directory tags is less than preset threshold, the directory tags are deleted.
In the present embodiment, above-mentioned removing module 106 is also used to:
Firstly, determining the quantity of the corresponding data file of each directory tags respectively.
Then, each directory tags are ranked up according to the size order of the quantity of corresponding data file.For example, from Small sequence is arrived greatly or sequence from small to large is ranked up.
Finally, retaining the catalogue mark for the preceding preset quantity that sorts when the size order is sequence from big to small Label, and other directory tags other than the directory tags of reservation are deleted.Alternatively, if the size order is from small to large suitable Sequence then retains the directory tags for the posterior preset quantity that sorts, and other directory tags other than the directory tags of reservation is deleted It removes.
The present embodiment deletes the occupancy that partial target label advantageously reduces memory space.
Further it is proposed that a kind of data in magnetic disk processing method.
As shown in fig. 6, Fig. 6 is the flow diagram of inventive disk data processing method first embodiment.
In the present embodiment, this method is suitable for being stored with the intelligent hardware devices of data file (for example, depositing configured with first The intelligent hardware devices of storage area and the second memory block), alternatively, being suitable for and the electronic equipment (example that is stored with the data file Such as, the electronic equipment configured with the first memory block and the second memory block) communication connection intelligent hardware devices, this method comprises:
Step S10 in real time or periodically, or after receiving classified and stored instruction, scans the file directory of the data file.
Above-mentioned data file can be stored in above-mentioned first memory block, and the file directory of the data file can be stored in second In memory block.In other embodiments except this embodiment, the file directory of the data file also be can be stored in except intelligence is hard In other any applicable devices or equipment other than part equipment and electronic equipment.
Step S20 extracts one or more according to predetermined tag extraction rule from the file directory of scanning A directory tags.
Specifically, by file directory D: PDF for Setup Files, tag extraction is carried out to this document catalogue, is generated Directory tags " D " and " PDF ".
Preferably, in the present embodiment, above-mentioned predetermined tag extraction rule can refer to following two schemes:
Scheme one:
Firstly, each directory node for the file directory establishes node tree, the node tree includes multiple catalogue sections Point branch is (for example, the directory node branch " X1-X2-X3-X4 " in Fig. 4, " X1-X2-X5-X6 ", " X1-X2-X5-X7 ", " X1- Z1-Z2-Z3 ", " X1-Y1-Y2 " etc.).In each directory node branch include master catalogue node and subdirectory node, each Higher level's directory node is the master catalogue node of its subprime directory node, for example, nodes X 1 is nodes X 1, the master catalogue of Z1, Y1 Node, nodes X 2 are the master catalogue nodes of nodes X 3, X5.
Then, it is determined that most junior in each directory node branch shares directory node, directory node branch Most junior share directory node refer to other directory node branches share and in the directory node branch it is corresponding All junior's subdirectory nodes are not the directory node of shared directory node.For example, directory node branch " X1-X2-X3-X4 " It is nodes X 2 that corresponding most junior, which shares directory node, and " X1-X2-X5-X6 " and " X1-X2-X5-X7 " corresponding most junior is shared Directory node is nodes X 5.
Finally, the most junior of each determining directory node branch is shared directory node and its corresponding all respectively The nodename of higher level's directory node is combined according to the sequence of positions of corresponding directory node branch, generates combination name Claim.The combination title is the directory tags of corresponding directory node branch, for example, directory node branch " X1-X2-X3- The corresponding directory tags of X4 " are " X1-X2 ".
Scheme two:
Firstly, each directory node for file directory establishes node tree, the node tree includes multiple directory nodes point Branch is (for example, the directory node branch " X1-X2-X3-X4 " in Fig. 4, " X1-X2-X5-X6 ", " X1-X2-X5-X7 ", " X1-Z1- Z2-Z3 ", " X1-Y1-Y2 " etc.).It include master catalogue node and subdirectory node in each directory node branch, on each Grade directory node is the master catalogue node of its subprime directory node, for example, nodes X 1 is the master catalogue section of nodes X 1, Z1, Y1 Point, nodes X 2 are the master catalogue nodes of nodes X 3, X5.
Then, the i-stage directory node in each directory node branch is determined respectively, and i is the positive integer greater than 1, example Such as, i can be 2, and the 2nd grade of directory node of directory node branch " X1-X2-X3-X4 " is " X2 ".
Finally, respectively by the i-stage directory node of each determining directory node branch and its corresponding all higher levels The nodename of directory node is combined according to the sequence of positions of corresponding directory node branch, generates combination title.Institute The directory tags that combination title is corresponding directory node branch are stated, for example, directory node branch " X1-X2-X3-X4 " is corresponding Directory tags be " X1-X2 ".
Each data file under each file directory is associated with by step S30 with corresponding directory tags respectively Mapping, establishes the corresponding relationship between the preset kind the file information of each data file and the directory tags of relationship maps.
Specifically, the corresponding directory tags of each mark data files under respectively each file directory, example Such as, if the corresponding directory tags of file directory A1 are a1, the corresponding directory tags of file directory A2 are a2.Under file directory A1 Each data file is with directory tags a1 relationship maps, each data file under file directory A2 is and directory tags A2 relationship maps.And by the preset kind the file information of each data file it is corresponding with the foundation of the directory tags of relationship maps close System.
Above-mentioned preset kind the file information includes store path information, file name etc..
Step S40 stores the corresponding relation data.For example, storing the corresponding relation data to second In memory block.
Step S50, after responding the file query requests with directory tags that user terminal is sent, according to the corresponding pass Coefficient is based on true according to the preset kind the file information of the corresponding each data file of directory tags in the determination inquiry request Fixed preset kind the file information generates the corresponding file polling result of the inquiry request (for example, file polling list), and The file polling result of generation is fed back into the user terminal.
The file directory of the present embodiment scan data file;One or more catalogue marks are extracted from the file directory of scanning Label;Respectively by each data file and the corresponding directory tags relationship maps under each file directory, and establish corresponding pass System;It is true according to corresponding relation data after receiving the file query requests with directory tags that a user terminal is sent The preset kind the file information for determining the corresponding each data file of directory tags in inquiry request generates and feeds back the inquiry and asks Ask corresponding file polling result to user terminal.Compared to the prior art, the catalogue that the present embodiment will extract in file directory Mapping relations are established between label and data file, when carrying out file polling, user terminal are only needed to provide directory tags Corresponding data file is fast and accurately inquired, improves the efficiency and accuracy rate of file polling, and easy to operate.
As shown in fig. 7, Fig. 7 is the flow diagram of inventive disk data processing method second embodiment.
The present embodiment is on the basis of first embodiment, after step S20, this method further include:
Step S60 establishes incidence relation between each directory tags.
For example, catalogue level :/photo/shenzhen/nanshan/dsc_001.jpg, according to this dsc_001.jpg Upper two layers of directory name of file can propose two directory tags: shenzhen, nanshan, and as opening shenzhen When this directory tags, also association shows an association directory tags: nanshan.
The scene of correlation tag can have several ways:
One, two label of mode is in the relationship of upper and lower level, such as previous example, two label categories of shenzhen, nanshan There is same file dsc_001.jpg under overlying relation, two labels, is consequently belonging to correlation tag.
Two, two labels of mode are all associated with A file.Such as the manual right/photo/shenzhen/nanshan/dsc_ of user 001.jpg file has played the label of one " landscape " again, that label " shenzhen ", " nanshan ", and " landscape " is all association mark Label, when opening any one label, the correlation tag column on side all show other two correlation tags.
Mode three, label are of the same name: it can be extracted according to/photo/shenzhen/nanshan/dsc_001.jpg file: Two labels: shenzhen, nanshan also can extract according to/video/shenzhen/DJI_002.MOV: video, Two labels of shenzhen, wherein shenzhen label is existing, thus shenzhen label be associated with dsc_001.jpg and DJI_002.MOV file, and the also relevant both of these documents of nanshan, video, therefore: shenzhen, nanshan, Video belongs to correlation tag.
The present embodiment can further improve user file inquiry and ask by establishing incidence relation between each directory tags The response accuracy asked effectively promotes the efficiency of inquiry.
As shown in figure 8, Fig. 8 is the flow diagram of inventive disk data processing method 3rd embodiment.
The present embodiment is on the basis of the first, second embodiment, before step S40, this method further include:
Step S70 determines the quantity of the corresponding data file of each directory tags respectively.
Step S80 deletes the catalogue mark when the quantity for having the corresponding data file of directory tags is less than preset threshold Label.
In the present embodiment, above-mentioned steps S70, S80 can be replaced by following steps:
Firstly, determining the quantity of the corresponding data file of each directory tags respectively.
Then, each directory tags are ranked up according to the size order of the quantity of corresponding data file.For example, from Small sequence is arrived greatly or sequence from small to large is ranked up.
Finally, retaining the catalogue mark for the preceding preset quantity that sorts when the size order is sequence from big to small Label, and other directory tags other than the directory tags of reservation are deleted.Alternatively, if the size order is from small to large suitable Sequence then retains the directory tags for the posterior preset quantity that sorts, and other directory tags other than the directory tags of reservation is deleted It removes.
The present embodiment deletes the occupancy that partial target label advantageously reduces memory space.
Further, the present invention also proposes that a kind of computer readable storage medium, the computer readable storage medium are deposited Contain data in magnetic disk processing routine, the data in magnetic disk processing routine can be executed by least one processor so that it is described at least One processor executes the data in magnetic disk processing method in any of the above-described embodiment.
The above description is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all at this Under the inventive concept of invention, using equivalent structure transformation made by description of the invention and accompanying drawing content, or directly/use indirectly It is included in other related technical areas in scope of patent protection of the invention.

Claims (16)

1. a kind of intelligent hardware devices, the intelligent hardware devices include first memory and processor, which is characterized in that described The data in magnetic disk processing routine that can be run on the processor, the data in magnetic disk processing routine are stored on first memory Following steps are realized when being executed by the processor:
Scanning step: in real time or periodically, or after receiving classified and stored instruction, the file directory of scan data file, the number It is stored in the electronic equipment communicated to connect with the intelligent hardware devices according to file;
Extraction step: it according to predetermined tag extraction rule, is extracted from the file directory of scanning one or more Directory tags;
Mapping establishment step: each data file under each file directory is associated with corresponding directory tags respectively Mapping, establishes the corresponding relationship between the preset kind the file information of each data file and the directory tags of relationship maps;
Storing step: the corresponding relation data is stored;
Query steps: the file query requests with directory tags that response user terminal is sent, according to the corresponding relationship number According to the preset kind the file information of the corresponding each data file of directory tags in the determination inquiry request, based on determining Preset kind the file information generates the corresponding file polling of the inquiry request as a result, and the file polling result of generation is anti- It feeds the user terminal.
2. intelligent hardware devices as described in claim 1, which is characterized in that the electricity with intelligent hardware devices communication connection Sub- equipment includes the first memory block and the second memory block, and the file directory of the data file and the data file is stored in institute It states in the first memory block, the corresponding relation data is stored in second memory block.
3. intelligent hardware devices as described in claim 1, which is characterized in that the processor executes the data in magnetic disk processing Program also performs the steps of after the extraction step
Incidence relation is established between each directory tags.
4. intelligent hardware devices as claimed any one in claims 1 to 3, which is characterized in that the predetermined label Extracting rule are as follows:
Node tree is established for each directory node of the file directory, the node tree includes multiple directory node branches, often It include master catalogue node and subdirectory node in one directory node branch, each higher level's directory node is its subprime directory The master catalogue node of node;
Determine that the most junior in each directory node branch shares directory node, the most junior of a directory node branch is shared Directory node refers to sharing with other directory node branches and corresponding all juniors in the directory node branch Directory node is not the directory node of shared directory node;
The most junior of each determining directory node branch is shared into directory node and its corresponding all higher level's catalogues respectively The nodename of node is combined according to the sequence of positions of corresponding directory node branch, is generated and is combined title, and described group Close the directory tags that title is corresponding directory node branch.
5. intelligent hardware devices as claimed any one in claims 1 to 3, which is characterized in that the predetermined label Extracting rule are as follows:
Node tree is established for each directory node of file directory, the node tree includes multiple directory node branches, each It include master catalogue node and subdirectory node in directory node branch, each higher level's directory node is its subprime directory node Master catalogue node;
The i-stage directory node in each directory node branch is determined respectively, and i is the positive integer greater than 1;
Respectively by the i-stage directory node of each determining directory node branch and its corresponding all higher level's directory nodes Nodename is combined according to the sequence of positions of corresponding directory node branch, generates combination title, the combination title The directory tags of as corresponding directory node branch.
6. intelligent hardware devices as claimed any one in claims 1 to 3, which is characterized in that described in the processor executes Data in magnetic disk processing routine also performs the steps of before the storing step
The quantity of the corresponding data file of each directory tags is determined respectively;
Each directory tags are ranked up according to the size order of the quantity of corresponding data file;
When the size order is sequence from big to small, retain the directory tags for the preceding preset quantity that sorts, and will protect Other directory tags other than the directory tags stayed are deleted, alternatively, retaining when the size order is sequence from small to large The directory tags for the posterior preset quantity that sorts, and other directory tags other than the directory tags of reservation are deleted.
7. intelligent hardware devices as claimed any one in claims 1 to 3, which is characterized in that described in the processor executes Data in magnetic disk processing routine also performs the steps of before the storing step
The quantity of the corresponding data file of each directory tags is determined respectively;
When the quantity for having the corresponding data file of directory tags is less than preset threshold, the directory tags are deleted.
8. a kind of intelligent hardware devices, which is characterized in that the intelligent hardware devices include second memory and processor, described The data in magnetic disk processing routine that can be run on the processor, the data in magnetic disk processing routine are stored on second memory Following steps are realized when being executed by the processor:
Scanning step: in real time or periodically, or after receiving classified and stored instruction, the file directory of scan data file, the number It is stored in the second memory according to file;
Extraction step: it according to predetermined tag extraction rule, is extracted from the file directory of scanning one or more Directory tags;
Mapping establishment step: each data file under each file directory is associated with corresponding directory tags respectively Mapping, establishes the corresponding relationship between the preset kind the file information of each data file and the directory tags of relationship maps;
Storing step: the corresponding relation data is stored;
Query steps: the file query requests with directory tags that response user terminal is sent, according to the corresponding relationship number According to the preset kind the file information of the corresponding each data file of directory tags in the determination inquiry request, based on determining Preset kind the file information generates the corresponding file polling of the inquiry request as a result, and the file polling result of generation is anti- It feeds the user terminal.
9. intelligent hardware devices as claimed in claim 8, which is characterized in that the second memory further includes the first memory block With the second memory block, the file directory of the data file and the data file is stored in first memory block, described Corresponding relation data is stored in second memory block.
10. a kind of data in magnetic disk processing method, this method is suitable for being stored with the intelligent hardware devices of data file, alternatively, suitable Intelligent hardware devices for being communicated to connect with the electronic equipment for being stored with the data file, which is characterized in that this method packet Include step:
Scanning step: in real time or periodically, or after receiving classified and stored instruction, the file directory of the data file is scanned;
Extraction step: it according to predetermined tag extraction rule, is extracted from the file directory of scanning one or more Directory tags;
Mapping establishment step: each data file under each file directory is associated with corresponding directory tags respectively Mapping, establishes the corresponding relationship between the preset kind the file information of each data file and the directory tags of relationship maps;
Storing step: the corresponding relation data is stored;
Query steps: the file query requests with directory tags that response user terminal is sent, according to the corresponding relationship number According to the preset kind the file information of the corresponding each data file of directory tags in the determination inquiry request, based on determining Preset kind the file information generates the corresponding file polling of the inquiry request as a result, and the file polling result of generation is anti- It feeds the user terminal.
11. data in magnetic disk processing method as claimed in claim 10, which is characterized in that after the extraction step, the party Method further include:
Incidence relation is established between each directory tags.
12. data in magnetic disk processing method as described in claim 10 or 11, which is characterized in that the predetermined label mentions Take rule are as follows:
Node tree is established for each directory node of the file directory, the node tree includes multiple directory node branches, often It include master catalogue node and subdirectory node in one directory node branch, each higher level's directory node is its subprime directory The master catalogue node of node;
Determine that the most junior in each directory node branch shares directory node, the most junior of a directory node branch is shared Directory node refers to sharing with other directory node branches and corresponding all juniors in the directory node branch Directory node is not the directory node of shared directory node;
The most junior of each determining directory node branch is shared into directory node and its corresponding all higher level's catalogues respectively The nodename of node is combined according to the sequence of positions of corresponding directory node branch, is generated and is combined title, and described group Close the directory tags that title is corresponding directory node branch.
13. data in magnetic disk processing method as described in claim 10 or 11, which is characterized in that the predetermined label mentions Take rule are as follows:
Node tree is established for each directory node of file directory, the node tree includes multiple directory node branches, each It include master catalogue node and subdirectory node in directory node branch, each higher level's directory node is its subprime directory node Master catalogue node;
The i-stage directory node in each directory node branch is determined respectively, and i is the positive integer greater than 1;
Respectively by the i-stage directory node of each determining directory node branch and its corresponding all higher level's directory nodes Nodename is combined according to the sequence of positions of corresponding directory node branch, generates combination title, the combination title The directory tags of as corresponding directory node branch.
14. data in magnetic disk processing method as described in claim 10 or 11, which is characterized in that before the storing step, This method further include:
The quantity of the corresponding data file of each directory tags is determined respectively;
Each directory tags are ranked up according to the size order of the quantity of corresponding data file;
When the size order is sequence from big to small, retain the directory tags for the preceding preset quantity that sorts, and will protect Other directory tags other than the directory tags stayed are deleted, alternatively, retaining when the size order is sequence from small to large The directory tags for the posterior preset quantity that sorts, and other directory tags other than the directory tags of reservation are deleted.
15. data in magnetic disk processing method as described in claim 10 or 11, which is characterized in that before the storing step, This method further include:
The quantity of the corresponding data file of each directory tags is determined respectively;
When the quantity for having the corresponding data file of directory tags is less than preset threshold, the directory tags are deleted.
16. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage has data in magnetic disk Processing routine, the data in magnetic disk processing routine can be executed by least one processor, so that at least one described processor is held The step of capable data in magnetic disk processing method as described in any one of claim 10-15.
CN201810791052.3A 2018-07-18 2018-07-18 Intelligent hardware device, magnetic disk data processing method and storage medium Active CN109189728B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810791052.3A CN109189728B (en) 2018-07-18 2018-07-18 Intelligent hardware device, magnetic disk data processing method and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810791052.3A CN109189728B (en) 2018-07-18 2018-07-18 Intelligent hardware device, magnetic disk data processing method and storage medium

Publications (2)

Publication Number Publication Date
CN109189728A true CN109189728A (en) 2019-01-11
CN109189728B CN109189728B (en) 2022-08-12

Family

ID=64936191

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810791052.3A Active CN109189728B (en) 2018-07-18 2018-07-18 Intelligent hardware device, magnetic disk data processing method and storage medium

Country Status (1)

Country Link
CN (1) CN109189728B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110532231A (en) * 2019-09-02 2019-12-03 Oppo(重庆)智能科技有限公司 File polling method, file polling device and terminal device
CN111966633A (en) * 2020-08-14 2020-11-20 北京百度网讯科技有限公司 Method, device, electronic equipment and medium for inquiring child nodes under directory

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101183367A (en) * 2007-01-23 2008-05-21 腾讯科技(深圳)有限公司 Method for managing document by label, instantaneous communications customer terminal and system
CN102609532A (en) * 2012-02-15 2012-07-25 大唐移动通信设备有限公司 Method and device for monitoring file directory
CN102722487A (en) * 2011-03-30 2012-10-10 腾讯科技(深圳)有限公司 Method and apparatus for file management
CN103942205A (en) * 2013-01-18 2014-07-23 深圳市腾讯计算机系统有限公司 Method, device and system for storing and reading catalogue index
CN104469518A (en) * 2014-12-16 2015-03-25 广东欧珀移动通信有限公司 Access method for audio and video files and electronic device
CN105243081A (en) * 2015-09-07 2016-01-13 河南大学 Formal concept based file system directory structure organization method
CN105550252A (en) * 2015-12-09 2016-05-04 北京金山安全软件有限公司 File positioning method and device and electronic equipment
CN105721527A (en) * 2014-12-04 2016-06-29 金蝶软件(中国)有限公司 Data processing method and server
CN106331075A (en) * 2016-08-18 2017-01-11 华为技术有限公司 Method for storing files, metadata server and manager
CN106886610A (en) * 2017-04-11 2017-06-23 广东浪潮大数据研究有限公司 The file management method and device of a kind of distributed file system
CN107562786A (en) * 2017-07-27 2018-01-09 平安科技(深圳)有限公司 File memory method, terminal and computer-readable recording medium

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101183367A (en) * 2007-01-23 2008-05-21 腾讯科技(深圳)有限公司 Method for managing document by label, instantaneous communications customer terminal and system
CN102722487A (en) * 2011-03-30 2012-10-10 腾讯科技(深圳)有限公司 Method and apparatus for file management
CN102609532A (en) * 2012-02-15 2012-07-25 大唐移动通信设备有限公司 Method and device for monitoring file directory
CN103942205A (en) * 2013-01-18 2014-07-23 深圳市腾讯计算机系统有限公司 Method, device and system for storing and reading catalogue index
CN105721527A (en) * 2014-12-04 2016-06-29 金蝶软件(中国)有限公司 Data processing method and server
CN104469518A (en) * 2014-12-16 2015-03-25 广东欧珀移动通信有限公司 Access method for audio and video files and electronic device
CN105243081A (en) * 2015-09-07 2016-01-13 河南大学 Formal concept based file system directory structure organization method
CN105550252A (en) * 2015-12-09 2016-05-04 北京金山安全软件有限公司 File positioning method and device and electronic equipment
CN106331075A (en) * 2016-08-18 2017-01-11 华为技术有限公司 Method for storing files, metadata server and manager
CN106886610A (en) * 2017-04-11 2017-06-23 广东浪潮大数据研究有限公司 The file management method and device of a kind of distributed file system
CN107562786A (en) * 2017-07-27 2018-01-09 平安科技(深圳)有限公司 File memory method, terminal and computer-readable recording medium

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110532231A (en) * 2019-09-02 2019-12-03 Oppo(重庆)智能科技有限公司 File polling method, file polling device and terminal device
CN110532231B (en) * 2019-09-02 2021-12-17 Oppo(重庆)智能科技有限公司 File query method, file query device and terminal equipment
CN111966633A (en) * 2020-08-14 2020-11-20 北京百度网讯科技有限公司 Method, device, electronic equipment and medium for inquiring child nodes under directory
CN111966633B (en) * 2020-08-14 2024-04-09 北京百度网讯科技有限公司 Method, device, electronic equipment and medium for inquiring child node under directory

Also Published As

Publication number Publication date
CN109189728B (en) 2022-08-12

Similar Documents

Publication Publication Date Title
CN102750375B (en) Service and tag recommendation method based on random walk
CN101408877B (en) System and method for loading tree node
CN102184227B (en) General crawler engine system used for WEB service and working method thereof
CN102164186B (en) Method and system for realizing cloud search service
CN104516979A (en) Data query method and data query system based on quadratic search
CN103327052A (en) Data storage method and system and data visiting method and system
CN102946320B (en) Distributed supervision method and system for user behavior log forecasting network
CN103345521A (en) Method and device for processing key values in hash table database
CN103279474A (en) Video file index method and system
CN106202416A (en) Table data write method and device, table data read method and device
CN106033428B (en) The selection method of uniform resource locator and the selection device of uniform resource locator
CN106777179A (en) A kind of online method for previewing of document and system
CN102196027A (en) System and method for implementing mobile cloud service
CN109241384A (en) A kind of method for visualizing and device of scientific research information
CN110163268A (en) A kind of image processing method, device and server, storage medium
CN108536617A (en) Buffer memory management method, medium, system and electronic equipment
CN109189728A (en) Intelligent hardware devices, data in magnetic disk processing method and storage medium
CN102098233A (en) Method and system for controlling communication window in instant messenger
CN110989937A (en) Data storage method, device and equipment and computer readable storage medium
CN109885535A (en) A kind of method and relevant apparatus of file storage
CN101719124A (en) System of infinite layering multi-path acquisition based on regular matching
CN106487655A (en) A kind of method for message interaction, device and processing server
CN104636368A (en) Data retrieval method and device and server
CN109302406B (en) Distributed webpage evidence obtaining method and system
US20090112704A1 (en) Management tool for efficient allocation of skills and resources

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