WO2018205852A1 - Method and system for automatically creating folder tree diagram - Google Patents

Method and system for automatically creating folder tree diagram Download PDF

Info

Publication number
WO2018205852A1
WO2018205852A1 PCT/CN2018/084817 CN2018084817W WO2018205852A1 WO 2018205852 A1 WO2018205852 A1 WO 2018205852A1 CN 2018084817 W CN2018084817 W CN 2018084817W WO 2018205852 A1 WO2018205852 A1 WO 2018205852A1
Authority
WO
WIPO (PCT)
Prior art keywords
string
variable
tree
document
variables
Prior art date
Application number
PCT/CN2018/084817
Other languages
French (fr)
Chinese (zh)
Inventor
谭红
马也驰
Original Assignee
上海颐为网络科技有限公司
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 上海颐为网络科技有限公司 filed Critical 上海颐为网络科技有限公司
Publication of WO2018205852A1 publication Critical patent/WO2018205852A1/en

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/16File or folder operations, e.g. details of user interfaces specifically adapted to file systems
    • G06F16/164File meta data generation
    • G06F16/166File name conversion
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/13File access structures, e.g. distributed indices

Definitions

  • the present invention relates to optimization techniques for folders in digital systems, and more particularly to methods and systems for creating corresponding treemaps based on folders.
  • Folder nesting and the like cause confusion in file management, making it difficult for users to find the files they need. Moreover, when a user tries to find a desired file by searching, the name of the file is often forgotten and the search cannot be performed efficiently, and sometimes even the existence of such a file is not remembered.
  • the file management on the traditional digital device or network storage device can only use the resource manager of the PC system to expand the path address of the folder where the file is located along a single path. So too many nesting levels can make it very time consuming to open the required files in this way.
  • the object of the present invention is to provide a method and system for automatically creating a folder tree diagram, which optimizes the nesting of folders at any time, and is convenient for finding required files.
  • the technical solution of the present invention is as follows:
  • the present invention discloses a method for automatically creating a folder tree diagram, including:
  • the step of forming a string file includes:
  • the string variable is used to store the names of the files and folders read in to form a string document.
  • the step of converting the string document into a tree structure comprises:
  • the string document is classified and stored according to the serial number, and the dictionary variable is updated to be a structured dictionary variable;
  • the present invention also discloses a computer storage medium storing computer program instructions for performing the steps in the automatic creation of a folder tree diagram.
  • the invention also discloses a computer system comprising a processor and a memory, wherein the computer program is stored on the memory, and the computer program is run in the processor as a computer instruction, wherein the computer instruction is used in the method for automatically creating a folder tree diagram step.
  • the invention also discloses a folder tree automatic creation system, comprising:
  • a string document conversion module for reading the names of all files and folders of a specified path and converting them into a string form to form a string document
  • a tree structure conversion module for converting a string document into a tree structure to form a folder tree.
  • the string document conversion module includes:
  • Database call unit for calling a database in Python
  • a path specifying unit for specifying a scan path
  • the file name reading unit through the database, recursively reads all the files and folders in all the levels in the scan path to obtain a name, wherein each level of files and folders are arranged by a serial number, and the child files or folders are relative to the parent.
  • Level folder indentation ;
  • the variable storage unit stores the names of the read files and folders with string variables to form a string document.
  • the tree structure conversion module includes:
  • a list variable construction unit for reading a string document and converting it into a list format by row division to form a list variable
  • Dictionary variable and structure level variable initialization unit for initializing dictionary variables and structure level variables
  • a string document serial number detecting unit configured to detect a serial number in a string document based on a list variable and a structure level variable
  • a dictionary variable structuring unit for classifying and storing string documents according to sequence numbers based on attributes in dictionary variables, and updating dictionary variables to structured dictionary variables;
  • a tree diagram presentation unit for transforming structured dictionary variables into a tree structure and presenting them in a tree diagram.
  • the present invention has a better technical effect: the invention reads all the files of the scan path and the names of the folders by the database to form text, and then converts the text into a tree structure, and automatically generates various types in this way.
  • FIG. 1 is a flow chart showing an embodiment of a method for automatically creating a folder tree of the present invention.
  • FIG. 2 to 5 show a detailed sub-flow chart of the steps in the automatic creation method of the folder tree diagram shown in Fig. 1.
  • Figure 6 shows a schematic diagram of an embodiment of a folder tree auto-creation system of the present invention.
  • FIG. 1 shows the flow of an embodiment of a method for automatically creating a folder tree diagram of the present invention. Referring to Figure 1, the following is a detailed description of the steps of the method of the present embodiment.
  • Step S1 Read the names of all the files and folders of the specified path and convert them into a string form to form a string document.
  • Step S11 Call the database os in Python.
  • Step S12 Specify a scan path.
  • Step S13 Through the database os, recursively read all files and folders in all the levels in the scan path to obtain a name, wherein each level of files and folders are arranged by a serial number, and the child files or folders are relative to the parent.
  • the folder is indented.
  • Step S14 The string file is used to store the names of the read files and folders to form a string document.
  • the read string variable is as shown in the following example.
  • Step S2 Convert the string document into a tree structure to form a folder tree.
  • Step S21 reading the string document and converting it into a list format by row division to form a list variable document.
  • Step S22 Initialize the dictionary variable e_new and the structure level variable level.
  • Step S23 Detect the sequence number in the string document based on the list variable and the structure level variable.
  • the string number of the detected string can be realized by the data_check function.
  • the input parameters of the function are the document variable and the level variable respectively, and the output parameters are passed to the doc attribute of the e_new variable, that is, the e_new['doc'], child, and child_document variables.
  • Step S231 Pass the delivery parameters to the document and the level variable respectively.
  • Step S233 processing the document by row, each line uses the find method to find the index variable, and if found, performs the next step; otherwise, step S235 is performed.
  • the find method here is an algorithm inside Python, the purpose is to find the starting position of the target string in the string text.
  • Step S234 Read the string variable of the current line, ie document[i], into the wiki_name variable; superimpose the index.
  • Step S235 If the index is '1.', the string variable of the current row, ie document[i], is read into the variable D; if the index is not '1.', the string variable of the current row is accumulated. Go to the variable wiki_doc.
  • Step S237 Return the variable D, wiki_name, wiki_doc, and level.
  • Step S24 classify and store the string document according to the serial number based on the attribute in the dictionary variable, and update the dictionary variable to a structured dictionary variable.
  • Sorting string documents by serial number is implemented by the structured_cycle function.
  • the input parameters of this function are: e_new's attribute ch, ie e_new['ch'], child, child_document, and level variables.
  • the output parameter of this function is passed to the ch attribute of e_new, ie e_new['ch'].
  • step S244 If the i-th element of the list variable child_document, that is, child_document[i] is ", the next step is performed; otherwise, step S246 is performed.
  • S246 Execute the data_check module, where the input parameters are: child_document[i] and level variables; the output parameters are passed to: doc, child_next, child_document_next, and level variables.
  • step S248 If the variable child_next is [], the next step is performed, otherwise step S2410 is performed.
  • Step S25 Convert the structured dictionary variable into a tree structure and present it in a tree diagram manner.
  • Figure 6 illustrates the principles of an embodiment of the folder tree auto-creation system of the present invention.
  • the system of this embodiment includes: a string file conversion module and a tree structure conversion module.
  • the string document conversion module is used to read the names of all files and folders of the specified path and convert them into a string form to form a string document.
  • the tree structure transformation module is used to convert a string document into a tree structure to form a folder tree.
  • the string document conversion module includes: a database calling unit, a path specifying unit, a file name reading unit, and a variable storage unit.
  • the database call unit is used to call the database in Python.
  • the path specification unit is used to specify the scan path.
  • the file name reading unit is used to recursively read all the files and folders in all the levels in the scan path through the database, and the files and folders in each level are arranged by serial numbers, and the child files or folders are relative to each other.
  • the parent folder is indented.
  • the variable storage unit stores the names of the read files and folders with string variables to form a string document.
  • the tree structure transformation module includes: a list variable construction unit, a dictionary variable and a structure level variable initialization unit, a string document number detection unit, a dictionary variable structure unit, and a tree diagram presentation unit.
  • the list variable constructor is used to read a string document and convert it into a list format by row division to form a list variable.
  • Dictionary variable and structure level variable initialization unit for initializing dictionary variables and structure level variables.
  • the string document serial number detecting unit is configured to detect the serial number in the string document based on the list variable and the structure level variable.
  • a dictionary variable structuring unit for classifying a string document according to a sequence number based on attributes in a dictionary variable, and updating the dictionary variable to a structured dictionary variable.
  • the tree diagram presentation unit is used to convert structured dictionary variables into a tree structure and present them in a tree diagram.
  • the present invention also discloses a computer storage medium on which computer program instructions for executing the aforementioned steps in the automatic creation of a folder tree diagram as shown in FIGS. 1 to 5.
  • the invention also discloses a computer system comprising a processor and a memory, wherein the computer program is stored on the memory, the computer program is run as a computer instruction in the processor, and the computer instruction is used to execute the aforementioned file as shown in FIG. 1 to FIG.
  • the clip tree automatically creates steps in the method.
  • DSPs digital signal processors
  • ASICs application specific integrated circuits
  • FPGAs field programmable gate arrays
  • Programmable logic devices, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein are implemented or executed.
  • a general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine.
  • the processor may also be implemented as a combination of computing devices, such as a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
  • a software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
  • An exemplary storage medium is coupled to the processor to enable the processor to read and write information to/from the storage medium.
  • the storage medium can be integrated into the processor.
  • the processor and the storage medium can reside in an ASIC.
  • the ASIC can reside in the user terminal.
  • the processor and the storage medium may reside as a discrete component in the user terminal.
  • the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented as a computer program product in software, the functions may be stored on or transmitted as one or more instructions or code on a computer readable medium.
  • Computer readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another.
  • a storage medium may be any available media that can be accessed by a computer.
  • such computer readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage device, or can be used to carry or store instructions or data structures. Any other medium that is desirable for program code and that can be accessed by a computer.
  • any connection is also properly referred to as a computer readable medium.
  • the software is transmitted from a web site, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave.
  • the coaxial cable, fiber optic cable, twisted pair cable, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of the medium.
  • Disks and discs as used herein include compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), floppy discs, and Blu-ray discs, in which disks are often reproduced magnetically. Data, and discs optically reproduce data with a laser. Combinations of the above should also be included within the scope of computer readable media.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Disclosed in the present invention are a method and a system for automatically creating a folder tree diagram, used for optimising folder nesting at any time and facilitating the look-up of required files. The technical solution comprises: using a Python database to read the names of all of the files and folders on a specified path and convert same into a character string format, and forming a character string document; then converting the character string document into a tree structure, and finally forming a folder tree diagram.

