Data retrieval method, device, equipment and storage medium

Abstract

The present disclosure provides a data retrieval method, device, equipment, storage medium and program product, and the present disclosure relates to the field of artificial intelligence technology, especially to the technical fields of unmanned driving, vehicle networking and vehicle-mounted maps. The specific implementation scheme is: according to the geographic location data, at least one first address code is determined; at least one road network area corresponding to the reference area is determined; for the first road network area in at least one road network area where the road network density is greater than the density threshold, the second address code is determined according to the reference area and the first road network area, and the corresponding relationship between the first road network area and the second address code is added to the corresponding relationship set; for the second road network area in at least one road network area where the road network density is less than or equal to the density threshold, the corresponding relationship between the second road network area and the corresponding first address code is added to the corresponding relationship set; and according to the corresponding relationship set, the road network data is retrieved.

Description

Technical Field

[0001] The present disclosure relates to the field of artificial intelligence technology, and in particular to technical fields such as unmanned driving, vehicle networking, and vehicle-mounted maps. Background Art

[0002] As one of the four major industries in the world, automobiles play an important role in the national economy and daily life. With the development of artificial intelligence, in order to improve the intelligence of automobiles, advanced driving assistance systems (ADAS) can be deployed in vehicles. Advanced driving assistance systems use various sensors installed on the vehicle to sense the surrounding environment at any time during the driving process of the car, collect data, identify, detect and track static and dynamic objects, and combine road network data to perform systematic calculations and analysis, so as to detect possible dangers in advance and increase the safety of the car. Summary of the invention

[0003] The present disclosure provides a data retrieval method, apparatus, device, storage medium and program product.

[0004] According to one aspect of the present disclosure, a data retrieval method is provided, comprising: determining at least one first address code based on geographic location data, wherein the at least one first address code corresponds one-to-one to at least one reference area; for each reference area in the at least one reference area, determining at least one road network area corresponding to the reference area; for a first road network area in the at least one road network area whose road network density is greater than a density threshold, determining a second address code based on the reference area and the first road network area, and adding the correspondence between the first road network area and the second address code to a correspondence set, wherein the second address code has more bits than the first address code; for a second road network area in the at least one road network area whose road network density is less than or equal to the density threshold, adding the correspondence between the second road network area and the corresponding first address code to the correspondence set; and retrieving road network data based on the correspondence set.

[0005] According to another aspect of the present disclosure, a data retrieval device is provided, comprising: a first determination module, for determining at least one first address code based on geographic location data, wherein the at least one first address code corresponds one-to-one to at least one reference area; a second determination module, for determining, for each reference area in the at least one reference area, at least one road network area corresponding to the reference area; a first adding module, for determining, for a first road network area in the at least one road network area whose road network density is greater than a density threshold, a second address code based on the reference area and the first road network area, and adding the correspondence between the first road network area and the second address code to a correspondence set, wherein the second address code has more bits than the first address code; a second adding module, for a second road network area in the at least one road network area whose road network density is less than or equal to the density threshold, adding the correspondence between the second road network area and the corresponding first address code to the correspondence set; and a retrieval module, for retrieving road network data according to the correspondence set.

[0006] Another aspect of the present disclosure provides an electronic device, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the method shown in an embodiment of the present disclosure.

[0007] According to another aspect of an embodiment of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable the computer to execute the method shown in the embodiment of the present disclosure.

[0008] According to another aspect of an embodiment of the present disclosure, a computer program product is provided, including a computer program / instruction, wherein the computer program / instruction implements the steps of the method shown in the embodiment of the present disclosure when executed by a processor.

[0009] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] The accompanying drawings are used to better understand the present solution and do not constitute a limitation of the present disclosure.

[0011] Figure 1 is a schematic diagram of an application scenario of a data retrieval method, device, electronic device, and storage medium according to an embodiment of the present disclosure;

[0012] Figure 2 A flowchart of a data retrieval method according to an embodiment of the present disclosure is schematically shown;

[0013] Figure 3 A schematic diagram schematically shows a division of reference areas according to an embodiment of the present disclosure;

[0014] Figure 4 A schematic diagram schematically shows a method of dividing sub-reference areas according to an embodiment of the present disclosure;

[0015] Figure 5 A flowchart of a data retrieval method according to another embodiment of the present disclosure is schematically shown;

[0016] Figure 6 A schematic diagram schematically shows a data retrieval method according to another embodiment of the present disclosure;

