Road historical data tracing method, device, equipment and medium

Abstract

The invention relates to the technical field of data processing, and discloses a road historical data tracing method and device, equipment and a medium. The method comprises the following steps: acquiring basic data of the current year and basic data of the last year, and matching key attributes of the basic data of the current year and the basic data of the last year; when key attribute matching fails, historical event tracing is carried out on the basic data of the current year and the basic data of the last year, and change content and historical events are determined; and generating an annual incremental road historical data traceability table and a road historical data traceability chain according to the change content and the historical event. According to the road full life cycle historical data tracing method, the road full life cycle historical data tracing method is provided for road industry management, the accuracy of the tracing result is high, and the industry management requirements of road construction and maintenance are fully met.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular to a method, device, equipment and medium for tracing back historical highway data. Background Art

[0002] The spatiotemporal data model is built based on the representation method of time and is used to organize and manage temporal geographic data, attributes, spatial and temporal semantics. A more complete geographic data model can be used to reproduce historical states, track historical changes, and predict future trends.

[0003] Existing technologies mainly target roads and objects that existed in history over a long time span (hundreds of years), and the basic references for tracing are relative positions, surrounding environments, and graphical restoration of text descriptions. However, historical data tracing in the field of modern highway management is the tracing of routes from planning to abandonment. Existing technologies cannot accurately obtain the attribute information corresponding to the highway, cannot obtain supporting materials (approvals, etc.) from the planning to the abandonment of the highway, and cannot provide tracing results that meet the requirements and regulations of highway administrative management. Therefore, existing technologies are not suitable for modern highway industry management. Summary of the invention

[0004] In view of this, the purpose of the present invention is to overcome the deficiencies in the prior art and to provide a method, device, equipment and medium for tracing highway historical data.

[0005] The present invention provides the following technical solutions:

[0006] In a first aspect, an embodiment of the present disclosure provides a method for tracing highway historical data, the method comprising:

[0007] Obtaining basic data of this year and basic data of last year, and matching key attributes of the basic data of this year and basic data of last year;

[0008] When the key attribute fails to match, historical events are traced back to the basic data of the current year and the basic data of the previous year to determine the change content and historical events;

[0009] According to the change content and the historical events, an annual incremental highway historical data tracing table and a highway historical data tracing chain are generated.

[0010] Optionally, the key attributes include route code, route name, route length and route start and end points, and the matching of the key attributes of the basic data of this year with the basic data of last year includes:

[0011] Matching the route codes of the basic data of this year with those of the basic data of last year, and when the route code matching fails, matching the route names of the basic data of this year with those of the basic data of last year;

[0012] When the route name matching fails, the route lengths of the basic data of this year and the basic data of last year are matched, and the route start and end points of the basic data of this year and the basic data of last year are matched;

[0013] When both the route length match and the route start and end point match fail, it is determined that the key attribute match fails.

[0014] Optionally, matching the key attributes of the basic data of the current year with the basic data of the previous year further includes:

[0015] When the route code matches successfully, or when the route name matches successfully, or when the route length matches successfully and the route start and end points match successfully, it is determined that the key attribute matches successfully.

[0016] Optionally, after determining that the key attribute matches successfully, the method further includes:

[0017] It is determined that the route corresponding to the basic data of this year and the basic data of last year is the same route, and an annual incremental highway historical data tracing table and a highway historical data tracing chain for the same route are directly generated.

[0018] Optionally, the tracing back historical events of the basic data of the current year and the basic data of the previous year to determine the change content and historical events includes:

[0019] Compare the technical attributes of the basic data of the current year with the basic data of the previous year to determine whether there is an attribute change, and when there is an attribute change, determine the corresponding change content, wherein the technical attributes include route length, roadbed width, road surface width, road surface material and technical grade;

[0020] Query the change events and their corresponding key attributes in the previous year's planning library, and match the queried key attributes with the approval documents in the previous year's planning library. When the queried key attributes successfully match the approval documents, determine the corresponding historical events.

[0021] Optionally, the method further comprises:

[0022] When there is no attribute change and the queried key attribute fails to match the approval document, it is determined that the route corresponding to the basic data of this year cannot be traced back.

[0023] Optionally, generating an annual incremental highway historical data tracing table and a highway historical data tracing chain according to the change content and the historical events includes:

