CN117874307A

CN117874307A - Engineering data field identification method and device, electronic equipment and storage medium

Info

Publication number: CN117874307A
Application number: CN202410275642.6A
Authority: CN
Inventors: 郁文斌; 徐昱; 邱兆阳; 程露竹
Original assignee: CRSC Research and Design Institute Group Co Ltd
Current assignee: CRSC Research and Design Institute Group Co Ltd
Priority date: 2024-03-12
Filing date: 2024-03-12
Publication date: 2024-04-12
Anticipated expiration: 2044-03-12

Abstract

The invention discloses a method, a device, electronic equipment and a storage medium for identifying engineering data fields, and relates to the technical field of high-speed rail data processing, wherein the method comprises the following steps: matching a target data source file according to the data source keywords; determining a target field position in the target data source file according to a preset level keyword; and merging the positions of the target fields corresponding to the preset level keywords to be identification areas. The embodiment of the invention realizes a general processing method of engineering data sources, can realize automatic matching identification of field data, can improve the positioning precision of the field data, can enhance the data processing efficiency and can improve the automation degree of high-speed rail signal train control engineering data processing.

Description

Engineering data field identification method and device, electronic equipment and storage medium

Technical Field

The present invention relates to the field of high-speed rail data processing technologies, and in particular, to a method and apparatus for identifying an engineering data field, an electronic device, and a storage medium.

Background

At present, logic processing of high-speed railway signal software is based on engineering data, and functional correctness is represented through a scene of engineering data realization, so that the engineering data is a basis of a functional expression form of the engineering data, and data related to signals in railway engineering are huge and complex, and therefore, the engineering design data processing in the industry aims at accuracy and simultaneously improves automation level, so that the generation efficiency is improved.

In the production process of signal equipment manufacturers, the finally delivered signal software is divided into two parts of applied basic software and engineering data, wherein the engineering data can be compiled together or can be independently read by the basic software after being encrypted as a configuration file. In either way, however, the delivery of engineering data must be handled after review and validation of the data provided by the design entity. Currently, the column control data is completely dataized, can be provided by a design unit in an electronic form, and has standardized and normalized standards. The design unit can process and convert the normalized electronic engineering data into a data form required by basic software according to an engineering audit scheme. The method is an important link in the production of equipment, so that equipment manufacturers are required to develop corresponding software and assist in manually processing the data sources, different attributes are required to be established according to data in the data reading process, and classification of the attributes is identified by data fields, so that massive engineering data fields are required to be identified, and an intelligent engineering data processing method is required to improve the identification efficiency of engineering data resources.

Disclosure of Invention

The invention provides an engineering data field identification method, an engineering data field identification device, electronic equipment and a storage medium, so as to realize a general processing method of an engineering data source, realize automatic matching of field data, realize accurate positioning of the field data, improve data processing efficiency and improve automation degree of field identification.

According to an aspect of the present invention, there is provided an engineering data field identifying method, wherein the method includes:

matching a target data source file according to the data source keywords;

determining a target field position in the target data source file according to a preset level keyword;

and merging the positions of the target fields corresponding to the preset level keywords to be identification areas.

According to another aspect of the present invention, there is provided an engineering data field identifying apparatus, wherein the apparatus includes:

the file matching module is used for matching the target data source file according to the data source keywords;

the field searching module is used for determining a target field position in the target data source file according to a preset level keyword;

and the region merging module is used for merging the positions of the target fields corresponding to the preset level keywords into an identification region.

According to another aspect of the present invention, there is provided an electronic apparatus including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the engineering data field identification method of any one of the embodiments of the present invention.

According to another aspect of the present invention, there is provided a computer readable storage medium storing computer instructions for causing a processor to implement the engineering data field identifying method according to any embodiment of the present invention.

According to the technical scheme provided by the embodiment of the invention, the target data source file is obtained through the data source keywords, the target field positions are determined in the target data source file according to the preset level keywords, and different target field positions are combined into the identification area, so that the identification of the target field in the data source file is realized, the speed of locating the target field is improved, and the data processing efficiency and the automation degree of data processing can be improved.

It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the invention or to delineate the scope of the invention. Other features of the present invention will become apparent from the description that follows.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1 is a flow chart of a method for identifying engineering data fields according to a first embodiment of the present invention;

FIG. 2 is a schematic diagram of a structure of a target data source file according to a first embodiment of the present invention;

FIG. 3 is a flow chart of a method for identifying engineering data fields according to a second embodiment of the present invention;

FIG. 4 is a flow chart of another method for identifying engineering data fields according to a third embodiment of the present invention;