[0017] Figure 7 A block diagram schematically shows a data retrieval device according to an embodiment of the present disclosure; and

[0018] Figure 8 A block diagram schematically illustrates an example electronic device that may be used to implement an embodiment of the present disclosure. DETAILED DESCRIPTION

[0019] The following is a description of exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present disclosure. Similarly, for the sake of clarity and conciseness, descriptions of well-known functions and structures are omitted in the following description.

[0020] The following will be combined Figure 1 The application scenarios of the method and device provided by the present disclosure are described.

[0021] Figure 1 Schematic diagram of application scenarios of the data retrieval method, device, electronic device and storage medium according to the embodiment of the present disclosure. It should be noted that: Figure 1 What is shown are merely examples of application scenarios to which the embodiments of the present disclosure can be applied, in order to help those skilled in the art understand the technical content of the present disclosure, but it does not mean that the embodiments of the present disclosure cannot be used in other devices, systems, environments or scenarios.

[0022] like Figure 1 As shown, the application scenario 100 of the embodiment of the present disclosure includes multiple vehicles 101, 102, 103, and a server 104. The vehicles 101, 102, 103 may be autonomous driving vehicles.

[0023] Server 104 may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services (Virtual Private Server, or VPS for short). Server 104 may also be a server of a distributed system, or a server combined with a blockchain.

[0024] According to an embodiment of the present disclosure, vehicles 101 , 102 , and 103 may exchange data with server 104 .

[0025] In one embodiment, vehicles 101, 102, and 103 may respectively send their own geographic location data to server 104. Server 104 may determine at least one first address code based on the geographic location data, wherein at least one first address code corresponds to at least one reference area one by one. Then, for each reference area in at least one reference area, at least one road network area corresponding to the reference area is determined. For a first road network area in at least one road network area where the road network density is greater than a density threshold, a second address code is determined based on the reference area and the first road network area, and the corresponding relationship between the first road network area and the second address code is added to a corresponding relationship set, wherein the number of bits of the second address code is more than that of the first address code. For a second road network area in at least one road network area where the road network density is less than or equal to the density threshold, the corresponding relationship between the second road network area and the corresponding first address code is added to a corresponding relationship set. Next, the road network data is retrieved according to the corresponding relationship set. The retrieved road network data is then sent to vehicles 101, 102, and 103.

[0026] According to an embodiment of the present disclosure, vehicles 101, 102, and 103 may be equipped with an Advanced Driving Assistance System (ADAS). After obtaining the road network data around the vehicle, the server 104 may send the retrieved road network data around the vehicle to the vehicle for use by the vehicle's Advanced Driving Assistance System.

[0027] In the technical solution disclosed herein, the collection, storage, use, processing, transmission, provision and disclosure of geographic location data, road network data and other data involved are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0028] Figure 2 The flowchart of the data retrieval method according to the embodiment of the present disclosure is schematically shown.

[0029] like Figure 2As shown, the method 200 includes, in operation S210, determining at least one first address code according to geographic location data.

[0030] Then, operations S220 to S240 are performed for each of the at least one reference region.

[0031] In operation S220, at least one road network area corresponding to the reference area is determined.

[0032] In operation S230, for a first road network area in which the road network density is greater than a density threshold in at least one road network area, a second address code is determined based on a reference area and the first road network area, and a correspondence between the first road network area and the second address code is added to a correspondence set.

[0033] In operation S240, for a second road network area in which the road network density is less than or equal to the density threshold in the at least one road network area, a correspondence relationship between the second road network area and the corresponding first address code is added to a correspondence relationship set.

[0034] In operation S250, road network data is retrieved according to the correspondence set.

[0035] According to an embodiment of the present disclosure, a map may be divided into at least one reference area. Each reference area may be uniquely identified by a first address code. That is, at least one first address code corresponds to at least one reference area one by one. According to an embodiment of the present disclosure, the first address code may include numbers, letters, symbols, and any combination of numbers, letters, and symbols.

[0036] Figure 3 A schematic diagram of dividing a reference area according to an embodiment of the present disclosure is schematically shown.

[0037] For example Figure 3 As shown, the map 30 can be divided into reference areas 31, 32, 33 and 34. Exemplarily, in this embodiment, the reference area 31 can be represented by the first address code aa, the reference area 32 can be represented by the first address code bb, the reference area 33 can be represented by the first address code cc, and the reference area 34 can be represented by the first address code dd.