[0024] Generate the annual incremental highway historical data tracing table according to the change content and the historical event, wherein the annual incremental highway historical data tracing table includes at least one of the route code, tracing year, tracing year status, section code, meta-section data, and route attribute;

[0025] Starting from the basic data of the current year, the historical data is gradually traced back to generate the changes and historical events of each year, and the highway historical data traceability chain is formed according to the changes and historical events of each year.

[0026] In a second aspect, an embodiment of the present disclosure provides a highway historical data tracing device, the device comprising:

[0027] A matching module is used to obtain basic data of this year and basic data of last year, and match key attributes of the basic data of this year and basic data of last year;

[0028] A tracing module is used to trace the historical events of the basic data of the current year and the basic data of the previous year to determine the change content and historical events when the key attribute matching fails;

[0029] A generation module is used to generate an annual incremental highway historical data tracing table and a highway historical data tracing chain according to the change content and the historical events.

[0030] In a third aspect, a computer device is provided in an embodiment of the present disclosure, the computer device comprising a memory and a processor, the memory storing a computer program, and the processor implementing the steps of the highway historical data tracing method described in the first aspect when executing the computer program.

[0031] In a fourth aspect, a computer-readable storage medium is provided in an embodiment of the present disclosure, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the highway historical data tracing method described in the first aspect are implemented.

[0032] Beneficial effects of this application:

[0033] The highway historical data tracing method provided in the embodiment of the present application includes: obtaining the basic data of the current year and the basic data of the previous year, and matching the key attributes of the basic data of the current year and the basic data of the previous year; when the key attribute matching fails, tracing the historical events of the basic data of the current year and the basic data of the previous year to determine the changes and historical events; according to the changes and the historical events, generating an annual incremental highway historical data tracing table and a highway historical data tracing chain. Aiming at the management of the highway industry, the present application proposes a tracing method for the historical data of the entire life cycle of the highway, and the tracing results are highly accurate, which fully supports the industry management needs of highway construction and maintenance.

[0034] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and understandable, preferred embodiments are given below and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments. It should be understood that the following drawings only illustrate certain embodiments of the present invention and should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without creative work. In each of the drawings, similar components are numbered similarly.

[0036] Figure 1 A flowchart of a highway historical data tracing method provided by an embodiment of the present application is shown;

[0037] Figure 2 A flowchart of a key attribute matching algorithm provided in an embodiment of the present application is shown;

[0038] Figure 3 A flowchart of a historical event tracing algorithm provided by an embodiment of the present application is shown;

[0039] Figure 4 A flowchart of generating a highway historical data traceability chain provided by an embodiment of the present application is shown;

[0040] Figure 5 A schematic diagram of the structure of a highway historical data tracing device provided in an embodiment of the present application is shown;

[0041] Figure 6 A schematic diagram of the structure of a computer device provided in an embodiment of the present application is shown. DETAILED DESCRIPTION

[0042] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be understood as limiting the present invention.

[0043] It should be noted that when an element is referred to as being "fixed to" another element, it may be directly on the other element or there may be a central element. When an element is considered to be "connected to" another element, it may be directly connected to the other element or there may be a central element at the same time. In contrast, when an element is referred to as being "directly on" another element, there is no intermediate element. The terms "vertical", "horizontal", "left", "right" and similar expressions used herein are for illustrative purposes only.

[0044] In the present invention, unless otherwise clearly specified and limited, the terms "installed", "connected", "connected", "fixed" and the like should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two elements or the interaction relationship between two elements. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0045] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of the present invention, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.

[0046] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein in the specification of the template are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "and / or" used herein includes any and all combinations of one or more of the related listed items.

[0047] Example 1

[0048] like Figure 1 FIG. 1 is a flowchart of a method for tracing back historical highway data in an embodiment of the present application. The method for tracing back historical highway data provided in an embodiment of the present application includes the following steps:

[0049] Step S110, obtaining basic data of this year and basic data of last year, and matching key attributes of the basic data of this year and basic data of last year.

