CN115495015A - Data file processing method, device, equipment and storage medium - Google Patents
Data file processing method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN115495015A CN115495015A CN202211160132.1A CN202211160132A CN115495015A CN 115495015 A CN115495015 A CN 115495015A CN 202211160132 A CN202211160132 A CN 202211160132A CN 115495015 A CN115495015 A CN 115495015A
- Authority
- CN
- China
- Prior art keywords
- data
- file
- root node
- data file
- link
- 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
- 238000003672 processing method Methods 0.000 title abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 42
- 238000012545 processing Methods 0.000 claims abstract description 34
- 238000004458 analytical method Methods 0.000 claims abstract description 33
- 238000013500 data storage Methods 0.000 claims description 48
- 238000012986 modification Methods 0.000 abstract description 30
- 230000004048 modification Effects 0.000 abstract description 30
- 238000012423 maintenance Methods 0.000 abstract description 8
- 230000006870 function Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 9
- 238000004590 computer program Methods 0.000 description 7
- 238000011161 development Methods 0.000 description 5
- 238000010606 normalization Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- 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/11—File system administration, e.g. details of archiving or snapshots
-
- 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/17—Details of further file system functions
- G06F16/172—Caching, prefetching or hoarding of files
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a data file processing method, a data file processing device, data file processing equipment and a storage medium, and belongs to the technical field of computers and the Internet. The method comprises the following steps: acquiring a data file and a file type of the data file; analyzing the data file by adopting an analysis mode corresponding to the file type, and determining at least one root node corresponding to the data file, at least one child node corresponding to each root node and a node connection sequence corresponding to the data file; generating a data link corresponding to the data file according to at least one root node, at least one child node corresponding to each root node and a node connection sequence; the data in the data file is stored in the form of a data link. According to the method and the device, the processing efficiency during data reading, maintenance and modification is improved.
Description
Technical Field
The present application relates to the field of computers, and in particular, to a method, an apparatus, a device, and a storage medium for processing a data file.
Background
Currently, in software application development, configuration information that is not easily encoded in code may be stored in a database.
In the related art, a data file for storing configuration information is generated for the configuration information that should not be encoded in a code. Wherein different configuration information may be stored by different types of data files due to the complexity of function development in software applications. Later, during the running process of the software application, different data files can be read from the database so as to realize different functions of the software application.
However, in the related art, since the configuration information is stored in the database in different types of data files, different parsing methods need to be used to parse the different types of data files to obtain data when the data is read, and thus the data reading efficiency is low.
Disclosure of Invention
The embodiment of the application provides a data file processing method, a data file processing device, data file processing equipment and a data file storage medium, and processing efficiency during data reading, maintenance and modification is improved. The technical scheme is as follows.
According to an aspect of an embodiment of the present application, there is provided a method for processing a data file, the method including the steps of:
acquiring a data file and a file type of the data file, wherein the data file comprises at least one datum;
analyzing the data file by adopting an analysis mode corresponding to the file type, and determining at least one root node corresponding to the data file, at least one child node corresponding to each root node and a node connection sequence corresponding to the data file;
generating a data link corresponding to the data file according to the at least one root node, the at least one child node corresponding to each root node and the node connection sequence;
and storing the data in the data file in the form of the data link.
According to an aspect of the embodiments of the present application, there is provided an apparatus for processing a data file, the apparatus including the following modules:
the file acquisition module is used for acquiring a data file and the file type of the data file, wherein the data file comprises at least one data;
the file analysis module is used for analyzing the data file by adopting an analysis mode corresponding to the file type, determining at least one root node corresponding to the data file, at least one child node corresponding to each root node and a node connection sequence corresponding to the data file;
a link generation module, configured to generate a data link corresponding to the data file according to the at least one root node, the at least one child node corresponding to each root node, and the node connection order;
and the data storage module is used for storing the data in the data file in the form of the data link.
According to an aspect of the embodiments of the present application, there is provided a computer device, including a processor and a memory, where the memory stores at least one program, and the at least one program is loaded and executed by the processor to implement the method for processing the data file.
According to an aspect of the embodiments of the present application, there is provided a computer-readable storage medium, in which at least one program is stored, and the at least one program is loaded and executed by a processor to implement the above-mentioned data file processing method.
According to an aspect of embodiments herein, there is provided a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and executes the computer instructions, so that the computer device executes the processing method of the data file.
The technical scheme provided by the embodiment of the application can bring the following beneficial effects:
the data in the data files are stored through the data link, the data files are converted into the data link, so that the storage difference caused by different file types of the data files is eliminated, the data in each data file are stored in the form of the data link, the data in the data files are stored in a unified form, inconvenience caused by the difference of the file types during data reading, maintenance and modification is avoided, and the processing efficiency during the data reading, maintenance and modification is improved; moreover, the file data normalization method is provided, and the expansibility and reusability of the data storage block are improved; in addition, a corresponding analysis mode is determined according to the data file type, and the data file is analyzed by adopting the corresponding analysis mode, so that the analysis efficiency of the data file is improved, and the subsequent data storage efficiency is further improved.
Drawings
FIG. 1 is a schematic diagram of a data file processing system provided by one embodiment of the present application;
FIG. 2 illustrates a schematic diagram of a data file processing system;
FIG. 3 is a flow chart of a method for processing a data file according to an embodiment of the present application;
fig. 4 to 6 are diagrams illustrating a manner of generation of a data link;
FIG. 7 is a flow chart of a method for processing a data file according to another embodiment of the present application;
FIG. 8 is a block diagram of a data file processing device according to an embodiment of the present application;
FIG. 9 is a block diagram of a data file processing apparatus according to another embodiment of the present application;
fig. 10 is a block diagram of a computer device according to an embodiment of the present application.
Detailed Description
To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
Referring to fig. 1, a schematic diagram of a data file processing system according to an embodiment of the present application is shown. The data file processing system may include a terminal device 10 and a server 20.
The terminal device 10 may be an electronic device such as a Computer, a tablet Computer, a game console, an electronic book reader, a multimedia player, a wearable device, a PC (Personal Computer), and the like, which is not limited in this embodiment. In some embodiments, the terminal device 10 includes a client of the application program. The application may be any application, such as a game application, a music application, a reading application, a social application, and the like. For example, the application may be an application that needs to be installed and downloaded, or may be an application that is to be used on demand, which is not limited in this embodiment of the application.
The server 20 may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing basic cloud computing services such as a cloud service, a cloud database, cloud computing, a cloud function, cloud storage, a network service, cloud communication, middleware service, a domain name service, a security service, a CDN, and a big data and artificial intelligence platform.
The terminal device 10 and the server 20 communicate with each other via a network. In some embodiments, the terminal device 10 described above includes a first terminal device 11 and a second terminal device 12. The first terminal device 11 is a terminal device used by a user who develops an application program, and the second terminal device 12 is a terminal device used by a user who uses an application program. Illustratively, as shown in fig. 2, the development user uploads the data file of the application program through the first terminal device 11. Wherein, the data file comprises the configuration data of the application program. Illustratively, the development user may upload the data file through a visualization interface. Then, the first terminal device 11 sends the data file to the server 20, further, after the server 20 obtains the data file, the server obtains the file type of the data file, and determines a corresponding parsing manner according to the file type, further, the data file is parsed by using the parsing manner, and at least one root node corresponding to the data file, at least one child node corresponding to each root node, and a node connection sequence corresponding to the data file are determined. And then, according to the at least one root node, the at least one child node corresponding to each root node and the node connection sequence corresponding to the data file, generating a data link corresponding to the data file, and storing the data in the data file in a database in a data link form. Then, in the process of using the application program by the user through the second terminal device 12, the second terminal device 12 sends a data acquisition request to the server 20, and the server 20 acquires a corresponding data link from the database according to the data acquisition request, and generates and sends data feedback information to the second terminal device 12 according to the data link. Then, the second terminal device 12 performs screen rendering, function realization, and the like on the application program according to the data feedback information.
It should be noted that, the description of the interaction between the terminal device 10 and the server 20 is only exemplary and explanatory, and in an exemplary embodiment, the interaction manner between the terminal device 10 and the server 20 may be flexibly set and adjusted, which is not limited in the embodiment of the present application. Illustratively, in the case that the load of the first terminal device 11 allows, the data file is converted into the data link by the first terminal device 11, and then the data link is stored in the database by the server 20.
Referring to fig. 3, a flowchart of a method for processing a data file according to an embodiment of the present application is shown. The steps in the method may be executed by the terminal device 10 and/or the server 20 (hereinafter collectively referred to as "computer device") in fig. 1, for example, the execution subject of each step may be a client of the application program in the terminal device 10. The method may comprise at least one of the following steps (301-304):
A data file refers to a file for storing data. The data file may be any type of file, such as an Excel file, a Json file, and an XML file, which is not limited in this embodiment of the present application. In some embodiments, different data corresponds to different file types, for example, a suitable file type may be selected based on the data, and the data file may be generated according to the data with the selected file type as a reference.
In the embodiment of the application, the computer device acquires the data file first, determines the file type of the data file, and converts the data file by adopting an analysis mode corresponding to the file type, so that the data files of different types can be converted into a uniform format for data storage. Wherein, the data file comprises at least one data. Illustratively, if the data file is a configuration file of an application, the data included in the data is configuration data of the application.
In some embodiments, the data file may be generated manually by a user or automatically by a computer device, which is not limited in this application. In one possible embodiment, the data file is generated manually by a user. In some embodiments, an appropriate file type is determined from the data by a user and the data is written to generate a data file corresponding to the file type. In another possible embodiment, the data file is automatically generated by a computer device. In some embodiments, an appropriate file type is determined from the data by the computer device, and the data is automatically written to generate a data file corresponding to the file type.
In some embodiments, the file type of the data file is carried in the data file. Illustratively, the file type of the data file is a suffix of the data file. Of course, in other possible embodiments, the file type of the data file may also be directly written into the data of the data file, such as the first row of data in the data file is used to record the file type of the data file.
In some embodiments, the correspondence between the file type and the parsing method is pre-stored in the parsing query file. In a possible implementation manner, the file type is directly stored in the data file, and after the computer device acquires the data file, the file type is determined according to the file type indication information stored in the data file, and then an analysis manner corresponding to the file type is queried and determined from the analysis query file. The file type indication information may be stored in any position in the data file, such as a title position, a file name position, and the like, which is not limited in this embodiment of the present application. In another possible implementation manner, the file type is not stored in the data file, and after the computer device obtains the data file, the computer device scans the data file to determine the file type corresponding to the data file, and then queries from the parsing query file to determine the parsing manner corresponding to the file type. It should be noted that the parsing query file may be any type of file, and the embodiment of the present application is not limited to this.
In some embodiments, the data in the data file is stored in the data file in the form of data sets, that is, the data file includes at least one data set, and one data set includes at least one data. In some embodiments, after determining the parsing method, the computer device parses the data file to obtain at least one data group in the parsing method; further, by adopting the analysis mode, each data group is analyzed. The data types corresponding to different data sets may be the same or different. Illustratively, in the data file, the data category corresponding to the first data group includes name, age, and mailbox, and the data category corresponding to the second data group includes first name, and mailbox (email).
In some embodiments, since different file types correspond to different parsing manners, in order to improve parsing efficiency of a data file, when a computer device parses the data file, a parsing manner corresponding to a file type of the data file is determined first, and then the data file is parsed by using the parsing manner. In the embodiment of the application, after acquiring a data file and a file type of the data file, a computer device determines a corresponding parsing manner based on the file type, further parses the data file by using the parsing manner, determines at least one root node corresponding to the data file, at least one child node corresponding to each root node, and a node connection sequence corresponding to the data file.
In some embodiments, the foregoing resolution manner may be used to indicate a resolution rule, and may also be used to indicate a resolution address. In a possible embodiment, the parsing manner is used to indicate a parsing rule, and the computer device parses the data file based on the parsing rule after determining the parsing rule. In another possible embodiment, the parsing manner is used to indicate a parsing address, and after determining the parsing address, the computer device invokes the corresponding file parsing block to parse the data file based on the parsing address. The file analysis block may include a file analysis program packaged in advance.
In some embodiments, the data files of different file types correspond to different parsing manners, that is, data reading manners of the data files of different file types are different, so that the data files of different file types correspond to different data link generation manners.
In a possible implementation manner, in a case that a file type of a data file is a first file type, after acquiring the data file and the file type of the data file, a computer device analyzes the data file in an analysis manner corresponding to the file type, and acquires at least one data stored in the data file and a data storage sequence corresponding to the data file, and further determines at least one root node corresponding to the data file, at least one child node corresponding to each root node, and a node connection sequence corresponding to the data file according to the at least one data and the data storage sequence, so as to generate a data link corresponding to the data file. The first file type refers to a file which cannot accurately read the corresponding relationship between the data and the data types. Illustratively, the first file type is an Excel file, and since the Excel file only stores data types in the first row of data, the data types corresponding to the data in each row of data cannot be accurately determined when the data is read in row units. It should be noted that the at least one data is all data stored in the data file.
In another possible implementation manner, in a case that the file type of the data file is the second file type, after acquiring the data file and the file type of the data file, the computer device analyzes the data file by using an analysis manner corresponding to the file type, acquires at least one data stored in the data file, a correspondence between data and a data category corresponding to the data file, and a data storage order corresponding to the data file, and further determines, according to the at least one data, the correspondence between the data and the data category, and the data storage order, at least one root node corresponding to the data file, at least one child node corresponding to each root node, and a node connection order corresponding to the data file, so as to generate a data link corresponding to the data file. The second file type refers to a file capable of accurately reading the corresponding relationship between the data and the data types. The second file type is exemplarily a Json file or an XML file, and since data categories and data are stored in the Json file and the XML file in a nested manner, the data category corresponding to a certain data can be accurately determined when the data is read. The at least one piece of data is all data stored in the data file, and the data type is a type of data when the data is stored. Illustratively, if the data is differentiated in data format when stored, the data type is used to indicate the data format, e.g., the data type may include int, float, double, etc.; if the data is distinguished by specific storage meanings when stored, the data category is used for indicating the storage meaning of the data, for example, the data category may include name, age, mailbox, and the like.
Step 303, generating a data link corresponding to the data file according to at least one root node, at least one child node corresponding to each root node, and a node connection order.
In this embodiment, after obtaining the at least one root node and the at least one child node and the node connection order corresponding to each root node, the computer device generates a data link corresponding to the data file according to the at least one root node and the at least one child node and the node connection order corresponding to each root node.
In the embodiment of the application, after acquiring the data link corresponding to the data file, the computer device stores the data in the data file in the form of the data link. In some embodiments, the data links are stored in a database, and the database includes data links corresponding to a plurality of data files.
In some embodiments, in order to improve the reading efficiency of data in the database, similar or associated data is stored in adjacent positions, and clustering storage of the data is realized, so that subsequent uniform processing of the data is facilitated.
In one possible implementation, the computer device is configured to store the data link as a log of the second root node. In an exemplary embodiment, the step 304 includes at least one of:
1. determining a storage location of the data link in the database based on a second root node in the data link;
2. the data in the data file is stored in the storage location in the form of a data link.
In some embodiments, a second root node is included in the data link. The data file comprises at least one data group, one data group comprises at least one data, and the second root node is used for indicating the data group category in the at least one data group. In an embodiment of the present application, after acquiring the data link, the computer device determines, based on a second root node in the data link, a storage location of the data link in the database, and further stores data in the data file in the form of the data link at the storage location.
In some embodiments, after acquiring the data link, the computer device acquires, according to a second root node in the data link, an associated root node corresponding to the second root node in the database, and determines a storage location of the data link in the database based on a location of the associated root node in the database. In a possible embodiment, the root node and the second root node are the same root node. In some embodiments, a second root node stored in the database is traversed, with reference to the second root node in the data link, to determine the associated root node.
The manner described above for memorializing the data link with reference to the second root node is applicable to data files belonging to the second file type.
In another possible embodiment, the computer device stores the data link with reference to the data file identification. In an exemplary embodiment, the step 304 includes at least one of:
1. determining the storage position of the data link in the database based on the data file identifier corresponding to the data link;
2. the data in the data file is stored in the storage location in the form of a data link.
In some embodiments, the data link corresponds to a data file identifier indicating the data file to which the data link corresponds. In the embodiment of the application, after acquiring the data link, the computer device determines a storage location of the data link in the database based on the data file identifier corresponding to the data link, and further stores data in the data file in the form of the data link at the storage location.
In some embodiments, after acquiring the data link, the computer device acquires, according to the data file identifier corresponding to the data link, an associated file identifier corresponding to the data file identifier from the database, and further determines, based on a location of the data link corresponding to the associated file identifier in the database, a storage location of the data link corresponding to the data file identifier in the database. In a possible implementation manner, the associated file identifier refers to a file identifier of an associated data file associated with the data file. Taking the configuration file of the application program as an example, the data file is a first configuration file for a target section of the application program, and the associated data file is a second configuration file for the target section of the application program.
The above-described manner of storing the data link with reference to the data file identifier is exemplarily applicable to the data file belonging to the first file type.
To sum up, in the technical solution provided in the embodiment of the present application, data in a data file is stored through a data link, and the data file is converted into the data link, so as to eliminate storage differences caused by different file types of the data file, so that data in each data file is stored in the form of the data link, and data in the data file is stored in a unified form, thereby avoiding inconvenience caused by file type differences during data reading, maintenance and modification, and improving processing efficiency during data reading, maintenance and modification; moreover, the file data normalization method is provided, and the expansibility and reusability of the data storage block are improved; in addition, a corresponding analysis mode is determined according to the data file type, and the data file is analyzed by adopting the corresponding analysis mode, so that the analysis efficiency of the data file is improved, and the subsequent data storage efficiency is further improved.
Next, a method of generating the data link will be described.
In a possible implementation, the file type of the data file is a first file type. In an exemplary embodiment, the above steps 302 and 303 include at least one of the following steps:
1. analyzing the data file by adopting an analysis mode corresponding to the file type, and determining data respectively stored in each data group in the data file and a data storage sequence respectively corresponding to each data group;
2. regarding a target data group in at least one data group, according to a data storage sequence corresponding to the target data group, taking data with the most front storage sequence as first data;
3. taking the first data as a first root node;
4. determining other data with the storage sequence behind the first data as child nodes corresponding to the first root node according to the storage sequence of the data in the target data group;
5. determining the connection sequence of each child node according to the storage sequence of other data in the target data group;
6. generating a data sub-link corresponding to a target data group according to the first root node, the child nodes corresponding to the first root node and the connection sequence of each child node;
7. and splicing the first root nodes in the data sub-links respectively corresponding to each data group to generate the data links corresponding to the data files.
In some embodiments, at least one data set is included in the data file, with at least one data included in a data set. In the embodiment of the application, after acquiring the data file and determining the file type of the data file, the computer device analyzes the data file by adopting an analysis mode corresponding to the file type, and determines data stored in each data group in the data file and a data storage sequence corresponding to each data group. And then, taking the data with the storage sequence positioned at the forefront as first data, determining the first data as a first root node, and determining other data with the storage sequence positioned at the back of the first data as child nodes corresponding to the first root node. And determining the connection sequence of other data as child nodes according to the storage sequence of other data in the data groups, further generating data sub-links corresponding to each data group according to the first root node, the child node corresponding to the first root node and the connection sequence among the child nodes, and splicing the first root nodes in the data sub-links corresponding to each data group according to the data sub-links corresponding to each data group to generate the data links corresponding to the data files.
Taking the target data group as an example, for the target data group, after acquiring the data stored in the target data group and the data storage sequence corresponding to the target data group, the computer device takes the data with the storage sequence located at the forefront as the first data, and takes the first data as the first root node. And then, according to the data storage sequence corresponding to the target data group, determining other data with the storage sequence behind the first data as child nodes corresponding to the first root node, and according to the storage sequence of the other data in the target data group, determining the connection sequence of each child node, and further according to the first root node, the child nodes corresponding to the first root node, and the connection sequence of each child node, generating a data child link corresponding to the target data group. Illustratively, after determining the first root node and the child nodes corresponding to the first root node, the computer device sequentially connects the child nodes according to the storage sequence of other data in the target data group, and then connects the child node located at the first position to the first root node to generate the data child link corresponding to the target data group. The target data set is any data set in the data file.
In addition, a generation method of the data link will be described with reference to fig. 4.
Illustratively, as shown in fig. 4, the data file 40 is an Excel file, and the data file 40 includes a first data group 41 and a second data group 42. The first data group 41 includes data (1) (90005) (90006) and has a data storage order of 1-90005-90006, and based on this, the first data sub-link 43 corresponding to the first data group 41 is generated. In the first data sublink 43, data (1) is a first root node, data (90005) and data (90006) are child nodes corresponding to the first root node, and the connection order of the child nodes is 90005-90006. The second data group 42 includes data (2) (90007) (90008), and the data storage order is 2-90007-90008, and based on this, the second data sublink 44 corresponding to the second data group 42 is generated. In the second data sublink 44, data (2) is a first root node, data (90007) and data (90008) are child nodes corresponding to the first root node, and the connection order of the child nodes is 90007-90008. Thereafter, the first root node (1) of the first data sublink 43 and the second root node (2) of the second data sublink 44 are spliced to generate a data link 45 corresponding to the data file 40.
In another possible embodiment, the file type of the data file is a second file type. In an exemplary embodiment, the above steps 302 and 303 include at least one of the following steps:
1. analyzing the data file by adopting an analysis mode corresponding to the file type, and determining the corresponding relation between the data and the data category corresponding to each data group in the data file and the data storage sequence corresponding to each data group;
2. for a target data group in at least one data group, determining the data type as a first root node according to the corresponding relation between the data corresponding to the target data group and the data type, and determining the data corresponding to the data type as a child node corresponding to the first root node;
3. determining a connection sequence between the first root nodes according to a data storage sequence corresponding to the target data group;
4. determining a data sublink corresponding to a target data group according to the first root node, a subnode corresponding to the first root node and a connection sequence among the first root nodes;
5. and splicing the data sub-links corresponding to the data groups belonging to the same data group category based on the data group categories to which the data groups belong respectively to generate the data links corresponding to the data files.
In some embodiments, at least one data set is included in the data file, with at least one data included in a data set. In the embodiment of the application, after acquiring the data file and determining the file type of the data file, the computer device analyzes the data file in an analysis mode corresponding to the file type, and determines the corresponding relationship between the data and the data category corresponding to each data group in the data file and the data storage sequence corresponding to each data group. And then, determining the connection relation between the first root node and the child node according to the corresponding relation between the data and the data category, and further determining the connection relation between the first root nodes according to the data storage sequence corresponding to the data group. And then, generating data sublinks corresponding to the data groups according to the connection relationship between the first root nodes and the subnodes and the connection relationship between the first root nodes, and generating data links corresponding to the data files based on the data sublinks corresponding to the data groups.
Taking the target data group as an example, for the target data group, after acquiring the corresponding relationship between the data and the data category corresponding to the target data and the data storage sequence corresponding to the target data group, the computer device determines the data category as a first root node according to the corresponding relationship, and determines the data corresponding to the data category as a child node corresponding to the first root node. And then, determining the connection sequence between the first root nodes according to the data storage sequence corresponding to the target data group. And then, generating a data sub-link corresponding to the target data group according to the first root node, the connection relation among the sub-nodes corresponding to the first root node and the connection sequence among the first root nodes. Illustratively, after determining the connection relationship between the first root node and the child node, the computer device connects the first root node having the correspondence relationship with the child node, and then, after determining the data storage order, the computer device sequentially connects the first root node with reference to the data storage order to generate the data sublink corresponding to the target data set. The target data set is any data set in the data file.
In some embodiments, the data file further includes data group categories, and one data group category corresponds to one or more data groups. After the computer device obtains the data sublinks respectively corresponding to the data groups, the data sublinks corresponding to the data groups belonging to the same data group category are spliced based on the data group category to which each data group belongs, and a data link corresponding to the data file is generated. Illustratively, when the data sublinks are spliced, the computer takes the data group category as a second root node, and connects the first root node in the data sublink corresponding to the data group belonging to the same data group category to the second root node.
In addition, the generation manner of the data link is described with reference to fig. 5 and 6.
Illustratively, as shown in fig. 5, the data file 50 is a Json file, and the data file 50 includes a first data group 51, a second data group 52, and a third data group 53. For the first data group 51, the first data category (first name) and the first data (Brett) have a corresponding relationship, the second data category (last name) and the second data (Lin) have a corresponding relationship, the third data category (email) and the third data (breet @ xxxx.com) have a corresponding relationship, and the data storage order is Brett-Lin-breet @ xxxx.com, based on which the first data sublink 54 corresponding to the first data group 51 is generated. In the first data sub-link 54, a first root node (first name) is connected with a child node (Brett), a first root node (last name) is connected with the child node (Lin), the first root node (email) is connected with the child node (breet @ xxxx.com), and the connection sequence of the first root node is first name-last name-email. For the second data group 52, the first data category (first name) has a corresponding relationship with the first data (Jason), the second data category (last name) has a corresponding relationship with the second data (Li), the third data category (email) has a corresponding relationship with the third data (Jason @ xxxx.com), and the data storage sequence is Jason-Li-Jason @ xxxx.com, based on which the second data sublink 55 corresponding to the second data group 52 is generated. In the second data sub-link 55, a first root node (first name) is connected with a child node (Jason), a first root node (last name) is connected with a child node (Li), a first root node (email) is connected with a child node (Jason @ xxxx. Com), and the connection sequence of the first root node is first name-last name-email. For the third data group 53, a corresponding relationship exists between the first data category (first name) and the first data (Elliotte), a corresponding relationship exists between the second data category (last name) and the second data (Han), a corresponding relationship exists between the third data category (email) and the third data (Elliotte @ xxxx.com), and the data storage sequence is Elliotte-Han-Elliotte @ xxxx.com, based on which the third data sublink 56 corresponding to the third data group 53 is generated. In the third data sub-link 56, the first root node (first name) is connected to the child node (Elliotte), the first root node (last name) is connected to the child node (Han), the first root node (email) is connected to the child node (Elliotte @ xxxx.com), and the connection sequence of the first root node is first name-last name-email. Thereafter, since the data file 50 includes a data group class (peer) and the first data group 51, the second data group 52 and the third data group 53 all belong to the data group class, the first root node at the first position in the first data sub-link 54 may be connected to the second root node (peer), the first root node at the first position in the second data sub-link 55 may be connected to the first root node at the first position in the first data sub-link 54, and the first root node at the first position in the third data sub-link 56 may be connected to the first root node at the first position in the second data sub-link 55 to generate the data link 57.
Illustratively, as shown in fig. 6, the data file 60 is an XML file, and the data file 60 includes a first data set 61 therein. For the first data group 61, a corresponding relationship exists between the first data category (first name) and the first data (Brett), a corresponding relationship exists between the second data category (last name) and the second data (Lin), a corresponding relationship exists between the third data category (email) and the third data (breet @ xxxx.com), and the data storage sequence is Brett-Lin-breet @ xxxx.com, based on which the first data sub-link 62 corresponding to the first data group 61 is generated. In the first data sub-link 62, a first root node (first name) is connected with a child node (Brett), a first root node (last name) is connected with a child node (Lin), a first root node (email) is connected with the child node (breet @ xxxx. Thereafter, since the data file 60 includes the data group category (request), the first root node at the first position in the first data sublink 62 may be connected to the second root node (request) to generate the data link 63.
Referring to fig. 7, a flowchart of a data file processing method according to another embodiment of the present application is shown. The steps in the method may be executed by the terminal device 10 and/or the server 20 (hereinafter collectively referred to as "computer device") in fig. 1, for example, the execution subject of each step may be a client of the application program in the terminal device 10. The method may comprise at least one of the following steps (701-706):
Step 702, analyzing the data file by using an analysis mode corresponding to the file type, and determining at least one root node corresponding to the data file, at least one child node corresponding to each root node, and a node connection sequence corresponding to the data file.
And 703, generating a data link corresponding to the data file according to the at least one root node, the at least one child node corresponding to each root node and the node connection sequence.
The above steps 701-704 are the same as steps 301-304 in the embodiment of fig. 3, and refer to the embodiment of fig. 3 for details, which are not repeated herein.
Step 705, in a case that the data acquisition request is received, acquiring a data link corresponding to the acquisition identifier information from a database based on the acquisition identifier information included in the data acquisition request.
The data acquisition request is used for requesting to acquire data. In some embodiments, after the data link is stored to the database, the corresponding data is read from the database by a data acquisition request. For example, if the data file is a configuration file of an application program, the data obtaining request may be a request generated by triggering in an operation process of the application program.
In this embodiment of the present application, when receiving the data acquisition request, the computer device acquires, from a database, a data link corresponding to the acquisition identification information based on the acquisition identification information included in the data acquisition request.
In a possible implementation, the obtaining the identification information includes the target second root node. In some embodiments, the computer device, after obtaining the data obtaining request, determines a target second root node from the data obtaining request, and further obtains a data link corresponding to the target second root node based on traversal of the second root node by the target second root node for a second root node included in the database.
In another possible implementation, the obtaining identification information includes a data file identification. In some embodiments, after obtaining the data obtaining request, the computer device determines a data file identifier from the data obtaining request, and further obtains a data link corresponding to the data file identifier from a database based on the data file identifier.
In this embodiment of the application, after acquiring the data link corresponding to the acquired identification information, the computer device generates data feedback information corresponding to the data acquisition request according to the data link corresponding to the acquired identification information, and sends the data feedback information.
In some embodiments, after the data link is stored to the database, the data is modified from the database by a data modification request. The data modification includes data replacement, data addition, data deletion, and the like, which is not limited in the embodiment of the present application. Illustratively, the computer device obtains a data link corresponding to the modification identification information from the database based on the modification identification information included in the data modification request when receiving the data modification request, and then modifies the data link corresponding to the modification identification information according to the data modification request.
In a possible implementation manner, the data modification request includes a data modification file, and the computer device modifies the data link in the database according to the data modification file. It should be noted that, because the data is stored in the database in the form of a data link, when the data is modified, the file types between the data modification file and the original data file may be the same or different, and this is not limited in this embodiment of the present application. Of course, in another possible implementation, since the data in the database is stored in the form of a data link, when the data is modified, the modified data can be directly uploaded according to the unified data interface.
In summary, in the technical scheme provided by the embodiment of the application, data in data files of different file types are stored in a data link form, and a data file normalization idea is provided, so that data files of different file types do not exist in a database, and the data reading efficiency is improved. Moreover, the normalization processing of the data file enables the data to be modified by adopting a uniform modification interface when the data in the database is modified, and the development cost is reduced.
The following are embodiments of the apparatus of the present application that may be used to perform embodiments of the method of the present application. For details which are not disclosed in the embodiments of the apparatus of the present application, reference is made to the embodiments of the method of the present application.
Referring to fig. 8, a block diagram of a data file processing apparatus according to an embodiment of the present application is shown. The device has the function of realizing the processing method of the data file, and the function can be realized by hardware or by hardware executing corresponding software. The device can be a computer device, and can also be arranged in the computer device. The apparatus 800 may include: a file acquisition module 810, a file parsing module 820, a link generation module 830, and a data storage module 840.
The file obtaining module 810 is configured to obtain a data file and a file type of the data file, where the data file includes at least one piece of data.
A file parsing module 820, configured to parse the data file in a parsing manner corresponding to the file type, and determine at least one root node corresponding to the data file, at least one child node corresponding to each root node, and a node connection order corresponding to the data file.
A link generating module 830, configured to generate a data link corresponding to the data file according to the at least one root node, the at least one child node corresponding to each root node, and the node connection order.
A data storage module 840, configured to store data in the data file in the form of the data link.
In an exemplary embodiment, the data file includes at least one data group, and one data group includes at least one data; the file parsing module 820 is further configured to:
analyzing the data file by adopting an analysis mode corresponding to the file type, and determining data respectively stored in each data group in the data file and a data storage sequence respectively corresponding to each data group;
regarding a target data group in the at least one data group, according to a data storage sequence corresponding to the target data group, taking data with the most front storage sequence as first data;
taking the first data as a first root node;
determining other data with a storage sequence behind the first data as a child node corresponding to the first root node according to a data storage sequence corresponding to the target data group;
and determining the connection sequence of each child node according to the storage sequence of the other data in the target data group.
In an exemplary embodiment, the link generation module 830 is further configured to:
generating a data sub-link corresponding to the target data group according to the first root node, the child nodes corresponding to the first root node and the connection sequence of each child node;
and splicing the first root nodes in the data sub-links corresponding to the data groups respectively to generate the data links corresponding to the data files.
In an exemplary embodiment, the data file includes at least one data group, and one data group includes at least one data; the file parsing module 820 is further configured to:
analyzing the data file by adopting an analysis mode corresponding to the file type, and determining the corresponding relation between the data and the data category corresponding to each data group in the data file and the data storage sequence corresponding to each data group;
for a target data group in the at least one data group, determining the data type as a first root node according to the corresponding relation between the data corresponding to the target data group and the data type, and determining the data corresponding to the data type as a child node corresponding to the first root node;
and determining the connection sequence between the first root nodes according to the data storage sequence corresponding to the target data group.
In an exemplary embodiment, the link generation module 830 is further configured to:
determining a data sublink corresponding to the target data group according to the first root node, a subnode corresponding to the first root node and a connection sequence among the first root nodes;
and splicing the data sublinks corresponding to the data groups belonging to the same data group category based on the data group categories to which the data groups respectively belong to generate the data links corresponding to the data files.
In an exemplary embodiment, the link generation module 830 is further configured to:
and connecting the first root node in the data sublink corresponding to the data group belonging to the same data group category to the second root node by taking the data group category as the second root node.
In an exemplary embodiment, the data storage module 840 is further configured to:
determining a storage location of the data link in a database based on a second root node in the data link; the data file comprises at least one data group, one data group comprises at least one data, and the second root node is used for indicating the data group category in the at least one data group;
storing data in the data file in the form of the data link at the storage location.
In an exemplary embodiment, the data storage module 840 is further configured to:
determining the storage position of the data link in a database based on the data file identification corresponding to the data link;
storing data in the data file in the form of the data link at the storage location.
In an exemplary embodiment, the data storage module 840 is further configured to:
acquiring a related root node corresponding to the second root node from the database;
determining a storage location of the data link in the database based on the location of the associated root node in the database.
In an exemplary embodiment, the data storage module 840 is further configured to:
acquiring an associated file identifier corresponding to the data file identifier in the database;
and determining the storage position of the data link corresponding to the data file identifier in the database based on the position of the data link corresponding to the associated file identifier in the database.
In an exemplary embodiment, as shown in fig. 9, the apparatus 800 further comprises: a data reading module 850, an information generating module 860 and an information transmitting module 870.
A data reading module 850, configured to, in a case that a data obtaining request is received, obtain, based on obtaining identification information included in the data obtaining request, a data link corresponding to the obtaining identification information from the database.
An information generating module 860, configured to generate data feedback information corresponding to the data obtaining request according to the data link corresponding to the obtaining identification information.
An information sending module 870, configured to send the data feedback information.
In an exemplary embodiment, the data reading module 850 is further configured to:
the obtained identification information comprises a target second root node, and a data link corresponding to the target second root node is obtained based on the target second root node traversing second root nodes contained in the database;
or,
the obtaining identification information comprises a data file identification, and based on the data file identification, a data link corresponding to the data file identification is obtained from the database.
In an exemplary embodiment, as shown in fig. 9, the apparatus 800 further comprises: a data modification module 880.
A data modification module 880, configured to, when a data modification request is received, obtain, based on modification identification information included in the data modification request, a data link corresponding to the modification identification information from the database; and modifying the data link corresponding to the modification identification information according to the data modification request.
To sum up, in the technical solution provided in the embodiment of the present application, data in a data file is stored through a data link, and the data file is converted into the data link, so as to eliminate storage differences caused by different file types of the data file, so that the data in each data file is stored in the form of the data link, and the data in the data file is stored in a unified form, thereby avoiding inconvenience caused by file type differences during data reading, maintenance and modification, and improving processing efficiency during data reading, maintenance and modification; moreover, the file data normalization method is provided, and the expansibility and reusability of the data storage block are improved; in addition, the corresponding analysis mode is determined through the data file type, and the data file is analyzed by adopting the corresponding analysis mode, so that the analysis efficiency of the data file is improved, and the subsequent data storage efficiency is further improved.
It should be noted that, when the apparatus provided in the foregoing embodiment implements the functions thereof, only the division of the functional modules is illustrated, and in practical applications, the functions may be distributed by different functional modules according to needs, that is, the internal structure of the apparatus may be divided into different functional modules to implement all or part of the functions described above. In addition, the apparatus and method embodiments provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the method embodiments for details, which are not described herein again.
Referring to fig. 10, a block diagram of a computer device according to an embodiment of the present application is shown. The computer device can be used for realizing the functions of the data file processing method. Specifically, the method comprises the following steps:
the computer apparatus 1000 includes a Central Processing Unit (CPU) 1001, a system Memory 1004 including a Random Access Memory (RAM) 1002 and a Read Only Memory (ROM) 1003, and a system bus 1005 connecting the system Memory 1004 and the CPU 1001. The computer device 1000 also includes a basic Input/Output system (I/O system) 1006, which helps to transfer information between various devices within the computer, and a mass storage device 1007, which stores an operating system 1013, application programs 1014, and other program modules 1015.
The basic input/output system 1006 includes a display 1008 for displaying information and an input device 1009, such as a mouse, keyboard, etc., for user input of information. Wherein a display 1008 and an input device 1009 are connected to the central processing unit 1001 via an input-output controller 1010 connected to the system bus 1005. The basic input/output system 1006 may also include an input/output controller 1010 for receiving and processing input from a number of other devices, such as a keyboard, mouse, or electronic stylus. Similarly, the input-output controller 1010 also provides output to a display screen, a printer, or other type of output device.
The mass storage device 1007 is connected to the central processing unit 1001 through a mass storage controller (not shown) connected to the system bus 1005. The mass storage device 1007 and its associated computer-readable media provide non-volatile storage for the computer device 1000. That is, the mass storage device 1007 may include a computer-readable medium (not shown) such as a hard disk or CD-ROM (Compact disk Read-Only Memory) drive.
Without loss of generality, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes RAM, ROM, EPROM (Erasable Programmable Read-Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), flash Memory or other solid state Memory, CD-ROM, DVD (Digital Video Disc) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices. Of course, those skilled in the art will appreciate that computer storage media is not limited to the foregoing. The system memory 1004 and mass storage device 1007 described above may be collectively referred to as memory.
According to various embodiments of the present application, the computer device 1000 may also operate as a remote computer connected to a network through a network, such as the Internet. That is, the computer device 1000 may be connected to the network 1012 through the network interface unit 1011 connected to the system bus 1005, or the network interface unit 1011 may be used to connect to other types of networks and remote computer systems (not shown).
The memory also includes a computer program stored in the memory and configured to be executed by the one or more processors to implement the above-described method of processing a data file.
In an exemplary embodiment, a computer readable storage medium is also provided, in which at least one instruction, at least one program, a set of codes, or a set of instructions is stored, which when executed by a processor, implements the above-mentioned data file processing method.
Optionally, the computer-readable storage medium may include: ROM (Read Only Memory), RAM (Random Access Memory), SSD (Solid State drive), or optical disc. The Random Access Memory may include a ReRAM (resistive Random Access Memory) and a DRAM (Dynamic Random Access Memory).
In an exemplary embodiment, a computer program product or computer program is also provided, the computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer readable storage medium, and the processor executes the computer instructions to cause the computer device to execute the processing method of the data file.
It should be understood that reference to "a plurality" herein means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. In addition, the step numbers described herein only show an exemplary possible execution sequence among the steps, and in some other embodiments, the steps may also be executed out of the numbering sequence, for example, two steps with different numbers are executed simultaneously, or two steps with different numbers are executed in a reverse order to the illustrated sequence, which is not limited in this application.
The above description is only exemplary of the application and should not be taken as limiting the application, and any modifications, equivalents, improvements and the like that are made within the spirit and principle of the application should be included in the protection scope of the application.
Claims (12)
1. A method for processing a data file, the method comprising:
acquiring a data file and a file type of the data file, wherein the data file comprises at least one data;
analyzing the data file by adopting an analysis mode corresponding to the file type, and determining at least one root node corresponding to the data file, at least one child node corresponding to each root node and a node connection sequence corresponding to the data file;
generating a data link corresponding to the data file according to the at least one root node, the at least one child node corresponding to each root node and the node connection sequence;
storing data in the data file in the form of the data link.
2. The method of claim 1, wherein the data file includes at least one data group, and one data group includes at least one data;
the analyzing the data file by adopting the analyzing mode corresponding to the file type, determining at least one root node corresponding to the data file, at least one child node corresponding to each root node, and a node connection sequence corresponding to the data file, includes:
analyzing the data file by adopting an analysis mode corresponding to the file type, and determining data respectively stored in each data group in the data file and a data storage sequence respectively corresponding to each data group;
regarding a target data group in the at least one data group, according to a data storage sequence corresponding to the target data group, taking data with the most front storage sequence as first data;
taking the first data as a first root node;
determining other data with a storage sequence behind the first data as a child node corresponding to the first root node according to a data storage sequence corresponding to the target data group;
and determining the connection sequence of each child node according to the storage sequence of the other data in the target data group.
3. The method according to claim 2, wherein the generating, according to the at least one root node, the at least one child node corresponding to each root node, and the node connection order, the data link corresponding to the data file comprises:
generating a data sub-link corresponding to the target data group according to the first root node, the child nodes corresponding to the first root node and the connection sequence of each child node;
and splicing the first root nodes in the data sub-links corresponding to the data groups respectively to generate the data links corresponding to the data files.
4. The method of claim 1, wherein the data file includes at least one data group, and one data group includes at least one data;
the analyzing the data file by adopting the analyzing mode corresponding to the file type, determining at least one root node corresponding to the data file, at least one child node corresponding to each root node, and a node connection sequence corresponding to the data file, includes:
analyzing the data file by adopting an analysis mode corresponding to the file type, and determining the corresponding relation between the data and the data category corresponding to each data group in the data file and the data storage sequence corresponding to each data group;
for a target data group in the at least one data group, determining the data type as a first root node according to the corresponding relation between the data corresponding to the target data group and the data type, and determining the data corresponding to the data type as a child node corresponding to the first root node;
and determining the connection sequence between the first root nodes according to the data storage sequence corresponding to the target data group.
5. The method according to claim 4, wherein the generating, according to the at least one root node, the at least one child node corresponding to each root node, and the node connection order, the data link corresponding to the data file includes:
determining a data sublink corresponding to the target data group according to the first root node, a subnode corresponding to the first root node and a connection sequence among the first root nodes;
and splicing the data sub-links corresponding to the data groups belonging to the same data group category based on the data group categories to which the data groups belong respectively, and generating the data links corresponding to the data files.
6. The method according to claim 5, wherein the generating the data link corresponding to the data file by splicing the data sublinks corresponding to the data groups belonging to the same data group category based on the data group categories to which the respective data groups belong comprises:
and connecting the first root node in the data sublink corresponding to the data group belonging to the same data group category to the second root node by taking the data group category as the second root node.
7. The method of claim 1, wherein storing the data in the data file in the form of the data link comprises:
determining a storage location of the data link in a database based on a second root node in the data link; the data file comprises at least one data group, one data group comprises at least one data, and the second root node is used for indicating the data group category in the at least one data group; storing data in the data file in the form of the data link at the storage location;
or,
determining the storage position of the data link in a database based on the data file identification corresponding to the data link; storing data in the data file in the form of the data link at the storage location.
8. The method of claim 7, wherein determining the storage location of the data link in the database based on a second root node of the data link comprises:
acquiring a related root node corresponding to the second root node from the database;
determining a storage location of the data link in the database based on the location of the associated root node in the database;
the determining the storage location of the data link in the database based on the data file identifier corresponding to the data link includes:
acquiring an associated file identifier corresponding to the data file identifier from the database;
and determining the storage position of the data link corresponding to the data file identifier in the database based on the position of the data link corresponding to the associated file identifier in the database.
9. The method according to any one of claims 1 to 8, further comprising:
under the condition of receiving a data acquisition request, acquiring a data link corresponding to acquisition identification information from the database based on the acquisition identification information included in the data acquisition request;
generating data feedback information corresponding to the data acquisition request according to the data link corresponding to the acquisition identification information;
sending the data feedback information;
the acquiring the data link corresponding to the acquiring identification information from the database based on the acquiring identification information included in the data acquiring request includes:
the obtained identification information comprises a target second root node, and a data link corresponding to the target second root node is obtained based on the target second root node traversing second root nodes contained in the database;
or,
the obtaining identification information comprises a data file identification, and based on the data file identification, a data link corresponding to the data file identification is obtained from the database.
10. An apparatus for processing a data file, the apparatus comprising:
the file acquisition module is used for acquiring a data file and the file type of the data file, wherein the data file comprises at least one data;
the file analysis module is used for analyzing the data file by adopting an analysis mode corresponding to the file type, determining at least one root node corresponding to the data file, at least one child node corresponding to each root node and a node connection sequence corresponding to the data file;
a link generation module, configured to generate a data link corresponding to the data file according to the at least one root node, the at least one child node corresponding to each root node, and the node connection order;
and the data storage module is used for storing the data in the data file in the form of the data link.
11. A computer device comprising a processor and a memory, wherein at least one program is stored in the memory, and wherein the at least one program is loaded and executed by the processor to implement the method of processing a data file according to any one of claims 1 to 9.
12. A computer-readable storage medium, in which at least one program is stored, the at least one program being loaded and executed by a processor to implement the method of processing a data file according to any one of claims 1 to 9.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202211160132.1A CN115495015A (en) | 2022-09-22 | 2022-09-22 | Data file processing method, device, equipment and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202211160132.1A CN115495015A (en) | 2022-09-22 | 2022-09-22 | Data file processing method, device, equipment and storage medium |
Publications (1)
Publication Number | Publication Date |
---|---|
CN115495015A true CN115495015A (en) | 2022-12-20 |
Family
ID=84471307
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202211160132.1A Pending CN115495015A (en) | 2022-09-22 | 2022-09-22 | Data file processing method, device, equipment and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN115495015A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2024217453A1 (en) * | 2023-04-20 | 2024-10-24 | 华为技术有限公司 | Distributed data storage method and controller |
-
2022
- 2022-09-22 CN CN202211160132.1A patent/CN115495015A/en active Pending
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2024217453A1 (en) * | 2023-04-20 | 2024-10-24 | 华为技术有限公司 | Distributed data storage method and controller |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR102575120B1 (en) | Computer-implemented systems and methods for linking a blockchain to a set of digital twins | |
US9137288B2 (en) | Scalable push-based architecture for web applications | |
CN110032575A (en) | Data query method, apparatus, equipment and storage medium | |
CN111683066B (en) | Heterogeneous system integration method, heterogeneous system integration device, computer equipment and storage medium | |
CN114500690B (en) | Interface data processing method and device, electronic equipment and storage medium | |
CN112860777B (en) | Data processing method, device and equipment | |
WO2022083436A1 (en) | Data processing method and apparatus, and device and readable storage medium | |
CN111090385A (en) | Data management method and device based on block chain | |
CN113315811A (en) | Identifier analysis method and device based on alliance block chain, storage medium and server | |
CN113901131A (en) | Index-based on-chain data query method and device | |
CN115495015A (en) | Data file processing method, device, equipment and storage medium | |
CN113792008A (en) | Method and device for acquiring network topology structure, electronic equipment and storage medium | |
CN111274004B (en) | Process instance management method and device and computer storage medium | |
CN115016784B (en) | Low code application multiplexing method, application analysis system, equipment and storage medium | |
CN114168149A (en) | Data conversion method and device | |
CN112035413A (en) | Metadata information query method and device and storage medium | |
CN111552715A (en) | User query method and device | |
CN116991929A (en) | Micro-service system based on big hospital data | |
CN113590348B (en) | Parameter transmission method, device, equipment and medium based on tree structure | |
US20120078841A1 (en) | Information generating device, information generating method, and computer readable recording medium | |
CN109766388B (en) | Method and system for storing data into HBase | |
CN113704486A (en) | Map data construction method and device and map data query method and device | |
CN115051979B (en) | Monitoring data debugging system, method, vehicle and computer readable storage medium | |
CN113764074B (en) | Image processing method and device, computer equipment and storage medium | |
US20240241869A1 (en) | Data ingestion and cleansing tool |
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 |