Description

一种文件夹树形图自动创建方法和系统Method and system for automatically creating folder tree diagram 技术领域Technical field
本发明涉及数字系统中的文件夹的优化技术,尤其涉及基于文件夹创建对应树形图的方法和系统。The present invention relates to optimization techniques for folders in digital systems, and more particularly to methods and systems for creating corresponding treemaps based on folders.
背景技术Background technique
在个人数字设备(例如智能手机、平板电脑、移动硬盘等)以及网络存储设备(例如云盘等)经过长期使用后,人工建立或者自动生成的文件夹数量会越来越多,造成文件夹的嵌套层级也会越来越多。After long-term use of personal digital devices (such as smart phones, tablets, mobile hard drives, etc.) and network storage devices (such as cloud disks), the number of manually created or automatically generated folders will increase, resulting in folders. There are more and more nesting levels.
文件夹嵌套等造成了文件管理上的混乱,导致用户不容易找到所需的文件。而且,当用户试图以搜索方式找寻所需文件时,又往往会忘记文件名字而导致搜索无法有效进行,甚至有时候都不记得有这类文件的存在。Folder nesting and the like cause confusion in file management, making it difficult for users to find the files they need. Moreover, when a user tries to find a desired file by searching, the name of the file is often forgotten and the search cannot be performed efficiently, and sometimes even the existence of such a file is not remembered.
而传统的数字设备或者网络存储设备上的文件管理通过采用PC系统的资源管理器,只能顺着单一路径展开文件所在文件夹的路径地址。所以嵌套层级过多会导致通过这种操作方式来打开所需文件变得十分费时。The file management on the traditional digital device or network storage device can only use the resource manager of the PC system to expand the path address of the folder where the file is located along a single path. So too many nesting levels can make it very time consuming to open the required files in this way.
发明内容Summary of the invention
以下给出一个或多个方面的简要概述以提供对这些方面的基本理解。此概述不是所有构想到的方面的详尽综览,并且既非旨在指认出所有方面的关键性或决定性要素亦非试图界定任何或所有方面的范围。其唯一的目的是要以简化形式给出一个或多个方面的一些概念以为稍后给出的更加详细的描述之序。A brief overview of one or more aspects is provided below to provide a basic understanding of these aspects. This summary is not an extensive overview of all aspects that are conceived, and is not intended to identify key or critical elements in all aspects. Its sole purpose is to present some concepts of one or more aspects
本发明的目的在于提供了一种文件夹树形图自动创建方法和系统,随时优化文件夹的嵌套,便于查找所需文件。The object of the present invention is to provide a method and system for automatically creating a folder tree diagram, which optimizes the nesting of folders at any time, and is convenient for finding required files.
本发明的技术方案为:本发明揭示了一种文件夹树形图自动创建方法,包括:The technical solution of the present invention is as follows: The present invention discloses a method for automatically creating a folder tree diagram, including:
读取指定路径的所有文件和文件夹的名字并将其转换为字符串的形式,形成字符串文档;Reads the names of all files and folders of the specified path and converts them into a string form to form a string document;
将字符串文档转化为树状结构,形成文件夹树形图。Convert a string document into a tree structure to form a folder tree.
根据本发明的文件夹树形图自动创建方法的一实施例,在形成字符串文档的步骤包括:According to an embodiment of the automatic creation method of the folder tree diagram according to the present invention, the step of forming a string file includes:
调用Python中的数据库;Call the database in Python;
指定扫描路径;Specify the scan path;
通过数据库,递归读入扫描路径中的所有层级中的所有文件和文件夹得到名字,其中每一层级的文件以及文件夹用序号排列,子级文件或者文件夹相对于父级文件夹缩进;Through the database, recursively read all the files and folders in all the levels in the scan path to get the name, wherein each level of files and folders are arranged by serial number, and the child files or folders are indented relative to the parent folder;
用字符串变量存储读入的文件和文件夹的名字,构成字符串文档。The string variable is used to store the names of the files and folders read in to form a string document.
根据本发明的文件夹树形图自动创建方法的一实施例,将字符串文档转化为树状结构的步骤包括:According to an embodiment of the automatic creation method of the folder tree diagram according to the present invention, the step of converting the string document into a tree structure comprises:
读取字符串文档,通过按行划分转换成列表格式,构成列表变量;Read a string document and convert it into a list format by row division to form a list variable;
初始化字典变量和结构层级变量;Initialize dictionary variables and structure level variables;
基于列表变量和结构层级变量,检测字符串文档中的序号;Detecting sequence numbers in a string document based on list variables and structure level variables;
基于字典变量中的属性,将字符串文档按照序号进行分类存储,更新字典变量为结构化字典变量;Based on the attributes in the dictionary variable, the string document is classified and stored according to the serial number, and the dictionary variable is updated to be a structured dictionary variable;
将结构化字典变量转化为树状结构并以树形图方式展现。Transform structured dictionary variables into tree structures and present them in a tree diagram.
本发明还揭示了一种计算机存储介质,存储了计算机程序指令,计算机程序指令用于执行文件夹树形图自动创建方法中的步骤。The present invention also discloses a computer storage medium storing computer program instructions for performing the steps in the automatic creation of a folder tree diagram.
本发明还揭示了一种计算机系统,包括处理器和存储器,存储器上存储计算机程序,计算机程序在处理器中运行成计算机指令,所述计算机指令用于执行文件夹树形图自动创建方法中的步骤。The invention also discloses a computer system comprising a processor and a memory, wherein the computer program is stored on the memory, and the computer program is run in the processor as a computer instruction, wherein the computer instruction is used in the method for automatically creating a folder tree diagram step.
本发明还揭示了一种文件夹树形图自动创建系统,包括:The invention also discloses a folder tree automatic creation system, comprising:
字符串文档转化模块,用于读取指定路径的所有文件和文件夹的名字并将其转换为字符串的形式,形成字符串文档;A string document conversion module for reading the names of all files and folders of a specified path and converting them into a string form to form a string document;
树状结构转化模块,用于将字符串文档转化为树状结构,形成文件夹树形图。A tree structure conversion module for converting a string document into a tree structure to form a folder tree.
根据本发明的文件夹树形图自动创建系统的一实施例,字符串文档转化模块包括:According to an embodiment of the folder tree automatic creation system of the present invention, the string document conversion module includes:
数据库调用单元,用于调用Python中的数据库;Database call unit for calling a database in Python;
路径指定单元,用于指定扫描路径;a path specifying unit for specifying a scan path;
文件名读取单元,通过数据库,递归读入扫描路径中的所有层级中的所有文件和文件夹得到名字,其中每一层级的文件以及文件夹用序号排列,子级文件或者文件夹相对于父级文件夹缩进;The file name reading unit, through the database, recursively reads all the files and folders in all the levels in the scan path to obtain a name, wherein each level of files and folders are arranged by a serial number, and the child files or folders are relative to the parent. Level folder indentation;
变量存储单元,用字符串变量存储读入的文件和文件夹的名字,构成字符串文档。The variable storage unit stores the names of the read files and folders with string variables to form a string document.
根据本发明的文件夹树形图自动创建系统的一实施例,树状结构转化模块包括:An embodiment of the folder tree automatic creation system according to the present invention, the tree structure conversion module includes:
列表变量构造单元,用于读取字符串文档,通过按行划分转换成列表格式,构成列表变量;a list variable construction unit for reading a string document and converting it into a list format by row division to form a list variable;
字典变量和结构层级变量初始化单元,用于初始化字典变量和结构层级变量;Dictionary variable and structure level variable initialization unit for initializing dictionary variables and structure level variables;
字符串文档序号检测单元,用于基于列表变量和结构层级变量,检测字符串文档中的序号;a string document serial number detecting unit, configured to detect a serial number in a string document based on a list variable and a structure level variable;
字典变量结构化单元,用于基于字典变量中的属性,将字符串文档按照序号进行分类存储,更新字典变量为结构化字典变量;a dictionary variable structuring unit for classifying and storing string documents according to sequence numbers based on attributes in dictionary variables, and updating dictionary variables to structured dictionary variables;
树形图展现单元,用于将结构化字典变量转化为树状结构并以树形图方式展现。A tree diagram presentation unit for transforming structured dictionary variables into a tree structure and presenting them in a tree diagram.
本发明对比现有技术有更好的技术效果:本发明借助数据库读取扫描路径的所有文件以及文件夹的名字以形成文本,再将文本转换为树形结构,用这种方式自动生成各类数字设备、云盘中的嵌套的文件夹以及其中文件的树形图。Compared with the prior art, the present invention has a better technical effect: the invention reads all the files of the scan path and the names of the folders by the database to form text, and then converts the text into a tree structure, and automatically generates various types in this way. A digital device, a nested folder in a cloud disk, and a tree view of the files in it.
附图说明DRAWINGS
图1示出了本发明的文件夹树形图自动创建方法的实施例的流程图。1 is a flow chart showing an embodiment of a method for automatically creating a folder tree of the present invention.
图2至图5示出了图1所示的文件夹树形图自动创建方法中的步骤的细化子流程图。2 to 5 show a detailed sub-flow chart of the steps in the automatic creation method of the folder tree diagram shown in Fig. 1.
图6示出了本发明的文件夹树形图自动创建系统的实施例的原理图。Figure 6 shows a schematic diagram of an embodiment of a folder tree auto-creation system of the present invention.
具体实施方式detailed description
在结合以下附图阅读本公开的实施例的详细描述之后,能够更好地理解本发明的上述特征和优点。在附图中,各组件不一定是按比例绘制,并且具有类似的相关特性或特征的组件可能具有相同或相近的附图标记。The above features and advantages of the present invention will be better understood from the following description of the appended claims. In the figures, components are not necessarily drawn to scale, and components having similar related features or features may have the same or similar reference numerals.
图1示出了本发明的文件夹树形图自动创建方法的实施例的流程。请参见图1,下面是对本实施例的方法的步骤的详述。1 shows the flow of an embodiment of a method for automatically creating a folder tree diagram of the present invention. Referring to Figure 1, the following is a detailed description of the steps of the method of the present embodiment.
步骤S1:读取指定路径的所有文件和文件夹的名字并将其转换为字符串的形式,形成字符串文档。Step S1: Read the names of all the files and folders of the specified path and convert them into a string form to form a string document.
这一步骤的实现进一步参见图2所示。The implementation of this step is further seen in Figure 2.
步骤S11:调用Python中的数据库os。Step S11: Call the database os in Python.
步骤S12:指定扫描路径。Step S12: Specify a scan path.
步骤S13:通过数据库os,用递归读入扫描路径中的所有层级中的所有文件和文件夹得到名字,其中每一层级的文件以及文件夹用序号排列,子级文件或者文件夹相对于父级文件夹缩进。Step S13: Through the database os, recursively read all files and folders in all the levels in the scan path to obtain a name, wherein each level of files and folders are arranged by a serial number, and the child files or folders are relative to the parent. The folder is indented.
步骤S14:用字符串变量存储读入的文件和文件夹的名字,构成字符串文档。Step S14: The string file is used to store the names of the read files and folders to form a string document.
例如,读好的字符串变量如以下示例。For example, the read string variable is as shown in the following example.
1.Biaoti1.Biaoti
1.F11.F1
1.F1.1.doc1.F1.1.doc
2.F1.2.doc2.F1.2.doc
3.F1.3.doc3.F1.3.doc
4.F1.44.F1.4
1.F1.4.1.doc1.F1.4.1.doc
2.F1.4.2.doc2.F1.4.2.doc
3.F1.4.3.doc3.F1.4.3.doc
4.F1.4.4.doc4.F1.4.4.doc
2.F22.F2
1.F2.1.doc1.F2.1.doc
2.F2.2.doc2.F2.2.doc
3.F2.3.doc3.F2.3.doc
4.F2.4.doc4.F2.4.doc
3.F33.F3
1.F3.1.doc1.F3.1.doc
2.F3.2.doc2.F3.2.doc
3.F3.3.doc3.F3.3.doc
4.F3.4.doc4.F3.4.doc
步骤S2:将字符串文档转化为树状结构,形成文件夹树形图。Step S2: Convert the string document into a tree structure to form a folder tree.
这一步骤的实现进一步参见图3所示。The implementation of this step is further illustrated in Figure 3.
步骤S21:读取字符串文档,通过按行划分转换成列表格式,构成列表变量document。Step S21: reading the string document and converting it into a list format by row division to form a list variable document.
步骤S22:初始化字典变量e_new和结构层级变量level。Step S22: Initialize the dictionary variable e_new and the structure level variable level.
初始化字典变量e_new,其中包括name,doc,ch三种属性,即e_new={'name':”,'doc':”,'ch':[]}。Initialize the dictionary variable e_new, which includes three attributes: name, doc, and ch, ie e_new={'name':", 'doc':", 'ch':[]}.
初始化中间变量child以及child_document,即child=[],child_document=[]。Initialize the intermediate variables child and child_document, ie child=[], child_document=[].
初始化结构层级level,即level=0。初始化字典变量e_new的属性name,即e_new['name']='扫描结构化'。Initialize the structure level level, ie level=0. Initialize the attribute name of the dictionary variable e_new, ie e_new['name']='scan structured'.
步骤S23:基于列表变量和结构层级变量,检测字符串文档中的序号。Step S23: Detect the sequence number in the string document based on the list variable and the structure level variable.
检测字符串文档序号可以通过data_check函数来实现,函数的输入参数分别为document变量和level变量,输出参数传递给e_new变量的doc属性,即e_new['doc']、child以及child_document变量。The string number of the detected string can be realized by the data_check function. The input parameters of the function are the document variable and the level variable respectively, and the output parameters are passed to the doc attribute of the e_new variable, that is, the e_new['doc'], child, and child_document variables.
data_check函数的具体实现步骤如图4所示。The specific implementation steps of the data_check function are shown in Figure 4.
步骤S231:将传递参数分别传给document以及level变量。Step S231: Pass the delivery parameters to the document and the level variable respectively.
步骤S232:初始化wiki_name,即wiki_name=[];初始化wiki_doc,即wiki_doc=[”for i in range(200)];初始化D,即D=”;初始化index_1,即index_1='1.'Step S232: Initialize wiki_name, ie wiki_name=[]; initialize wiki_doc, ie wiki_doc=["for i in range(200)]; initialize D, ie D="; initialize index_1, ie index_1='1.'
步骤S233:对document按行处理,每行利用find方法寻找index变量,若找到执行下一步;否则执行步骤S235。Step S233: processing the document by row, each line uses the find method to find the index variable, and if found, performs the next step; otherwise, step S235 is performed.
这里的find方法是python内部的一个算法,目的是在字符串文本中找到目标字符串的起始位置。The find method here is an algorithm inside Python, the purpose is to find the starting position of the target string in the string text.
步骤S234:将当前所在行的字符串变量,即document[i],读入到wiki_name变量中;将index进行叠加。Step S234: Read the string variable of the current line, ie document[i], into the wiki_name variable; superimpose the index.
步骤S235:若index为'1.',则将当前所在行的字符串变量,即document[i]读入变量D中;若index不为'1.',则将当前行的字符串变量累加到变量wiki_doc中。Step S235: If the index is '1.', the string variable of the current row, ie document[i], is read into the variable D; if the index is not '1.', the string variable of the current row is accumulated. Go to the variable wiki_doc.
步骤S236:读取document的下一行,即i=i+1。若document被读完,则执行下一步,否则执行步骤S233。Step S236: Read the next line of the document, that is, i=i+1. If the document is read, the next step is performed, otherwise step S233 is performed.
步骤S237:返回变量D、wiki_name、wiki_doc以及level。Step S237: Return the variable D, wiki_name, wiki_doc, and level.
步骤S24:基于字典变量中的属性,将字符串文档按照序号进行分类存储,更新字典变量为结构化字典变量。Step S24: classify and store the string document according to the serial number based on the attribute in the dictionary variable, and update the dictionary variable to a structured dictionary variable.
将字符串文档按照序号进行分类存储通过structured_cycle函数来实现。该函数的输入参数分别为::e_new的属性ch,即e_new['ch']、child、child_document以及level变量。该函数的输出参数传递给e_new的ch属性,即e_new['ch']。Sorting string documents by serial number is implemented by the structured_cycle function. The input parameters of this function are: e_new's attribute ch, ie e_new['ch'], child, child_document, and level variables. The output parameter of this function is passed to the ch attribute of e_new, ie e_new['ch'].
structured_cycle函数的具体实现步骤如图5所示。The specific implementation steps of the structured_cycle function are shown in Figure 5.
S241:将传递参数分别传给e_new、child、child_document、level变量。S241: Pass the transfer parameters to the e_new, child, child_document, and level variables, respectively.
S242:初始化循环次数i,即i=0。S242: Initialize the number of loops i, that is, i=0.
S243:将列表变量child的第i个元素,即child[i]赋值给name变量。S243: Assign the i-th element of the list variable child, ie child[i], to the name variable.
S244:若列表变量child_document的第i个元素,即child_document[i]为”,则执行下一步;否则执行步骤S246。S244: If the i-th element of the list variable child_document, that is, child_document[i] is ", the next step is performed; otherwise, step S246 is performed.
S245:将doc、child_document_next、child_next变量分别赋值”、[]、[]。S245: Assign the doc, child_document_next, and child_next variables to ", [], [].
S246:执行data_check模块,其中输入参数分别为:child_document[i]以及level变量;输出参数传递给:doc、child_next、child_document_next以及level变量。S246: Execute the data_check module, where the input parameters are: child_document[i] and level variables; the output parameters are passed to: doc, child_next, child_document_next, and level variables.
S247:创建新的字典变量,即{'name':name,'doc':doc,'ch':[]},将新的字典变量添加到e_new中。S247: Create a new dictionary variable, {'name':name,'doc':doc,'ch':[]}, and add the new dictionary variable to e_new.
S248:若变量child_next为[],则执行下一步,否则执行步骤S2410。S248: If the variable child_next is [], the next step is performed, otherwise step S2410 is performed.
S249:将变量level的值赋值给新的变量level_new并累加level_new,即level_new=level_new+1。用递归的方法重新执行structured_cycle模块,其中输入参数分别为:e_new第i个元素的属性ch,即e_new[i]['ch']、child_next、child_document_next以及level_new变量;输出参数传递给e_new第i个元素的ch属性,即e_new[i]['ch']。S249: Assign the value of the variable level to the new variable level_new and accumulate level_new, that is, level_new=level_new+1. Recursively re-executing the structured_cycle module, where the input parameters are: e_new attribute i of the i-th element, ie e_new[i]['ch'], child_next, child_document_next, and level_new variables; output parameters passed to e_new ith The ch attribute of the element, ie e_new[i]['ch'].
S2410:累加循环次数i,即i=i+1。若循环次数i等于变量child的元素个数,则执行下一步,否则执行步骤S243。S2410: Accumulate the number of cycles i, that is, i=i+1. If the number of loops i is equal to the number of elements of the variable child, the next step is performed, otherwise step S243 is performed.
S2411:返回变量e_new。S2411: Return the variable e_new.
步骤S25:将结构化字典变量转化为树状结构并以树形图方式展现。Step S25: Convert the structured dictionary variable into a tree structure and present it in a tree diagram manner.
图6示出了本发明的文件夹树形图自动创建系统的实施例的原理。请参见图6,本实施例的系统包括:字符串文档转化模块和树状结构转化模块。其中字符串文档转化模块用于读取指定路径的所有文件和文件夹的名字并将其转换为字符串的形式,形成字符串文档。树状结构转化模块用于将字符串文档转化为树状结构,形成文件夹树形图。Figure 6 illustrates the principles of an embodiment of the folder tree auto-creation system of the present invention. Referring to FIG. 6, the system of this embodiment includes: a string file conversion module and a tree structure conversion module. The string document conversion module is used to read the names of all files and folders of the specified path and convert them into a string form to form a string document. The tree structure transformation module is used to convert a string document into a tree structure to form a folder tree.
字符串文档转化模块包括:数据库调用单元、路径指定单元、文件名读取单元、变量存储单元。The string document conversion module includes: a database calling unit, a path specifying unit, a file name reading unit, and a variable storage unit.
数据库调用单元用于调用Python中的数据库。路径指定单元用于指定扫描路径。文件名读取单元用于通过数据库,递归读入扫描路径中的所有层级中的所有文件和文件夹得到名字,其中每一层级的文件以及文件夹用序号排列,子级文件或者文件夹相对于父级文件夹缩进。变量存储单元用字符串变量存储读入的文件和文件夹的名字,构成字符串文档。The database call unit is used to call the database in Python. The path specification unit is used to specify the scan path. The file name reading unit is used to recursively read all the files and folders in all the levels in the scan path through the database, and the files and folders in each level are arranged by serial numbers, and the child files or folders are relative to each other. The parent folder is indented. The variable storage unit stores the names of the read files and folders with string variables to form a string document.
树状结构转化模块包括:列表变量构造单元、字典变量和结构层级变量初始化单元、字符串文档序号检测单元、字典变量结构化单元、树形图展现单元。The tree structure transformation module includes: a list variable construction unit, a dictionary variable and a structure level variable initialization unit, a string document number detection unit, a dictionary variable structure unit, and a tree diagram presentation unit.
列表变量构造单元用于读取字符串文档,通过按行划分转换成列表格式,构成列表变量。字典变量和结构层级变量初始化单元,用于初始化字典变量和结构层级变量。字符串文档序号检测单元,用于基于列表变量和结构层级变量,检测字符串文档中的序号。字典变量结构化单元,用于基于字典变量中的属性,将字符串文档按照序号进行分类存储,更新字典变量为结构化字典变量。树形图展现单元用于将结构化字典变量转化为树状结构并以树形图方式展现。The list variable constructor is used to read a string document and convert it into a list format by row division to form a list variable. Dictionary variable and structure level variable initialization unit for initializing dictionary variables and structure level variables. The string document serial number detecting unit is configured to detect the serial number in the string document based on the list variable and the structure level variable. A dictionary variable structuring unit for classifying a string document according to a sequence number based on attributes in a dictionary variable, and updating the dictionary variable to a structured dictionary variable. The tree diagram presentation unit is used to convert structured dictionary variables into a tree structure and present them in a tree diagram.
此外,本发明还揭示了一种计算机存储介质,其上计算机程序指令,计算机程序指令用于执行前述的如图1至图5所示的文件夹树形图自动创建方法中的步骤。Furthermore, the present invention also discloses a computer storage medium on which computer program instructions for executing the aforementioned steps in the automatic creation of a folder tree diagram as shown in FIGS. 1 to 5.
本发明还揭示了一种计算机系统,包括处理器和存储器,存储器上存储计算机程序,计算机程序在处理器中运行成计算机指令,计算机指令用于执行前述的如图1至图5所示的文件夹树形图自动创建方法中的步骤。The invention also discloses a computer system comprising a processor and a memory, wherein the computer program is stored on the memory, the computer program is run as a computer instruction in the processor, and the computer instruction is used to execute the aforementioned file as shown in FIG. 1 to FIG. The clip tree automatically creates steps in the method.
尽管为使解释简单化将上述方法图示并描述为一系列动作,但是应理解并领会,这些方法不受动作的次序所限,因为根据一个或多个实施例,一些动作可按不同次序发生和/或与来自本文中图示和描述或本文中未图示和描述但本领域技术人员可以理解的其他动作并发地发生。Although the above method is illustrated and described as a series of acts for simplicity of the explanation, it should be understood and appreciated that these methods are not limited by the order of the acts, as some acts may occur in different orders in accordance with one or more embodiments. And/or concurrently with other acts from what is illustrated and described herein or that are not illustrated and described herein, but are understood by those skilled in the art.
本领域技术人员将进一步领会,结合本文中所公开的实施例来描述的各种解说性逻辑板块、模块、电路、和算法步骤可实现为电子硬件、计算机软件、 或这两者的组合。为清楚地解说硬件与软件的这一可互换性,各种解说性组件、框、模块、电路、和步骤在上面是以其功能性的形式作一般化描述的。此类功能性是被实现为硬件还是软件取决于具体应用和施加于整体系统的设计约束。技术人员对于每种特定应用可用不同的方式来实现所描述的功能性,但这样的实现决策不应被解读成导致脱离了本发明的范围。Those skilled in the art will further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps are described above generally in the form of their functionality. Whether such functionality is implemented as hardware or software depends on the particular application and design constraints imposed on the overall system. The skilled person will be able to implement the described functionality in a different manner for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the invention.
结合本文所公开的实施例描述的各种解说性逻辑板块、模块、和电路可用通用处理器、数字信号处理器(DSP)、专用集成电路(ASIC)、现场可编程门阵列(FPGA)或其它可编程逻辑器件、分立的门或晶体管逻辑、分立的硬件组件、或其设计成执行本文所描述功能的任何组合来实现或执行。通用处理器可以是微处理器,但在替换方案中,该处理器可以是任何常规的处理器、控制器、微控制器、或状态机。处理器还可以被实现为计算设备的组合,例如DSP与微处理器的组合、多个微处理器、与DSP核心协作的一个或多个微处理器、或任何其他此类配置。Various illustrative logic blocks, modules, and circuits described in connection with the embodiments disclosed herein may be general purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), or others. Programmable logic devices, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein are implemented or executed. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. The processor may also be implemented as a combination of computing devices, such as a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
结合本文中公开的实施例描述的方法或算法的步骤可直接在硬件中、在由处理器执行的软件模块中、或在这两者的组合中体现。软件模块可驻留在RAM存储器、闪存、ROM存储器、EPROM存储器、EEPROM存储器、寄存器、硬盘、可移动盘、CD-ROM、或本领域中所知的任何其他形式的存储介质中。示例性存储介质耦合到处理器以使得该处理器能从/向该存储介质读取和写入信息。在替换方案中,存储介质可以被整合到处理器。处理器和存储介质可驻留在ASIC中。ASIC可驻留在用户终端中。在替换方案中,处理器和存储介质可作为分立组件驻留在用户终端中。The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor to enable the processor to read and write information to/from the storage medium. In the alternative, the storage medium can be integrated into the processor. The processor and the storage medium can reside in an ASIC. The ASIC can reside in the user terminal. In the alternative, the processor and the storage medium may reside as a discrete component in the user terminal.
在一个或多个示例性实施例中,所描述的功能可在硬件、软件、固件或其任何组合中实现。如果在软件中实现为计算机程序产品,则各功能可以作为一条或更多条指令或代码存储在计算机可读介质上或藉其进行传送。计算机可读介质包括计算机存储介质和通信介质两者,其包括促成计算机程序从一地向另一地转移的任何介质。存储介质可以是能被计算机访问的任何可用介质。作为示例而非限定,这样的计算机可读介质可包括RAM、ROM、EEPROM、CD-ROM或其它光盘存储、磁盘存储或其它磁存储设备、或能被用来携带或存储指令或 数据结构形式的合意程序代码且能被计算机访问的任何其它介质。任何连接也被正当地称为计算机可读介质。例如,如果软件是使用同轴电缆、光纤电缆、双绞线、数字订户线(DSL)、或诸如红外、无线电、以及微波之类的无线技术从web网站、服务器、或其它远程源传送而来,则该同轴电缆、光纤电缆、双绞线、DSL、或诸如红外、无线电、以及微波之类的无线技术就被包括在介质的定义之中。如本文中所使用的盘(disk)和碟(disc)包括压缩碟(CD)、激光碟、光碟、数字多用碟(DVD)、软盘和蓝光碟,其中盘(disk)往往以磁的方式再现数据,而碟(disc)用激光以光学方式再现数据。上述的组合也应被包括在计算机可读介质的范围内。In one or more exemplary embodiments, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented as a computer program product in software, the functions may be stored on or transmitted as one or more instructions or code on a computer readable medium. Computer readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage medium may be any available media that can be accessed by a computer. By way of example and not limitation, such computer readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage device, or can be used to carry or store instructions or data structures. Any other medium that is desirable for program code and that can be accessed by a computer. Any connection is also properly referred to as a computer readable medium. For example, if the software is transmitted from a web site, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave. The coaxial cable, fiber optic cable, twisted pair cable, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of the medium. Disks and discs as used herein include compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), floppy discs, and Blu-ray discs, in which disks are often reproduced magnetically. Data, and discs optically reproduce data with a laser. Combinations of the above should also be included within the scope of computer readable media.
提供对本公开的先前描述是为使得本领域任何技术人员皆能够制作或使用本公开。对本公开的各种修改对本领域技术人员来说都将是显而易见的,且本文中所定义的普适原理可被应用到其他变体而不会脱离本公开的精神或范围。由此,本公开并非旨在被限定于本文中所描述的示例和设计,而是应被授予与本文中所公开的原理和新颖性特征相一致的最广范围。The previous description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the present disclosure will be obvious to those skilled in the art, and the general principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. The present disclosure is not intended to be limited to the examples and designs described herein, but rather the broadest scope of the principles and novel features disclosed herein.