FIG. 5 is a schematic diagram of an engineering data matching process according to a fourth embodiment of the present invention;

FIG. 6 is a schematic diagram of the structure of a source content of engineering data according to a fourth embodiment of the present invention;

FIG. 7 is an exemplary diagram of an automatic engineering data identification method according to a fourth embodiment of the present invention;

FIG. 8 is a schematic diagram of a field location according to a fourth embodiment of the present invention;

FIG. 9 is a diagram of field location according to a fourth embodiment of the present invention;

fig. 10 is a schematic structural diagram of an engineering data field identifying apparatus according to a fifth embodiment of the present invention;

fig. 11 is a schematic structural diagram of an electronic device implementing the engineering data field identification method according to an embodiment of the present invention.

Detailed Description

In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.

It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Example 1

Fig. 1 is a flowchart of a method for identifying engineering data fields according to an embodiment of the present invention, where the method may be implemented by an engineering data field identifying device, and the engineering data field identifying device may be implemented in hardware and/or software, and the device may be configured in a server or a terminal. As shown in fig. 1, the method includes:

Step 110, matching the target data source file according to the data source keywords.

The data source keywords may be keywords identifying a data source, the data source keywords may be preconfigured or input by a user, the data source keywords may include file names, line information, project engineering information, site information, file carrier information, or the like, the target data source files may be files to be subjected to field identification, the target data source files may be one or more of column control data files, file forms of the target data files may not be limited, and for example, the target data files may be EXCEL files, database files, HTML files, or the like.

In the embodiment of the invention, the data source keyword can be acquired, the data source keyword can be information representing a file source file, the data source keyword can be input by a user or preconfigured, or can be dynamically determined according to a preset algorithm, and the corresponding target data source file can be searched according to the data source keyword.

And 120, determining the position of a target field in the target data source file according to the preset level keyword.

The preset level keywords may be a set of keywords having a level relationship, each preset level keyword may be composed of a plurality of keywords, the plurality of keywords may be located in different levels, and each level in the preset level keywords may have one or more keywords, and illustratively, the preset level keywords may be [ initial signal: name, display ], wherein the originating signal may be a first level keyword of a preset level keyword, and the name and display may be a second level keyword of the preset level keyword. The target field location may be a location of a target field in the target data source file that matches by a preset level key, and the target field location may be determined by a distance from an upper left corner and a lower right corner of the target data source file.

In the embodiment of the invention, the preset level keywords can be acquired, the preset level keywords can be pre-configured or automatically generated by capturing the data source file, the target field position can be determined in the target data source file in a mode of matching the preset level keywords, the matching can comprise that the hierarchical relationship of the target fields in the target data source file is the same as the hierarchical structure of the preset level keywords, and the target fields have keywords matched with the preset level keywords.

And step 130, merging the positions of the target fields into the identification area.

The identification area may be an area for processing the target field, and the identification area may be generated by combining at least one target field position.

In the embodiment of the present invention, one or more target field positions to which each preset level keyword is matched may be determined, one or more corresponding target field positions may be combined for each preset level keyword, and the combined region may be used as an identification region corresponding to the preset level keyword.

According to the embodiment of the invention, the target data source file is obtained through the data source keywords, the target field positions are determined in the target data source file according to the preset level keywords, and different target field positions are combined into the identification area, so that the identification of the target field in the data source file is realized, the speed of locating the target field is improved, and the data processing efficiency and the automation degree of data processing can be improved.

Further, on the basis of the above-mentioned application embodiment, the target data source file includes at least an identification area and a data area.

In the embodiment of the present invention, the identification area may be a data area within a data file, where the data area may be a data area storing data content within the data file, referring to fig. 2, taking a local approach information table as an example of a target data source file, where the target data source file includes an identification area formed by a header and a data area formed by data content, where an approach type, a start signal, a name, a display, a terminal signal name, a name of a transponder, a transponder group unit number, a link distance, etc., a switch, a line speed, etc., of different data or attribute types may be used as the identification area, and the corresponding data content may be used as the data area.

Example two

Fig. 3 is a flowchart of a method for identifying an engineering data field according to a second embodiment of the present invention, where the embodiment of the present invention is embodied on the basis of the foregoing embodiment of the present invention, and a process for obtaining a target field location according to a preset level keyword is described in detail, with reference to fig. 3, and the method provided by the embodiment of the present invention specifically includes the following steps:

step 210, matching the target data source file according to the data source keyword.

Step 220, receiving a keyword set corresponding to a preset level keyword, wherein keywords of different levels in the preset level keyword are separated by a preset identifier.