[0050] In this embodiment, the basic data of this year and the basic data of the previous year (mainly including the attribute information of the route and the electronic map data indicating the spatial position of the route) are imported by the electronic map basic data system, and the attribute information is extracted. The attribute information mainly refers to the key attributes, technical attributes and maintenance attributes of the route. Among them, the key attributes include route code, route name, route length, starting and ending points; the technical attributes include route length, roadbed width, pavement width, pavement material, and technical grade; the maintenance attributes include maintenance unit, construction year, major and medium repair year and other information.

[0051] Understandably, the tracing of historical data first uses the "key attribute matching" method, which uses the key attributes in the attribute information for tracing. In highways, changing and adjusting the route codes and names of county and township roads requires a strict administrative approval process. The key attributes of county and township roads are difficult to change, and the change process has complete approval documents. Therefore, the historical change process of county and township roads is relatively clear, and the tracing process is clear.

[0052] Specifically, Figure 2 As shown, the matching process adopts a hierarchical progressive approach. The route code matching and route name matching adopt "XOR" judgment. First, the route codes of the basic data of this year and the basic data of last year are matched. When the route code matching fails, the route names of the basic data of this year and the basic data of last year are matched.

[0053] Understandably, the village road route codes and route names are managed by county-level departments and will be adjusted in real time according to the overall situation of the annual road network. The change frequency is relatively high. Therefore, when the route number and route name both fail to match, the second step is to match the route length with the route start and end points. The route length and route start and end points are judged by "and". First, match the route length of the basic data of this year with the basic data of the previous year, and match the route start and end points of the basic data of this year with the basic data of the previous year. When the route length match and the route start and end point match both fail, it is determined that the key attribute match fails.

[0054] It should be noted that when the route code matches successfully or when the route name matches successfully, it is determined that the key attribute matches successfully, and the route corresponding to the basic data of this year and the basic data of the previous year is considered to be the same route; when the route length matches successfully and the route starting and ending points match successfully, it is also determined that the key attribute matches successfully, that is, the conditions that the route length and the route starting and ending points are the same must be met at the same time to be able to determine that two routes with different route codes and route names in adjacent years are the same route, that is, the route data in adjacent years have an inheritance relationship.

[0055] After determining that the routes in adjacent years are the same route, the annual incremental highway historical data tracing table and highway historical data tracing chain of the route can be directly generated.

[0056] The above method ensures the accuracy of data tracing by using the "key attribute matching" method, which relies on key attributes that are difficult to change easily (such as route code, route name, etc.) for tracing. The matching process adopts a hierarchical progressive approach, from route code to route name, and then to route length and route start and end points. This step-by-step matching strategy improves the efficiency and flexibility of data matching and ensures the accuracy and consistency of highway historical data.

[0057] Step S120: When the key attribute matching fails, historical event tracing is performed on the basic data of the current year and the basic data of the previous year to determine the change content and historical events.

[0058] Understandably, when the records in the basic database are incomplete and the key attributes cannot be used to trace historical data, the "historical event tracing" process is entered. "Historical event tracing" uses the annual plans, various change approvals, feasibility study preliminary design materials, project acceptance materials, etc. archived in the database to determine the various changes and historical events that occurred in the highway during the tracing year, and traces back based on the corresponding events.

[0059] Specifically, if Figure 3 As shown, the main process of historical event tracing includes technical attribute comparison and planning library comparison. If one of the two methods can be successfully compared, the tracing is considered to be completed. First, the technical attributes (route length, roadbed width, road surface width, road surface material and technical grade) of the basic data of the current year and the basic data of the previous year are compared to determine whether there is a change in the attributes. If there is a change in the attributes, the corresponding changes in the two years before and after are preliminarily determined.

[0060] Then, the change event and its corresponding key attributes (route code, route name, route length, route start and end points) are queried in the previous year's planning library, and the queried key attributes are matched with the approval documents in the previous year's planning library. When the queried key attributes match the approval documents successfully, it is considered that the historical data traceability is successful, and the corresponding historical events can be determined at this time.

[0061] It should be noted that when both methods cannot be traced, that is, there is no attribute change and the queried key attributes fail to match the approval document, it proves that the relevant information in the database is missing. At this time, it is determined that the route corresponding to the basic data of this year cannot be traced.

[0062] The above method provides two tracing methods: technical attribute comparison and planning library comparison. These two methods complement each other, increase the flexibility of tracing, and provide highway management departments with rich historical information and change records.

[0063] Step S130: Generate an annual incremental highway historical data tracing table and a highway historical data tracing chain according to the change content and the historical events.