Claims (8)

  1. 一种文件夹树形图自动创建方法,其特征在于,包括:A method for automatically creating a folder tree diagram, comprising:
    读取指定路径的所有文件和文件夹的名字并将其转换为字符串的形式,形成字符串文档;Reads the names of all files and folders of the specified path and converts them into a string form to form a string document;
    将字符串文档转化为树状结构,形成文件夹树形图。Convert a string document into a tree structure to form a folder tree.
  2. 根据权利要求1所述的文件夹树形图自动创建方法,其特征在于,在形成字符串文档的步骤包括:The automatic folder tree creation method according to claim 1, wherein the step of forming a string file comprises:
    调用Python中的数据库;Call the database in Python;
    指定扫描路径;Specify the scan path;
    通过数据库,递归读入扫描路径中的所有层级中的所有文件和文件夹得到名字,其中每一层级的文件以及文件夹用序号排列,子级文件或者文件夹相对于父级文件夹缩进;Through the database, recursively read all the files and folders in all the levels in the scan path to get the name, wherein each level of files and folders are arranged by serial number, and the child files or folders are indented relative to the parent folder;
    用字符串变量存储读入的文件和文件夹的名字,构成字符串文档。The string variable is used to store the names of the files and folders read in to form a string document.
  3. 根据权利要求2所述的文件夹树形图自动创建方法,其特征在于,将字符串文档转化为树状结构的步骤包括:The method for automatically creating a folder tree according to claim 2, wherein the step of converting the string document into a tree structure comprises:
    读取字符串文档,通过按行划分转换成列表格式,构成列表变量;Read a string document and convert it into a list format by row division to form a list variable;
    初始化字典变量和结构层级变量;Initialize dictionary variables and structure level variables;
    基于列表变量和结构层级变量,检测字符串文档中的序号;Detecting sequence numbers in a string document based on list variables and structure level variables;
    基于字典变量中的属性,将字符串文档按照序号进行分类存储,更新字典变量为结构化字典变量;Based on the attributes in the dictionary variable, the string document is classified and stored according to the serial number, and the dictionary variable is updated to be a structured dictionary variable;
    将结构化字典变量转化为树状结构并以树形图方式展现。Transform structured dictionary variables into tree structures and present them in a tree diagram.
  4. 一种计算机存储介质,存储了计算机程序指令,计算机程序指令用于执行如权利要求1至3中任一项所述的文件夹树形图自动创建方法中的步骤。A computer storage medium storing computer program instructions for performing the steps in the automatic creation of a folder tree diagram according to any one of claims 1 to 3.
  5. 一种计算机系统,包括处理器和存储器,存储器上存储计算机程序,计算机程序在处理器中运行成计算机指令,所述计算机指令用于执行如权利要求1至3中任一项所述的文件夹树形图自动创建方法中的步骤。A computer system comprising a processor and a memory, the memory storing a computer program, the computer program running in the processor as a computer instruction for executing the folder of any one of claims 1 to 3. The tree diagram automatically creates steps in the method.
  6. 一种文件夹树形图自动创建系统,其特征在于,包括:A folder tree automatic creation system, comprising:
    字符串文档转化模块,用于读取指定路径的所有文件和文件夹的名字并将其转换为字符串的形式,形成字符串文档;A string document conversion module for reading the names of all files and folders of a specified path and converting them into a string form to form a string document;
    树状结构转化模块,用于将字符串文档转化为树状结构,形成文件夹树形图。A tree structure conversion module for converting a string document into a tree structure to form a folder tree.
  7. 根据权利要求6所述的文件夹树形图自动创建系统,其特征在于,字符串文档转化模块包括:The folder tree automatic creation system according to claim 6, wherein the string document conversion module comprises:
    数据库调用单元,用于调用Python中的数据库;Database call unit for calling a database in Python;
    路径指定单元,用于指定扫描路径;a path specifying unit for specifying a scan path;
    文件名读取单元,通过数据库,递归读入扫描路径中的所有层级中的所有文件和文件夹得到名字,其中每一层级的文件以及文件夹用序号排列,子级文件或者文件夹相对于父级文件夹缩进;The file name reading unit, through the database, recursively reads all the files and folders in all the levels in the scan path to obtain a name, wherein each level of files and folders are arranged by a serial number, and the child files or folders are relative to the parent. Level folder indentation;
    变量存储单元,用字符串变量存储读入的文件和文件夹的名字,构成字符串文档。The variable storage unit stores the names of the read files and folders with string variables to form a string document.
  8. 根据权利要求7所述的文件夹树形图自动创建系统,其特征在于,树状结构转化模块包括:The folder tree automatic creation system according to claim 7, wherein the tree structure conversion module comprises:
    列表变量构造单元,用于读取字符串文档,通过按行划分转换成列表格式,构成列表变量;a list variable construction unit for reading a string document and converting it into a list format by row division to form a list variable;
    字典变量和结构层级变量初始化单元,用于初始化字典变量和结构层级变量;Dictionary variable and structure level variable initialization unit for initializing dictionary variables and structure level variables;
    字符串文档序号检测单元,用于基于列表变量和结构层级变量,检测字符串文档中的序号;a string document serial number detecting unit, configured to detect a serial number in a string document based on a list variable and a structure level variable;
    字典变量结构化单元,用于基于字典变量中的属性,将字符串文档按照序号进行分类存储,更新字典变量为结构化字典变量;a dictionary variable structuring unit for classifying and storing string documents according to sequence numbers based on attributes in dictionary variables, and updating dictionary variables to structured dictionary variables;
    树形图展现单元,用于将结构化字典变量转化为树状结构并以树形图方式展现。A tree diagram presentation unit for transforming structured dictionary variables into a tree structure and presenting them in a tree diagram.