[0038] According to an embodiment of the present disclosure, each reference area may correspond to at least one road network area. A road network area may correspond to one or more reference areas. The road network area may be, for example, an administrative area, such as a province, a city, an autonomous region, a municipality directly under the central government, and the like.

[0039] According to an embodiment of the present disclosure, on the basis that the map is divided into at least one reference area, the reference area can be further divided to obtain sub-reference areas with smaller areas. Each sub-reference area can be uniquely identified by a second address code. Since the number of sub-reference areas is greater, more bits are required to represent them, that is, the number of bits of the second address code is greater than that of the first address code. According to an embodiment of the present disclosure, the second address code can include numbers, letters, symbols, and any combination of numbers, letters, and symbols.

[0040] Figure 4 A schematic diagram of sub-dividing a reference area according to an embodiment of the present disclosure is schematically shown.

[0041] For example Figure 4 As shown, the map 40 can be divided into reference areas 41, 42, 43 and 44. Exemplarily, in this embodiment, the reference area 44 can be further divided into sub-reference areas 441, 442, 443 and 444. Among them, the sub-reference area 441 can be represented by the second address code aaa, the sub-reference area 442 can be represented by the second address code bbb, the sub-reference area 443 can be represented by the second address code ccc, and the sub-reference area 444 can be represented by the second address code ddd.

[0042] According to an embodiment of the present disclosure, the first address code and the second address code can be used as an index to retrieve road network data. For example, in this embodiment, for each road network area in the corresponding relationship set, the road network data of the road network area can be retrieved according to the first address code and / or the second address code corresponding to each road network area to obtain a search result.

[0043] Since the reference area corresponding to the first address code is larger, when the road network density in the reference area is high, the amount of data that needs to be processed when using the first address code to retrieve road network data is larger, resulting in the recall of more invalid data and the consumption of more computing resources, thereby reducing the retrieval performance.

[0044] According to an embodiment of the present disclosure, when the road network density of the road network area corresponding to the reference area is less than or equal to the density threshold, the first address code of the reference area is used as an index. When the road network density of the road network area corresponding to the reference area is greater than the density threshold, the second address code corresponding to the reference area is further determined as an index. This can reduce the amount of data that needs to be processed when retrieving road network data, save computing resources, and thus improve retrieval performance.

[0045] Based on this, according to an embodiment of the present disclosure, if the road network density of the road network area corresponding to the reference area is less than or equal to the density threshold, the correspondence between the road network area and the corresponding first address code can be added to the correspondence set. If the road network density of the road network area corresponding to the reference area is greater than the density threshold, the second address code can be determined based on the reference area and the road network area, and the correspondence between the road network area and the second address code is added to the correspondence set. Among them, the density threshold can be set according to actual needs, and the present disclosure does not specifically limit this.

[0046] According to an embodiment of the present disclosure, the geographic location data may include, for example, a latitude and longitude range.

[0047] According to an embodiment of the present disclosure, for example, an address coding algorithm may be used to determine at least one first character string according to a latitude and longitude range as at least one first address code, wherein the number of digits of the first character string is greater than 1.

[0048] According to an embodiment of the present disclosure, for example, an address coding algorithm can be used to determine multiple second character strings according to the latitude and longitude range of the reference area. Then, a second character string corresponding to the road network area among the multiple second character strings is determined as the second address code. The number of digits of the second character string is greater than that of the first address code.

[0049] According to an embodiment of the present disclosure, the address encoding algorithm may include, for example, a GeoHash algorithm.

[0050] According to an embodiment of the present disclosure, the geographic location data may include, for example, data indicating the geographic location of the terminal device. The terminal device may include, for example, the vehicle shown above. Based on this, Figure 5 The flowchart of a data retrieval method according to another embodiment of the present disclosure is schematically shown.

[0051] like Figure 5 As shown, the method 500 includes, in operation S510, obtaining a positioning point of a terminal device.

[0052] In operation S520, a target area of ​​a predetermined size around the positioning point is determined.

[0053] In operation S530, the latitude and longitude range of the target area is determined as geographic location data.

[0054] In operation S540, at least one first address code is determined according to the geographic location data.

[0055] Then, operations S550 to S580 are performed for each of the at least one reference region.

[0056] In operation S550, at least one road network area corresponding to the reference area is determined.

