A computer-implemented driving route matching method, comprising: obtaining a to-be-retrieved route (C-D), the to-be-retrieved route comprising a retrieval start point and a retrieval end point; searching in a database of existing routes (A-B, A-M, P-Q) to select the existing routes passing through grids within a predetermined range around the retrieval start point as routes available for the start point; searching in the database of the existing routes, to select the existing routes passing through grids within a predetermined range around the retrieval end point as routes available for the end point; calculating the intersection of the routes available for the start point and the routes available for the end point, and using routes in the intersection as candidate routes (A-B, P-Q), wherein the routes in the intersection pass through said grids within the predetermined range around the retrieval start point and through said grids within the predetermined range around the retrieval end point; and screening the candidate routes based on detouring distances, wherein screening the candidate routes based on detouring distances comprises: re-planning routes according to original start points (A, P) and original end points (B, Q) of the candidate routes, the retrieval start point, and the retrieval end point to obtain re-planned routes (A-C-D-B, P-C-D-Q) passing the original start points (A, P) and the original end points (B, Q) of the respective candidate routes, the retrieval start point, and the retrieval end point; calculating detouring distances of the re-planned routes (A-C-D-B, P-C-D-Q), wherein the detouring distances are distance differences between route distances of the re-planned routes (A-C-D-B, P-C-D-Q) and original route distances of the candidate routes (A-B, P-Q); and using the re-planned routes (A-C-D-B, P-C-D-Q) having the detouring distances within a preset threshold range as routes obtained after screening. obtaining a to-be-retrieved route (C-D), the to-be-retrieved route comprising a retrieval start point and a retrieval end point; searching in a database of existing routes (A-B, A-M, P-Q) to select the existing routes passing through grids within a predetermined range around the retrieval start point as routes available for the start point; searching in the database of the existing routes, to select the existing routes passing through grids within a predetermined range around the retrieval end point as routes available for the end point; calculating the intersection of the routes available for the start point and the routes available for the end point, and using routes in the intersection as candidate routes (A-B, P-Q), wherein the routes in the intersection pass through said grids within the predetermined range around the retrieval start point and through said grids within the predetermined range around the retrieval end point; and screening the candidate routes based on detouring distances, wherein screening the candidate routes based on detouring distances comprises: re-planning routes according to original start points (A, P) and original end points (B, Q) of the candidate routes, the retrieval start point, and the retrieval end point to obtain re-planned routes (A-C-D-B, P-C-D-Q) passing the original start points (A, P) and the original end points (B, Q) of the respective candidate routes, the retrieval start point, and the retrieval end point; calculating detouring distances of the re-planned routes (A-C-D-B, P-C-D-Q), wherein the detouring distances are distance differences between route distances of the re-planned routes (A-C-D-B, P-C-D-Q) and original route distances of the candidate routes (A-B, P-Q); and using the re-planned routes (A-C-D-B, P-C-D-Q) having the detouring distances within a preset threshold range as routes obtained after screening. re-planning routes according to original start points (A, P) and original end points (B, Q) of the candidate routes, the retrieval start point, and the retrieval end point to obtain re-planned routes (A-C-D-B, P-C-D-Q) passing the original start points (A, P) and the original end points (B, Q) of the respective candidate routes, the retrieval start point, and the retrieval end point; calculating detouring distances of the re-planned routes (A-C-D-B, P-C-D-Q), wherein the detouring distances are distance differences between route distances of the re-planned routes (A-C-D-B, P-C-D-Q) and original route distances of the candidate routes (A-B, P-Q); and using the re-planned routes (A-C-D-B, P-C-D-Q) having the detouring distances within a preset threshold range as routes obtained after screening.