Wherein, the keyword set may be a set composed of one or more keywords in each preset level keyword, and keywords in different levels in the keyword set may be separated by preset identifiers, where the preset identifiers may include: ","; symbols of "," & "," | "and the like, for example, keyword set= { a, b, c: e f, which indicates that the keyword set has three levels, the first level having three keywords a, b and c, respectively, the second level having 1 keyword e, and the third level having 1 keyword f.

In the embodiment of the invention, the preset level keywords can exist in the form of configuration files or input information, the keywords in each preset level keyword can be extracted to the corresponding keyword set, and the keywords belonging to different levels are separated by using preset identifiers in each keyword set.

Step 230, searching the target data source file for target fields respectively matched with the hierarchical order of the keyword set and the keywords.

The hierarchical order may be a hierarchical structure of fields within the target data source file, for example, the first attribute field includes a second attribute field and a third attribute field, and the hierarchical order is that the first attribute field is a parent attribute field, and the second attribute field and the third attribute field are child attribute fields.

In the embodiment of the invention, different keyword sets can be used for matching the target data source file, the level order is searched in the target data source file and is the same as the level of the keywords in the keyword sets, and the fields are matched with the target keywords of the keywords, it is understood that the level order matching can comprise the same level number and the same level structure, the target fields are matched with the keyword sets and can comprise a field set in the target data source file, the level number and the level structure of the field set are the same as the keyword sets, and the information of the fields in each level in the field set comprises the keywords in the corresponding level in the keyword sets, and each field in the field set can be used as the target field.

Step 240, extracting the position information of the target field in the target data source file as the target field position.

The location information may be a location parameter reflecting the location of the target field in the target data source file, and the location information may include coordinate information or the number of rows and columns, for example, the location information may be the number of rows and columns of the target field from the upper left corner edge and the lower right corner edge of the target data source file.

In the embodiment of the invention, the position information of each target field in the target data source file can be determined, the position information can be the position coordinate of each target field or the distance information from the edge of the target data source file, and the position information of each target field can be respectively used as the position of the target field.

Step 250, merging the positions of the target fields corresponding to the preset level keywords into the identification area.

According to the embodiment of the invention, the data source keywords are matched with the target data source file, keyword sets corresponding to different preset level keywords are received, the level sequence of the keyword sets and target fields matched with the keywords are searched in the target data source file, the position information of each target field in the target data source file is determined as the target field position, and the corresponding target field positions are combined for each preset level keyword, so that an identification area is generated, field identification in the data source file is realized, the identification area of the field is determined, the data processing efficiency can be improved, and the automation degree of data processing is enhanced.

Further, on the basis of the above embodiment of the present invention, the preset level key at least includes a key corresponding to a file name object level, a tree page name object level, and a tree field name level.

In the embodiment of the invention, the preset level keywords may be composed of keywords of different data structure levels, each level in the preset level keywords may correspond to an abstract level of the column control data, the preset level keywords at least include one or more of keywords of a file name object level, a tree page name object level and a tree field name level, and the file name object level, the tree page name object level and the tree field name level are lowered layer by layer. In some embodiments of the invention, the preset hierarchy keywords may include only keywords of the tree field name hierarchy, or only keywords of the tree page name object hierarchy and the tree field name hierarchy.

In some embodiments of the invention, searching for target fields in the target data source file that match the hierarchical order of the respective keyword sets and the keywords, respectively, includes:

step 2301, dividing keywords in the keyword set according to the preset identifier, generating a keyword list corresponding to each keyword, and initializing a preset stack.

The keyword list may be a list formed by keywords in each keyword set, each keyword in the keyword list may be arranged according to a hierarchy, it may be understood that a preset identifier may be stored in the keyword list to mark a root node of the keyword set, a preset stack may be related information of a target field matched by the temporary keyword, and it may be understood that the target field corresponding to the keyword may also use other storage structures such as a queue, a linked list, and the like to temporarily store related information of the target field matched by the keyword.

In the embodiment of the invention, for each keyword set, the keyword set can be divided into one or more keywords in an atomic form according to a preset identifier, a keyword list comprising each keyword can be generated, the arrangement sequence of the keywords in the keyword list can identify the level of the keywords in the keyword set, after determining the keyword list corresponding to each keyword set, a preset stack can be initialized, and the preset stack can be used for temporarily storing related information of a target field matched with the keywords.

And 2302, extracting the keywords of the top layer as matching keywords, and taking the fields matched with the matching keywords in the target data source file as target fields.

In the embodiment of the invention, the keywords in the top layer in the keyword list can be used as matching keywords in the target data source file for matching searching, and if a field matched with the keywords is found, the field is used as a target field.