PCT/CN2018/084817 2017-05-11 2018-04-27 Method and system for automatically creating folder tree diagram WO2018205852A1 (en)

Applications Claiming Priority (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
CN201710329589.3 2017-05-11

Publications (1)

Publication Number Publication Date
WO2018205852A1 true WO2018205852A1 (en) 2018-11-15

Family

ID=59777713

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/084817 WO2018205852A1 (en) 2017-05-11 2018-04-27 Method and system for automatically creating folder tree diagram

Country Status (2)

Country Link
CN (1) CN107145588A (en)
WO (1) WO2018205852A1 (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107145588A (en) * 2017-05-11 2017-09-08 上海颐学网络科技有限公司 A kind of file arborescence automatically creates method and system
CN110852044B (en) * 2018-08-20 2023-09-15 上海颐为网络科技有限公司 Text editing method and system based on structuring
CN109388647B (en) * 2018-10-30 2020-09-29 成都四方伟业软件股份有限公司 WEB-based data filling method and system
CN110297682A (en) * 2019-06-28 2019-10-01 广州微易软件有限公司 A kind of task display method
CN110489516B (en) * 2019-08-15 2022-03-18 厦门铅笔头信息科技有限公司 Method for quickly establishing prefix index for massive structured data

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104615663A (en) * 2015-01-07 2015-05-13 小米科技有限责任公司 File sorting method and device and terminal
CN105045528A (en) * 2015-06-24 2015-11-11 武汉烽火众智数字技术有限责任公司 Fast FAT32 disk partition traversal and file searching method
US20170091623A1 (en) * 2015-09-30 2017-03-30 Fujitsu Limited Computer readable recording medium, specifying method, specifying apparatus, and method of analyzing provided information
CN107145588A (en) * 2017-05-11 2017-09-08 上海颐学网络科技有限公司 A kind of file arborescence automatically creates method and system

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100495398C (en) * 2006-03-30 2009-06-03 国际商业机器公司 Method for searching order in file system and correlation search engine
CN101599066A (en) * 2008-06-03 2009-12-09 鸿富锦精密工业(深圳)有限公司 Bulk operation and management system of documents and method
CN101739589B (en) * 2009-12-08 2012-08-29 大唐微电子技术有限公司 Method and device for generating intelligent card data
CN101976196B (en) * 2010-11-19 2013-01-02 重庆大学 Quality of service oriented code automatic code generating method
CN103309876A (en) * 2012-03-12 2013-09-18 腾讯科技(深圳)有限公司 Method and device for creating folders
CN103902918B (en) * 2012-12-30 2017-01-18 航天信息股份有限公司 Method and device for rapidly extracting text from Word document
US10409781B2 (en) * 2015-04-29 2019-09-10 Box, Inc. Multi-regime caching in a virtual file system for cloud-based shared content

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104615663A (en) * 2015-01-07 2015-05-13 小米科技有限责任公司 File sorting method and device and terminal
CN105045528A (en) * 2015-06-24 2015-11-11 武汉烽火众智数字技术有限责任公司 Fast FAT32 disk partition traversal and file searching method
US20170091623A1 (en) * 2015-09-30 2017-03-30 Fujitsu Limited Computer readable recording medium, specifying method, specifying apparatus, and method of analyzing provided information
CN107145588A (en) * 2017-05-11 2017-09-08 上海颐学网络科技有限公司 A kind of file arborescence automatically creates method and system

Also Published As

Publication number Publication date
CN107145588A (en) 2017-09-08

Similar Documents

Publication Publication Date Title
WO2018205852A1 (en) Method and system for automatically creating folder tree diagram
Moroney et al. The firebase realtime database
US10540624B2 (en) System and method to automate provenance-aware application execution
US10810191B2 (en) Limiting scans of loosely ordered and/or grouped relations in a database
US10169471B2 (en) Generating and executing query language statements from natural language
US10282447B2 (en) Adapting a relational query to accommodate hierarchical data
US9183279B2 (en) Semantic questioning mechanism to enable analysis of information architectures
US8468146B2 (en) System and method for creating search index on cloud database
CN108470040B (en) Method and device for warehousing unstructured data
CN111566638B (en) Adding descriptive metadata to an application programming interface for use by intelligent agents
Dudáš et al. Dataset summary visualization with lodsight
US8661004B2 (en) Representing incomplete and uncertain information in graph data
US9104683B2 (en) Enabling intelligent media naming and icon generation utilizing semantic metadata
WO2018205981A1 (en) Metadata management
US9406018B2 (en) Systems and methods for semantic data integration
US20190278847A1 (en) Natural language processing with dynamic pipelines
US9754015B2 (en) Feature rich view of an entity subgraph
WO2021011691A1 (en) Systems and methods for using an ontology to generate database entries and access and search a database
Imasheva et al. The practice of moving to big data on the case of the nosql database, clickhouse
US20180024832A1 (en) Cognitive feature analytics
US20200012643A1 (en) Method for managing and executing decoders and transformations using linked data and a service layer
US9922135B1 (en) Distributed storage and retrieval of directed acyclic graphs
RU2605387C2 (en) Method and system for storing graphs data
US10346440B2 (en) Model navigation constrained by classification
US10706075B2 (en) Analyzing application behavior to determine relationships between data

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18798636

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18798636

Country of ref document: EP

Kind code of ref document: A1