[0057] In operation S560, for a first road network area in at least one road network area where the road network density is greater than a density threshold, a second address code is determined based on a reference area and the first road network area, and a correspondence between the first road network area and the second address code is added to a correspondence set.

[0058] In operation S570, for a second road network area in which the road network density is less than or equal to the density threshold in the at least one road network area, a correspondence relationship between the second road network area and the corresponding first address code is added to a correspondence relationship set.

[0059] In operation S580, road network data is retrieved according to the correspondence set.

[0060] According to an embodiment of the present disclosure, the predetermined size can be set according to actual needs. For example, in this embodiment, a circle with a radius of R meters can be determined as the target area with the positioning point as the center.

[0061] According to the embodiment of the present disclosure, operations S540 to S580 may be described above, for example, and will not be described in detail herein.

[0062] According to an embodiment of the present disclosure, the terminal device may include, for example, an autonomous driving vehicle. The autonomous driving vehicle is equipped with an advanced driver assistance system. The advanced driver assistance system requires road network data around the vehicle when running. Therefore, the road network data may be retrieved using the data retrieval method of an embodiment of the present disclosure to obtain the road network data around the vehicle. The retrieved road network data around the vehicle may then be sent to the autonomous driving vehicle for use by the advanced driver assistance system of the autonomous driving vehicle.

[0063] Reference below Figure 6 , the data retrieval method shown above is further described in conjunction with a specific embodiment. Those skilled in the art can understand that the following exemplary embodiments are only used to understand the present disclosure, and the present disclosure is not limited thereto.

[0064] According to an embodiment of the present disclosure, when establishing an index between an address code and a road network data, a multi-level index may be established. Exemplarily, in this embodiment, a two-level index is established, the first-level index is a 6-bit GeoHash string, i.e., the first address code, and the second-level index is a 7-bit GeoHash string, i.e., the second address code.

[0065] Figure 6 A schematic diagram of a data retrieval method according to another embodiment of the present disclosure is schematically shown.

[0066] exist Figure 6It is shown in the figure that, according to the geographic location data of the target area 60, it can be determined that the target area 60 hits four reference areas 61, 62, 63 and 64, wherein the reference area 61 corresponds to the 6-digit GeoHash string aaaaaa, the reference area 62 corresponds to the 6-digit GeoHash string bbbbbb, the reference area 63 corresponds to the 6-digit GeoHash string cccccc, and the reference area 64 corresponds to the 6-digit GeoHash string dddddd.

[0067] Then, the road network areas and road network densities of the road network areas corresponding to the GeoHash strings aaaaaa, bbbbbb, cccccc, and dddddd are retrieved in the index library.

[0068] In this embodiment, aaaaaa corresponds to the road network area S, and the road network density is 100. bbbbbb corresponds to the road network area S and the road network area T, wherein the road network density of the part of the reference area 61 corresponding to bbbbbb that belongs to S is 200, and the road network density of the part of the reference area 61 corresponding to T is 30. cccccc corresponds to the road network area S, and the road network density is 20. dddddd corresponds to the road network area S and the road network area T, wherein the road network density of the part of the reference area 64 corresponding to dddddd that belongs to S is 140, and the road network density of the part of the reference area 64 that belongs to T is 110.

[0069] Exemplarily, in this embodiment, the density threshold may be 100. Based on this, it can be determined that the road network density of the road network area S in the reference area 61 and the reference area 63 does not exceed the density threshold. The correspondence between the road network area S and aaaaaa, the correspondence between the road network area T and bbbbbb, and the correspondence between the road network area S and cccccc can be added to the correspondence set. Exemplarily, in this embodiment, the correspondence set is shown in Table 1.

[0070] Table 1

[0071] Road network area S aaaaaa、cccccc Road network area T bbbbbb

[0072] In this embodiment, the road network area S portion in the reference area 62, the road network area S portion in the reference area 64, and the road network area T portion all exceed the density threshold. Therefore, it can be further determined that the road network area S portion in the reference area 62 and the road network area S portion in the reference area 64 and the road network area T portion all exceed the second address code corresponding to the density threshold. Based on this, the reference areas 62 and 64 can be divided into multiple sub-reference areas, respectively. Then, the sub-reference area hit by the target area 60 of the multiple sub-reference areas is determined. Exemplarily, in this embodiment, the target area 60 hits the sub-reference areas 621 and 641. Among them, the sub-reference area 621 corresponds to the 7-bit GeoHash string eeeeeee, and the sub-reference area 641 corresponds to the 7-bit GeoHash string fffffff. Therefore, the correspondence between road network area S and eeeeeee, the correspondence between road network area T and eeeeeee, the correspondence between road network area S and fffffff, and the correspondence between road network area T and fffffff can be added to the correspondence set, and the resulting correspondence set is shown in Table 2.