Step 2303, determining a matching field area of the target field within the target data source file as an iteration maximum position and determining a field position of the target field within the target data source file.

The matching field area may be a range related to the target field, where the matching field area may include an area where the current target field is located and an area where all fields under the target field are located, and the iteration maximum position may be a maximum area for matching corresponding to a keyword set to which a keyword corresponding to the target field belongs.

In the embodiment of the invention, the matching field area of the target field corresponding to the matching key in the target data file can be determined, the area where the target field is located and the area where all the subfields under the target field are located can be used as the matching field area of the target field, the matching field area can be used as the iteration maximum position, and the position where the target field is located in the target data source file can also be used as the field position.

And 2304, writing the iteration maximum position, the field position and the matching key as field matching results into a preset stack.

In the embodiment of the present invention, the iteration maximum position, the field position and the matching keyword may be recorded as a field matching result of the target field, where the field matching result may be information related to the target field corresponding to the matching keyword, and in other embodiments, the field matching result stored in the preset stack may include, but is not limited to, one or more information of the iteration maximum position, the field position and the matching keyword.

Step 2305, extracting the keywords of the next layer of matching keywords in the keyword list as new matching keywords.

In the embodiment of the invention, if the keyword list has the keyword next to the matching keyword, that is, all keywords in the keyword list are not completely matched, the keyword next to the matching keyword in the keyword list may be used as a new matching keyword, and it is understood that the keyword next to the matching keyword may be the keyword in the sequence of the keyword list located next to the matching keyword.

Step 2306, if the keyword list does not have the keyword of the next layer of matching keywords, determining that the target field of the current keyword set is found, and popping up the field matching result stored in the preset stack.

In the embodiment of the invention, if the keyword in the keyword list is not matched with the next keyword, that is, the keyword in the keyword list is matched with the next keyword, the completion of matching the target field can be determined, and the popped field matching result can be used as the matching output information of the target field. Furthermore, whether all the popped field matching results belong to the maximum iteration position can be judged, and if yes, the field matching results are required to be checked manually.

If the matching key is obtained, a field matching result stored in the last preset stack is popped up, and a field matched with the matching key is searched in an iteration maximum position of the field matching result and used as a target field.

In the embodiment of the invention, after the new matching key is acquired, the last stored field matching result can be acquired from the stack bottom of the preset stack, and the target field matched with the current matching key can be searched in the area corresponding to the iteration maximum position of the field matching result.

Step 2308, if the field matched with the matching key word is not found in the iteration maximum position, returning to execute the field matching result stored last by popping up the preset stack.

In the embodiment of the present invention, if no matching keyword matching field is found in the iteration maximum position of the field matching result stored last in the preset stack, the step 2307 is returned to execute the step of popping the field matching result at the stack bottom of the preset stack, and steps 2307 and 2308 may be executed through a loop until a field matching the matching keyword is found in the iteration maximum position of the field matching result as a target field, or until all the field matching results stored in the preset stack are popped, and the preset stack is empty.

Step 2309, determining a field position of the target field in the target data source file, and taking a larger area in the iteration maximum position of the field matching result popped up by the last iteration preset stack as the iteration maximum position of the target field.

According to the embodiment of the invention, the matching field area of the field position of the target field in the target data source file can be determined, the matching field area is compared with the iteration maximum position in the field matching result popped up by the last preset stack, and one of the two areas with larger area can be used as the new iteration maximum position.

Step 2310, return execution writes the iteration maximum position, the field position and the matching key as the field matching result into the preset stack.

In the embodiment of the present invention, step 2304 may be returned to perform writing the iteration maximum position, the field position, and the matching keyword as the field matching result into the preset stack, and steps 2304-2310 may be performed in a loop until all matching keywords in the keyword list are matched.

In some inventive embodiments, extracting location information of the target field within the target data source file as the target field location includes:

when the matching of the target fields is determined, determining the left uplink number, the right downlink number, the left uplink number and the right downlink number of each target field in the target data source file as position information; each location information is stored in association with a target field as a target field location.

In the embodiment of the present invention, when determining the target field, the left uplink, right downlink, left uplink and right downlink of the target field may be searched in the target data source file as the location information of the target field, and the location information and the target field are associated and stored, so that the location information is used as the location of the target field, and it can be understood that the manner of associating and storing the location information and the target field includes, but is not limited to, direct association and indirect association, for example, direct association and storing includes storing the location information into a second preset stack, where the location information in the second preset stack is the same as the location of the key of the target field in the preset stack.

