CN107145588A - A kind of file arborescence automatically creates method and system - Google Patents
A kind of file arborescence automatically creates method and system Download PDFInfo
- Publication number
- CN107145588A CN107145588A CN201710329589.3A CN201710329589A CN107145588A CN 107145588 A CN107145588 A CN 107145588A CN 201710329589 A CN201710329589 A CN 201710329589A CN 107145588 A CN107145588 A CN 107145588A
- Authority
- CN
- China
- Prior art keywords
- file
- variable
- character string
- arborescence
- document
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
- G06F16/164—File meta data generation
- G06F16/166—File name conversion
Abstract
Method and system is automatically created the invention discloses a kind of file arborescence, optimizes the nesting of file at any time, is easy to search required file.Its technical scheme is：The All Files of specified path and the name of file and the form for being converted into character string are read with Python databases, character string document is formed；Character string document is converted into tree again, file arborescence is ultimately formed.
Description
Technical field
Create corresponding tree-like the present invention relates to the optimisation technique of the file in digital display circuit, more particularly to based on file
The method and system of figure.
Background technology
In individual digital equipment (such as smart mobile phone, tablet personal computer, mobile hard disk) and the network storage equipment is (for example
Cloud disk etc.) after long-term use, the number of folders manually set up or automatically generated can be more and more, cause file
Nested level also can be more and more.
File nesting etc. causes the confusion in file management, causes user to be not easily found required file.Moreover,
When file needed for user attempts to look for way of search, and often forget file name and cause search not enter effectively
OK, or even sometimes the presence of this class file is all forgotten.
And the file management on traditional digital device or the network storage equipment is by using the resource management of PC systems
Device, the path address of file where file can only be deployed along single-pathway.So nested level can excessively cause by this
Plant mode of operation becomes very time-consuming come file needed for opening.
The content of the invention
The brief overview of one or more aspects given below is to provide to the basic comprehension in terms of these.This general introduction is not
The extensive overview of all aspects contemplated, and it is also non-to be both not intended to identify the key or decisive key element of all aspects
Attempt to define the scope in terms of any or all.Its unique purpose is to provide the one of one or more aspects in simplified form
A little concepts think the sequence of more detailed description given later.
Method and system is automatically created object of the present invention is to provide a kind of file arborescence, optimizes file at any time
The nesting of folder, is easy to search required file.
The technical scheme is that：Method is automatically created present invention is disclosed a kind of file arborescence, including：
The All Files of specified path and the name of file and the form for being converted into character string are read, character is formed
Illustration and text juxtaposed setting shelves；
Character string document is converted into tree, file arborescence is formed.
An embodiment of method is automatically created according to the file arborescence of the present invention, the step of character string document is formed
Including：
Call the database in Python；
Invisible scanning path；
By database, the All Files and file that recurrence is read in all levels in scanning pattern obtain name,
The file and file of each of which level are arranged with sequence number, and sub- level file or file contract relative to parent file
Enter；
The name of the file read in and file is stored with string variable, character string document is constituted.
An embodiment of method is automatically created according to the file arborescence of the present invention, character string document is converted into tree-shaped
The step of structure, includes：
Character string document is read, listings format is converted into by divided by row, list variable is constituted；
Initialize dictionary variable and structural level variable；
Based on list variable and structural level variable, the sequence number in character string document is detected；
Based on the attribute in dictionary variable, character string document is subjected to classification storage according to sequence number, updating dictionary variable is
Structuring dictionary variable；
Structuring dictionary variables transformations are showed for tree and in arborescence mode.
Present invention further teaches a kind of computer-readable storage medium, computer program instructions, computer program instructions are stored
Step in method is automatically created for performing file arborescence.
Present invention further teaches a kind of computer system, including processor and memory, computer journey is stored on memory
Sequence, computer program runs into computer instruction within a processor, and the computer instruction is used to perform file arborescence certainly
Step in dynamic creation method.
System is automatically created present invention further teaches a kind of file arborescence, including：
Character string document conversion module, for reading the All Files of specified path and the name of file and being converted
For the form of character string, character string document is formed；
Tree conversion module, for character string document to be converted into tree, forms file arborescence.
An embodiment of system, character string document conversion module bag are automatically created according to the file arborescence of the present invention
Include：
Data base call unit, for calling the database in Python；
Path designating unit, for invisible scanning path；
Filename reading unit, by database, recurrence read in All Files in all levels in scanning pattern and
File obtains name, and the file and file of each of which level are arranged with sequence number, and sub- level file or file are relative
In the retraction of parent file；
Variable storage unit, the name of the file read in and file is stored with string variable, constitutes character string document.
An embodiment of system is automatically created according to the file arborescence of the present invention, tree conversion module includes：
List variable structural unit, for reading character string document, listings format is converted into by divided by row, row are constituted
Table variable；
Dictionary variable and structural level initialization of variable unit, for initializing dictionary variable and structural level variable；
Character string document sequence number detection unit, for based on list variable and structural level variable, detecting character string document
In sequence number；
Dictionary variant structural unit, for based on the attribute in dictionary variable, character string document to be carried out according to sequence number
Classification storage, it is structuring dictionary variable to update dictionary variable；
Arborescence shows unit, for being tree by structuring dictionary variables transformations and being showed in arborescence mode.
Present invention contrast prior art has superior technique effect：The present invention reads all of scanning pattern by database
The name of file and file is to form text, then converts text to tree structure, automatically generates in this way all kinds of
Nested file in digital device, cloud disk and the wherein arborescence of file.
Brief description of the drawings
Fig. 1 shows that the file arborescence of the present invention automatically creates the flow chart of the embodiment of method.
Fig. 2 to Fig. 5 shows that the file arborescence shown in Fig. 1 automatically creates the refinement sub-process of the step in method
Figure.
Fig. 6 shows that the file arborescence of the present invention automatically creates the schematic diagram of the embodiment of system.
Embodiment
After the detailed description of embodiment of the disclosure is read in conjunction with the following drawings, it better understood when the present invention's
Features described above and advantage.In the accompanying drawings, each component is not necessarily drawn to scale, and with similar correlation properties or feature
Component may have same or like reference.
Fig. 1 shows that the file arborescence of the present invention automatically creates the flow of the embodiment of method.Fig. 1 is referred to, under
The detailed description for the step of face is the method to the present embodiment.
Step S1：The All Files of specified path and the name of file and the form for being converted into character string are read,
Form character string document.
The step for realization with further reference to shown in Fig. 2.
Step S11：Call the database os in Python.
Step S12：Invisible scanning path.
Step S13：By database os, the All Files and file in all levels in scanning pattern are read in recurrence
Name is held, the file and file of each of which level are arranged with sequence number, sub- level file or file are relative to father
Level file retraction.
Step S14：The name of the file read in and file is stored with string variable, character string document is constituted.
For example, reading good string variable such as the example below.
1.Biaoti
1.F1
1.F1.1.doc
2.F1.2.doc
3.F1.3.doc
4.F1.4
1.F1.4.1.doc
2.F1.4.2.doc
3.F1.4.3.doc
4.F1.4.4.doc
2.F2
1.F2.1.doc
2.F2.2.doc
3.F2.3.doc
4.F2.4.doc
3.F3
1.F3.1.doc
2.F3.2.doc
3.F3.3.doc
4.F3.4.doc
Step S2：Character string document is converted into tree, file arborescence is formed.
The step for realization with further reference to shown in Fig. 3.
Step S21：Character string document is read, listings format is converted into by divided by row, list variable is constituted
document。
Step S22：Initialize dictionary variable e_new and structural level variable level.
Dictionary variable e_new is initialized, including name, doc, the attribute of ch tri-, i.e. e_new=' name':”,'
doc':”,'ch':[]}。
Initialize intermediate variable child and child_document, i.e. child=[], child_document=
[]。
Initialisation structures level level, i.e. level=0.Initialize dictionary variable e_new attribute name, i.e. e_new
[' name']=' Scan Architecture '.
Step S23：Based on list variable and structural level variable, the sequence number in character string document is detected.
Detection character string document sequence number can realize that the input parameter of function is respectively by data_check functions
Document variables and level variables, output parameter pass to the doc attributes of e_new variables, i.e. e_new [' doc'], child
And child_document variables.
Data_check functions to implement step as shown in Figure 4.
Step S231：Transfer Parameters are transmitted to document and level variables respectively.
Step S232：Initialize wiki_name, i.e. wiki_name=[]；Initialize wiki_doc, i.e. wiki_doc=
[”for i in range(200)]；Initialize D, i.e. D="；Initialize index_1, i.e. index_1='1.'
Step S233：Document is handled by row, often row finds index variables using find methods, if finding execution
Next step；Otherwise step S235 is performed.
Here find methods are an algorithms inside python, it is therefore an objective to find target character in character string text
The original position of string.
Step S234：Capable string variable will be currently located, i.e. document [i] is read into wiki_name variables
In；Index is overlapped.
Step S235：If index is ' 1.', capable string variable will be currently located, i.e. document [i], which is read in, to be become
Measure in D；If index is not ' 1.', the string variable of current line is added in variable wiki_doc.
Step S236：Read document next line, i.e. i=i+1.If document is run through, next step is performed,
Otherwise step S233 is performed.
Step S237：Return to variables D, wiki_name, wiki_doc and level.
Step S24：Based on the attribute in dictionary variable, character string document is subjected to classification storage according to sequence number, word is updated
Allusion quotation variable is structuring dictionary variable.
Character string document is carried out into classification storage according to sequence number to realize by structured_cycle functions.The function
Input parameter be respectively：：E_new attribute ch, i.e. e_new [' ch'], child, child_document and level become
Amount.The output parameter of the function passes to e_new ch attributes, i.e. e_new [' ch'].
Structured_cycle functions to implement step as shown in Figure 5.
S241：Transfer Parameters are transmitted to e_new, child, child_document, level variable respectively.
S242：Loop initialization number of times i, i.e. i=0.
S243：By list variable child i-th of element, i.e. child [i] is assigned to name variables.
S244：If list variable child_document i-th of element, i.e. child_document [i] is ", then hold
Row next step；Otherwise step S246 is performed.
S245：By doc, child_document_next, child_next variable distinguish assignment ", [], [].
S246：Data_check modules are performed, wherein input parameter is respectively：Child_document [i] and level
Variable；Output parameter is passed to：Doc, child_next, child_document_next and level variable.
S247：Create new dictionary variable, i.e., ' name':name,'doc':doc,'ch':[] }, new dictionary is become
Amount is added in e_new.
S248：If variable child_next is [], next step is performed, step S2410 is otherwise performed.
S249：Variable level value is assigned to new variable level_new and cumulative level_new, i.e. level_
New=level_new+1.Structured_cycle modules are re-executed with recursive method, wherein input parameter is respectively：
E_new i-th of attribute of an element ch, i.e. e_new [i] [' ch'], child_next, child_document_next and
Level_new variables；Output parameter passes to the ch attributes of i-th of element of e_new, i.e. e_new [i] [' ch'].
S2410：Accumulation loop number of times i, i.e. i=i+1.If cycle-index i is equal to variable child element number, hold
Row next step, otherwise performs step S243.
S2411：Return to variable e_new.
Step S25：Structuring dictionary variables transformations are showed for tree and in arborescence mode.
Fig. 6 shows that the file arborescence of the present invention automatically creates the principle of the embodiment of system.Fig. 6 is referred to, this
The system of embodiment includes：Character string document conversion module and tree conversion module.Wherein character string document conversion module
For reading the All Files of specified path and the name of file and the form for being converted into character string, character illustration and text juxtaposed setting is formed
Shelves.Tree conversion module is used to character string document being converted into tree, forms file arborescence.
Character string document conversion module includes：Data base call unit, path designating unit, filename reading unit, change
Measure memory cell.
Data base call unit is used to call the database in Python.Path designating unit is used for invisible scanning path.
Filename reading unit is used for by database, and recurrence reads in the All Files and file in all levels in scanning pattern
Name is obtained, the file and file of each of which level are arranged with sequence number, sub- level file or file are relative to parent
File is retracted.Variable storage unit stores the name of the file read in and file with string variable, constitutes character illustration and text juxtaposed setting
Shelves.
Tree conversion module includes：List variable structural unit, dictionary variable and structural level initialization of variable list
Member, character string document sequence number detection unit, dictionary variant structural unit, arborescence show unit.
List variable structural unit is used to read character string document, and listings format is converted into by divided by row, constitutes row
Table variable.Dictionary variable and structural level initialization of variable unit, for initializing dictionary variable and structural level variable.Character
Illustration and text juxtaposed setting shelves sequence number detection unit, for based on list variable and structural level variable, detecting the sequence number in character string document.Dictionary
Variant structural unit, for based on the attribute in dictionary variable, character string document being carried out into classification storage according to sequence number, updated
Dictionary variable is structuring dictionary variable.Arborescence show unit be used for by structuring dictionary variables transformations be tree and with
Arborescence mode shows.
In addition, present invention further teaches a kind of computer-readable storage medium, computer program instructions thereon, computer program refers to
Make and automatically create step in method for performing foregoing file arborescence as shown in Figures 1 to 5.
Present invention further teaches a kind of computer system, including processor and memory, computer journey is stored on memory
Sequence, computer program runs into computer instruction within a processor, and computer instruction is foregoing such as Fig. 1 to Fig. 5 institutes for performing
The file arborescence shown automatically creates the step in method.
Although for make explanation simplify the above method is illustrated and is described as a series of actions, it should be understood that and understand,
The order that these methods are not acted is limited, because according to one or more embodiments, some actions can occur in different order
And/or with from it is depicted and described herein or herein it is not shown and describe but it will be appreciated by those skilled in the art that other
Action concomitantly occurs.
Those skilled in the art will further appreciate that, the various illustratives described with reference to the embodiments described herein
Logic plate, module, circuit and algorithm steps can be realized as electronic hardware, computer software or combination of the two.To be clear
Explain to Chu this interchangeability of hardware and software, various illustrative components, frame, module, circuit and step be above with
Its functional form makees vague generalization description.Such feature be implemented as hardware or software depend on concrete application and
Put on the design constraint of total system.Technical staff can be realized described for every kind of application-specific with different modes
Feature, but such realize that decision-making should not be interpreted to cause departing from the scope of the present invention.
General place can be used with reference to various illustrative logic plates, module and the circuit that presently disclosed embodiment is described
Reason device, digital signal processor (DSP), application specific integrated circuit (ASIC), field programmable gate array (FPGA) other are compiled
Journey logical device, discrete door or transistor logic, discrete nextport hardware component NextPort or its be designed to carry out function described herein
Any combinations are realized or performed.General processor can be microprocessor, but in alternative, the processor can be appointed
What conventional processor, controller, microcontroller or state machine.Processor is also implemented as the combination of computing device, example
The one or more microprocessors that are cooperated with the combination of microprocessor, multi-microprocessor, with DSP core such as DSP or it is any its
His such configuration.
It can be embodied directly in hardware, in by processor with reference to the step of the method or algorithm that embodiment disclosed herein is described
Embodied in the software module of execution or in combination of the two.Software module can reside in RAM memory, flash memory, ROM and deposit
Reservoir, eprom memory, eeprom memory, register, hard disk, removable disk, CD-ROM or known in the art appoint
In the storage medium of what other forms.Exemplary storage medium is coupled to processor to enable the processor from/to the storage
Medium is read and write-in information.In alternative, storage medium can be integrated into processor.Processor and storage medium can
Reside in ASIC.ASIC can reside in user terminal.In alternative, processor and storage medium can be used as discrete sets
Part is resident in the user terminal.
In one or more exemplary embodiments, described function can be in hardware, software, firmware or its any combinations
It is middle to realize.If being embodied as computer program product in software, each function can be used as the instruction of one or more bars or generation
Code storage is transmitted on a computer-readable medium or by it.Computer-readable medium includes computer-readable storage medium and communication
Both media, it includes any medium for facilitating computer program to shift from one place to another.Storage medium can be can quilt
Any usable medium that computer is accessed.It is non-limiting as example, such computer-readable medium may include RAM, ROM,
EEPROM, CD-ROM or other optical disc storage, disk storage or other magnetic storage apparatus can be used to carry or store instruction
Or the desirable program code and any other medium that can be accessed by a computer of data structure form.Any connection is also by by rights
Referred to as computer-readable medium.If for example, software is to use coaxial cable, fiber optic cables, twisted-pair feeder, digital subscriber line
Or the wireless technology of such as infrared, radio and microwave etc is passed from web site, server or other remote sources (DSL)
Send, then the coaxial cable, fiber optic cables, twisted-pair feeder, DSL or such as infrared, radio and microwave etc is wireless
Technology is just included among the definition of medium.Disk (disk) and dish (disc) as used herein include compact disc
(CD), laser disc, laser disc, digital versatile disc (DVD), floppy disk and blu-ray disc, which disk (disk) are often reproduced in the way of magnetic
Data, and dish (disc) laser reproduce data optically.Combinations of the above should also be included in computer-readable medium
In the range of.
It is for so that any person skilled in the art all can make or use this public affairs to provide of this disclosure be previously described
Open.Various modifications of this disclosure all will be apparent for a person skilled in the art, and as defined herein general
Suitable principle can be applied to spirit or scope of other variants without departing from the disclosure.Thus, the disclosure is not intended to be limited
Due to example described herein and design, but it should be awarded and principle disclosed herein and novel features phase one
The widest scope of cause.
Claims (8)
1. a kind of file arborescence automatically creates method, it is characterised in that including：
The All Files of specified path and the name of file and the form for being converted into character string are read, character illustration and text juxtaposed setting is formed
Shelves；
Character string document is converted into tree, file arborescence is formed.
2. file arborescence according to claim 1 automatically creates method, it is characterised in that forming character string document
The step of include：
Call the database in Python；
Invisible scanning path；
By database, the All Files and file that recurrence is read in all levels in scanning pattern obtain name, wherein
The file and file of each level are arranged with sequence number, and sub- level file or file are retracted relative to parent file；
The name of the file read in and file is stored with string variable, character string document is constituted.
3. file arborescence according to claim 2 automatically creates method, it is characterised in that convert character string document
The step of for tree, includes：
Character string document is read, listings format is converted into by divided by row, list variable is constituted；
Initialize dictionary variable and structural level variable；
Based on list variable and structural level variable, the sequence number in character string document is detected；
Based on the attribute in dictionary variable, character string document is subjected to classification storage according to sequence number, it is structure to update dictionary variable
Change dictionary variable；
Structuring dictionary variables transformations are showed for tree and in arborescence mode.
4. a kind of computer-readable storage medium, stores computer program instructions, computer program instructions are used to perform such as right will
The file arborescence any one of 1 to 3 is asked to automatically create the step in method.
5. storing computer program on a kind of computer system, including processor and memory, memory, computer program is at place
Computer instruction is run into reason device, the computer instruction is used to perform file as claimed any one in claims 1 to 3
Folder arborescence automatically creates the step in method.
6. a kind of file arborescence automatically creates system, it is characterised in that including：
Character string document conversion module, for reading the All Files of specified path and the name of file and being converted into word
The form of string is accorded with, character string document is formed；
Tree conversion module, for character string document to be converted into tree, forms file arborescence.
7. file arborescence according to claim 6 automatically creates system, it is characterised in that character string document converts mould
Block includes：
Data base call unit, for calling the database in Python；
Path designating unit, for invisible scanning path；
Filename reading unit, by database, recurrence reads in the All Files and file in all levels in scanning pattern
Name is held, the file and file of each of which level are arranged with sequence number, sub- level file or file are relative to father
Level file retraction；
Variable storage unit, the name of the file read in and file is stored with string variable, constitutes character string document.
8. file arborescence according to claim 7 automatically creates system, it is characterised in that tree conversion module
Including：
List variable structural unit, for reading character string document, listings format is converted into by divided by row, is constituted list and is become
Amount；
Dictionary variable and structural level initialization of variable unit, for initializing dictionary variable and structural level variable；
Character string document sequence number detection unit, for based on list variable and structural level variable, detecting in character string document
Sequence number；
Dictionary variant structural unit, for based on the attribute in dictionary variable, character string document to be classified according to sequence number
Storage, it is structuring dictionary variable to update dictionary variable；
Arborescence shows unit, for being tree by structuring dictionary variables transformations and being showed in arborescence mode.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710329589.3A CN107145588A (en) | 2017-05-11 | 2017-05-11 | A kind of file arborescence automatically creates method and system |
| PCT/CN2018/084817 WO2018205852A1 (en) | 2017-05-11 | 2018-04-27 | Method and system for automatically creating folder tree diagram |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710329589.3A CN107145588A (en) | 2017-05-11 | 2017-05-11 | A kind of file arborescence automatically creates method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107145588A true CN107145588A (en) | 2017-09-08 |
Family
ID=59777713
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710329589.3A Pending CN107145588A (en) | 2017-05-11 | 2017-05-11 | A kind of file arborescence automatically creates method and system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN107145588A (en) |
| WO (1) | WO2018205852A1 (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018205852A1 (en) * | 2017-05-11 | 2018-11-15 | 上海颐为网络科技有限公司 | Method and system for automatically creating folder tree diagram |
| CN109388647A (en) * | 2018-10-30 | 2019-02-26 | 成都四方伟业软件股份有限公司 | A kind of data based on WEB make a report on method and system |
| CN110297682A (en) * | 2019-06-28 | 2019-10-01 | 广州微易软件有限公司 | A kind of task display method |
| CN110489516A (en) * | 2019-08-15 | 2019-11-22 | 厦门铅笔头信息科技有限公司 | A method of quickly prefix index is established for massive structured data |
| CN110852044A (en) * | 2018-08-20 | 2020-02-28 | 上海颐为网络科技有限公司 | Text editing method and system based on structuralization |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070276807A1 (en) * | 2006-03-30 | 2007-11-29 | Wei Zhu Chen | Search Ranking Method for File System and Related Search Engine |
| CN101599066A (en) * | 2008-06-03 | 2009-12-09 | 鸿富锦精密工业（深圳）有限公司 | Bulk operation and management system of documents and method |
| CN101739589A (en) * | 2009-12-08 | 2010-06-16 | 大唐微电子技术有限公司 | Method and device for generating intelligent card data |
| CN101976196A (en) * | 2010-11-19 | 2011-02-16 | 重庆大学 | Quality of service oriented code automatic code generating method |
| CN103309876A (en) * | 2012-03-12 | 2013-09-18 | 腾讯科技（深圳）有限公司 | Method and device for creating folders |
| CN103902918A (en) * | 2012-12-30 | 2014-07-02 | 航天信息股份有限公司 | Method and device for rapidly extracting text from Word document |
| US20160321287A1 (en) * | 2015-04-29 | 2016-11-03 | Box, Inc. | File tree streaming in a virtual file system for cloud-based shared content |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104615663B (en) * | 2015-01-07 | 2019-04-26 | 小米科技有限责任公司 | File ordering method, apparatus and terminal |
| CN105045528B (en) * | 2015-06-24 | 2018-08-31 | 武汉烽火众智数字技术有限责任公司 | A kind of quick FAT32 disk partition traversal and file search method |
| JP2017068706A (en) * | 2015-09-30 | 2017-04-06 | 富士通株式会社 | Identification program, identification method, identification device, and analysis method of provided information |
| CN107145588A (en) * | 2017-05-11 | 2017-09-08 | 上海颐学网络科技有限公司 | A kind of file arborescence automatically creates method and system |
-
2017
- 2017-05-11 CN CN201710329589.3A patent/CN107145588A/en active Pending
-
2018
- 2018-04-27 WO PCT/CN2018/084817 patent/WO2018205852A1/en active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070276807A1 (en) * | 2006-03-30 | 2007-11-29 | Wei Zhu Chen | Search Ranking Method for File System and Related Search Engine |
| CN101599066A (en) * | 2008-06-03 | 2009-12-09 | 鸿富锦精密工业（深圳）有限公司 | Bulk operation and management system of documents and method |
| CN101739589A (en) * | 2009-12-08 | 2010-06-16 | 大唐微电子技术有限公司 | Method and device for generating intelligent card data |
| CN101976196A (en) * | 2010-11-19 | 2011-02-16 | 重庆大学 | Quality of service oriented code automatic code generating method |
| CN103309876A (en) * | 2012-03-12 | 2013-09-18 | 腾讯科技（深圳）有限公司 | Method and device for creating folders |
| CN103902918A (en) * | 2012-12-30 | 2014-07-02 | 航天信息股份有限公司 | Method and device for rapidly extracting text from Word document |
| US20160321287A1 (en) * | 2015-04-29 | 2016-11-03 | Box, Inc. | File tree streaming in a virtual file system for cloud-based shared content |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018205852A1 (en) * | 2017-05-11 | 2018-11-15 | 上海颐为网络科技有限公司 | Method and system for automatically creating folder tree diagram |
| CN110852044A (en) * | 2018-08-20 | 2020-02-28 | 上海颐为网络科技有限公司 | Text editing method and system based on structuralization |
| CN110852044B (en) * | 2018-08-20 | 2023-09-15 | 上海颐为网络科技有限公司 | Text editing method and system based on structuring |
| CN109388647A (en) * | 2018-10-30 | 2019-02-26 | 成都四方伟业软件股份有限公司 | A kind of data based on WEB make a report on method and system |
| CN110297682A (en) * | 2019-06-28 | 2019-10-01 | 广州微易软件有限公司 | A kind of task display method |
| CN110489516A (en) * | 2019-08-15 | 2019-11-22 | 厦门铅笔头信息科技有限公司 | A method of quickly prefix index is established for massive structured data |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2018205852A1 (en) | 2018-11-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107145588A (en) | A kind of file arborescence automatically creates method and system | |
| US9009108B2 (en) | Minimal extensions required for multi-master offline and collaboration for devices and web services | |
| CN105808633B (en) | Data archiving method and system | |
| CN104035754A (en) | XML (Extensible Markup Language)-based custom code generation method and generator | |
| CN108932236A (en) | A kind of file management method, scratch file delet method and device | |
| WO2019237882A1 (en) | Data processing method and apparatus, electronic device and computer-readable storage medium | |
| CN101566988A (en) | Method, system and device for searching fuzzy semantics | |
| EP3217632B1 (en) | Oid configuration, parsing method, client, node, database and storage medium | |
| CN104091228A (en) | Systems for resource management, resource registering, resource inquiry and resource semantic corpus management of internet of things | |
| CN110019048A (en) | Document handling method, device, system and server based on MongoDB | |
| CN108920608B (en) | Search field knowledge graph construction method and system for enterprise data | |
| CN106156060B (en) | Tag control system and terminal, label application method and label method for sorting | |
| CN116010414A (en) | Data storage method, device, equipment and storage medium | |
| KR101226162B1 (en) | Method and apparatus for converting ontology date to graph data | |
| Graube et al. | Integrating industrial middleware in linked data collaboration networks | |
| CN107239568B (en) | Distributed index implementation method and device | |
| Palmer et al. | RAVEN: Using smartphones for collaborative disaster data collection. | |
| CN108241620B (en) | Query script generation method and device | |
| CN111241142A (en) | Scientific and technological achievement conversion pushing system and method | |
| CN114490651A (en) | Data storage method and device | |
| CN103810259A (en) | Urinalysis prototype constructing and data storage method based on OpenEHR | |
| US20200142867A1 (en) | Intelligent pushing method and system for related contents of newly-created entries | |
| Ahmed et al. | A light weight approach for ontology generation and change synchronization between ontologies and source relational databases | |
| Gavankar et al. | Enriching an academic knowledge base using linked open data | |
| CN106372121A (en) | Server and data processing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20180115 Address after: 200030 Shanghai City Paper Road No. 199 2 floor Y15 Applicant after: Shanghai Yi network technology Co., Ltd. Address before: 200434 101 Room 101, No. 738, Shanghai Guangji Road, Shanghai, Shanghai Applicant before: Shanghai Yi learning network technology Co., Ltd. |
|
| TA01 | Transfer of patent application right | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170908 |
|
| RJ01 | Rejection of invention patent application after publication |