[0073] Table 2

[0074] Road network area S aaaaaa,cccccc,eeeeeee,ffffffff Road network area T bbbbbb, eeeeeee, fffffff

[0075] Then, according to the corresponding relationship set, the road network data corresponding to aaaaaa, cccccc, eeeeeee, and fffffff can be retrieved in the road network data of the road network area S, and the road network data corresponding to bbbbbb, eeeeeee, and fffffff can be retrieved in the road network data of the road network area T.

[0076] It is understandable that if a 6-digit GeoHash string is uniformly used for retrieval, the retrieval range of the road network data is large, resulting in a large amount of data to be processed, and thus a large performance loss. In this embodiment, for areas where the road network density is greater than the density threshold, a 6-digit GeoHash string is further determined. Since the more digits a GeoHash string has, the finer the geographical range it corresponds to, the retrieval range can be reduced, the amount of data to be processed can be reduced, and performance can be improved.

[0077] Figure 7 The block diagram of the data retrieval device according to the embodiment of the present disclosure is schematically shown.

[0078] like Figure 7 As shown, the apparatus 700 includes a first determination module 710 , a second determination module 720 , a first adding module 730 , a second adding module 740 and a retrieval module 750 .

[0079] The first determination module 710 is used to determine at least one first address code according to the geographic location data, wherein the at least one first address code corresponds to at least one reference area in a one-to-one manner.

[0080] The second determination module 720 is configured to determine, for each reference area in at least one reference area, at least one road network area corresponding to the reference area.

[0081] The first adding module 730 is used to determine the second address code for a first road network area in at least one road network area whose road network density is greater than a density threshold according to a reference area and the first road network area, and add the correspondence between the first road network area and the second address code into a correspondence set, wherein the second address code has more bits than the first address code.

[0082] The second adding module 740 is used to add the correspondence between the second road network area and the corresponding first address code into the correspondence set for a second road network area in which the road network density is less than or equal to the density threshold in at least one road network area.

[0083] The retrieval module 750 is used to retrieve the road network data according to the corresponding relationship set.

[0084] According to an embodiment of the present disclosure, the geographic location data may include a latitude and longitude range. The first determination module may include a first determination submodule, configured to use an address coding algorithm to determine at least one first string as at least one first address code according to the latitude and longitude range, wherein the number of digits of the first string is greater than 1.

[0085] According to an embodiment of the present disclosure, the first adding module may include: a second determining submodule and a third determining submodule. The second determining submodule is used to determine a plurality of second character strings according to the latitude and longitude range of the reference area using an address coding algorithm, wherein the number of digits of the second character string is greater than that of the first address code. The third determining submodule is used to determine a second character string corresponding to the road network area among the plurality of second character strings as the second address code.

[0086] According to an embodiment of the present disclosure, the address encoding algorithm may include a GeoHash algorithm.

[0087] According to an embodiment of the present disclosure, the retrieval module may include a retrieval sub-module, which is used to retrieve the road network data of the road network area for each road network area in the corresponding relationship set according to the first address code and / or second address code corresponding to each road network area to obtain a retrieval result.

[0088] According to an embodiment of the present disclosure, the above-mentioned device may further include an acquisition module, a third determination module and a fourth determination module. The acquisition module is used to acquire the positioning point of the terminal device. The third determination module is used to determine a target area of ​​a predetermined size around the positioning point. The fourth determination module is used to determine the latitude and longitude range of the target area as the geographic location data.

[0089] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.

[0090] Figure 8 A block diagram of an example electronic device 800 that can be used to implement an embodiment of the present disclosure is schematically shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0091] like Figure 8 As shown, the device 800 includes a computing unit 801, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 802 or a computer program loaded from a storage unit 808 into a random access memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the device 800 can also be stored. The computing unit 801, the ROM 802, and the RAM 803 are connected to each other via a bus 804. An input / output (I / O) interface 805 is also connected to the bus 804.