[0064] It can be understood that the incremental tracing table is a global data table that records the route codes and route status of the same route in the database over the years, and represents the inheritance relationship between the same route in different years. Table 1 below shows an incremental tracing table.

[0065] Table 1

[0066]

[0067]

[0068] In Table 1, the "Route Code" column indicates the route code of the corresponding year; the "Tracing Year" column indicates the route code of the route in that year; the "Tracing Year Status" indicates the status of the route in the tracing year, which is described by the "Item Type" in the data dictionary. If there is no change in that year, the tracing year status is marked as "No Change". When the system enters the basic data of a new year, the latest record data formed through the historical data tracing process of steps S110 and S120 above is placed in the first row under the table header.

[0069] It should be noted that after a road is completed and put into use, the spatial entity is connected to the road network and becomes part of the road network. Its "route" attribute only exists as a management attribute and is used for its maintenance and operation related work. The composition of a "route" changes with the adjustment of business work, and its essence is an artificial definition given to the road entity. Meta-section data records the technical data information of the road infrastructure that actually exists in space, strips away its maintenance attributes, and treats it as an independent spatial entity. Therefore, in daily management, a "route" is usually composed of multiple "sections", and each section is assigned a unique section serial number in spatial order based on the route code. A "section" is composed of a series of meta-sections, which can be deconstructed into several meta-sections. Table 2 below shows an association table between a section code and a meta-section code.

[0070] Table 2

[0071]

[0072] In Table 2, the annual records are used, the "section code" corresponds to the unique identification code of the corresponding section, and the "meta-section code" records the unique identification codes of all meta-sections in the route one by one.

[0073] Furthermore, meta-section data is the most basic unit of road data, which divides all roads in the highway network into fixed lengths, generally "meters" or "0.1 meters". Meta-sections have a globally unique identification code to ensure that they are not repeated in all annual records in the database. Meta-section data only records the basic technical attributes of roads and is used to describe road entities existing in space. Table 3 below shows a meta-section attribute table.

[0074] Table 3

[0075]

[0076] In Table 3, "Record Year" indicates the year represented by the record. When the data of a new year is stored in the database, the data records of the latest year are added on the basis of retaining the records of the previous year. In addition to recording the technical attribute information, its spatial information is also recorded for visualization in the GIS system.

[0077] It should be noted that the route attributes store the maintenance information of the route. Since in daily management, a route is composed of multiple sections, the route attributes are represented by the section attributes. The table shows all the maintenance attribute information contained in the section. The route information is connected by the sequence of the section serial numbers through the route code, as shown in Table 4 below, which shows a route attribute table.

[0078] Table 4

[0079]

[0080] The above method manages highway data in a more refined way by introducing concepts such as section coding and meta-section coding. By generating an annual incremental highway historical data traceability table, the route code, route status and changes of the same route in different years can be recorded, thus realizing the full life cycle management of highway infrastructure. This helps highway management departments to fully understand the historical changes and current status of highways, and provide strong support for subsequent decision-making and maintenance work.

[0081] Preferably, Figure 4 As shown, based on the data obtained above, starting from the basic data of this year as the tracing entry, gradually tracing back to the historical data, generating the changes and historical events of each year, and forming a complete highway historical data tracing chain based on the changes and historical events of each year, realizing the full life cycle tracing of highway infrastructure, so as to provide comprehensive query and call for the business management system.

[0082] The construction of the highway historical data traceability chain in the above method enables the changes and historical events of each year to be clearly recorded and tracked. This greatly improves the traceability of the data and helps to quickly locate and understand the source and change process of the data when needed.

[0083] The highway historical data tracing method provided in the embodiment of the present application obtains the basic data of the current year and the basic data of the previous year, and matches the key attributes of the basic data of the current year and the basic data of the previous year; when the key attribute matching fails, the basic data of the current year and the basic data of the previous year are traced back to historical events to determine the changes and historical events; based on the changes and historical events, an annual incremental highway historical data tracing table and a highway historical data tracing chain are generated. Aiming at highway industry management, the present application proposes a method for tracing historical data of highways throughout their life cycle. The tracing results are highly accurate and fully support the industry management needs of highway construction and maintenance.

[0084] Example 2

