CN112000762B - Road management detection method, device, electronic equipment and readable storage medium - Google Patents
Road management detection method, device, electronic equipment and readable storage medium Download PDFInfo
- Publication number
- CN112000762B CN112000762B CN202010918336.1A CN202010918336A CN112000762B CN 112000762 B CN112000762 B CN 112000762B CN 202010918336 A CN202010918336 A CN 202010918336A CN 112000762 B CN112000762 B CN 112000762B
- Authority
- CN
- China
- Prior art keywords
- road
- search
- road section
- seed
- new
- 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.)
- Active
Links
- 238000001514 detection method Methods 0.000 title claims abstract description 79
- 238000009792 diffusion process Methods 0.000 claims abstract description 90
- 238000000034 method Methods 0.000 claims abstract description 46
- 238000010845 search algorithm Methods 0.000 claims abstract description 31
- 238000004891 communication Methods 0.000 claims description 35
- 238000012545 processing Methods 0.000 claims description 23
- 238000004590 computer program Methods 0.000 claims description 9
- 230000002159 abnormal effect Effects 0.000 claims description 6
- 238000007726 management method Methods 0.000 description 23
- 238000010586 diagram Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 238000007689 inspection Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013075 data extraction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
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/29—Geographical information databases
-
- 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/22—Indexing; Data structures therefor; Storage structures
-
- 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/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Computational Linguistics (AREA)
- Remote Sensing (AREA)
- Traffic Control Systems (AREA)
- Navigation (AREA)
Abstract
The application provides a road management detection method, a road management detection device, electronic equipment and a readable storage medium. The method comprises the following steps: extracting target road entity data from road network data to be processed, and determining a single first target road section in the target road entity data to serve as a first search seed; performing diffusion inquiry on the first search seeds in the target road entity data through a search algorithm to obtain search results of the diffusion inquiry; when a new road section exists in the search results, taking the new road section as a new first search seed, performing diffusion inquiry on the new first search seed in the target road entity data, and determining the detection result of the target road entity data according to the search result of each diffusion inquiry. Based on the method, the identification and detection of the connectivity of the road segments in the target road entity data can be automatically realized, and the connectivity of the road segments is not required to be detected manually, so that the efficiency of detecting the connectivity between the road segments is improved.
Description
Technical Field
The invention relates to the technical field of geographic information and computer data processing, in particular to a road management detection method, a device, electronic equipment and a readable storage medium.
Background
The connectivity check of the road data is a check content when the road data is put in storage. When the road network data just acquired is subjected to data storage, the connectivity among the road segments in the road network data is related to not only the spatial relationship but also the attribute information. The connectivity of the road segments in the road entity data in the road network data cannot be directly recognized by the machine. At present, a manual mode is generally adopted to check the connectivity between road segments, and the detection mode has low efficiency.
Disclosure of Invention
The application provides a road management detection method, a device, electronic equipment and a readable storage medium, which can improve the efficiency of connectivity detection between road segments.
In order to achieve the above object, the technical solution provided by the embodiments of the present application is as follows:
In a first aspect, an embodiment of the present application provides a road management detection method, where the method includes:
Obtaining road network data to be processed, wherein the road network data to be processed comprises a single road section provided with a road section identification attribute, and the road section identification attribute comprises a road section code and a road code or further comprises a repeated road section code;
extracting target road entity data from the road network data to be processed according to the road code and the repeated road section code, and determining a single first target road section in the target road entity data to serve as a first search seed;
Performing diffusion inquiry on the first search seed in the target road entity data through a search algorithm to obtain a search result of the diffusion inquiry;
When a new road section exists in the search result, taking the new road section as a new first search seed, and performing diffusion inquiry on the new first search seed in the target road entity data until a new road section does not exist in the new search result is obtained;
and determining a detection result of the target road entity data according to the search result of each diffusion inquiry, wherein the detection result comprises connectivity in the target road entity data.
In the above-described embodiment, in the target road entity data, the target link is taken as the search seed, and then the diffusion search is performed using the search algorithm to find all links communicating with the search seed. Based on the method, the identification and detection of the connectivity of the road segments in the target road entity data can be automatically realized, and the connectivity of the road segments is not required to be detected manually, so that the efficiency of detecting the connectivity between the road segments is improved.
With reference to the first aspect, in some optional embodiments, performing, by a search algorithm, a diffuse query on the first search seed in the target road entity data, to obtain a search result of the diffuse query, includes:
Selecting a road section adjacent to the first search seed from the target road entity data as a search result of the first search seed through the search algorithm;
And updating a data structure corresponding to the first search seed according to the search result, wherein the data structure comprises a data structure for storing a road section identification attribute of a new road section obtained by performing diffusion search on the first search seed.
In the above embodiment, the data structure is used to store the link identifier attribute of the new link obtained by performing the diffuse search on the search seed, so as to be beneficial to judging from the data structure whether the new link is found when the current search seed performs the diffuse search.
With reference to the first aspect, in some optional embodiments, the data structure corresponding to the first search seed includes a first data structure and a second data structure;
Updating a data structure corresponding to the first search seed according to the search result, including:
according to the search result, storing the road section identification attribute of all the first search seeds which have completed searching in the first data structure;
And storing the road section identification attribute of the new road section obtained by performing diffusion search on the first search seed in the second data structure according to the search result.
In the above embodiment, the first data structure and the second data structure store corresponding data, which is favorable for judging connectivity between the current search seed and other road segments according to the data in the first data structure and the second data structure.
With reference to the first aspect, in some optional embodiments, the data structure corresponding to the first search seed further includes a third data structure and a fourth data structure, and the method further includes:
When the search result of the first search seed indicates that the number of the new road sections is greater than or equal to 2, storing the road section identification attribute of the road section obtained by performing the diffusion search on the first search seed and the road section identification attribute of the first search seed in the third data structure;
Taking each new road section in the second data structure as a new first search seed, and storing the road section identification attribute and the first search seed road section identification attribute of the road section obtained by performing diffusion search on each new first search seed in a corresponding fourth data structure;
when the number of road sections obtained by searching is smaller than 2, determining that the connectivity of the new first searching seed is single-ended communication;
And when the road section identification attribute of the third data structure comprises all road section identification attributes in the appointed fourth data structure, determining that the connectivity of the new first search seed corresponding to the appointed fourth data structure is single-ended communication.
With reference to the first aspect, in some optional embodiments, determining a detection result of the target road entity data according to a search result of each diffusion query includes:
Judging whether a road section identification attribute of the new road section exists in a second data structure corresponding to the first search seed aiming at the first search seed of each diffusion inquiry;
When the link identification attribute of the new link does not exist in the second data structure, determining that the connectivity of the current link of the first search seed is single-ended communication, and ending the current road entity data search;
When the road section identification attribute of the new road section exists in the second data structure, determining that the connectivity of the current road section of the first search seed is that two ends are communicated, and continuing the current road entity data search;
And determining the detection result of the road section in the target road entity data according to the connectivity of the road section of each first search seed.
In the above embodiment, the connectivity detection of each link in the road may be achieved by detecting the connectivity of each link searching for the seed.
With reference to the first aspect, in some optional embodiments, the method further includes:
Judging whether the number of the road sections in the first data structure is the same as the total number of the road sections in the target road entity data;
If yes, determining the road section communication of the target road entity data;
If not, determining that the connectivity of the road section of the target road entity data is abnormal.
In the above embodiment, the road segments in the first data structure are all the road segments that are mutually connected, which can be used as a basis for determining the connectivity of all the road segments in the target road entity data, so that the detection of the connectivity of the target road entity data can be realized according to the number of the road segments in the first data structure.
With reference to the first aspect, in some optional embodiments, the method further includes:
When an undetected road segment exists in the target road entity data, determining a single target road segment from the undetected road segment as a second search seed until the undetected road segment does not exist in the target road entity data;
Performing diffusion inquiry on the second search seeds on the undetected road sections through a search algorithm to obtain search results of the diffusion inquiry;
When a new road section exists in the search result, taking the new road section as a new second search seed, and performing diffusion inquiry on the new second search seed in the road network data to be processed until a new road section does not exist in the new search result;
And determining a detection result of the undetected road section according to the search result of each diffusion inquiry, wherein the detection result comprises connectivity of the second search seed in the road network data to be processed and the detection result comprises connectivity of the second search seed in the target road entity data.
In the road network data to be processed, when isolated non-connected road sections or roads exist, when the first search seed is selected for the diffusion search, part of the road section data cannot be detected. In the above embodiment, the method is advantageous to traverse each road segment in the target road entity data by performing the diffuse query on the undetected road segment, so as to realize the connectivity detection of each road segment.
In a second aspect, an embodiment of the present application further provides a road management detection apparatus, where the apparatus includes:
The road network processing device comprises an acquisition unit and a processing unit, wherein the acquisition unit is used for acquiring road network data to be processed, the road network data to be processed comprises a single road section provided with a road section identification attribute, and the road section identification attribute comprises a road section code and a road code or further comprises a repeated road section code;
A seed determining unit, configured to extract target road entity data from the road network data to be processed according to the road code and the repeated road segment code, and determine a single first target road segment in the target road entity data as a first search seed;
The query unit is used for performing diffuse query on the first search seeds in the target road entity data through a search algorithm to obtain search results of the diffuse query;
The diffusion processing unit is used for taking the new road section as a new first search seed when a new road section exists in the search result, and performing diffusion inquiry on the new first search seed in the target road entity data until the new road section does not exist in the new search result;
And the result determining unit is used for determining the detection result of the target road entity data according to the search result of each diffusion inquiry, wherein the detection result comprises the connectivity of the target road entity data.
In a third aspect, an embodiment of the present application further provides an electronic device, where the electronic device includes a memory and a processor that are coupled to each other, and the memory stores a computer program, where the computer program, when executed by the processor, causes the electronic device to perform the method described above.
In a fourth aspect, embodiments of the present application also provide a computer readable storage medium having a computer program stored therein, which when run on a computer causes the computer to perform the above-described method.
Drawings
In order to more clearly illustrate the technical solution of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described. It is to be understood that the following drawings illustrate only certain embodiments of the application and are therefore not to be considered limiting of its scope, for the person of ordinary skill in the art may admit to other equally relevant drawings without inventive effort.
Fig. 1 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Fig. 2 is a flow chart of a road management detection method according to an embodiment of the present application.
Fig. 3 is a schematic diagram of road network data according to an embodiment of the present application.
Fig. 4 is a functional block diagram of a road management detection apparatus according to an embodiment of the present application.
Icon: 10-an electronic device; 11-a processing module; 12-a memory module; 13-a communication module; 100-road management detection device; 110-an acquisition unit; 120-a seed determination unit; 130-a query unit; 140-a diffusion processing unit; 150-a result determination unit.
Detailed Description
The technical solutions in the embodiments of the present application will be described below with reference to the accompanying drawings in the embodiments of the present application. It should be noted that the terms "first," "second," and the like are used merely to distinguish between descriptions and should not be construed as indicating or implying relative importance.
Embodiments of the present application will be described in detail below with reference to the accompanying drawings. The following embodiments and features of the embodiments may be combined with each other without conflict.
Referring to fig. 1, an electronic device 10 is provided in an embodiment of the present application, which may be used to detect connectivity of a road segment in road network data. The electronic device 10 may be, but is not limited to, a personal computer (Personal Computer, PC), a server, or the like.
In this embodiment, the electronic device 10 may include a processing module 11, a storage module 12, a communication module 13, and a road management detection apparatus 100, where the processing module 11, the storage module 12, the communication module 13, and the road management detection apparatus 100 are electrically connected directly or indirectly to each other to implement data transmission or interaction. For example, the components may be electrically connected to each other via one or more communication buses or signal lines.
It will be appreciated that the electronic device 10 may establish a communication connection with a road network server that collects road network data, and may obtain road network data from the road network server that needs to be processed. The road network data to be processed is the road network data to be processed in the following method. The road network data to be processed comprises road section data of the road, at this time, the connection relationship between the road sections or between the road sections is not established, and the machine cannot automatically identify the connection between the road sections or the connection between the road sections. Wherein a road may comprise one or more road segments.
In the present embodiment, the storage module 12 stores a computer program, which when executed by the processing module 11, may enable the electronic device 10 to perform the steps in the road management detection method described below.
Referring to fig. 2, the embodiment of the present application further provides a road management detection method, which can be applied to the electronic device 10, and each step in the method is executed or implemented by the electronic device 10. The method may comprise the steps of:
step S210, obtaining to-be-processed road network data, wherein the to-be-processed road network data comprises a single road segment provided with a road segment identification attribute, and the road segment identification attribute comprises a road segment code and a road code or further comprises a repeated road segment code;
Step S220, extracting target road entity data from the road network data to be processed according to the road code and the repeated road segment code, and determining a single first target road segment in the target road entity data to serve as a first search seed;
Step S230, performing diffusion inquiry on the first search seed in the target road entity data through a search algorithm to obtain a search result of the diffusion inquiry;
step S240, when a new road section exists in the search result, taking the new road section as a new first search seed, and performing diffusion inquiry on the new first search seed in the target road entity data until no new road section exists in the new search result;
Step S250, determining a detection result of the target road entity data according to the search result of each diffusion query, where the detection result includes connectivity of the target road entity data.
In the above-described embodiment, in the target road entity data, the target link is taken as the search seed, and then the diffusion search is performed using the search algorithm to find all links communicating with the search seed. Based on the method, the identification and detection of the connectivity of the road segments in the target road entity data can be automatically realized, and the connectivity of the road segments is not required to be detected manually, so that the efficiency of detecting the connectivity between the road segments is improved.
The steps in the method will be described in detail as follows:
In step S210, the road network data to be processed is the data to be put into the road network database. In the road network data to be processed, one or more pieces of road entity data can be extracted according to the road codes and the repeated road segment codes. One piece of road entity data can comprise data of a plurality of road segments, and the spatial relationship and the continuity of attribute logic of each road entity need to be detected before the road entity data are put in storage.
In the road network data to be processed, generally, each road section of each road entity data is preset with a corresponding road section identification attribute. The link identification attribute includes, but is not limited to, an attribute identification of a link code (e.g., a link ID), a road code (e.g., a road ID), a duplicate link code, etc. Each road segment may understandably have a road coding of the associated road entity data. The road code can be a digital string or a character string, and can be set according to actual conditions.
In this embodiment, based on road network data monitored by geographical national conditions, each road section attribute includes two fields of road coding and repeated road section coding. And according to the attribute field, completing the data extraction of the road entity. It will be appreciated that the road code (field name RN) may be defined as an exclusive road segment, i.e. as a unique road code for each road segment, as a unique road segment for the road entity, and there is no case where the road segment is shared with other roads. The repeated link code (field name is denoted as RNP) may be defined as a common link, that is, a link commonly used among two or more roads, and the repeated link code may have stored in a field thereof a road code of all the roads sharing the link.
If one road segment is a shared road segment, the road segment identification attribute of the road segment comprises a repeated road segment code. If a link is a unique link, the link identification attribute of the link includes a road code and a link code, and may not include a duplicate link code.
In step S220, the link identification attribute may be used to indicate the identity of the road to which the link belongs. When the first search seed is determined, one road code can be randomly selected from all road segments in the road network data to be processed to serve as the road code of the target road entity data, and then all road segments which are the same as the road code are extracted to serve as all road segments of the target road entity data, so that the road network data are organized into new road entity data. Then, one link is randomly selected as a first target link, i.e., a first search seed, from all links of the target road entity data. That is, the electronic device 10 may extract each link of the target road entity data from the road network data to be processed, and then randomly select one link identification attribute from the link identification attributes of the target road entity data as the link identification attribute of the target link. Then, step S230 is performed.
In step S230, the search algorithm may be determined according to the actual situation. For example, the search algorithm may be a seed search algorithm. The seed search algorithm can be applied to road detection, and can be used for detecting connectivity of road sections and roads by combining the data of the road sections. The seed search algorithm is an extension of the seed filling algorithm, and is a recursive algorithm that can search in all directions starting from a specified seed point until a boundary is encountered.
Referring to fig. 3, the road network data to be processed is generally vector data with attribute information as shown in fig. 3. In fig. 3, the road network data to be processed includes two pieces of road entity data, each including a plurality of road segments. The search algorithm may perform a diffuse query based on the determined search seed. In each diffusion inquiry, the search algorithm can judge and record whether a road section adjacent to the search seed exists in the vector data, and record the obtained result as the search result of the diffusion inquiry.
For example, in fig. 3, assuming that the first search seed is the road segment with the number 1, when the road segment with the number 1 is subjected to the diffuse query, road segments adjacent to the number 1 may be searched for as the road segments with the numbers 2 and 5, respectively. At this time, the search results for the number 1 are the number 2 and number 5 links, and the number 2 and number 5 links represent the link communication with the number 1 link. At this time, the electronic device 10 may automatically establish and store a logical relationship in which the road segments of the number 1 and the numbers 2, 5 communicate with each other.
In this embodiment, step S230 may include:
Selecting a road section adjacent to the first search seed from the target road entity data as a search result of the first search seed through the search algorithm;
And updating a data structure corresponding to the first search seed according to the search result, wherein the data structure comprises a data structure for storing a road section identification attribute of a new road section obtained by performing diffusion search on the first search seed.
Understandably, the electronic device 10 could create a data structure corresponding to each search seed. The data structure may be, but is not limited to, an array, queue, stack, etc. of data structures for storing road segment identification attributes of corresponding road segments in the search results. The number of data structures corresponding to each search seed may be set according to actual circumstances.
For example, the data structure corresponding to the first search seed includes a first data structure and a second data structure. Updating the data structure corresponding to the first search seed according to the search result may include:
according to the search result, storing the road section identification attribute of all the first search seeds which have completed searching in the first data structure;
And storing the road section identification attribute of the new road section obtained by performing diffusion search on the first search seed in the second data structure according to the search result.
In this embodiment, for each search seed, the first data structure is used to store the road segment identification attribute of all the first search seeds that have currently completed searching. That is, the first data structure is used to store the link identification attribute of all the searched links. The second data structure is used for storing the road section identification attribute of the new road section obtained after the current searching seed is subjected to diffusion searching. Wherein the link identification attribute stored in the data structure is typically a link code.
If no new road section is found after the current search seed performs the diffusion search, the data does not need to be stored in the second data structure. The new road segment can be understood as a road segment identifier attribute of a road segment adjacent to the current search seed is not in the first data structure obtained by the last search.
Understandably, the first data structure and the second data structure store the corresponding road segment identification attribute, so that the connectivity between the current search seed and other road segments can be judged according to the road segment identification attribute of the first data structure and the road segment identification attribute of the second data structure. That is, the links adjacent to the search seed obtained by the diffused query communicate with the links of the search seed.
In step S240, if a new link exists in the search result, it indicates that a new link communicating with the search seed exists. The new road section can be used as a new search seed to continue the diffusion search. Based on the method, the searching of all road sections communicated by the initial first searching seeds can be realized, and missing road sections are prevented from being searched. The process of performing the diffusion search on the new search seed may refer to the detailed description of step S230, which is not repeated here.
In step S250, the search results for each first search seed generally include two types of cases. For example, a new road segment exists in the search results, or no new road segment exists in the search results. If a new road segment exists in the search result, the road segment representing the search seed is a continuous road segment in the road and is not a terminal road segment of the road. If no new road section exists in the search result, the road section representing the search seed is the end road section in the road. The detection results may include characterizing connectivity of each search seed in a single road.
The electronic device 10 may obtain connectivity for the link by storing connectivity for each search seed, based on which the machine may be facilitated to directly identify whether connectivity between road segments is possible based on connectivity.
As an optional implementation manner, the data structure corresponding to the first search seed further includes a third data structure and a fourth data structure, and the method may further include:
When the search result of the first search seed indicates that the number of the new road sections is greater than or equal to 2, storing the road section identification attribute of the road section obtained by performing the diffusion search on the first search seed and the road section identification attribute of the first search seed in the third data structure;
Taking each new road section in the second data structure as a new first search seed, and storing the road section identification attribute and the first search seed road section identification attribute of the road section obtained by performing diffusion search on each new first search seed in a corresponding fourth data structure;
when the number of road sections obtained by searching is smaller than 2, determining that the connectivity of the new first searching seed is single-ended communication;
And when the road section identification attribute of the third data structure comprises all road section identification attributes in the appointed fourth data structure, determining that the connectivity of the new first search seed corresponding to the appointed fourth data structure is single-ended communication.
And when the road section identification attribute of the third data structure does not completely comprise all road section identification attributes in the appointed fourth data structure, determining that the connectivity of the new search seed corresponding to the appointed fourth data structure is communicated at two ends.
In this embodiment, step S250 may include:
Judging whether a road section identification attribute of the new road section exists in a second data structure corresponding to the first search seed aiming at the first search seed of each diffusion inquiry;
When the link identification attribute of the new link does not exist in the second data structure, determining that the connectivity of the current link of the first search seed is single-ended communication, and ending the current road entity data search;
When the road section identification attribute of the new road section exists in the second data structure, determining that the connectivity of the current road section of the first search seed is that two ends are communicated, and continuing the current road entity data search;
And determining the detection result of the road section in the target road entity data according to the connectivity of the road section of each first search seed.
In this embodiment, connectivity may be understood as a connectivity attribute. The connectivity attributes may include a first attribute indicating that the current search seed is single ended in the link, a second attribute indicating that the current search seed is single ended in the link. The current road entity data is the target road entity data. The current road entity data search continues, which may be understood as executing step S240 again.
Here, the double-ended communication in the road is understood to be a continuous road segment in the road, and both ends of the road segment are communicated with other road segments, for example, in fig. 3, the road segment with the number 1 is the double-ended communication in the road. In a road single ended communication is understood to mean that the road segment is an end road segment in the road, only one of the ends of the road segment being in communication with the other road segments, e.g. in fig. 3 the road segment with number 6 is in single ended communication in the road. The connectivity of each search seed may be part of the search results for that search seed. The search results may also include the new road segment described above, and the like.
The electronic device 10 may establish a logical relationship for obtaining connectivity between adjacent road segments by storing the search result of each search seed, thereby obtaining a detection result of the road network data to be processed. The detection result may include a logical relationship of connectivity between machine-identifiable neighboring road segments.
As an alternative embodiment, the method may further comprise: judging whether the number of the road sections in the first data structure is the same as the total number of the road sections in the target road entity data; if yes, determining the road section communication of the target road entity data; if not, determining that the connectivity of the road section of the target road entity data is abnormal.
As can be appreciated, for the target road entity data, the electronic device 10 may update the road segment data in the first data structure until all the diffuse searches for the first search seeds end the search. The road sections in the first data structure are mutually communicated road sections and can be used as the basis for judging the connectivity of all the road sections in the target road entity data. If the number of the road segments in the first data structure is smaller than the total number of the road segments in the target road entity data, the road segments in the target road entity data are not communicated, or the connectivity is abnormal. If the number of the road segments in the first data structure is equal to the total number of the road segments in the target road entity data, the road segments in the target road entity data are communicated with each other. In this way, the detection of the target road entity data connectivity may be achieved according to the number of road segments in the first data structure.
Because each road section is provided with the road section identification attribute, if the connectivity of the road is abnormal, the road section with single-ended communication can be used as a suspicious road section, so that the position of the road section with the possibility of abnormality can be rapidly positioned.
As an alternative embodiment, the method may further comprise:
When an undetected road segment exists in the target road entity data, determining a single target road segment from the undetected road segment as a second search seed until the undetected road segment does not exist in the target road entity data;
Performing diffusion inquiry on the second search seeds on the undetected road sections through a search algorithm to obtain search results of the diffusion inquiry;
When a new road section exists in the search result, taking the new road section as a new second search seed, and performing diffusion inquiry on the new second search seed in the road network data to be processed until a new road section does not exist in the new search result;
And determining the detection result of the undetected road section according to the search result of each diffusion inquiry, wherein the detection result comprises the connectivity of the second search seed in the target road entity data.
In the target road entity data, when there is an isolated non-connected link, when the first search seed is selected for the diffuse search, some of the link data cannot be detected. That is, a diffuse search is performed for the first search seed, and after the search for all links communicating with the first search seed is completed, there may be an undetected link in the target road entity data. Such undetected road segments are typically road segments that are not in communication with the first search seed. At this time, connectivity detection needs to be performed on the non-detected road segments. The second search seed is selected from the undetected road segments, and the manner of determining the second search seed is similar to that of determining the first search seed, which is not described herein.
It is to be understood that the process of connectivity detection for the non-detected road segments may be similar to the process of steps S220 to S250, and will not be described here again. In this embodiment, the diffusion query is performed on the undetected road segments, so that each road segment in the target road entity data is traversed, connectivity detection of each road segment is achieved, and the condition of missed detection is avoided.
To facilitate an understanding of the implementation of the method, an implementation of the method will be exemplarily described below in conjunction with fig. 3, as follows:
For example, the road entity data a, B shown in fig. 3 are two pieces of road entity data extracted from road network data, where each line segment may be understood as one piece of road segment data, and each road segment has a road segment identification attribute. For example, in the road a, including the road segments 1-6, the road segments 1-6 in the road entity a are all road segment codes under the same road code, and the continuity of the attribute logic is already satisfied, but further judgment is required for the continuity of the spatial relationship. After the road entity data is acquired, continuity judgment of the spatial relationship needs to be performed, and a road segment code is randomly selected as a road segment code of the first search seed, for example, a road segment with the number 1 is selected as the first search seed. Then, using array a [ ], storing the road section code of the search seed which has completed searching; storing the road section code of the new road section obtained by performing diffusion search for the current first search seed by using the array b; if the road entity data such as road B is a bifurcation road, the search result needs to be further judged, and the search result of the first search seed and the first search seed are stored by utilizing the array c < + >; and simultaneously, each newly added search result is used as a new search seed to search, and the newly added search result and the search seed are stored by using the array d [ ]. It is understood that the array a [ ] is the first data structure, the array b [ ] is the second data structure, the array c [ ] is the third data structure, and the array d [ ] is the fourth data structure.
For the road entity A, aiming at the road section 1, the road section 1 is subjected to diffusion search by utilizing a seed search algorithm, so that an array a [1,2,5] and an array b [2,5] can be obtained, and the obtained array a and the obtained array b are search results of the road section 1.
Then, taking the road sections 2 and 5 in the array b as new first search seeds, and performing diffusion search to obtain an array a [1,2,5,3,6] and an array b [3,6]; and then taking the road sections 3 and 6 in the array b [3,6] as new first search seeds, and carrying out diffusion search again to obtain a [1,2,5,3,6,4] and the array b [4]. And taking the road section 4 in the b [4] as a new first search seed, and performing further diffusion search to obtain an array b [ blank ], wherein when the array b is [ blank ], the new road section is not existed. I.e. there is no longer link data for the connection in the current road entity a.
In detecting the link data of the road entity B, the diffusion search and detection may be performed in a similar manner as described above. For example, the road segment of the number 7 is selected as the first search seed for the road entity B, and then a diffusion search is performed to obtain a [7,8,9], B [8,9]. Since the search result of the road section 7 (the first search seed) indicates that the number of new road sections is greater than or equal to 2, at this time, the road section codes of the road sections obtained by performing the diffusion search on the road section 7 and the road section codes of the first search seed may be stored in the array c [ ], to obtain c [7,8,9], then the new road sections 8,9 in the array b [8,9] are respectively used as the new search seeds, and the road section codes of the road sections obtained by performing the diffusion search on the new road sections 8,9 are respectively stored in the corresponding array d [ ]. The fourth array of the road section 8 is d 7,9, and the fourth array of the road section 9 is d 7,8, 10. Since the fourth array d 7,9 of segment 8 is contained in array c 7,8,9, segment 8 is single ended. Since the fourth array d 7,8, 10 of the road segment 9 is not included in the array c 7,8,9, i.e., a new connection road segment exists in the road segment 9, which means that the connectivity of the road segment 9 is double-ended, then a diffuse search is performed on the remaining road segments of the road B until there is no new search result in the array B [ ].
Based on the design, when the array b is empty, the current searching seed is the end road section in the road; when the array b is not empty, the current search seed is the middle road section in the road. In the connectivity inspection of road data, not only the spatial relationship continuity of the road is considered, but also the logical connectivity of the attribute information of the road segments is considered, and the unique number of the road data with the break point can be obtained through the diffusion traversal inquiry of the seed search algorithm, so that the data inspector can conveniently locate the position where the problem exists, and the quality inspection work of the road data in the aspect of connectivity is convenient, for example, the connectivity inspection of the roads such as the shared road, the annular broken road (like the road B in fig. 3), the road with the branches and the like can be realized. The method provided by the embodiment can be used for checking the data quality of the road data and detecting the connectivity of the road network data in application scenes such as digital map navigation.
Referring to fig. 4, an embodiment of the present application further provides a road management detection apparatus 100, which can be applied to the electronic device 10. The road management detection apparatus 100 may perform or implement the steps in the method. The road management detection apparatus 100 includes at least one software function module that may be stored in the storage module 12 in the form of software or Firmware (Firmware) or cured in an Operating System (OS) of a data exchange server. The processing module 11 is used to execute executable modules stored in the storage module 12, such as software function modules and computer programs included in the road management detection apparatus 100.
For example, the road management detection apparatus 100 may include an acquisition unit 110, a seed determination unit 120, a query unit 130, a diffusion processing unit 140, and a result determination unit 150.
The obtaining unit 110 is configured to obtain to-be-processed road network data, where the to-be-processed road network data includes a single road segment provided with a road segment identifier attribute, and the road segment identifier attribute includes a road segment code and a road code, or further includes a repeated road segment code.
The seed determining unit 120 is configured to extract target road entity data from the road network data to be processed according to the road code and the repeated road segment code, and determine a single first target road segment in the target road entity data as a first search seed.
And the query unit 130 is configured to perform a diffuse query on the first search seed in the target road entity data through a search algorithm, so as to obtain a search result of the diffuse query.
And the diffusion processing unit 140 is configured to take the new road segment as a new first search seed when a new road segment exists in the search result, and perform diffusion query on the new first search seed in the target road entity data until no new road segment exists in the new search result.
And a result determining unit 150, configured to determine a detection result of the target road entity data according to the search result of each diffusion query, where the detection result includes connectivity of the target road entity data.
Alternatively, the querying element 130 may be further configured to: selecting a road section adjacent to the first search seed from the target road entity data as a search result of the first search seed through the search algorithm; and updating a data structure corresponding to the first search seed according to the search result, wherein the data structure comprises a data structure for storing a road section identification attribute of a new road section obtained by performing diffusion search on the first search seed.
Optionally, the data structure corresponding to the first search seed includes a first data structure and a second data structure. The querying element 130 may also be configured to:
according to the search result, storing the road section identification attribute of all the first search seeds which have completed searching in the first data structure;
And storing the road section identification attribute of the new road section obtained by performing diffusion search on the first search seed in the second data structure according to the search result.
Alternatively, the result determination unit 150 may be further configured to:
Judging whether a road section identification attribute of the new road section exists in a second data structure corresponding to the first search seed aiming at the first search seed of each diffusion inquiry;
When the link identification attribute of the new link does not exist in the second data structure, determining that the connectivity of the current link of the first search seed is single-ended communication, and ending the current road entity data search;
When the road section identification attribute of the new road section exists in the second data structure, determining that the connectivity of the current road section of the first search seed is that two ends are communicated, and continuing the current road entity data search;
And determining the detection result of the road section in the target road entity data according to the connectivity of the road section of each first search seed.
Optionally, the data structure corresponding to the first search seed further includes a third data structure and a fourth data structure. The road management detection apparatus 100 may further include a road detection unit for:
When the search result of the first search seed indicates that the number of the new road sections is greater than or equal to 2, storing the road section identification attribute of the road section obtained by performing the diffusion search on the first search seed and the road section identification attribute of the first search seed in the third data structure;
Taking each new road section in the second data structure as a new first search seed, and storing the road section identification attribute and the first search seed road section identification attribute of the road section obtained by performing diffusion search on each new first search seed in a corresponding fourth data structure;
when the number of road sections obtained by searching is smaller than 2, determining that the connectivity of the new first searching seed is single-ended communication;
And when the road section identification attribute of the third data structure comprises all road section identification attributes in the appointed fourth data structure, determining that the connectivity of the new first search seed corresponding to the appointed fourth data structure is single-ended communication.
Alternatively, the road management detection apparatus 100 may further include a road detection unit for judging whether the number of road segments in the first data structure is the same as the total number of road segments in the target road entity data; if yes, determining the road section communication of the target road entity data; if not, determining that the connectivity of the road section of the target road entity data is abnormal.
Alternatively, the seed determining unit 120 may be further configured to determine, when there is an undetected road segment in the target road entity data, a single target road segment from the undetected road segments as the second search seed until there is no undetected road segment in the target road entity data; the query unit 130 may be further configured to perform a diffuse query on the second search seed on the undetected road segment by using a search algorithm, so as to obtain a search result of the diffuse query; the diffusion processing unit 140 may be further configured to, when a new road segment exists in the search result, take the new road segment as a new second search seed, and perform diffusion query on the new second search seed in the to-be-processed road network data until no new road segment exists in the new search result; the result determining unit 150 may be further configured to determine a detection result of the non-detected road segment according to a search result of each flooding query, where the detection result includes connectivity of the second search seed in the target road entity data.
The processing module 11 may be an integrated circuit chip with signal processing capabilities. The processing module 11 may be a general purpose processor. For example, the processor may be a central processor (Central Processing Unit, CPU), a graphics processor (Graphics Processing Unit, GPU), a network processor (Network Processor, NP), or the like; the disclosed methods, steps, and logic diagrams of embodiments of the present application may also be implemented or performed with a digital signal processor (DIGITAL SIGNAL Processing, DSP), application Specific Integrated Circuit (ASIC), field-Programmable gate array (Field-Programmable GATE ARRAY, FPGA) or other Programmable logic device, discrete gate or transistor logic, or discrete hardware components.
The memory module 12 may be, but is not limited to, random access memory, read only memory, programmable read only memory, erasable programmable read only memory, electrically erasable programmable read only memory, and the like. In this embodiment, the storage module 12 may be used to store road segment data, search algorithms, and the like in the road network data. Of course, the storage module 12 may also be used to store a program, which is executed by the processing module 11 upon receiving an execution instruction.
The communication module 13 is used for establishing a communication connection between the electronic device 10 and the server through a network, and transmitting and receiving data through the network. For example, the electronic device 10 may establish a communication connection with a road network server through the communication module 13, and be configured to obtain road network data that needs to be processed from the road network server, so as to detect connectivity of each road segment in the road network data.
It is to be understood that the configuration shown in fig. 2 is merely a schematic illustration of one configuration of the electronic device 10, and that the electronic device 10 may include more components than those shown in fig. 2. The components shown in fig. 2 may be implemented in hardware, software, or a combination thereof.
It should be noted that, for convenience and brevity of description, specific working processes of the electronic device 10 and the road management detection apparatus 100 described above may refer to corresponding processes of each step in the foregoing method, and will not be described in detail herein.
The embodiment of the application also provides a computer readable storage medium. The readable storage medium has stored therein a computer program which, when run on a computer, causes the computer to execute the road management detection method as described in the above embodiments.
From the foregoing description of the embodiments, it will be apparent to those skilled in the art that the present application may be implemented in hardware, or by means of software plus a necessary general hardware platform, and based on this understanding, the technical solution of the present application may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disc, a mobile hard disk, etc.), and includes several instructions for causing a computer device (may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective implementation scenario of the present application.
In summary, the present application provides a road management detection method, a road management detection device, an electronic device, and a readable storage medium. The method comprises the following steps: obtaining road network data to be processed, wherein the road network data to be processed comprises a single road section provided with a road section identification attribute, and the road section identification attribute comprises a road section code and a road code or further comprises a repeated road section code; extracting target road entity data from road network data to be processed according to the road code and the repeated road segment code, and determining a single first target road segment in the target road entity data to serve as a first search seed; performing diffusion inquiry on the first search seeds in the target road entity data through a search algorithm to obtain search results of the diffusion inquiry; when a new road section exists in the search result, taking the new road section as a new first search seed, and performing diffusion inquiry on the new first search seed in the target road entity data until the new road section does not exist in the new search result; and determining a detection result of the target road entity data according to the search result of each diffusion inquiry, wherein the detection result comprises connectivity in the target road entity data. Based on the method, the identification and detection of the connectivity of the road segments in the target road entity data can be automatically realized, and the connectivity of the road segments is not required to be detected manually, so that the efficiency of detecting the connectivity between the road segments is improved.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus, system and method may be implemented in other manners as well. The above-described apparatus, system, and method embodiments are merely illustrative, for example, flow charts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. In addition, functional modules in the embodiments of the present application may be integrated together to form a single part, or each module may exist alone, or two or more modules may be integrated to form a single part.
The above description is only of the preferred embodiments of the present application and is not intended to limit the present application, but various modifications and variations can be made to the present application by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the protection scope of the present application.
Claims (7)
1. A method of road management detection, the method comprising:
Obtaining road network data to be processed, wherein the road network data to be processed comprises a single road section provided with a road section identification attribute, and the road section identification attribute comprises a road section code and a road code or further comprises a repeated road section code;
extracting target road entity data from the road network data to be processed according to the road code and the repeated road section code, and determining a single first target road section in the target road entity data to serve as a first search seed;
Performing diffusion inquiry on the first search seed in the target road entity data through a search algorithm to obtain a search result of the diffusion inquiry;
When a new road section exists in the search result, taking the new road section as a new first search seed, and performing diffusion inquiry on the new first search seed in the target road entity data until a new road section does not exist in the new search result is obtained;
Determining a detection result of the target road entity data according to the search result of each diffusion inquiry, wherein the detection result comprises connectivity of the target road entity data;
the performing, by using a search algorithm, a diffuse query on the first search seed in the target road entity data to obtain a search result of the diffuse query, where the method includes:
Selecting a road section adjacent to the first search seed from the target road entity data as a search result of the first search seed through the search algorithm; updating a data structure corresponding to the first search seed according to the search result, wherein the data structure comprises a data structure for storing a road section identification attribute of a new road section obtained by performing diffusion inquiry on the first search seed; the data structure corresponding to the first search seed comprises a first data structure, a second data structure, a third data structure and a fourth data structure; the updating the data structure corresponding to the first search seed according to the search result comprises the following steps:
According to the search result, storing the road section identification attribute of all the first search seeds which have completed searching in the first data structure; according to the search result, storing the road section identification attribute of the new road section obtained by performing diffusion inquiry on the first search seed in the second data structure; when the search result of the first search seed indicates that the number of the new road sections is greater than or equal to 2, storing the road section identification attribute of the road section obtained by performing diffusion inquiry on the first search seed and the road section identification attribute of the first search seed in the third data structure; taking each new road section in the second data structure as a new first search seed, and storing the road section identification attribute and the first search seed road section identification attribute of the road section obtained by performing diffusion inquiry on each new first search seed in a corresponding fourth data structure; when the number of road sections obtained by searching is smaller than 2, determining that the connectivity of the new first searching seed is single-ended communication; and when the road section identification attribute of the third data structure comprises all road section identification attributes in the appointed fourth data structure, determining that the connectivity of the new first search seed corresponding to the appointed fourth data structure is single-ended communication.
2. The method of claim 1, wherein determining the detection result of the target road entity data based on the search result of each diffused query comprises:
Judging whether a road section identification attribute of the new road section exists in a second data structure corresponding to the first search seed aiming at the first search seed of each diffusion inquiry;
When the link identification attribute of the new link does not exist in the second data structure, determining that the connectivity of the current link of the first search seed is single-ended communication, and ending the current road entity data search;
When the road section identification attribute of the new road section exists in the second data structure, determining that the connectivity of the current road section of the first search seed is that two ends are communicated, and continuing the current road entity data search;
And determining the detection result of the road section in the target road entity data according to the connectivity of the road section of each first search seed.
3. The method according to claim 1, wherein the method further comprises:
Judging whether the number of the road sections in the first data structure is the same as the total number of the road sections in the target road entity data;
If yes, determining the road section communication of the target road entity data;
If not, determining that the connectivity of the road section of the target road entity data is abnormal.
4. The method according to claim 1, wherein the method further comprises:
When an undetected road segment exists in the target road entity data, determining a single target road segment from the undetected road segment as a second search seed until the undetected road segment does not exist in the target road entity data;
Performing diffusion inquiry on the second search seeds on the undetected road sections through a search algorithm to obtain search results of the diffusion inquiry;
When a new road section exists in the search result, taking the new road section as a new second search seed, and performing diffusion inquiry on the new second search seed in the road network data to be processed until a new road section does not exist in the new search result;
And determining the detection result of the undetected road section according to the search result of each diffusion inquiry, wherein the detection result comprises the connectivity of the second search seed in the road network data to be processed.
5. A road management detection apparatus, the apparatus comprising:
The road network processing device comprises an acquisition unit and a processing unit, wherein the acquisition unit is used for acquiring road network data to be processed, the road network data to be processed comprises a single road section provided with a road section identification attribute, and the road section identification attribute comprises a road section code and a road code or further comprises a repeated road section code;
A seed determining unit, configured to extract target road entity data from the road network data to be processed according to the road code and the repeated road segment code, and determine a single first target road segment in the target road entity data as a first search seed;
The query unit is used for performing diffuse query on the first search seeds in the target road entity data through a search algorithm to obtain search results of the diffuse query; the query unit is specifically configured to: selecting a road section adjacent to the first search seed from the target road entity data as a search result of the first search seed through the search algorithm; updating a data structure corresponding to the first search seed according to the search result, wherein the data structure comprises a data structure for storing a road section identification attribute of a new road section obtained by performing diffusion inquiry on the first search seed; the data structure corresponding to the first search seed comprises a first data structure, a second data structure, a third data structure and a fourth data structure; the updating the data structure corresponding to the first search seed according to the search result comprises the following steps: according to the search result, storing the road section identification attribute of all the first search seeds which have completed searching in the first data structure; according to the search result, storing the road section identification attribute of the new road section obtained by performing diffusion inquiry on the first search seed in the second data structure; when the search result of the first search seed indicates that the number of the new road sections is greater than or equal to 2, storing the road section identification attribute of the road section obtained by performing diffusion inquiry on the first search seed and the road section identification attribute of the first search seed in the third data structure; taking each new road section in the second data structure as a new first search seed, and storing the road section identification attribute and the first search seed road section identification attribute of the road section obtained by performing diffusion inquiry on each new first search seed in a corresponding fourth data structure; when the number of road sections obtained by searching is smaller than 2, determining that the connectivity of the new first searching seed is single-ended communication; when the road section identification attribute of the third data structure comprises all road section identification attributes in a designated fourth data structure, determining that the connectivity of a new first search seed corresponding to the designated fourth data structure is single-ended communication;
The diffusion processing unit is used for taking the new road section as a new first search seed when a new road section exists in the search result, and performing diffusion inquiry on the new first search seed in the target road entity data until the new road section does not exist in the new search result;
And the result determining unit is used for determining the detection result of the target road entity data according to the search result of each diffusion inquiry, wherein the detection result comprises the connectivity of the target road entity data.
6. An electronic device comprising a memory, a processor coupled to each other, the memory storing a computer program that, when executed by the processor, causes the electronic device to perform the method of any of claims 1-4.
7. A computer readable storage medium, characterized in that the computer program is stored in the readable storage medium, which, when run on a computer, causes the computer to perform the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010918336.1A CN112000762B (en) | 2020-09-03 | 2020-09-03 | Road management detection method, device, electronic equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010918336.1A CN112000762B (en) | 2020-09-03 | 2020-09-03 | Road management detection method, device, electronic equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112000762A CN112000762A (en) | 2020-11-27 |
| CN112000762B true CN112000762B (en) | 2024-06-18 |
Family
ID=73468267
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010918336.1A Active CN112000762B (en) | 2020-09-03 | 2020-09-03 | Road management detection method, device, electronic equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112000762B (en) |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101750089B (en) * | 2008-12-11 | 2012-05-23 | 北京四维图新科技股份有限公司 | Road network connectivity detection method and device based on massive electronic maps |
| CN105606110B (en) * | 2015-11-03 | 2019-03-01 | 浩鲸云计算科技股份有限公司 | The lookup method and device of reachable path based on depth-first traversal |
| EP3473980B1 (en) * | 2017-07-06 | 2022-05-04 | UISEE (Shanghai) Automotive Technologies Ltd. | Road characterization method, and method and device for displaying road information |
-
2020
- 2020-09-03 CN CN202010918336.1A patent/CN112000762B/en active Active
Non-Patent Citations (1)
| Title |
|---|
| 旧城区道路通行空间重构方法研究;谢秋婷;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》(第2018年第3期期);第3.2.2节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112000762A (en) | 2020-11-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109345388B (en) | Block chain intelligent contract verification method and device and storage medium | |
| CN110287696B (en) | Detection method, device and equipment for rebound shell process | |
| CN110086643B (en) | Risk identification method, terminal and storage medium | |
| CN113946546B (en) | Abnormality detection method, computer storage medium, and program product | |
| CN110674247A (en) | Barrage information intercepting method and device, storage medium and equipment | |
| CN111679968A (en) | Interface calling abnormity detection method and device, computer equipment and storage medium | |
| CN111585989A (en) | Vulnerability detection method and device of networked industrial control equipment and computer equipment | |
| CN112000762B (en) | Road management detection method, device, electronic equipment and readable storage medium | |
| CN111159577A (en) | Community division method and device, storage medium and electronic device | |
| CN112165505B (en) | Decentralized data processing method, electronic device and storage medium | |
| CN107153692B (en) | Method and equipment for matching character strings | |
| CN110730128A (en) | Information propagation path processing method and device, electronic equipment and storage medium | |
| CN104699761A (en) | Increment computing method for minimal functional dependencies | |
| CN115470236A (en) | Multi-subgraph matching method, device and equipment | |
| CN108763053B (en) | Method for generating buried point name and terminal equipment | |
| CN113256301B (en) | Data shielding method, device, server and medium | |
| CN114911515A (en) | Configuration management method, device, equipment and medium | |
| CN115499861A (en) | Service same-route detection method, device, equipment and storage medium | |
| CN116263770A (en) | Method, device, terminal equipment and medium for storing business data based on database | |
| KR101508577B1 (en) | Device and method for detecting malware | |
| CN108737522B (en) | Message processing method, device and system | |
| CN113326171B (en) | Memory data processing method and device and electronic equipment | |
| CN114915544B (en) | Method, device, equipment and storage medium for identifying network multi-hop attack chain | |
| CN106203076B (en) | Method for judging malicious file by utilizing EBP (electronic book protocol) | |
| CN112532521B (en) | Outflow node information identification method for NetFlow flow |
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 |