[0092] A number of components in the device 800 are connected to the I / O interface 805, including: an input unit 806, such as a keyboard, a mouse, etc.; an output unit 807, such as various types of displays, speakers, etc.; a storage unit 808, such as a disk, an optical disk, etc.; and a communication unit 809, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 809 allows the device 800 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0093] The computing unit 801 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 801 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 801 performs the various methods and processes described above, such as data retrieval methods. For example, in some embodiments, the data retrieval method may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 808. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 800 via ROM 802 and / or communication unit 809. When the computer program is loaded into RAM 803 and executed by the computing unit 801, one or more steps of the data retrieval method described above may be performed. Alternatively, in other embodiments, the computing unit 801 may be configured to perform the data retrieval method in any other appropriate manner (e.g., by means of firmware).

[0094] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0095] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0096] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

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

[0098] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0099] A computer system may include clients and servers. Clients and servers are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship to each other.

[0100] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.

[0101] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A data retrieval method, comprising: Determine the latitude and longitude range of the target area; Determine at least one first character string as at least one first address code according to the latitude and longitude range of the target area by using an address coding algorithm, wherein the number of digits of the first character string is greater than 1; Divide the map into at least one reference area, wherein the at least one first address code corresponds to the at least one reference area one by one, and each reference area is uniquely identified by one of the first address codes; For each reference region in the at least one reference region, determining at least one road network area corresponding to the reference area; For a first road network area in the at least one road network area where the road network density is greater than a density threshold, using an address coding algorithm to determine a plurality of second character strings according to the latitude and longitude range of the reference area, wherein the number of digits of the second character string is greater than that of the first address code; and Determine a second character string corresponding to the road network area from among the plurality of second character strings as a second address code, and add the correspondence between the first road network area and the second address code into a correspondence set, wherein the second address code has more bits than the first address code; For a second road network area in the at least one road network area where the road network density is less than or equal to the density threshold, adding a correspondence between the second road network area and the corresponding first address code into the correspondence set; and According to the corresponding relationship set, the road network data is retrieved.

2. The method according to claim 1, wherein: The address encoding algorithm includes the GeoHash algorithm.

3. The method according to claim 1, wherein: The retrieving the road network data according to the corresponding relationship set includes: For each road network area in the corresponding relationship set, the road network data of the road network area is retrieved according to the first address code and / or the second address code corresponding to each road network area to obtain a retrieval result.

4. The method according to claim 1, further comprising: Get the location point of the terminal device; A target area of ​​a predetermined size around the positioning point is determined.

5. A data retrieval device, comprising: The fourth determination module is used to determine the latitude and longitude range of the target area; A first determination submodule is configured to determine at least one first character string as at least one first address code according to the latitude and longitude range by using an address coding algorithm, wherein the number of digits of the first character string is greater than 1; A second determination module is used to determine, for each reference area in at least one reference area, at least one road network area corresponding to the reference area; A first adding module is used to determine, for a first road network area in the at least one road network area, whose road network density is greater than a density threshold, a second address code according to the reference area and the first road network area, and add a correspondence between the first road network area and the second address code to a correspondence set, wherein the second address code has more bits than the first address code; A second adding module is used for adding, for a second road network area in the at least one road network area where the road network density is less than or equal to the density threshold, a corresponding relationship between the second road network area and the corresponding first address code into the corresponding relationship set; and A retrieval module, used to retrieve road network data according to the corresponding relationship set, Wherein, the first adding module includes: a second determination submodule, configured to determine a plurality of second character strings according to the latitude and longitude range of the reference area by using an address coding algorithm, wherein the number of digits of the second character strings is greater than that of the first address code; and A third determining submodule, configured to determine a second character string corresponding to the road network area among the plurality of second character strings as the second address code; The device is also used to divide the map into the at least one reference area, wherein the at least one first address code corresponds to the at least one reference area one by one, and each reference area is uniquely identified by one of the first address codes.

6. The device according to claim 5, wherein: The address encoding algorithm includes the GeoHash algorithm.

7. The device according to claim 5, wherein: The retrieval module comprises: The retrieval submodule is used to retrieve the road network data of each road network area in the corresponding relationship set according to the first address code and / or the second address code corresponding to each road network area to obtain the retrieval result.

8. The apparatus according to claim 5, further comprising: An acquisition module, used to acquire the positioning point of the terminal device; The third determining module is used to determine a target area of ​​a predetermined size around the positioning point.

9. An electronic device, comprising: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 4.

10. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-4.

11. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 4 are implemented.

Images