CN116760768A - Method and system for realizing route inquiry bottom layer - Google Patents
Method and system for realizing route inquiry bottom layer Download PDFInfo
- Publication number
- CN116760768A CN116760768A CN202311047107.7A CN202311047107A CN116760768A CN 116760768 A CN116760768 A CN 116760768A CN 202311047107 A CN202311047107 A CN 202311047107A CN 116760768 A CN116760768 A CN 116760768A
- Authority
- CN
- China
- Prior art keywords
- information
- route
- data
- map
- resource
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000004927 fusion Effects 0.000 claims abstract description 25
- 238000012545 processing Methods 0.000 claims description 7
- 238000013507 mapping Methods 0.000 claims description 5
- 238000004458 analytical method Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 abstract description 5
- 230000006870 function Effects 0.000 description 8
- 238000007726 management method Methods 0.000 description 7
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000012732 spatial analysis Methods 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000007405 data analysis Methods 0.000 description 2
- 238000013523 data management Methods 0.000 description 2
- 238000000354 decomposition reaction Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000005215 recombination Methods 0.000 description 2
- 230000006798 recombination Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
-
- 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
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/25—Fusion techniques
Abstract
The invention provides a method and a system for realizing a routing query bottom layer, which relate to the field of communication, wherein the method comprises the following steps: acquiring resource data in a database; fusing the resource data with a map geographic information system to obtain fused data; acquiring a route query request submitted by a user, and analyzing the start-stop node position information of the route from the query request; according to the position information of the start and stop nodes, matching is carried out in the fusion data through a map matching algorithm so as to determine the actual route corresponding to the start and stop nodes; inquiring a database according to the actual route to obtain parameters and attribute information corresponding to the actual route; and assembling the actual route and the parameters and attribute information corresponding to the actual route to form a final query result. The invention can accurately and efficiently realize the inquiry function of the route and improve the level of operation and management.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a method and a system for realizing a routing query bottom layer.
Background
Along with the continuous expansion of the scale of the optical communication network, the resource data volume is increased sharply, and the traditional manual route inquiry mode cannot meet the requirement for efficient management of mass resources.
At present, the geographic information system technology is widely applied to map data processing, and a database management system is mature in big data processing.
However, how to combine the two organically and establish a unified platform containing resource data and geographic information, so as to realize efficient fusion of the resource database and the map information, and the method has a certain technical difficulty.
Disclosure of Invention
The invention aims to solve the technical problem of providing a method and a system for realizing a routing query bottom layer, which can accurately and efficiently realize the routing query function, improve the level of operation and management and intuitively display the geographic path of a route by means of map data.
In order to solve the technical problems, the technical scheme of the invention is as follows:
in a first aspect, a method for implementing a routing query bottom layer, the method includes:
acquiring resource data in a database;
fusing the resource data with a map geographic information system to obtain fused data;
acquiring a route query request submitted by a user, and analyzing the start-stop node position information of the route from the query request;
according to the position information of the start and stop nodes, matching is carried out in the fusion data through a map matching algorithm so as to determine the actual route corresponding to the start and stop nodes;
inquiring a database according to the actual route to obtain parameters and attribute information corresponding to the actual route;
and assembling the actual route and the parameters and attribute information corresponding to the actual route to form a final query result.
Further, obtaining the resource data in the database includes:
the resource database is connected and comprises an interface library, duan Ku and a machine room resource library;
reading interface information from an interface library, wherein the interface information comprises an interface name, an interface type, a machine room where an interface is positioned and interface technical specification parameters; reading segment information from a segment library, wherein the segment information comprises a segment name, an interface, a machine room through which the segment passes, a model and technical parameters; reading machine room information from a machine room resource library, wherein the machine room information comprises a machine room name, a machine room address coordinate, an interface in the machine room and resource information;
correlating the read interface information, the section information and the machine room information to form a resource object;
and storing the resource object into a resource pool of the application program to obtain the resource data from the database.
Further, fusing the resource data with a map geographic information system to obtain fused data, including:
acquiring map data provided by a map geographic information system, wherein the map data comprises a map image layer and a map element layer;
analyzing the map element layer, and extracting the space coordinates of the map element layer;
converting the machine room position coordinates in the resource data and the space coordinates of the map element layer, and mapping the machine room position coordinates into a map data coordinate system;
judging the type of the geographic elements along the segment according to the attribute in the segment data;
carrying out space analysis on start-stop coordinates of the segments and the geographic element types, and judging topological relation between the segments and the geographic element types;
and integrating the topological relation among the interfaces, the segments, the machine room position coordinates and the types of the segments and the geographic elements on the map element layer to form fusion data of the resource data and the map data.
Further, obtaining a route query request submitted by a user, and resolving start-stop node position information of the route from the query request, including:
acquiring a user interface of route query, inputting the name or number of a start-stop node of the query on the user interface, and submitting a query request;
extracting the name or number of a start-stop node in the query request;
according to the node name or number, searching the position coordinates of the start and stop nodes from a preset node information table, wherein the node information table comprises the number, the name and the longitude and latitude coordinates of each node;
and searching the coordinate information corresponding to the start and stop node from the node information table through the number or name matching.
Further, according to the position information of the start and stop nodes, matching is performed in the fusion data through a map matching algorithm to determine an actual route corresponding to the start and stop nodes, including:
performing geocoding on the coordinates of the start and stop nodes on the fusion data, and determining the geographic position of the coordinates of the start and stop nodes;
taking the coordinates of the start and stop nodes as the center, performing diffusibility search, and searching paths connecting the start and stop nodes according to the fusion data;
calculating the estimated final path length of the path from the starting point to the current node n according to a path scoring function f (n) =g (n) +h (n), wherein g (n) is the actual path distance from the starting point to the current node n, and h (n) is the estimated distance from the current node n to the end point;
and acquiring parameter information on the route according to the estimated final path length.
Further, according to the actual route, querying a database to obtain parameters and attribute information corresponding to the actual route, including:
obtaining geographic coordinate information of an actual physical route;
according to the geographic coordinate information, inquiring a segment table in a resource management database, and determining each segment through which an actual physical route passes;
acquiring asset codes of all segment IDs and start-stop nodes;
and searching matched segment parameters and segment attributes in a parameter table according to the segment ID and the asset code.
Further, assembling the actual route and parameters and attribute information corresponding to the actual route to form a final query result, including:
and splicing parameters of each section into a complete route parameter table according to the actual route sequence, and inquiring a machine room resource table to acquire related information if the actual route passes through the machine room to form final route geographic path information and a parameter attribute table.
In a second aspect, a routing query bottom layer implementation system includes:
the acquisition module is used for acquiring the resource data in the database; fusing the resource data with a map geographic information system to obtain fused data; acquiring a route query request submitted by a user, and analyzing the start-stop node position information of the route from the query request;
the processing module is used for matching in the fusion data through a map matching algorithm according to the position information of the start-stop nodes so as to determine the actual route corresponding to the start-stop nodes; inquiring a database according to the actual route to obtain parameters and attribute information corresponding to the actual route; and assembling the actual route and the parameters and attribute information corresponding to the actual route to form a final query result.
In a third aspect, a computing device includes:
one or more processors;
and a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the above-described methods.
In a fourth aspect, a computer readable storage medium stores a program that when executed by a processor implements the above method.
The scheme of the invention at least comprises the following beneficial effects:
the scheme of the invention accurately and efficiently realizes the inquiry function of the route, improves the level of operation and management, can intuitively display the geographic path of the route by means of map data, realizes the effective fusion and application of data by utilizing a resource database and a geographic information system, forms the inquiry result of the route containing comprehensive information by parameter assembly, and is convenient for subsequent utilization.
Drawings
Fig. 1 is a flow chart of a method for implementing a routing query bottom layer according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a routing query bottom layer implementation system according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As shown in fig. 1, an embodiment of the present invention proposes a method for implementing a routing query bottom layer, where the method includes:
step 11, obtaining resource data in a database;
step 12, fusing the resource data with a map geographic information system to obtain fused data;
step 13, obtaining a route query request submitted by a user, and analyzing the start-stop node position information of the route from the query request;
step 14, matching is carried out in the fusion data through a map matching algorithm according to the position information of the start-stop nodes so as to determine the actual route corresponding to the start-stop nodes;
step 15, according to the actual route, inquiring a database to obtain parameters and attribute information corresponding to the actual route;
and step 16, assembling the actual route and the parameters and attribute information corresponding to the actual route to form a final query result.
In step 11, all fixed and known resource information in the system, including path, attribute parameters, etc. of each, can be acquired, and for the acquisition of resource data, a complete and queriable resource background database is constructed, which is the basis for realizing routing query. In step 12, the resource data and the geographic information are integrated, so that the position information corresponds to the actual geographic position on the map, and the integration of the data enables the route to be searched and displayed on the map, thereby increasing the geographic intuitiveness. In step 13, the query request submitted by the user is accepted, and the starting and ending point positions of the specific route which the user wants to query are defined, so that the system can define the query requirement of the user and accurately provide services for the user. In step 14, a specific path meeting the query requirement of the user can be accurately found, and an actual path can be given on the map. In step 15, detailed parameters corresponding to the matched route, such as type, length, loss value, etc., can be obtained, so that the user can not only know the actual layout position. In step 16, after all the information sets obtained by the query are consolidated, a complete query feedback result is formed and returned to the user, so that the user can know the query result including the route, and the detailed parameters, attributes and other information about the route, and the query result is finer and more comprehensive.
In a preferred embodiment of the present invention, the step 11 may include:
step 111, connecting a resource database, wherein the resource database comprises an interface library, duan Ku and a machine room resource library;
step 112, reading interface information from an interface library, wherein the interface information comprises an interface name, an interface type, a computer room where an interface is positioned and interface technical specification parameters; reading segment information from a segment library, wherein the segment information comprises a segment name, an interface, a machine room through which the segment passes, a model and technical parameters; reading machine room information from a machine room resource library, wherein the machine room information comprises a machine room name, a machine room address coordinate, an interface in the machine room and resource information;
step 113, associating the read interface information, section information and machine room information to form a resource object;
and 114, storing the resource object into a resource pool of the application program to obtain the resource data from the database.
In step 111, a starting point of resource information acquisition is constructed, so that accuracy and comprehensiveness of a data acquisition method are ensured, and particularly interfaces, segments and machine room resource reservoirs are distinguished, so that efficiency of data management is improved, and accuracy of subsequent data processing is facilitated. In step 112, the detailed information is obtained comprehensively from different angles, and this way of accurately capturing the data can ensure that the creation of the resource object is robust and comprehensive, and the network is known in depth and detail. In step 113, the distributed information is effectively integrated to construct a resource object with global view and strict logic, which ensures the consistency required by data analysis and is more convenient for data management, maintenance and analysis. In step 114, the resource objects are stored in a centralized resource pool, and after the objects are created, performance waste caused by repeatedly acquiring and creating the objects can be avoided in terms of real-time inquiry, dynamic scheduling and the like, so that the operation efficiency and the instantaneity of the system are greatly improved.
In a preferred embodiment of the present invention, the step 12 may include:
step 121, obtaining map data provided by a map geographic information system, wherein the map data comprises a map image layer and a map element layer;
step 122, analyzing the map element layer, and extracting the space coordinates of the map element layer;
step 123, converting the machine room position coordinates in the resource data and the space coordinates of the map element layer, and mapping the machine room position coordinates into a map data coordinate system;
step 124, judging the type of the geographic elements along the segment according to the attribute in the segment data;
step 125, performing spatial analysis on the start-stop coordinates of the segments and the geographic element types, and judging the topological relation between the segments and the geographic element types;
and step 126, integrating the topological relation among the interfaces, the segments, the machine room position coordinates and the types of the segments and the geographic elements on the map element layer to form fusion data of the resource data and the map data.
In step 122, the element layer spatial coordinates are resolved, and abstract geographic coordinate information is obtained, which provides a basis for subsequent coordinate conversion and mapping. In step 123, the correspondence between the machine room position coordinates and the map coordinates is realized, so that the machine room position in the resource data can be visualized on the map. In step 124, basic information is provided for spatial analysis of the segments and the geographic elements, and pertinence of the spatial analysis is improved. In step 125, the spatial relationship between the segments and the geographic elements is calculated, and topology relationship information is provided for the fusion of the resource data and the map. In step 126, the organic fusion of the resource data and the map data is realized, so that the resource data can be intuitively displayed on the map, and the efficiency of data analysis and decision making is improved.
In a preferred embodiment of the present invention, the step 13 may include:
step 131, obtaining a user interface of route query, inputting the name or number of the start-stop node of the query on the user interface, and submitting the query request;
step 132, extracting the name or number of the start-stop node in the query request;
step 133, searching position coordinates of start and stop nodes from a preset node information table according to the node names or numbers, wherein the node information table comprises the numbers, the names and longitude and latitude coordinates of each node;
and step 134, searching the coordinate information corresponding to the start and stop nodes from the node information table through number or name matching.
In step 131, by acquiring the user interface and letting the user input the query request, the interaction between the user and the system is realized, the user can input the name or number of the start-stop node to be queried, the user can query the route conveniently, the query efficiency is improved, and the user experience is enhanced. In step 132, the accuracy of the query request is ensured by extracting node information in the query request, and necessary parameters are provided for the next search for location coordinates. In step 133, the node information table can be searched to obtain accurate longitude and latitude coordinates by using the node name or number, so that the accuracy of the query result is improved, and the correct unique node is ensured to be found. In step 134, it may be ensured that the corresponding route is found by the node name or number, and the starting point of the route may be determined according to the query result, so that the result is more intuitive and accurate, and decision making is facilitated.
In a preferred embodiment of the present invention, the step 14 may include:
step 141, performing geocoding of the coordinates of the start and stop nodes on the fused data, and determining the geographic position of the coordinates of the start and stop nodes;
step 142, taking the coordinates of the start and stop nodes as the center, performing a diffusibility search, and searching a path for connecting the start and stop nodes according to the fusion data;
step 143, calculating the estimated final path length of the path from the start point to the current node n according to the path scoring function f (n) =g (n) +h (n), wherein g (n) is the actual path distance from the start point to the current node n, and h (n) is the estimated distance from the current node n to the end point;
and 144, obtaining parameter information on the route according to the estimated final path length.
In step 141, the geocode may convert coordinates of the nodes into specific location addresses, which facilitates subsequent identification of the node locations on the map, and lays a foundation for finding paths between the nodes. In step 142, the diffuse search radiates outward centered on the start-stop node, and all possible paths connecting the two nodes can be effectively found, avoiding omission. In step 143, the scoring function combines the known distance and the estimated distance, and the expected lengths of the different paths may be compared for finding the best path. In step 144, based on the best path found previously, specific parameters on that path may be extracted, providing the user with detailed query results.
In a preferred embodiment of the present invention, the step 15 may include:
step 151, obtaining geographic coordinate information of an actual physical route;
step 152, according to the geographic coordinate information, inquiring a segment table in a resource management database, and determining each segment through which an actual physical route passes;
step 153, acquiring asset codes of all segment IDs and start-stop nodes;
step 154, searching the matched segment parameters and segment attributes in the parameter table according to the segment ID and asset code.
In step 152, the segment table is queried to accurately locate the segment corresponding to the route, thereby improving the accuracy of the query. In step 154, a unique segment is determined by ID and encoding, thereby obtaining detailed parameters and attribute information, such as type, capacity, manufacturer, etc., of the segment, completing the entire routing query.
In a preferred embodiment of the present invention, the step 16 may include:
and 161, splicing parameters of each section into a complete route parameter table according to the actual route sequence, and if the actual route passes through the machine room, inquiring the machine room resource table to acquire related information so as to form final route geographic path information and a parameter attribute table.
In step 161, the parameters of each segment obtained by the previous query may be spliced into an integral and complete routing parameter table according to the actual physical path sequence, so as to avoid the intermittent parameter and improve the continuity of the parameter table. By splicing the segment parameters and adding the machine room information, a complete table containing the route geographic path and the parameter attributes of each segment can be formed, and comprehensive details of the route can be provided for the user.
As shown in fig. 2, an embodiment of the present invention further provides a routing query bottom layer implementation system 20, including:
an acquisition module 21, configured to acquire resource data in a database; fusing the resource data with a map geographic information system to obtain fused data; acquiring a route query request submitted by a user, and analyzing the start-stop node position information of the route from the query request;
the processing module 22 is configured to perform matching in the fusion data according to the position information of the start-stop node through a map matching algorithm, so as to determine an actual route corresponding to the start-stop node; inquiring a database according to the actual route to obtain parameters and attribute information corresponding to the actual route; and assembling the actual route and the parameters and attribute information corresponding to the actual route to form a final query result.
Optionally, acquiring the resource data in the database includes:
the resource database is connected and comprises an interface library, duan Ku and a machine room resource library;
reading interface information from an interface library, wherein the interface information comprises an interface name, an interface type, a machine room where an interface is positioned and interface technical specification parameters; reading segment information from a segment library, wherein the segment information comprises a segment name, an interface, a machine room through which the segment passes, a model and technical parameters; reading machine room information from a machine room resource library, wherein the machine room information comprises a machine room name, a machine room address coordinate, an interface in the machine room and resource information;
correlating the read interface information, the section information and the machine room information to form a resource object;
and storing the resource object into a resource pool of the application program to obtain the resource data from the database.
Optionally, fusing the resource data with a map geographic information system to obtain fused data, including:
acquiring map data provided by a map geographic information system, wherein the map data comprises a map image layer and a map element layer;
analyzing the map element layer, and extracting the space coordinates of the map element layer;
converting the machine room position coordinates in the resource data and the space coordinates of the map element layer, and mapping the machine room position coordinates into a map data coordinate system;
judging the type of the geographic elements along the segment according to the attribute in the segment data;
carrying out space analysis on start-stop coordinates of the segments and the geographic element types, and judging topological relation between the segments and the geographic element types;
and integrating the topological relation among the interfaces, the segments, the machine room position coordinates and the types of the segments and the geographic elements on the map element layer to form fusion data of the resource data and the map data.
Optionally, obtaining a route query request submitted by a user, and resolving start-stop node position information of the route from the query request, including:
acquiring a user interface of route query, inputting the name or number of a start-stop node of the query on the user interface, and submitting a query request;
extracting the name or number of a start-stop node in the query request;
according to the node name or number, searching the position coordinates of the start and stop nodes from a preset node information table, wherein the node information table comprises the number, the name and the longitude and latitude coordinates of each node;
and searching the coordinate information corresponding to the start and stop node from the node information table through the number or name matching.
Optionally, matching is performed in the fusion data by a map matching algorithm according to the position information of the start and stop nodes to determine an actual route corresponding to the start and stop nodes, including:
performing geocoding on the coordinates of the start and stop nodes on the fusion data, and determining the geographic position of the coordinates of the start and stop nodes;
taking the coordinates of the start and stop nodes as the center, performing diffusibility search, and searching paths connecting the start and stop nodes according to the fusion data;
calculating the estimated final path length of the path from the starting point to the current node n according to a path scoring function f (n) =g (n) +h (n), wherein g (n) is the actual path distance from the starting point to the current node n, and h (n) is the estimated distance from the current node n to the end point;
and acquiring parameter information on the route according to the estimated final path length.
Optionally, according to the actual route, querying a database to obtain parameters and attribute information corresponding to the actual route, including:
obtaining geographic coordinate information of an actual physical route;
according to the geographic coordinate information, inquiring a segment table in a resource management database, and determining each segment through which an actual physical route passes;
acquiring asset codes of all segment IDs and start-stop nodes;
and searching matched segment parameters and segment attributes in a parameter table according to the segment ID and the asset code.
Optionally, assembling the actual route and parameters and attribute information corresponding to the actual route to form a final query result, including:
and splicing parameters of each section into a complete route parameter table according to the actual route sequence, and inquiring a machine room resource table to acquire related information if the actual route passes through the machine room to form final route geographic path information and a parameter attribute table.
It should be noted that the apparatus is an apparatus corresponding to the above method, and all implementation manners in the above method embodiment are applicable to this embodiment, so that the same technical effects can be achieved.
Embodiments of the present invention also provide a computing device comprising: a processor, a memory storing a computer program which, when executed by the processor, performs the method as described above. All the implementation manners in the method embodiment are applicable to the embodiment, and the same technical effect can be achieved.
Embodiments of the present invention also provide a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform a method as described above. All the implementation manners in the method embodiment are applicable to the embodiment, and the same technical effect can be achieved.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk, etc.
Furthermore, it should be noted that in the apparatus and method of the present invention, it is apparent that the components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered as equivalent aspects of the present invention. Also, the steps of performing the series of processes described above may naturally be performed in chronological order in the order of description, but are not necessarily performed in chronological order, and some steps may be performed in parallel or independently of each other. It will be appreciated by those of ordinary skill in the art that all or any of the steps or components of the methods and apparatus of the present invention may be implemented in hardware, firmware, software, or a combination thereof in any computing device (including processors, storage media, etc.) or network of computing devices, as would be apparent to one of ordinary skill in the art after reading this description of the invention.
The object of the invention can thus also be achieved by running a program or a set of programs on any computing device. The computing device may be a well-known general purpose device. The object of the invention can thus also be achieved by merely providing a program product containing program code for implementing said method or apparatus. That is, such a program product also constitutes the present invention, and a storage medium storing such a program product also constitutes the present invention. It is apparent that the storage medium may be any known storage medium or any storage medium developed in the future. It should also be noted that in the apparatus and method of the present invention, it is apparent that the components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered as equivalent aspects of the present invention. The steps of executing the series of processes may naturally be executed in chronological order in the order described, but are not necessarily executed in chronological order. Some steps may be performed in parallel or independently of each other.
While the foregoing is directed to the preferred embodiments of the present invention, it will be appreciated by those skilled in the art that various modifications and adaptations can be made without departing from the principles of the present invention, and such modifications and adaptations are intended to be comprehended within the scope of the present invention.
Claims (10)
1. A method for implementing a routing query floor, the method comprising: acquiring resource data in a database; fusing the resource data with a map geographic information system to obtain fused data; acquiring a route query request submitted by a user, and analyzing the start-stop node position information of the route from the query request; according to the position information of the start and stop nodes, matching is carried out in the fusion data through a map matching algorithm so as to determine the actual route corresponding to the start and stop nodes; inquiring a database according to the actual route to obtain parameters and attribute information corresponding to the actual route; and assembling the actual route and the parameters and attribute information corresponding to the actual route to form a final query result.
2. The method for implementing the routing query bottom layer according to claim 1, wherein obtaining the resource data in the database comprises: the resource database is connected and comprises an interface library, duan Ku and a machine room resource library; reading interface information from an interface library, wherein the interface information comprises an interface name, an interface type, a machine room where an interface is positioned and interface technical specification parameters; reading segment information from a segment library, wherein the segment information comprises a segment name, an interface, a machine room through which the segment passes, a model and technical parameters; reading machine room information from a machine room resource library, wherein the machine room information comprises a machine room name, a machine room address coordinate, an interface in the machine room and resource information; correlating the read interface information, the section information and the machine room information to form a resource object; and storing the resource object into a resource pool of the application program to obtain the resource data from the database.
3. The method for implementing the routing query bottom layer according to claim 2, wherein fusing the resource data with a map geographic information system to obtain fused data comprises: acquiring map data provided by a map geographic information system, wherein the map data comprises a map image layer and a map element layer; analyzing the map element layer, and extracting the space coordinates of the map element layer; converting the machine room position coordinates in the resource data and the space coordinates of the map element layer, and mapping the machine room position coordinates into a map data coordinate system; judging the type of the geographic elements along the segment according to the attribute in the segment data; carrying out space analysis on start-stop coordinates of the segments and the geographic element types, and judging topological relation between the segments and the geographic element types; and integrating the topological relation among the interfaces, the segments, the machine room position coordinates and the types of the segments and the geographic elements on the map element layer to form fusion data of the resource data and the map data.
4. The method for implementing the routing query bottom layer according to claim 3, wherein obtaining the routing query request submitted by the user and resolving the start-stop node position information of the route from the query request comprises: acquiring a user interface of route query, inputting the name or number of a start-stop node of the query on the user interface, and submitting a query request; extracting the name or number of a start-stop node in the query request; according to the node name or number, searching the position coordinates of the start and stop nodes from a preset node information table, wherein the node information table comprises the number, the name and the longitude and latitude coordinates of each node; and searching the coordinate information corresponding to the start and stop node from the node information table through the number or name matching.
5. The method according to claim 4, wherein the step of matching in the fusion data by a map matching algorithm according to the start-stop node position information to determine the actual route corresponding to the start-stop node comprises: performing geocoding on the coordinates of the start and stop nodes on the fusion data, and determining the geographic position of the coordinates of the start and stop nodes; taking the coordinates of the start and stop nodes as the center, performing diffusibility search, and searching paths connecting the start and stop nodes according to the fusion data; calculating the estimated final path length of the path from the starting point to the current node n according to a path scoring function f (n) =g (n) +h (n), wherein g (n) is the actual path distance from the starting point to the current node n, and h (n) is the estimated distance from the current node n to the end point; and acquiring parameter information on the route according to the estimated final path length.
6. The method for implementing the routing query bottom layer according to claim 5, wherein the step of querying a database according to the actual route to obtain the parameters and attribute information corresponding to the actual route includes: obtaining geographic coordinate information of an actual physical route; according to the geographic coordinate information, inquiring a segment table in a resource management database, and determining each segment through which an actual physical route passes; acquiring asset codes of all segment IDs and start-stop nodes; and searching matched segment parameters and segment attributes in a parameter table according to the segment ID and the asset code.
7. The method of claim 6, wherein assembling the actual route and parameters and attribute information corresponding to the actual route to form a final query result comprises: and splicing parameters of each section into a complete route parameter table according to the actual route sequence, and inquiring a machine room resource table to acquire related information if the actual route passes through the machine room to form final route geographic path information and a parameter attribute table.
8. A routing query infrastructure implementation system, comprising: the acquisition module is used for acquiring the resource data in the database; fusing the resource data with a map geographic information system to obtain fused data; acquiring a route query request submitted by a user, and analyzing the start-stop node position information of the route from the query request; the processing module is used for matching in the fusion data through a map matching algorithm according to the position information of the start-stop nodes so as to determine the actual route corresponding to the start-stop nodes; inquiring a database according to the actual route to obtain parameters and attribute information corresponding to the actual route; and assembling the actual route and the parameters and attribute information corresponding to the actual route to form a final query result.
9. A computing device, comprising: one or more processors; storage means for storing one or more programs which when executed by the one or more processors cause the one or more processors to implement the method of any of claims 1-7.
10. A computer readable storage medium, characterized in that the computer readable storage medium has stored therein a program which, when executed by a processor, implements the method according to any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311047107.7A CN116760768A (en) | 2023-08-21 | 2023-08-21 | Method and system for realizing route inquiry bottom layer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311047107.7A CN116760768A (en) | 2023-08-21 | 2023-08-21 | Method and system for realizing route inquiry bottom layer |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116760768A true CN116760768A (en) | 2023-09-15 |
Family
ID=87948217
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311047107.7A Pending CN116760768A (en) | 2023-08-21 | 2023-08-21 | Method and system for realizing route inquiry bottom layer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116760768A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2280677A1 (en) * | 1998-08-31 | 2000-02-29 | Delorme Publishing Company, Inc. | Integrated routing/mapping information system |
| CN1909473A (en) * | 2006-08-24 | 2007-02-07 | 上海交通大学 | Method for realizing integrated composite network information managing system based on geography information |
| CN103095504A (en) * | 2013-01-25 | 2013-05-08 | 山东广电网络有限公司济南分公司 | Management system of wired network basic resources |
| CN105591691A (en) * | 2016-02-29 | 2016-05-18 | 国网河南省电力公司南阳供电公司 | GIS-based communication optical cable online monitoring system and GIS-based communication optical cable fault point positioning method |
| CN109245923A (en) * | 2018-08-27 | 2019-01-18 | 国家电网有限公司 | Communications optical cable route resource management method and system |
| CN114186950A (en) * | 2021-10-19 | 2022-03-15 | 北京中电飞华通信有限公司 | Optical cable resource management method and system |
| CN115913355A (en) * | 2022-11-11 | 2023-04-04 | 中国电信股份有限公司 | Routing information display method and device, electronic equipment and storage medium |
-
2023
- 2023-08-21 CN CN202311047107.7A patent/CN116760768A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2280677A1 (en) * | 1998-08-31 | 2000-02-29 | Delorme Publishing Company, Inc. | Integrated routing/mapping information system |
| CN1909473A (en) * | 2006-08-24 | 2007-02-07 | 上海交通大学 | Method for realizing integrated composite network information managing system based on geography information |
| CN103095504A (en) * | 2013-01-25 | 2013-05-08 | 山东广电网络有限公司济南分公司 | Management system of wired network basic resources |
| CN105591691A (en) * | 2016-02-29 | 2016-05-18 | 国网河南省电力公司南阳供电公司 | GIS-based communication optical cable online monitoring system and GIS-based communication optical cable fault point positioning method |
| CN109245923A (en) * | 2018-08-27 | 2019-01-18 | 国家电网有限公司 | Communications optical cable route resource management method and system |
| CN114186950A (en) * | 2021-10-19 | 2022-03-15 | 北京中电飞华通信有限公司 | Optical cable resource management method and system |
| CN115913355A (en) * | 2022-11-11 | 2023-04-04 | 中国电信股份有限公司 | Routing information display method and device, electronic equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 尹平;: "利用地理信息系统完成光缆网络的设计和维护", 有线电视技术, no. 06 * |
| 沈铁民;: "基于GIS的光纤资源管理系统及其在光纤城域网中的应用", 科技资讯, no. 13 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Antoniou et al. | Measures and indicators of VGI quality: An overview | |
| CN103078962B (en) | The system and method for the accuracy of the information that increase returns for context signal | |
| Sehra et al. | A systematic study of OpenStreetMap data quality assessment | |
| JP2013025791A (en) | Methods, systems and programs for clustering collections of geo-tagged photographs | |
| CN106251164A (en) | Method and system are recommended at a kind of scenic spot | |
| JP2012123542A (en) | Server, information management method, information management program and computer-readable storage medium for recording information management program | |
| JP2021192041A (en) | Method for positioning building, device, electronic device, storage medium, program, and terminal device | |
| CN111177289A (en) | Method and system for extracting and checking related information of data space of multi-source network | |
| CN111414410A (en) | Data processing method, device, equipment and storage medium | |
| CN115905630A (en) | Graph database query method, device, equipment and storage medium | |
| CN103390099A (en) | Service system and service method based on mobile operation system platform and Mobile GIS (Geographic Information System) | |
| JP7298090B2 (en) | Method and apparatus for extracting spatial relationships of geolocation points | |
| CN112015845B (en) | Method, device, equipment and storage medium for map retrieval test | |
| CN113901117A (en) | Multi-source test data leading processing method | |
| TW201445341A (en) | System and method for searching based on selected area | |
| CN113553341A (en) | Multidimensional data analysis method, multidimensional data analysis device, multidimensional data analysis equipment and computer readable storage medium | |
| CN116760768A (en) | Method and system for realizing route inquiry bottom layer | |
| CN111949845A (en) | Method, apparatus, computer device and storage medium for processing mapping information | |
| CN105488179A (en) | Automatic configuring and connecting method for processing various databases and middleware | |
| CN110134730A (en) | Data production method, device, medium and electronic equipment | |
| Ladra et al. | A toponym resolution service following the OGC WPS standard | |
| Planting | Developing a data repository for the Climate Adaptive City Enschede | |
| Svetashova et al. | Towards semantic model extensibility in interoperable IoT data exchange platforms | |
| CN117271837A (en) | Method, device, equipment and storage medium for processing power distribution network data | |
| CN112965993B (en) | Data processing system, method, device and storage medium |
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 |