Example III

Fig. 4 is a flowchart of another engineering data field identification method according to the third embodiment of the present invention, where the embodiment of the present invention is embodied on the basis of the foregoing embodiment of the present invention, and a merging and generating process of an identification area is described in detail, and referring to fig. 4, the method provided by the embodiment of the present invention specifically includes the following steps:

step 310, matching the target data source file according to the data source keywords.

Step 320, determining the target field position in the target data source file according to the preset level keyword.

Step 330, initializing a preset maximum position set, and selecting a target field position from the target field positions corresponding to the preset level keywords as a comparison area.

The preset maximum position set may be a position information set for determining the identification area.

In the embodiment of the present invention, a preset maximum position set may be initialized, where the initialization process may include creating an empty set as the preset maximum position set when the preset maximum position set is not created, and updating the preset maximum position set to the empty set when the preset maximum position set is created, where one or more corresponding target field positions may be extracted for each preset level keyword, where one or more extracted target field positions may be selected as a comparison area, where it may be understood that the selection may be implemented by random selection, or by level selection where the target field positions correspond to keywords in the preset level keyword.

Step 340, if the first area range of the comparison area is greater than the second area range of the preset maximum position set, adding the target field position of the comparison area to the preset maximum position set.

In the embodiment of the invention, the first area range of the comparison area can be compared with the second area range corresponding to the preset maximum position set, and when the first area range of the comparison area is larger than the second area range of the preset maximum position set, the target field position corresponding to the comparison area can be added to the preset maximum position set. It can be appreciated that if the first area range of the comparison area is smaller than or equal to the second area range of the preset maximum position set, it can be determined that the target field position corresponding to the comparison area already belongs to the preset maximum position set, and then the target field position of the comparison area does not need to be processed.

And 350, selecting another target field position from the rest target field positions as a comparison area to be compared with the preset maximum position set until the target field positions are compared.

Specifically, another target field position from the remaining one or more target field positions corresponding to the preset level keyword may be reselected as the comparison area, and the first area range of the comparison area may be compared with the second area range of the preset maximum position set again, so that the step 340 is performed in a return manner, until the target field positions of the preset level keyword are compared with the preset maximum position set, and the step 340 and the step 350 may be repeatedly performed to combine the target field positions through the preset maximum position set.

And 360, taking a second area range of the preset maximum position set which is compared with the positions of all the target fields as an identification area.

In the embodiment of the invention, after comparing the target field positions of the preset level keywords, the second area corresponding to the preset maximum position set can be used as the identification area generated by combining the target field positions. It may be appreciated that when the preset level keyword is plural, the preset maximum position set corresponding to the preset level keyword may be used as the corresponding identification area thereof, that is, each preset level keyword may have a respective corresponding identification area.

According to the embodiment of the invention, the data source keywords are matched with the target data source file, the target field positions are searched in the target data source according to the preset level keywords, the preset maximum position set is initialized, one of the target field positions is selected as the comparison area, when the first area range of the comparison area is smaller than the second area range of the preset maximum position set, the target field positions of the comparison area are added to the preset maximum position set, the steps are repeated until all the target field positions are compared with the preset maximum position set, the second area range corresponding to the preset maximum position set is used as the identification area, so that the combination of different target field positions is realized, the reasonable identification area is set for the preset level keywords, the data retrieval amount in the subsequent reduction process can be reduced, the data processing efficiency can be improved, and the intelligent degree of data processing is enhanced.

Example IV

In one exemplary embodiment, taking field identification in a column control system in the signal domain as an example, the data sources provided by a column control system by a design survey are largely divided into two broad categories, namely, column control engineering data and column control interface data, which are often provided in digitized tabular form. In addition, the electronic interlocking sheets of the interlocking product are provided in the form of data words, and the input of the data is not standardized at present. The keyword matching of the data source can automatically position and identify the data according to the abstract structure of project engineering-line-file carrier-data source set-data of the signal train control data after the train control data and the like are abstracted, for example, the matching flow of the keyword matching of the data source is shown in the figure 5, after the data source is positioned through the matching process, the identification of a field identification area is carried out on the data, and the position of the whole data range containing the data area can be obtained by a storage format given by the data, so that the data area is identified after the identification of the field identification area is successful, and the data reading can be carried out. For a digitized version of a data set, see FIG. 6, the contents of which can be abstracted as follows:

The identification area is used for defining the meaning of the data (the data is generally given according to the data content from top to bottom) and is given by specific Chinese characters or English character strings containing keywords; the data region is a specific data source, sometimes ordered, and sometimes unordered, according to its data attributes. For example, the data contents in the line data table are ordered and the data contents in the route information table are unordered.