[0085] like Figure 5 FIG. 5 is a schematic diagram of a highway historical data tracing device 500 in an embodiment of the present application, and the device includes:

[0086] The matching module 510 is used to obtain the basic data of this year and the basic data of the previous year, and match the key attributes of the basic data of this year and the basic data of the previous year;

[0087] The tracing module 520 is used to trace the historical events of the basic data of the current year and the basic data of the previous year to determine the change content and historical events when the key attribute matching fails;

[0088] The generation module 530 is used to generate an annual incremental highway historical data tracing table and a highway historical data tracing chain according to the change content and the historical events.

[0089] The highway historical data tracing device provided in the embodiment of the present application is aimed at highway industry management. The tracing results of the historical data of the entire life cycle of the highway are highly accurate, which fully supports the industry management needs of highway construction and maintenance.

[0090] Example 3

[0091] The present application also provides a computer device. Figure 6 , Figure 6 This is a basic structural block diagram of the computer device in this embodiment.

[0092] The computer device 6 includes a memory 61, a processor 62, and a network interface 63 that are interconnected and communicated through a system bus. It should be noted that the figure only shows a computer device 6 with a memory 61, a processor 62, and a network interface 63, but it should be understood that it is not required to implement all the components shown, and more or fewer components can be implemented instead. Among them, those skilled in the art can understand that the computer device here is a device that can automatically perform numerical calculations and / or information processing according to pre-set or stored instructions, and its hardware includes but is not limited to microprocessors, application specific integrated circuits (Application Specific Integrated Circuit, ASIC), programmable gate arrays (Field-Programmable Gate Array, FPGA), digital processors (Digital Signal Processor, DSP), embedded devices, etc.

[0093] The computer device may be a computing device such as a desktop computer, a notebook, a PDA, a cloud server, etc. The computer device may interact with a user through a keyboard, a mouse, a remote controller, a touch pad, or a voice control device.

[0094] The memory 61 includes at least one type of readable storage medium, and the readable storage medium includes flash memory, hard disk, multimedia card, card-type memory (for example, SD or D slot compatibility test memory, etc.), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, disk, optical disk, etc. In some embodiments, the memory 61 can be an internal storage unit of the computer device 6, such as a hard disk or memory of the computer device 6. In other embodiments, the memory 61 can also be an external storage device of the computer device 6, such as a plug-in hard disk equipped on the computer device 6, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. Of course, the memory 61 can also include both the internal storage unit of the computer device 6 and its external storage device. In this embodiment, the memory 61 is generally used to store the operating system and various application software installed on the computer device 6, such as computer-readable instructions of the slot compatibility test method, etc. In addition, the memory 61 can also be used to temporarily store various types of data that have been output or are to be output.

[0095] The processor 62 may be a central processing unit (CPU), a controller, a microcontroller, a microprocessor, or other highway history data tracing chip in some embodiments. The processor 62 is generally used to control the overall operation of the computer device 6. In this embodiment, the processor 62 is used to run the computer-readable instructions or process data stored in the memory 61, such as the computer-readable instructions for running the slot compatibility test method.

[0096] The network interface 63 may include a wireless network interface or a wired network interface. The network interface 63 is generally used to establish a communication connection between the computer device 6 and other electronic devices.

[0097] The computer device provided in this embodiment can execute the above-mentioned highway historical data tracing method. Here, the highway historical data tracing method can be the highway historical data tracing method of each of the above-mentioned embodiments.

[0098] Example 4

[0099] This embodiment further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the highway historical data tracing method in the embodiment are implemented.

[0100] In this embodiment, the computer-readable storage medium includes flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, disk, optical disk, etc. In some embodiments, the computer-readable storage medium can be an internal storage unit of a computer device, such as a hard disk or memory of the computer device. In other embodiments, the computer-readable storage medium can also be an external storage device of a computer device, such as a plug-in hard disk equipped on the computer device, a smart memory card (Smart Media Card, referred to as SMC), a secure digital (Secure Digital, referred to as SD) card, a flash card, etc. Of course, the computer-readable storage medium can also include both the internal storage unit of the computer device and its external storage device. In this embodiment, the computer-readable storage medium is generally used to store an operating system and various application software installed on the computer device. In addition, the computer-readable storage medium can also be used to temporarily store various types of data that have been output or are to be output.

