CN111444254A - SK L system file format conversion method and system - Google Patents
SK L system file format conversion method and system Download PDFInfo
- Publication number
- CN111444254A CN111444254A CN202010235913.7A CN202010235913A CN111444254A CN 111444254 A CN111444254 A CN 111444254A CN 202010235913 A CN202010235913 A CN 202010235913A CN 111444254 A CN111444254 A CN 111444254A
- Authority
- CN
- China
- Prior art keywords
- file
- format
- data
- original
- tree
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/258—Data format conversion from or to a database
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a file format conversion method and a file format conversion system for an SK L system, which comprises the following steps of S1, judging whether the format of an original file meets the requirements, if not, entering S2, S2, arranging data in the original file into a tree-shaped relation graph, S3, generating an original format file template and a converted format file template, respectively establishing a first corresponding relation and a second corresponding relation in the tree-shaped relation graph, S4, generating a third corresponding relation between a data position in the original format file template and a data position in the converted format file template according to the first corresponding relation and the second corresponding relation, S5, converting the original file into the original format file template, converting the original file into a file meeting the requirements of the SK L system format according to the corresponding relation, automatically converting the file format into a file in the SK L system format by introducing a common analysis conversion module, thereby being convenient, reliable, high in accuracy and reducing the cost of manual conversion.
Description
Technical Field
The invention relates to a method and a system for converting a file format of an SK L system, and belongs to the technical field of Internet.
Background
The data access and management system (SK L system) is an automatic analysis import system, which can automatically identify files and import data into a distributed database through certain rule analysis, but in the existing SK L system, only files in a specific format can be identified, and file import in other formats is not supported.
Disclosure of Invention
Aiming at the defects of the prior art, the invention aims to provide a file format conversion method and a file format conversion system for an SK L system, which automatically and quickly convert an original file format into a file with a format recognizable by the SK L system by establishing a corresponding relation between the original file format and the converted file format, only needs to establish a tree-like relation chart once when establishing the corresponding relation, and is convenient, reliable and high in accuracy.
The invention provides a file format conversion method of an SK L system, which comprises the following steps of S1, judging whether the format of an original file meets the requirements of an SK L system, if not, entering S2 of the SK L system, S2, arranging data in the original file into a tree-like relation graph, S3, generating an original format file template and a converted format file template, respectively establishing a first corresponding relation and a second corresponding relation between the original format file template and the converted format file template and the tree-like relation graph, S4, generating a third corresponding relation between the data position in the original format file template and the data position in the converted format file template according to the first corresponding relation and the second corresponding relation, S5, converting the original file into the original format file template, and converting the original file into a file meeting the requirements of the SK L system format according to the third corresponding relation.
Further, the process of arranging the data in the original file into the tree relation graph is as follows: s2.1, acquiring data, wherein each data comprises two codes, one code is a first code representing the data, and the other code is a second code representing the data of the previous level; s2.2, sorting all data according to the size of the first codes, dividing the data with the same second codes into a group, dividing the data with the different second codes from other data into a group, recording the second codes corresponding to each group, and sorting according to the size; and S2.3, comparing the recorded second code with the first code, if the first code of certain data is the same as the recorded second code, the data is the upper-level data of a group corresponding to the second code, if the first code is not the same as the recorded second code, the data corresponding to the second code is taken as the first-level data, and a tree-like relation graph is established according to the upper-level and lower-level relation between the data.
Further, another method for arranging the data in the original file into the tree relation graph is as follows: s3.1, dividing the original file into a plurality of data nodes and distinguishing first-level nodes; s3.2, distinguishing the child nodes of one first-level node through a regular expression to obtain a node tree of the first-level node; s3.3, traversing all first-level nodes in the original file, and obtaining node trees corresponding to all the first-level nodes; s3.4, generating a complete node tree comprising all nodes to form a tree-like relation graph.
Further, the method for obtaining the node tree of the first level node in step S3.2 is as follows: s3.2.1 dividing the child nodes into self-closing child nodes and non-self-closing child nodes; s3.2.2, carrying out recursive screening on all child nodes, and judging whether the child nodes are self-closing child nodes, if so, skipping, otherwise, entering the next step; s3.2.3, carrying out recursive screening on all non-self-closing child nodes, if a non-self-closing child node is captured, carrying out recursive screening on the next child node in the index, if a self-closing child node is captured, carrying out recursive screening on the previous child node in the index until the index is 0; s3.2.4, the relation information of the searched child nodes is put into a Map set with the node name of key and the node value of value, and is presented in the form of the Map set.
Further, the method for judging whether the child node is a self-closing child node comprises the following steps: marking identifiers after self-closing child nodes, and when recursive screening is carried out, if the identifiers appear, the corresponding child nodes are self-closing child nodes; and for the non-self-closing child node, recording the position of the non-self-closing child node and the position of the self-closing child node corresponding to the non-self-closing child node.
Further, the identifier includes a space, a semicolon, a comma, a pause, a vertical line, a diagonal line, or an asterisk.
Further, before step S3.2, the loaded original file needs to pass through a cleaning module, and special characters in the original file are filtered out.
Further, the first corresponding relation is the corresponding relation between the position of the data in the original file and the position in the tree relation graph; the second corresponding relation is the corresponding relation between the position of the data in the converted file and the position in the tree-like relation graph, and a third corresponding relation between the position of the data in the original file and the position in the converted file is established according to the first corresponding relation and the second corresponding relation.
Further, the original file format is XM L format, and the file in the format that the SK L system can recognize is txt format file or CSV format file.
The invention also discloses an SK L system file format conversion system which comprises a judging module, a tree relation module, a corresponding relation module and an output module, wherein the judging module is used for judging whether the format of an original file meets the requirements of an SK L system, if the format of the original file does not meet the requirements of the SK L system, the tree relation module is used for arranging data in the original file into a tree relation graph, the corresponding relation module is used for generating an original format file template and a converted format file template, respectively establishing a first corresponding relation and a second corresponding relation between the original format file template and the converted format file template and the tree relation graph, generating a third corresponding relation between the data position in the original format file template and the data position in the converted format file template according to the first corresponding relation and the second corresponding relation, and the output module is used for converting the original file into the original format file template and converting the original file into a file meeting the requirements of the SK L system format according to the corresponding relation.
By adopting the technical scheme, the invention has the advantages that the scheme automatically converts the common file format into the file with the format recognizable by the SK L system by introducing the analysis conversion module, is convenient, reliable and high in accuracy, improves the format conversion efficiency and reduces the manual conversion cost.
Drawings
FIG. 1 is a flowchart of a file format conversion method of SK L system according to an embodiment of the invention;
FIG. 2 is a flowchart of a method for arranging original document data into a tree diagram according to an embodiment of the present invention;
FIG. 3 is a flowchart of a method for arranging original document data into a tree diagram according to another embodiment of the present invention;
fig. 4 is a flowchart of the file format conversion system of the SK L system in an embodiment of the invention.
Detailed Description
The present invention is described in detail by way of specific embodiments in order to better understand the technical direction of the present invention for those skilled in the art. It should be understood, however, that the detailed description is provided for a better understanding of the invention only and that they should not be taken as limiting the invention. In describing the present invention, it is to be understood that the terminology used is for the purpose of description only and is not intended to be indicative or implied of relative importance.
Example one
An SK L system file format conversion method, as shown in fig. 1, includes the following steps:
s1, the original file comprises a txt format file and an XM L format file, whether the format of the original file meets the requirements of an SK L system is judged, if the original file is txt, the original file is directly output without conversion, and if the original file does not meet the requirements of the SK L system, the original file enters S2.
And S2, arranging the data in the original file into a tree-like relational graph. As shown in fig. 2, the process of arranging the data in the original file into the tree relationship diagram is as follows:
s2.1 acquiring data, wherein each data comprises two codes, one code is a first code representing the data, and the other code is a second code representing the data at the upper level. For example, for the first level data, the first code is 1 and the second code is 0; for the second level data, the first encoding is 11, the second encoding is 1, and so on.
S2.2, sorting all the data according to the size of the first codes, dividing the data with the same second codes into a group, dividing the data with the different second codes from other data into a group, recording the second codes corresponding to each group, and sorting according to the size.
And S2.3, comparing the recorded second code with the first code, if the first code of certain data is the same as the recorded second code, the data is the upper-level data of a group corresponding to the second code, if the first code is not the same as the recorded second code, the data corresponding to the second code is taken as the first-level data, and a tree-like relation graph is established according to the upper-level and lower-level relation between the data. If the recorded second code is 11, when traversing data, if the first code of a certain data is 11, the data is the previous level data of the group corresponding to the second code 11, that is, the data is the parent level data of the group corresponding to the second code 11, and the data of the group corresponding to the second code 11 is the child level data of the data.
Each level of data in the file may be identified by a different identifier, including but not limited to a space, semicolon, comma, pause, vertical line, diagonal line, or asterisk.
And S3, generating an original format file template and a converted format file template, and respectively establishing a first corresponding relation and a second corresponding relation between the original format file template and the converted format file template and the tree-like relation graph. The first corresponding relation is the corresponding relation between the position of the data in the original file and the position in the tree relation graph; the second corresponding relation is the corresponding relation between the position of the data in the converted file and the position in the tree-like relation graph, and a third corresponding relation between the position of the data in the original file and the position in the converted file is established according to the first corresponding relation and the second corresponding relation.
S4, generating a third corresponding relation between the data position in the original format file template and the data position in the converted format file template according to the first corresponding relation and the second corresponding relation;
and S5, converting the original file into an original format file template, and converting the original file into a file meeting the format requirement of an SK L system according to the corresponding relation.
According to the scheme of the embodiment, the corresponding relation between the original file template and the converted template is established, so that the tree-shaped data graph is established only for generating the corresponding relation when the converted file is converted for the first time, and when the file format is converted later, the original file template is generated only by adjusting the position of the original file, and the converted file is generated directly according to the corresponding relation.
Example two
The technical solution in this embodiment is basically the same as that in the first embodiment, except that:
as shown in fig. 3, the method for arranging the data in the original file into the tree-like relationship diagram includes:
and (4) filtering the special characters in the original file by the cleaning module.
S3.1, dividing the original file into a plurality of data nodes and distinguishing first-level nodes.
S3.2, distinguishing the child nodes of one first-level node through a regular expression to obtain a node tree of the first-level node;
the method for obtaining the node tree of the first-level node comprises the following steps:
s3.2.1 dividing the child nodes into self-closing child nodes and non-self-closing child nodes;
s3.2.2, carrying out recursive screening on all child nodes, and judging whether the child nodes are self-closing child nodes, if so, skipping, otherwise, entering the next step; the method for judging whether the child node is the self-closing child node comprises the following steps: marking identifiers after self-closing child nodes, and when recursive screening is carried out, if the identifiers appear, the corresponding child nodes are self-closing child nodes; and for the non-self-closing child node, recording the position of the non-self-closing child node and the position of the self-closing child node corresponding to the non-self-closing child node.
S3.2.3, carrying out recursive screening on all non-self-closing child nodes, if a non-self-closing child node is captured, carrying out recursive screening on the next child node in the index, if a self-closing child node is captured, carrying out recursive screening on the previous child node in the index until the index is 0;
s3.2.4, the relation information of the searched child nodes is put into a Map set with the node name of key and the node value of value, and is presented in the form of the Map set.
S3.3, traversing all first-level nodes in the original file, and obtaining node trees corresponding to all the first-level nodes;
s3.4, generating a complete node tree comprising all nodes to form a tree-like relation graph.
The identifier includes a space, semicolon, comma, pause, vertical line, diagonal line, or asterisk.
EXAMPLE III
Based on the same inventive concept, the present embodiment discloses a file format conversion system of SK L system, as shown in fig. 4, including:
the judging module is used for judging whether the format of the original file meets the requirement of an SK L system, and if not, the original file enters the tree relation module in accordance with the SK L system;
the tree relation module is used for arranging the data in the original file into a tree relation graph;
the analysis conversion module is used for generating an original format file template and a converted format file template and respectively establishing a first corresponding relation and a second corresponding relation between the original format file template and the converted format file template and a tree-like relation graph; generating a third corresponding relation between the data position in the original format file template and the data position in the converted format file template according to the first corresponding relation and the second corresponding relation;
and the output module is used for converting the original file into an original format file template and converting the original file into a file meeting the SK L system format requirement according to the corresponding relation.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. An SK L system file format conversion method is characterized by comprising the following steps:
s1, judging whether the format of the original file meets the requirements of an SK L system, and if not, entering S2 if the format of the original file does not meet the requirements of the SK L system;
s2, arranging data in the original file into a tree-like relational graph;
s3, generating an original format file template and a converted format file template, and respectively establishing a first corresponding relation and a second corresponding relation between the original format file template and the converted format file template and the tree-like relation graph;
s4, generating a third corresponding relation between the data position in the original format file template and the data position in the converted format file template according to the first corresponding relation and the second corresponding relation;
and S5, converting the original file into the original format file template, and converting the original file into a file meeting the format requirement of an SK L system according to the corresponding relation.
2. The file format conversion method of SK L system of claim 1, wherein the process of arranging data in the original file into a tree relation graph is:
s2.1, acquiring data, wherein each data comprises two codes, one code is a first code representing the data, and the other code is a second code representing the data of the previous level;
s2.2, sorting all the data according to the size of the first codes, dividing the data with the same second codes into a group, dividing the data with the different second codes from other data into a group, recording the second codes corresponding to each group, and sorting according to the size;
s2.3, the recorded second codes are compared with the first codes, if the first codes of certain data are the same as the recorded second codes, the data are the upper-level data of a group corresponding to the second codes, if the first codes of the certain data are not the same as the recorded second codes, the data corresponding to the second codes are used as the first-level data, and a tree-like relation graph is established according to the upper-lower level relation between the data.
3. The method for converting file format of SK L system of claim 1, wherein the other method for arranging data in the original file into tree relation graph is:
s3.1, dividing the original file into a plurality of data nodes and distinguishing first-level nodes;
s3.2, distinguishing the child node of one of the first-level nodes through a regular expression to obtain a node tree of the first-level node;
s3.3, traversing all first-level nodes in the original file, and obtaining node trees corresponding to all the first-level nodes;
s3.4, generating a complete node tree comprising all nodes to form a tree-like relation graph.
4. A method for file format conversion in the SK L system according to claim 3, wherein the method for obtaining the node tree of the first level node in step S3.2 is:
s3.2.1 dividing the child nodes into self-closing child nodes and non-self-closing child nodes;
s3.2.2, carrying out recursive screening on all child nodes, and judging whether the child nodes are self-closing child nodes, if so, skipping, otherwise, entering the next step;
s3.2.3, carrying out recursive screening on all non-self-closing child nodes, if a non-self-closing child node is captured, carrying out recursive screening on the next child node in the index, if a self-closing child node is captured, carrying out recursive screening on the previous child node in the index until the index is 0;
s3.2.4, the relation information of the searched child nodes is put into a Map set with the node name of key and the node value of value, and is presented in the form of the Map set.
5. The SK L system file format conversion method of claim 4, wherein the method for determining whether a child node is a self-closing child node comprises marking an identifier after the self-closing child node, when recursive filtering is performed, if the identifier appears, the corresponding child node is a self-closing child node, and for a non-self-closing child node, recording the position of the non-self-closing child node and the position of the self-closing child node corresponding to the non-self-closing child node.
6. The SK L system file format conversion method of claim 5, wherein the identifier includes a space, a semicolon, a comma, a pause, a vertical bar, a diagonal line, or an asterisk.
7. The method of converting file format of SK L system of claim 4, wherein the loaded original file needs to pass through a cleaning module before performing step S3.2, so as to filter out special characters in the original file.
8. The SK L system file format conversion method according to any one of claims 1-7, wherein the first correspondence is a correspondence between a position of data in an original file and a position in the tree-like relationship diagram, the second correspondence is a correspondence between a position of data in a converted file and a position in the tree-like relationship diagram, and a third correspondence between a position of data in an original file and a position in a converted file is established according to the first correspondence and the second correspondence.
9. The SK L system file format conversion method as claimed in any one of claims 1-7, wherein the original file format is XM L format, and the file in the format recognizable by the SK L system is txt format file or CSV format file.
10. An SK L system file format conversion system, comprising:
the judging module is used for judging whether the format of the original file meets the requirement of an SK L system, and if not, the original file enters the tree relation module in accordance with the SK L system;
the tree relation module is used for arranging the data in the original file into a tree relation graph;
the analysis conversion module is used for generating an original format file template and a converted format file template and respectively establishing a first corresponding relation and a second corresponding relation between the original format file template and the converted format file template and the tree-like relation graph; generating a third corresponding relation between the data position in the original format file template and the data position in the converted format file template according to the first corresponding relation and the second corresponding relation;
and the output module is used for converting the original file into the original format file template and converting the original file into a file meeting the SK L system format requirement according to the corresponding relation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010235913.7A CN111444254B (en) | 2020-03-30 | 2020-03-30 | SKL system file format conversion method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010235913.7A CN111444254B (en) | 2020-03-30 | 2020-03-30 | SKL system file format conversion method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111444254A true CN111444254A (en) | 2020-07-24 |
| CN111444254B CN111444254B (en) | 2023-03-28 |
Family
ID=71649218
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010235913.7A Active CN111444254B (en) | 2020-03-30 | 2020-03-30 | SKL system file format conversion method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111444254B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112861508A (en) * | 2021-01-12 | 2021-05-28 | 中国石油天然气集团有限公司 | Standardization method and system for logging discrete data |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005111824A2 (en) * | 2004-05-19 | 2005-11-24 | Silverkite Inc. | Method and system for processing of text content |
| US20090254812A1 (en) * | 2008-04-03 | 2009-10-08 | Xerox Corporation | Sgml document validation using xml-based technologies |
| CN103559321A (en) * | 2013-11-22 | 2014-02-05 | 方正国际软件有限公司 | Document format conversion system |
| CN109121436A (en) * | 2015-11-25 | 2019-01-01 | 蒂米菲尔股份有限公司 | Augmentation, exploration and Maintenance Significant Items method layered |
| US20190121880A1 (en) * | 2017-10-20 | 2019-04-25 | Hewlett Packard Enterprise Development Lp | ENCODING OF DATA FORMATTED in HUMAN-READABLE TEXT ACCORDING TO SCHEMA INTO BINARY |
| CN110933077A (en) * | 2019-11-29 | 2020-03-27 | 深圳市风云实业有限公司 | Message parsing system and method |
-
2020
- 2020-03-30 CN CN202010235913.7A patent/CN111444254B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005111824A2 (en) * | 2004-05-19 | 2005-11-24 | Silverkite Inc. | Method and system for processing of text content |
| US20090254812A1 (en) * | 2008-04-03 | 2009-10-08 | Xerox Corporation | Sgml document validation using xml-based technologies |
| CN103559321A (en) * | 2013-11-22 | 2014-02-05 | 方正国际软件有限公司 | Document format conversion system |
| CN109121436A (en) * | 2015-11-25 | 2019-01-01 | 蒂米菲尔股份有限公司 | Augmentation, exploration and Maintenance Significant Items method layered |
| US20190121880A1 (en) * | 2017-10-20 | 2019-04-25 | Hewlett Packard Enterprise Development Lp | ENCODING OF DATA FORMATTED in HUMAN-READABLE TEXT ACCORDING TO SCHEMA INTO BINARY |
| CN110933077A (en) * | 2019-11-29 | 2020-03-27 | 深圳市风云实业有限公司 | Message parsing system and method |
Non-Patent Citations (1)
| Title |
|---|
| XIAOYONG SUN: "《Blind modulation format identification using decision tree twin support vector machine in optical communication system》", 《ELSEVIER-OPTICS COMMUNICATIONS》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112861508A (en) * | 2021-01-12 | 2021-05-28 | 中国石油天然气集团有限公司 | Standardization method and system for logging discrete data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111444254B (en) | 2023-03-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109684374B (en) | Method and device for extracting key value pairs of time series data | |
| CN102156740A (en) | SQL (structured query language) statement processing method and system | |
| CN116415206B (en) | Operator multiple data fusion method, system, electronic equipment and computer storage medium | |
| CN104618132A (en) | Generation method and generation device for application program recognition rule | |
| CN113704094A (en) | Test case knowledge base construction method and device, electronic equipment and storage medium | |
| CN113110995A (en) | System migration test method and device | |
| CN113254572B (en) | Electronic document classification supervision system based on cloud platform | |
| CN111444254B (en) | SKL system file format conversion method and system | |
| CN114398315A (en) | Data storage method, system, storage medium and electronic equipment | |
| CN114885334A (en) | High-concurrency short message processing method | |
| CN103856365B (en) | Client terminal access device automatic test approach and system | |
| CN114500676A (en) | Information interaction method and device among industrial internet devices and storage medium | |
| CN105677723A (en) | Method for establishing and searching data labels for industrial signal source | |
| CN111221967A (en) | Language data classification storage system based on block chain architecture | |
| CN111917861A (en) | Knowledge storage method and system based on block chain and knowledge graph and application thereof | |
| CN110019228B (en) | Multi-source data integration method and device based on fan data | |
| CN116302089A (en) | Picture similarity-based code clone detection method, system and storage medium | |
| CN115309705A (en) | Data integration classification system and method for automatically identifying basic data elements of urban information model platform | |
| CN105868220B (en) | Data processing method and device | |
| CN113849413A (en) | Code rule checking method and system based on knowledge base feature matching | |
| CN112256802A (en) | Automatic acquisition method and equipment for marine microorganism information | |
| CN112784135A (en) | Webpage information identification system | |
| CN111198879A (en) | Intelligent community-based business data storage method and system | |
| CN111352824A (en) | Test method and device and computer equipment | |
| CN112686029B (en) | SQL new statement identification method and device for database audit system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 301, 3rd Floor, Building F, Zhizao Street, Zhongguancun, No. 45 Chengfu Road, Haidian District, Beijing, 100080 Patentee after: Beijing Dongfang Jinxin Technology Co.,Ltd. Address before: 2917, Floor 25, No. 19, Madian East Road, Haidian District, Beijing, 100088 Patentee before: Beijing Dongfang Jinxin Technology Co.,Ltd. |
|
| CP03 | Change of name, title or address |