The identification area name is generally fixed, but since the old engineering is not executed according to the new specification in the process of standardization promotion, there is a case that the key word is greatly different. In any event, the type attribute of the data is identified by a name containing a key.

For example, the header of the line data table is an identification area, and the specific data content, namely the data area, is below the identification area. For example, as shown in fig. 2, the route information table of a station of a certain project is one of a plurality of data set hinges of a data source, and each of the plurality of data set hinges is formed by combining an identification area and a data area together. The identification area is a combination containing field key names for identifying specific signal attributes of the data content, as already described above. More than 70% of these names and formats are fixed according to statistics. In the structure of "project engineering-line-file carrier-data source set-data" after multi-bit integrated abstraction, after identifying the data source, the identification of each field of the field area of the data may be implemented by the method provided by the embodiment of the invention, see fig. 7, specifically including the following steps:

a) Multi-level keyword matching

The anchoring of the data content identification area can be matched according to the level of the field name combination, the result of the position of the keyword needs to be obtained, the anchoring of the file carrier is directly the matching of the keyword, and the processing can be processed according to the matching of the matching rule of one level in the level matching. The matching means is thus mainly a field-anchored matching of the data content identification area, which in its multilevel combination can be realized as follows:

given a matching character string S customized by a user, firstly dividing the matching character string S by a symbol' to obtain a matching set { S1, S2, S3, S4, S5 … … } of each layer;