[0101] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and structure diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present invention. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of the code, and the module, program segment or a part of the code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in an alternative implementation, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the structure diagram and / or the flow diagram, and the combination of boxes in the structure diagram and / or the flow diagram, can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0102] In addition, the functional modules or units in the various embodiments of the present invention may be integrated together to form an independent part, or each module may exist independently, or two or more modules may be integrated to form an independent part.

[0103] If the function is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention is essentially or partly contributed to the prior art or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a smart phone, a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium can be a non-volatile storage medium or a volatile storage medium. For example, the storage medium can be: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a disk or an optical disk, and other media that can store program codes.

[0104] The above description is only a specific implementation mode of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be covered by the protection scope of the present invention.

Claims

1. A method for tracing highway historical data, characterized in that: The method comprises: Obtaining basic data of this year and basic data of last year, and matching key attributes of the basic data of this year and basic data of last year; When the key attribute fails to match, historical events are traced back to the basic data of the current year and the basic data of the previous year to determine the change content and historical events; According to the change content and the historical events, an annual incremental highway historical data tracing table and a highway historical data tracing chain are generated.

2. The highway historical data tracing method according to claim 1 is characterized in that: The key attributes include route code, route name, route length and route starting and ending points. The matching of the key attributes of the basic data of the current year with the basic data of the previous year includes: Matching the route codes of the basic data of this year with those of the basic data of last year, and when the route code matching fails, matching the route names of the basic data of this year with those of the basic data of last year; When the route name matching fails, the route lengths of the basic data of this year and the basic data of last year are matched, and the route start and end points of the basic data of this year and the basic data of last year are matched; When both the route length match and the route start and end point match fail, it is determined that the key attribute match fails.

3. The highway historical data tracing method according to claim 2 is characterized in that: The matching of the key attributes of the basic data of the current year with the basic data of the previous year also includes: When the route code matches successfully, or when the route name matches successfully, or when the route length matches successfully and the route start and end points match successfully, it is determined that the key attribute matches successfully.

4. The highway historical data tracing method according to claim 3 is characterized in that: After determining that the key attribute matches successfully, the method further includes: It is determined that the route corresponding to the basic data of this year and the basic data of last year is the same route, and an annual incremental highway historical data tracing table and a highway historical data tracing chain for the same route are directly generated.

5. The highway historical data tracing method according to claim 1 is characterized in that: The historical event tracing of the basic data of the current year and the basic data of the previous year to determine the changes and historical events includes: Compare the technical attributes of the basic data of the current year with the basic data of the previous year to determine whether there is an attribute change, and when there is an attribute change, determine the corresponding change content, wherein the technical attributes include route length, roadbed width, road surface width, road surface material and technical grade; Query the change events and their corresponding key attributes in the previous year's planning library, and match the queried key attributes with the approval documents in the previous year's planning library. When the queried key attributes successfully match the approval documents, determine the corresponding historical events.

6. The highway historical data tracing method according to claim 5 is characterized in that: The method further comprises: When there is no attribute change and the queried key attribute fails to match the approval document, it is determined that the route corresponding to the basic data of this year cannot be traced back.

7. The highway historical data tracing method according to claim 1 is characterized in that: The generating of an annual incremental highway historical data tracing table and a highway historical data tracing chain according to the change content and the historical events includes: Generate the annual incremental highway historical data tracing table according to the change content and the historical event, wherein the annual incremental highway historical data tracing table includes at least one of the route code, tracing year, tracing year status, section code, meta-section data, and route attribute; Starting from the basic data of the current year, the historical data is gradually traced back to generate the changes and historical events of each year, and the highway historical data traceability chain is formed according to the changes and historical events of each year.

8. A highway historical data tracing device, characterized in that: The device comprises: A matching module is used to obtain basic data of this year and basic data of last year, and match key attributes of the basic data of this year and basic data of last year; A tracing module is used to trace the historical events of the basic data of the current year and the basic data of the previous year to determine the change content and historical events when the key attribute matching fails; A generation module is used to generate an annual incremental highway historical data tracing table and a highway historical data tracing chain according to the change content and the historical events.

9. A computer device, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the highway historical data tracing method according to any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the highway historical data tracing method according to any one of claims 1 to 7 are implemented.

Images