setting a corresponding keyword list L= [/', S1, S2, S3, S4, S5, … … ], '/' is defined as a root keyword and represents a marker of the beginning of matching;

a corresponding matching result list r= [ current matching keyword C, the position P0 where the current matching keyword is located, and the iterative maximum matching position P1] is set. For example, in fig. 8, the structure of the position definition is (lr=left up, rr=right down, lc=left up, rc=right down). If the matching pile 1-1 matches (0,1,3,5) and the matching pile 2-i matches (1, 2,4, 5), then r= [ key 2-i, (1, 2,4, 5), (0,2,3,5) ]. For the hierarchical combination name matching stake 1-1:2-i, (1, 2,4, 5) is the exact position of the matching stake 2-i, (0,2,3,5) is the maximum range of the identification area of the present hierarchical matching stake from the first layer to the current layer iteration;

And matching the matching piles according to the keyword list L= [ '/', S1, S2, S3, S4, S5, … … ] and the established stack in sequence in layers until a matching result is null.

The keyword Sx, assuming that the matching stake 1-1 of the root keyword '/' is included in the ith matching stake x-i of the x layer, the corresponding R is [ '/', (maximum row+1, minimum row-1, maximum column+1, minimum column-1) ];

sx successfully matches the ith matching pile x-i of the xth level, and the result is R (x-i) = [ K (x-i), P0 (x-i), P1 (x-i) ], and P0 (x-i) is R (x-i);

r (x-i) is stacked, and P1 (x-i) =max (R (x-i), where the matching pile x-i corresponds to P1 of the matching pile of the previous level, i.e. takes the maximum value of the range of the two;

sx continues matching, and if matching piles on other levels are matched, the same operation is performed.

Performing pop, obtaining R (x-i), obtaining a matching result of the matching keyword Sx according to the matching next layer of keyword S (x+1), wherein the matching range is P0 (x-i) = [ LR (x-i), RR (x-i), LC (x-i), and RC (x-i) ] of the data direction area of the position, namely (lr=rr (x-i) +1, rr=max row, lc=lc (x-i), rc=rc (x-i), and the j-th matching pile (x+1) -j) of the matching successful x+1 layer, obtaining the accurate position R ((x+1) -j) thereof, P0 ((x+1) -j) = R ((x+1) -j), then, the maximum range p1 ((x+1) -j) = MAX (R ((x+1) -j), P1 (x-i)), and thus stacking [ S (x+1) ((x+1) -j).

If the match is that of the last key Sn, this result is added to the record ret if successful.

And if the stack is not empty, continuing to sequentially carry out the above-mentioned pop operation until the stack is empty, thereby obtaining a final matching result ret.

Therefore, the algorithm complexity O (t) of multi-level keyword matching is in a linear relation with the size of the stack, instead of matching the whole data every time, and the processing efficiency can be greatly improved.

And matching the keywords with the matching piles, and matching the character strings according to the matching rules according to the keyword rules defined by the user.

And finally, obtaining the corresponding position of each field according to the final result, and obtaining a corresponding data area so as to obtain data for processing.

b) Identification zone location

The identification area of a certain data source is composed of a plurality of fields, each field obtains a specific position (LRi, RRi, LCi, RCi) corresponding to each keyword Si according to the multi-level keyword matching process, and the maximum positions are combined from the first field to the last field in sequence for the specific position of each keyword i, so that the positioning range of the identification area is finally obtained, generally, the data is in the column direction, and the positioning is shown in fig. 9. The identification area positioning process is as follows:

For the data source fields f1, f2, … …, fx, f (x+1), f (x+2), f (x+3), … …, fn, the matching locating value obtained by sequentially performing multi-level matching is denoted as L (i) = (LR (i), RR (i), LC (i), RC (i)), i >0;

the iteration may be performed by the following formula:

f (n) is the maximum range of all fields obtained from the iteration to the last field, i.e. the identification area range (LR, RR, LC, RC);

thus, the data area (RR+1, maxRow, LC, RC) in the data direction and the data area (LR, RR, RC+1, maxCol) in the behavior data direction are obtained, and the data area can read and analyze data by combining the positioning value L (i) corresponding to each field.

Example five

Fig. 10 is a schematic structural diagram of an engineering data field identifying apparatus according to a fifth embodiment of the present invention. As shown in fig. 10, the apparatus includes:

a file matching module 501, configured to match a target data source file according to a data source keyword.

The field searching module 502 is configured to determine a target field location in the target data source file according to a preset level key.

And the region merging module 503 is configured to merge the target field positions corresponding to the preset level keywords into an identification region.

According to the embodiment of the invention, the file matching module is used for obtaining the target data source file according to the data source keywords, the field searching module is used for determining the position of the target field in the target data source file according to the preset level keywords, and the region merging module is used for merging different target field positions into the identification region, so that the identification of the target field in the data source file is realized, the positioning speed of the target field is improved, and the data processing efficiency and the automation degree of data processing can be improved.

In some inventive embodiments, the field lookup module 502 includes:

and the keyword unit is used for receiving keyword sets corresponding to the preset level keywords, wherein the keywords of different levels in the preset level keywords are separated by preset identifiers.

And the matching searching unit is used for searching the target fields which are matched with the hierarchical order of the keyword sets and the keywords respectively in the target data source file.

And the position extraction unit is used for extracting the position information of the target field in the target data source file as the position of the target field.

Furthermore, on the basis of the embodiment of the present invention, the matching search unit is specifically configured to: dividing keywords in the keyword set according to the preset identifier, generating a keyword list corresponding to each keyword, and initializing a preset stack; extracting the keywords at the top layer in the keyword list as matching keywords, and taking fields matched with the matching keywords in the target data source file as target fields; determining a matching field area of the target field in the target data source file as an iteration maximum position and determining a field position of the target field in the target data source file; writing the iteration maximum position, the field position and the matching key word into the preset stack as field matching results; extracting the keywords of the next layer of the matched keywords in the keyword list as new matched keywords; determining that the target field of the current keyword set is searched completely if the keyword list does not have the keyword of the next layer of the matched keywords, and popping up the field matching result stored in the preset stack; if the matching key word is obtained, popping up the field matching result stored by the preset stack last, and searching a field matched with the matching key word in the iteration maximum position of the field matching result as the target field; if the field matched with the matching key word is not found in the iteration maximum position, returning to execute the field matching result stored last by popping up the preset stack; determining the field position of the target field in the target data source file, and taking a larger area in the iteration maximum position of the field matching result of the field position and the last preset stack pop-up as the iteration maximum position of the target field; and the return execution writes the iteration maximum position, the field position and the matching key into the preset stack as field matching results.

Further, on the basis of the above embodiment of the present invention, the location extraction unit is specifically configured to: when the target fields are determined to be matched, determining the left uplink number, the right downlink number, the left uplink number and the right downlink number of each target field in the target data source file as the position information; and storing each piece of position information in association with the target field as the target field position.

Further, on the basis of the above embodiment of the present invention, the region merging module 503 includes:

the set initialization unit is used for initializing a preset maximum position set and selecting a target field position from the target field positions corresponding to the preset level keywords as a comparison area.

And the comparison adding unit is used for adding the target field position of the comparison area to the preset maximum position set if the first area range of the comparison area is larger than the second area range of the preset maximum position set.

And the field selection unit is used for selecting another target field position from the rest target field positions to be used as the comparison area to be compared with the preset maximum position set until the comparison of the target field positions is completed.

And the area determining unit is used for taking the second area range of the preset maximum position set which is compared with each target field position as the identification area.

On the basis of the embodiment of the invention, the target data source file in the device at least comprises an identification area and a data area.

On the basis of the embodiment of the invention, the preset level keywords in the device at least comprise keywords corresponding to a file name object level, a tree page name object level and a tree field name level.

The engineering data field identification device provided by the embodiment of the invention can execute the engineering data field identification method provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method.

Example six

Fig. 11 shows a schematic diagram of the structure of an electronic device 10 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.

As shown in fig. 11, the electronic device 10 includes at least one processor 11, and a memory such as a Read Only Memory (ROM) 12, a Random Access Memory (RAM) 13, etc., communicatively connected to the at least one processor 11, wherein the memory stores a computer program executable by the at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the Read Only Memory (ROM) 12 or the computer program loaded from the storage unit 18 into the Random Access Memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 may also be stored. The processor 11, the ROM 12 and the RAM 13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to bus 14.

Various components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, etc.; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.

The processor 11 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 11 performs the various methods and processes described above, such as the engineering data field identification method.

In some embodiments, the engineering data field identification method may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as the storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM 12 and/or the communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the engineering data field identification method described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the engineering data field identification method in any other suitable manner (e.g., by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.

A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.

The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.

It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present invention may be performed in parallel, sequentially, or in a different order, so long as the desired results of the technical solution of the present invention are achieved, and the present invention is not limited herein.

The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims

1. A method for identifying engineering data fields, the method comprising:

matching a target data source file according to the data source keywords;

2. The method of claim 1, wherein determining the target field location within the target data source file according to the preset hierarchy key comprises:

Receiving a keyword set corresponding to the preset level keywords, wherein the keywords of different levels in the preset level keywords are separated by preset identifiers;

searching target fields matched with the hierarchical order of the keyword set and the keywords respectively in the target data source file;

and extracting the position information of the target field in the target data source file as the position of the target field.

3. The method according to claim 2, wherein searching for target fields in the target data source file that match the hierarchical order of the set of keywords and keywords, respectively, comprises:

dividing keywords in the keyword set according to the preset identifier, generating a keyword list corresponding to each keyword, and initializing a preset stack;

extracting the keywords at the top layer in the keyword list as matching keywords, and taking fields matched with the matching keywords in the target data source file as target fields;

determining a matching field area of the target field in the target data source file as an iteration maximum position and determining a field position of the target field in the target data source file;

Writing the iteration maximum position, the field position and the matching key word into the preset stack as field matching results;

extracting the keywords of the next layer of the matched keywords in the keyword list as new matched keywords;

determining that the target field of the current keyword set is searched completely if the keyword list does not have the keyword of the next layer of the matched keywords, and popping up the field matching result stored in the preset stack;

if the matching key word is obtained, popping up the field matching result stored by the preset stack last, and searching a field matched with the matching key word in the iteration maximum position of the field matching result as the target field;

if the field matched with the matching key word is not found in the iteration maximum position, returning to execute the field matching result stored last by popping up the preset stack;

determining the field position of the target field in the target data source file, and taking a larger area in the iteration maximum position of the field matching result of the field position and the last preset stack pop-up as the iteration maximum position of the target field;

And the return execution writes the iteration maximum position, the field position and the matching key into the preset stack as field matching results.

4. The method of claim 2, wherein the extracting the location information of the target field within the target data source file as the target field location comprises:

when the target fields are determined to be matched, determining the left uplink number, the right downlink number, the left uplink number and the right downlink number of each target field in the target data source file as the position information;

and storing each piece of position information in association with the target field as the target field position.

5. The method of claim 1, wherein merging each of the target field positions corresponding to the preset level key as an identification area comprises:

initializing a preset maximum position set, and selecting a target field position from the target field positions corresponding to the preset level keywords as a comparison area;

if the first area range of the comparison area is larger than the second area range of the preset maximum position set, adding the target field position of the comparison area to the preset maximum position set;

Selecting another target field position from the rest target field positions as the comparison area to be compared with the preset maximum position set until the target field positions are compared;

and taking the second area range of the preset maximum position set which is compared with the target field positions as the identification area.

6. The method of claim 1, wherein the target data source file comprises at least an identification area and a data area.

7. The method of claim 1, wherein the predetermined hierarchy keys include at least keys corresponding to a file name object hierarchy, a tree page name object hierarchy, and a tree field name hierarchy.

8. An engineering data field identifying apparatus, the apparatus comprising:

9. An electronic device, the electronic device comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the engineering data field identification method of any one of claims 1-7.

10. A computer readable storage medium storing computer instructions for causing a processor to implement the engineering data field identification method of any one of claims 1-7 when executed.