WO2020114272A1

WO2020114272A1 - Merchant search method, apparatus, electronic device, and storage medium

Info

Publication number: WO2020114272A1
Application number: PCT/CN2019/120839
Authority: WO
Inventors: 王大松
Original assignee: 拉扎斯网络科技（上海）有限公司
Priority date: 2018-12-08
Filing date: 2019-11-26
Publication date: 2020-06-11
Also published as: CN109634962A

Abstract

Provided are a merchant search method, apparatus, electronic device, and non-volatile storage medium, said method comprising: obtaining a user's geographic location, and using a pre-built index tree to find a first circumscribed rectangle covering the geographic location (101), the first circumscribed rectangle being the smallest circumscribed rectangle that covers the area of distribution of the merchant; determining a target distribution area that is geographically covered by the distribution area corresponding to the first circumscribed rectangle (102); taking the merchant corresponding to the target distribution area as a deliverable merchant corresponding to the geographic location (103); a leaf node of the index tree corresponding to the first circumscribed rectangle, a non-leaf node of the index tree corresponding to the second circumscribed rectangle, and the second circumscribed rectangle being the smallest circumscribed rectangle determined according to at least two merchant distribution areas.

Description

Merchant search method, device, electronic equipment and storage medium

cross reference

This application refers to the Chinese patent application No. 201811498585.9 filed on December 08, 2018 and titled "Merchant Search Methods, Devices, Electronic Equipment, and Storage Media", which is fully incorporated by reference into this application.

Technical field

This application relates to the technical field of e-commerce, and in particular to a merchant search method, device, electronic equipment, and storage medium.

Background technique

With the development of the Internet, online shopping is becoming more and more popular. In industries such as restaurants and hotels, users can quickly place orders through the Internet. For example, in the take-out industry, when users place orders, they first locate their own position, and then select merchants to place orders according to the demand for ordering. This process includes the process of spatial location search based on location services (LBS), that is, searching a list of nearby businesses that can provide distribution services to users based on the location of the user's location.

At present, regarding the implementation solution of LBS spatial search, the related technology is to use the spatial query function of the relational database management system (PostgreSQL). This solution uses a method of comparing all the merchant distribution areas one by one when searching for merchants, which is suitable for merchants. In the case of a small number of distribution areas, when the number of merchant distribution areas is tens of thousands, this solution is obviously unacceptable; the related technology is to use the search engine Lucene spatial query to divide the distribution area into several grids and use Indexing and querying the relationship between the grid and the user's location has a certain improvement in performance, but this solution increases the amount of spatial data. When the spatial data reaches the level of one million or ten million, the index is too large, which will cause There is an error in the query results.

Summary of the invention

The purpose of some embodiments of the present application is to provide a merchant search method, device, electronic equipment and storage medium. The spatial location search scheme based on the index tree and the idea of external rectangular filtering are used to aggregate merchants close to each other when the user searches. When you are a merchant, you can quickly find a merchant that meets the search criteria.

In order to solve the above technical problems, the embodiments of the present application provide a merchant search method, which includes: acquiring a user's geographic location, and using a pre-established index tree to find a first circumscribed rectangle covering the geographic location, where the first circumscribed rectangle is The smallest circumscribed rectangle covering the distribution area of the merchant; the target distribution area covered by the distribution area corresponding to the first circumscribed rectangle is determined; the merchant corresponding to the target distribution area is regarded as the distributable merchant corresponding to the geographical position; wherein, the leaf node of the index tree Corresponding to the first circumscribed rectangle, the non-leaf nodes of the index tree correspond to the second circumscribed rectangle, and the second circumscribed rectangle is the smallest circumscribed rectangle determined according to at least two merchant distribution areas.

An embodiment of the present application also provides a merchant search device, including: a search module for acquiring a user's geographic location, and using a pre-established index tree to find a first circumscribed rectangle covering the geographic location, where the first circumscribed rectangle is The smallest circumscribed rectangle covering the distribution area of the merchant; the target distribution area determination module for determining the target distribution area covered by the distribution area corresponding to the first circumscribed rectangle; the merchantable distribution determination module for the merchant corresponding to the target distribution area As a distributable merchant corresponding to the geographic location; where the leaf nodes of the index tree correspond to the first circumscribed rectangle, and the non-leaf nodes of the index tree correspond to the second circumscribed rectangle, the second circumscribed rectangle is determined according to at least two merchant distribution areas in the business circle The smallest circumscribed rectangle.

An embodiment of the present application further provides an electronic device, including: 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 at least one The processor executes to realize: acquiring the user's geographic location, and using a pre-established index tree to find the first circumscribed rectangle covering the geographic location, where the first circumscribed rectangle is the smallest circumscribed rectangle covering the merchant's distribution area; The target distribution area covered by the distribution area corresponding to the circumscribed rectangle; the merchant corresponding to the target distribution area is regarded as the deliverable merchant corresponding to the geographic location; where the leaf nodes of the index tree correspond to the first circumscribed rectangle, and the non-leaf nodes of the index tree correspond to the second The circumscribed rectangle, the second circumscribed rectangle is the smallest circumscribed rectangle determined according to at least two merchant distribution areas.

The embodiments of the present application also provide a non-volatile storage medium for storing a computer-readable program, and the computer-readable program is used for the computer to execute the merchant search method as described above.

In addition, the child nodes of each non-leaf node of the index tree include a first number of leaf nodes, and the first number is less than the threshold of the number of nodes.

In addition, the child nodes of each non-leaf node of the index tree include a second number of leaf nodes and a third number of non-leaf nodes; the sum of the second number and the third number is less than the node number threshold.

In addition, when creating the index tree, the dynamically changing public rectangle is determined by the two third circumscribed rectangles; if the two third circumscribed rectangles are mutually included, the common rectangle is equal to the larger of the two third circumscribed rectangles; if the two The third circumscribed rectangles are partially overlapping or separated from each other. The common rectangle is equal to the smallest circumscribed rectangle that covers the two third circumscribed rectangles; where the two third circumscribed rectangles include a first circumscribed rectangle and a common rectangle, or include two The first circumscribed rectangle; the second circumscribed rectangle at each level of the index tree is the common rectangle at the corresponding level of the index tree when the creation is completed.

In addition, creating the index tree further includes: selecting a first circumscribed rectangle that is closest to the common rectangle at the highest level of the index tree under construction from several first circumscribed rectangles to be inserted; according to the closest first circumscribed rectangle The position relationship with the unsaturated common rectangle in the index tree under construction determines the level of insertion of the closest circumscribed rectangle; wherein the index tree under construction corresponds to any state before the index tree is created; The unsaturated common rectangle is the common rectangle whose number of child nodes is less than the threshold of the number of nodes.

In addition, the determining the level of insertion of the closest first circumscribed rectangle according to the positional relationship between the closest first circumscribed rectangle and the unsaturated common rectangle in the index tree under construction includes: if there are several The positional relationship between the unsaturated common rectangle and the closest circumscribed rectangle includes the closest circumscribed rectangle, and then the insertion level is determined as the smallest common rectangle among the plurality of unsaturated common rectangles The next layer; if the position relationship between the closest first circumscribed rectangle and the common rectangle at the highest level of the index tree under construction is partially overlapping or separated from each other, then the insertion level is determined to be the highest of the index tree under construction Floor.

In addition, obtain the user's geographic location, and use the pre-established index tree to find the first circumscribed rectangle covering the geographic location, including: in the index tree, determine the second circumscribed rectangle of each level covering the geographic location in order from the root node; Among the leaf nodes contained in the second circumscribed rectangle at the last level of the position, each first circumscribed rectangle covering the geographic location is determined.

In addition, before determining the second circumscribed rectangle of each level covering the geographic location in order from the root node in the index tree, it also includes: determining the business district to which the user belongs and the index tree corresponding to the business district according to the geographic location.

In addition, using the pre-established index tree to find the first circumscribed rectangle covering the geographic location includes: determining whether the geographic location is within the latitude and longitude extreme range of the first circumscribed rectangle; if so, determining that the first circumscribed rectangle covers the geographic location, otherwise, It is determined that the first circumscribed rectangle does not cover the geographic location.

In addition, when there are at least two first circumscribed rectangles covering the geographic location, determining the target delivery area whose geographic location is covered by the delivery area corresponding to the first circumscribed rectangle includes: using a parallel computing method, and at the same time determining whether the geographic location is covered by the geographic location The delivery area corresponding to each first circumscribed rectangle of the position is covered, and if so, it is determined that the delivery area corresponding to the first circumscribed rectangle is the target delivery area.

In addition, after the merchant corresponding to the target delivery area is regarded as the deliverable merchant corresponding to the geographic location, it also includes: sending the deliverable merchant to the user's terminal device, and displaying the information of the deliverable merchant by the terminal device.

In addition, the geographic location and distribution area are represented by latitude and longitude information.

In addition, the first circumscribed rectangle is determined according to the following steps: determine the latitude and longitude extreme value in the merchant distribution area, the latitude and longitude extreme value includes maximum longitude, minimum longitude, maximum latitude and minimum latitude; determine the first circumscribed rectangle according to the latitude and longitude extreme value.

BRIEF DESCRIPTION

FIG. 1 is a flowchart of a merchant search method according to the first embodiment of the present application;

2 is a flowchart of determining a first circumscribed rectangle of a delivery area according to the first embodiment of the present application;

3 is a schematic diagram of determining a second circumscribed rectangle of a non-leaf node according to the second embodiment of the present application;

4 is a schematic diagram of an R-tree index tree according to the second embodiment of the present application;

5 is a schematic diagram of a merchant search device according to a third embodiment of the present application;

6 is a schematic diagram of an electronic device according to a fourth embodiment of the present application.

detailed description

To make the objectives, technical solutions, and advantages of the embodiments of the present application clearer, the embodiments of the present application will be described in detail below in conjunction with the accompanying drawings. However, those of ordinary skill in the art can understand that in the embodiments of the present application, in order to make the reader better understand the present application, many technical details are proposed. However, even without these technical details and various changes and modifications based on the following embodiments, the technical solution claimed in this application can be realized.

The first embodiment of the present application relates to a merchant search method. This embodiment can be applied to a terminal side, such as a terminal device such as a mobile phone, a tablet computer, or a server on a network side.

In the catering field, the business circle contains several merchants, and each merchant has a fixed service delivery area, that is, the merchant only provides order and delivery services for users who are located within their own delivery area. When users place an order through the network, they will first search the list of merchants corresponding to the distribution area to which their location belongs, and then select the merchant to place the order.

FIG. 1 is a flowchart of a method for searching a merchant according to the first embodiment of the present application. The method includes the following steps.

S101. Obtain the geographic location of the user, and use the pre-established index tree to find the first circumscribed rectangle covering the geographic location of the user.

In this embodiment, the index tree is specifically an R-tree index tree, that is, a Rectangle-tree (rectangular index tree), which is a tree-like data structure used for spatial data storage. The core idea is to aggregate nodes with similar distances in the tree. The upper layer of the structure represents it as the smallest circumscribed rectangle of these nodes, and this smallest circumscribed rectangle becomes a node of the upper layer. The R-tree index tree can ensure that the search of a spatial data only needs to access a small number of nodes by indexing the spatial data.

Specifically, the first circumscribed rectangle is the smallest circumscribed rectangle covering the distribution area of a merchant. A leaf node of the R-tree index tree corresponds to a first circumscribed rectangle, and a non-leaf node of the R-tree index tree corresponds to a second circumscribed rectangle. Rectangle, the second circumscribed rectangle is the smallest circumscribed rectangle determined according to the distribution area of at least two merchants in the business circle.

The distribution area of the merchant corresponds to a certain geographical range. The shape of the distribution area may be a regular rectangle or an irregular shape. For example, the geographic location information of the user's geographic location and the merchant's distribution area is latitude and longitude. According to the process of determining the first circumscribed rectangle of the distribution area according to the first embodiment of the present application, as shown in FIG. 2, the first circumscribed rectangle is determined according to the extreme values of the latitude and longitude of the distribution area. The extreme values of the latitude and longitude include maximum longitude, minimum longitude, and maximum latitude. And minimum latitude. It includes the following steps.

S1011: Extract the latitude and longitude information on the boundary of the delivery area. The latitude and longitude information includes the latitude and longitude values of all points on the boundary of the distribution area.

S1012. Extract longitude and latitude extreme values from the longitude and latitude information, that is, maximum longitude, minimum longitude, maximum latitude, and minimum latitude.

Specifically, among all the extracted longitude values on the boundary of the distribution area, the maximum longitude and the minimum longitude are found; among all the extracted latitude values on the boundary of the distribution area, the maximum latitude and the minimum latitude are found. The maximum longitude and minimum longitude are, for example, W _max and W _min , respectively, and the maximum latitude and minimum latitude are, for example, N _max and N _{min, respectively} .

S1013. Determine the first coordinates of the first circumscribed rectangle according to the maximum longitude and the maximum latitude, and determine the second coordinates of the first circumscribed rectangle according to the minimum longitude and the minimum latitude.

Specifically, for example, the first coordinate of the first circumscribed rectangle determined according to the maximum longitude W _max and the maximum latitude N _max is C1 (W _max , N _max ), and the first coordinate of the first circumscribed rectangle determined according to the minimum longitude W _min and the minimum latitude is The second coordinate is C2 (W _min , N _min ).

S1014. Determine a first circumscribed rectangle according to the first coordinate and the second coordinate.

Specifically, using the line between the first coordinate C1 (W _max , N _max ) and the second coordinate C2 (W _min , N _min ) as the diagonal of the first circumscribed rectangle, the first corresponding to the delivery area is determined Circumscribed rectangle.

In this embodiment, an R-tree index tree is established in units of business circles, that is, an R-tree index tree corresponding to business circles is established for the number of merchants included in each business circle and the distribution area of each merchant.

For example, the sub-nodes of the non-leaf nodes of the pre-established R-tree index tree include a first number of leaf nodes, and the first number is less than the node number threshold. Alternatively, the next-level child nodes of the non-leaf nodes of the R-tree index tree include a second number of leaf nodes and a third number of non-leaf nodes, and the sum of the second number and the third number is less than the node number threshold. The size of the threshold of the number of nodes is determined according to the number of merchants and the threshold of tree depth. When the number of merchants is large, the threshold of the number of nodes can be set to a large value so that the tree depth of the R-tree index tree does not exceed the tree depth threshold. When the number of merchants is small, in the case that the tree depth of the R-tree index tree does not exceed the tree depth threshold, the node number threshold can be set to a smaller value to make the tree depth larger and speed up the search. Specifically, for example, when the number of merchants is 2000, the first node threshold may be set to 6. Wherein, the geographical range represented by the second circumscribed rectangle on the root node covers the first circumscribed rectangle of all merchants in the business circle. The geographical range represented by the second circumscribed rectangle on the child node covers the first circumscribed rectangle of several merchants.

More specifically, the R-tree index tree in this embodiment is established in a bottom-up order, and each layer of the finally established R-tree index tree has at most one non-leaf node. In the process of creating an R-tree index tree, a dynamically changing rectangle is defined as a public rectangle. The position of the public rectangle in the R-tree index tree is the same as the position of the second circumscribed rectangle, that is, it is located on a non-leaf node. When the R-tree index tree is established, the common rectangle on the non-leaf nodes of the R-tree index tree in the final state is determined as the second circumscribed rectangle of the R-tree index tree.

The dynamically changing common rectangle is determined by two third circumscribed rectangles. The two third circumscribed rectangles include a first circumscribed rectangle and a common rectangle, or include two first circumscribed rectangles; the two third circumscribed rectangles determine the common In the case of rectangles, specifically, if the two third circumscribed rectangles are mutually contained, the common rectangle is equal to the larger of the two third circumscribed rectangles; if the two third circumscribed rectangles are partially overlapping or separated from each other, the common rectangle is equal to covering The smallest circumscribed rectangle of the two third circumscribed rectangles.

In one embodiment, for example, the finally established R-tree index tree has a total of N layers, and the numbers are 0, 1, 2, ..., N-1 in order from the lowest layer. In the process of creating an R-tree index tree, when the n-th layer is completed, for example, the currently-built part is an n-R-tree index tree, and several first circumscribed rectangles remain to be inserted into the index tree. In the current state, the nth layer of the nR-tree index tree contains one non-leaf node, that is, a common rectangle, and the nth layer of the nR-tree index tree contains several leaf nodes, that is, the first circumscribed rectangle, nR-tree The other n-2 layers of the index tree include one non-leaf node and several leaf nodes, that is, one common rectangle and several first circumscribed rectangles. For example, to select one of the first circumscribed rectangles to be inserted, the first circumscribed rectangle that is closest to the common rectangle of the nth layer of the nR-tree index tree, and you need to insert it into the nR-tree index tree, you need to determine The level of the nearest first circumscribed rectangle insertion. Specifically, starting from the common rectangle at the nth level of the nR-tree index tree, traversing the common rectangle at each level from top to bottom, determining the positional relationship between the nearest first circumscribed rectangle and the common rectangle at each level, and Determine the level of insertion of the closest first circumscribed rectangle according to the positional relationship, including: if there is a common rectangle containing the closest first circumscribed rectangle, and the number of child nodes contained in the common rectangle is less than the node number threshold, determine the closest The insertion level of the first circumscribed rectangle is the next layer of the common rectangle that contains the nearest first circumscribed rectangle, that is, the nearest first circumscribed rectangle is inserted into the child node of the common rectangle that contains the nearest first circumscribed rectangle . At this time, the common rectangle including the nearest first circumscribed rectangle changes, that is, the number of covered first circumscribed rectangles increases by one.

For example, if there are multiple common rectangles that include the nearest first circumscribed rectangle, and the number of child nodes included in the multiple common rectangles is less than the node number threshold, it is determined that the insertion level of the nearest first circumscribed rectangle is the multiple The next layer of the smallest common rectangle among the common rectangles, that is, insert the nearest first circumscribed rectangle into the child nodes of the smallest common rectangle among the multiple common rectangles. At this time, the minimum common common rectangle changes, that is, the number of covered first circumscribed rectangles increases by one.

If there is no common rectangle containing the nearest first circumscribed rectangle, that is, the position relationship between the nearest first circumscribed rectangle and the common rectangle of the nth layer is partially overlapping or separated from each other, then the nearest first circumscribed rectangle is determined The insertion level of the rectangle is the nth layer of the nR-tree index tree, that is, the nearest first circumscribed rectangle is inserted into the leaf node of the nth layer of the nR-tree index tree, and the nearest first circumscribed rectangle and nR -The common rectangle of the nth layer of the tree index tree determines the common rectangle of the n+1 layer. The common rectangle of the n+1 layer is the smallest of the common rectangle covering the nearest first circumscribed rectangle and the nth layer of the nR-tree index tree. Bounding rectangle. At this time, the n-R-tree index tree becomes an n+1-R-tree index tree, that is, the R-tree index tree is built up to the n+1th layer.

In a specific embodiment, the nth common rectangle is defined as the nth common rectangle. The steps for creating an R-tree index tree starting from level 0 include, for example, the following steps.

(1). Select the two closest circumscribed rectangles as the leaf nodes of the 0th layer of the R-tree index tree, and determine the first common rectangle covering the two closest circumscribed rectangles. The rectangle serves as a non-leaf node at the first level of the R-tree index tree and serves as the parent node of the two first circumscribed rectangles; where, if the two first circumscribed rectangles are mutually contained, the first common rectangle is equal to the two first circumscribed The larger of the rectangles; if the two first circumscribed rectangles are partially overlapping or separated from each other, the first common rectangle is equal to the smallest circumscribed rectangle covering the two first circumscribed rectangles.

(2) Select the first circumscribed rectangle with the closest distance to the first common rectangle, and determine the common rectangle covering the first common rectangle and the first circumscribed rectangle with the closest distance; if the first common rectangle is closest to the first circumscribed rectangle The rectangles are mutually contained, and the common rectangle is equal to the larger of the first common rectangle and the first circumscribed rectangle with the closest distance.

In an example, the larger one is the first common rectangle, then a leaf node is added at level 0 of the R-tree index tree, and the first common rectangle is added to the coverage of the first common rectangle at level 1 of the R-tree index tree. The rectangle is the first circumscribed rectangle closest to the first common rectangle.

In an example, the larger one is the nearest first circumscribed rectangle, then it is determined that the second common rectangle at the second level of the R-tree index tree is equal to the nearest first circumscribed rectangle, that is, becomes the first common rectangle and the The parent node of the nearest first circumscribed rectangle; a leaf node is added to the first layer of the R-tree index tree, that is, the first circumscribed rectangle closest to the first common rectangle.

If the first common rectangle and the closest circumscribed rectangle are partially overlapping or separated from each other, it is determined that the second common rectangle at the second level of the R-tree index tree is equal to covering the first common rectangle and the first closest circumscribed rectangle For the smallest circumscribed rectangle of R, a leaf node is added to the first layer of the R-tree index tree, that is, the first circumscribed rectangle closest to the first common rectangle.

According to the above method, until all the first circumscribed rectangles are used up, the R-tree index tree is established. It is worth noting that, during the establishment of the R-tree index tree, when the number of child nodes of a certain layer has reached the threshold of the number of nodes, the first outer circumscribed rectangle no longer added to this layer is added as a new leaf node. That is, at this time, even if the common rectangle of the layer contains the closest first circumscribed rectangle, the first circumscribed rectangle is not added to the leaf node of the common rectangle, but the first circumscribed rectangle is added to the common rectangle Leaf nodes on the same level. At the same time, the common rectangle of the upper layer is determined, and the common rectangle of the upper layer is equal to the common rectangle of the next layer, but the coverage range is increased by the nearest first circumscribed rectangle.

The closest distance mentioned in this embodiment is specifically used to describe the distance between the center points of two first circumscribed rectangles, or the distance between the common rectangle and the center point of the first circumscribed rectangle, and the closest first circumscribed distance The rectangle indicates that the distance to the center point of the first circumscribed rectangle is the shortest.

For example, to obtain the geographic location of the user, use the R-tree index tree to find the first circumscribed rectangle covering the geographic location of the user, as follows.

Through real-time positioning of the user, obtain the user's geographic location, such as latitude and longitude information, in the R-tree index tree from the root node to determine the second circumscribed rectangle covering each level of the user's geographic location; from the coverage of the user's geographic location Among the leaf nodes included in the second-level circumscribed rectangle at the last level, each first circumscribed rectangle covering the geographic location of the user is determined.

More specifically, if there is a leaf node's first circumscribed rectangle covering the user's geographic location, the first circumscribed rectangle is added to the list of deliverable first circumscribed rectangles; if there is a non-leaf node's second circumscribed rectangle covering the user's For the geographic location, continue to search for the next child node of the non-leaf node to determine whether the user's geographic location is covered by the first circumscribed rectangle of the leaf node in the child node or the second circumscribed rectangle of the non-leaf node in the child node. Until all the first circumscribed rectangles covering the geographic location of the user are found, a list of the first circumscribed rectangles that can be delivered is obtained.

Specifically, the above judgment whether the user's geographic location is covered by the first circumscribed rectangle of the leaf node can be done by comparing the user's geographic location with the latitude and longitude extreme value of the first circumscribed rectangle, if the user's geographic location is located at the latitude and longitude extreme of the first circumscribed rectangle In the value interval, it means that the first circumscribed rectangle covers the user position. For example, comparing whether the longitude of the user's geographic location is between the minimum longitude and the maximum longitude of the first circumscribed rectangle, and whether the latitude is between the minimum latitude and the maximum latitude of the first circumscribed rectangle.

S102. Determine a target delivery area covered by the delivery area corresponding to the first circumscribed rectangle of the geographic location of the user.

According to the first circumscribed rectangle including the location of the user found in step S101, a corresponding merchant can be obtained. Because the geographic area covered by the merchant's first circumscribed rectangle is different from the geographic area covered by the merchant's distribution area, the merchant's first circumscribed rectangle contains the user's location and does not mean that the geographic area covered by the merchant's distribution area also includes the user position. Therefore, the latitude and longitude information of the user's position is compared with the coverage of the distribution area corresponding to the first circumscribed rectangle covering the user's position, and it is determined whether the user's position is within the coverage of the distribution area corresponding to the first circumscribed rectangle to determine the coverage user The target distribution area of the location.

If the latitude and longitude information of the user's location is within the coverage area of the distribution area corresponding to the first circumscribed rectangle, it means that the merchant corresponding to the first circumscribed rectangle can provide distribution services for the user, and determine that the distribution area corresponding to the first circumscribed rectangle is the target Delivery Area.

If the latitude and longitude information of the user's location is not within the coverage area of the distribution area corresponding to the first circumscribed rectangle, it means that the merchant corresponding to the first circumscribed rectangle cannot provide distribution services for the user.

For example, when there are multiple first circumscribed rectangles covering the user's position, in this step, if it is determined whether the distribution areas of the multiple merchants cover the user's position, serial calculation can be used to sequentially determine the multiple distribution areas, or Use parallel computing to judge multiple distribution areas simultaneously. Among them, the serial calculation method refers to the distribution area of multiple merchants, and calculates and judges whether the distribution area of each merchant covers the user's position one by one; the parallel calculation method refers to the distribution area of multiple merchants, and simultaneously calculates and Determine whether the distribution area of each merchant covers the user's location.

S103. The merchant corresponding to the target distribution area is regarded as a deliverable merchant corresponding to the geographic location of the user.

In this embodiment, the distribution area corresponding to the target distribution area covers the geographic location of the user, that is, the merchant corresponding to the target distribution area can provide the distribution service for the user, and the merchant is determined as the user's distributable merchant, that is, the Distributable merchants in the user's geographic location.

In this embodiment, after the user's distributable merchant is determined, the distributable merchant is sent to the user's terminal device, and the terminal device displays the information of the distributable merchant. For example, send a distributable merchant to the user's mobile phone, and display the information of the distributable merchant on the mobile phone screen. The display content may include the merchant's ID, the merchant's name, the distance from the merchant to the user, the delivery fee, and the starting price.

In this embodiment, the merchant, the distribution area of the merchant, and the first circumscribed rectangle of the distribution area are connected through the characteristic parameters of the merchant, and the characteristic parameter of the merchant is, for example, the ID of the merchant.

The embodiment of the present application adopts the idea of spatial location search scheme based on index tree and filtering of circumscribed rectangles, aggregating merchants that are close to each other, and represented on the non-leaf nodes of the index tree structure as the first circumscribed rectangle of these merchants. Common circumscribed rectangle. When the user searches for a merchant, the amount of calculation is greatly reduced, and the merchant that meets the search conditions can be quickly found. In addition, the first circumscribed rectangle is determined according to the maximum latitude and longitude and the minimum latitude and longitude on the boundary of the distribution area, and the minimum circumscribed rectangle including the merchant's distribution area can be obtained, reducing the calculation amount in the search process.

The second embodiment of the present application relates to a merchant search method based on spatial location. This embodiment can be applied to a terminal side, such as a terminal device such as a mobile phone or a tablet computer, or a server on a network side.

The merchant search method provided by the second embodiment of the present application includes the following steps.

S201. Obtain the geographic location of the user, and use the pre-established index tree to find the first circumscribed rectangle covering the geographic location of the user.

The sub-nodes of the non-leaf nodes of the pre-established R-tree index tree include a first number of leaf nodes, and the first number is less than the threshold of the number of nodes. Alternatively, the next-level child nodes of the non-leaf nodes of the R-tree index tree include a second number of leaf nodes and a third number of non-leaf nodes, and the sum of the second number and the third number is less than the node number threshold. The size of the threshold of the number of nodes is determined according to the number of merchants and the threshold of tree depth. When the number of merchants is large, the threshold of the number of nodes can be set to a large value so that the tree depth of the R-tree index tree does not exceed the tree depth threshold. When the number of merchants is small, in the case that the tree depth of the R-tree index tree does not exceed the tree depth threshold, the node number threshold can be set to a smaller value to make the tree depth larger and speed up the search. Specifically, for example, when the number of merchants is 2000, the first node threshold may be set to 6. In a specific example, the threshold of the R-tree index tree is set to 2.

Specifically, the schematic diagram of determining the second circumscribed rectangle of the non-leaf node according to the second embodiment of the present application is shown in FIG. 3. The schematic diagram of the R-tree index tree according to the second embodiment of the present application is shown in FIG. 4. Combining Figure 3 and Figure 4, when building an R-tree index tree, you can start from any first circumscribed rectangle, for example, from the first circumscribed rectangle of a merchant located at the edge of the business circle, or from the center of the business circle. Start the first circumscribed rectangle of the merchant, compare it with the latitude and longitude range of the first circumscribed rectangle closest to it, determine the public circumscribed rectangle of the parent node of the upper layer, and then connect the public circumscribed rectangle to the next Compare the latitude and longitude range of the closest circumscribed rectangle to determine the virtual node circumscribed rectangle of the parent node of the upper layer. In the same way, insert each first circumscribed rectangle into the R-tree index tree to complete the R-tree The establishment of the index tree.

For example, suppose the total number of merchants in the business circle is 5, and the first circumscribed rectangles corresponding to all merchants are numbered and sorted as D1, D2, D3, D4, and D5. The first circumscribed rectangle adjacent to the serial number indicates that the geographic location is also adjacent. For example, starting from D1, first compare the latitude and longitude ranges of D1 and the first closest circumscribed rectangle D2, and find that D1 and D2 are partially overlapping, then determine that the first common circumscribed rectangle of the parent node of the upper layer is D12, D12 The coverage area of contains two first circumscribed rectangles D1 and D2. Secondly, comparing the latitude and longitude ranges of the first common circumscribed rectangle D12 and the next closest circumscribed rectangle D3, it is found that D12 and D3 are independent of each other, and it is determined that the second common circumscribed rectangle of the parent node at the upper layer is D123, the coverage of D123 includes three first circumscribed rectangles D1, D2, D3. Again, compare the latitude and longitude range of the second common circumscribed rectangle D123 with the next closest circumscribed rectangle D4, and find that D123 contains D4, then determine the size of the third common circumscribed rectangle of the parent node of the upper layer and D123 Same as the position, denoted by D1 to 4, the coverage of D1 to 4 includes four first circumscribed rectangles D1, D2, D3, D4. The same method continues to insert the remaining first circumscribed rectangles D5 by comparing the latitude and longitude ranges of the public circumscribed rectangle of the parent node and the next closest circumscribed rectangle to complete the establishment of the R tree.

For example, the user's geographic location is obtained, and the first circumscribed rectangle covering the user's geographic location is found in the R-tree index tree to obtain a list of first circumscribed rectangles that can be distributed.

For example, when searching for the first circumscribed rectangle covering the user's position in the R-tree index tree, the top-down search sequence is adopted, that is, the search starts from the root node circumscribed rectangle, which specifically includes the following steps.

(1) Find out whether the second circumscribed rectangle corresponding to the root node contains the user's location: If the second circumscribed rectangle corresponding to the root node does not contain the user's location, it means that all the merchants in the business circle do not provide distribution services for the user's location. Search; for example, user A in FIG. 3 uses the R-tree index tree shown in FIG. 5 to search, which is not within the coverage range of the second circumscribed rectangles D1 to 5.

If the second circumscribed rectangle corresponding to the root node contains the user's position, continue to search whether the circumscribed rectangles of all the child nodes of the second layer contain the user's position. For example, user B or user E in FIG. 3 uses the R-tree index tree shown in FIG. 4 to search within the coverage range of the second circumscribed rectangles D1 to 5.

(2) In turn, find out whether the circumscribed rectangles corresponding to all the child nodes of the second layer contain the user's position. The circumscribed rectangles of all child nodes include several second circumscribed rectangles, or the circumscribed rectangles of all child nodes include several second circumscribed rectangles and First circumscribed rectangle. In turn, find out whether the circumscribed rectangle corresponding to each child node contains the user's position: If the first circumscribed rectangle corresponding to the leaf node does not contain the user's position, it means that the merchant corresponding to the leaf node does not provide distribution services for the user's position; for example, in Figure 3 User B, after searching, is not within the coverage of the first circumscribed rectangle D5.

If the circumscribed rectangle corresponding to the leaf node contains the user's location, it means that the merchant corresponding to the leaf node can provide distribution services for the user's location and record the first circumscribed rectangle; for example, the E user in Figure 3, after searching, finds the first circumscribed rectangle Within the coverage of D5.

If the second circumscribed rectangle does not include the user's location, it means that the merchant corresponding to the second circumscribed rectangle does not provide distribution services for the user's location.

If the second circumscribed rectangle contains the user's location, it means that the merchant corresponding to the second circumscribed rectangle can provide distribution service for the user's location, then continue to find whether the circumscribed rectangle corresponding to all the child nodes of the third layer of the second circumscribed rectangle contains the user's location For example, the user B in FIG. 3, after searching, within the coverage of the second circumscribed rectangles D1 to 4, continue searching to the next layer.

For each level, the child nodes of the second circumscribed rectangle containing the user's location are searched according to the method of step (2) above until all the first circumscribed rectangles containing the user's location are found.

For example, the B user in FIG. 3, after a top-down search in the R-tree index tree, finally finds two first circumscribed rectangles covering the location of the B user: D1 and D2.

S202. Determine a target distribution area covered by the distribution area corresponding to the first circumscribed rectangle of the geographic location of the user. The details are as in step S102 in the first specific embodiment.

S203. The merchant corresponding to the target distribution area is regarded as a deliverable merchant corresponding to the geographic location of the user.

The embodiment of the present application adopts the idea of spatial location search scheme based on index tree and filtering of circumscribed rectangles, aggregating merchants that are close to each other, and represented on the non-leaf nodes of the index tree structure as the first circumscribed rectangle of these merchants. Common circumscribed rectangle. When the user searches for a merchant, the public circumscribed rectangle can quickly find multiple clustered merchants that meet the conditions, greatly reducing the amount of calculation. In addition, according to the location relationship, the closest merchants are aggregated, which is more in line with the user search scenario. And through the top-down search in the index tree, users can effectively filter out merchants that do not meet the conditions when searching for merchants, and can quickly find multiple merchants that match the user's location.

The third embodiment of the present application relates to a merchant search device. FIG. 5 is a schematic diagram of a merchant search device according to a third embodiment of the present application. The merchant search device 500 includes the following modules.

The search module 501 is used to obtain the user's geographic location, and use the pre-established index tree to find the first circumscribed rectangle covering the geographic location, where the first circumscribed rectangle is the smallest circumscribed rectangle covering the merchant's distribution area; the user's geographic location and distribution The area is used for latitude and longitude information.

The target delivery area determination module 502 is used to determine a target delivery area whose geographic location is covered by the delivery area corresponding to the first circumscribed rectangle.

The deliverable merchant determination module 503 is used to make the merchant corresponding to the target delivery area as the deliverable merchant corresponding to the geographic location; wherein, the leaf nodes of the index tree correspond to the first circumscribed rectangle, and the non-leaf nodes of the index tree correspond to the second circumscribed rectangle, The second circumscribed rectangle is the smallest circumscribed rectangle determined according to at least two merchant distribution areas in the business circle.

Specifically, the child nodes of each non-leaf node of the index tree include a first number of leaf nodes, and the first number is less than the threshold of the number of nodes. Or the child nodes of each non-leaf node of the index tree include a second number of leaf nodes and a third number of non-leaf nodes; the sum of the second number and the third number is less than the node number threshold.

More specifically, the search module 501 determines the second circumscribed rectangles covering each level of the geographic location in order from the root node in the index tree; from the leaf nodes contained in the second circumscribed rectangle at the last level covering the geographic location, the coverage geography is determined Each first circumscribed rectangle of the location includes: judging whether the geographic location is within the latitude and longitude extreme range of the first circumscribed rectangle, if it is, it is determined that the first circumscribed rectangle covers the geographic location, otherwise, it is determined that the first circumscribed rectangle does not cover the geographic location .

For example, when there are at least two first circumscribed rectangles covering the geographic location, determining the target distribution area whose geographic location is covered by the distribution area corresponding to the first circumscribed rectangle includes: using a parallel computing method, while determining whether the geographic location is covered by the geographic location The delivery area corresponding to each first circumscribed rectangle of the position is covered. If so, the delivery area corresponding to the first circumscribed rectangle is determined to be the target delivery area.

For example, the search module 501 determines the business circle to which the user belongs and the index tree corresponding to the business circle according to the geographic location of the user before determining the second circumscribed rectangles at each level covering the geographic location from the root node in the index tree.

In the embodiment of the present application, the merchant search device 500 further includes an index tree creation module 504, which is used to create an index tree according to the distribution area of the merchant in the commercial circle. Specifically, the index tree creation module 504 includes a first circumscribed rectangle determination module 5041, a common rectangle determination module 5042, and an insertion level determination module 5043.

Specifically, the first circumscribed rectangle determining module 5041 is used to determine the first circumscribed rectangle according to the distribution area of the merchant in the business circle, specifically: determining the extreme values of latitude and longitude in the distribution area of the merchant, the extreme values of latitude and longitude include maximum longitude, minimum longitude, and maximum Latitude and minimum latitude; the first circumscribed rectangle is determined according to the extreme value of latitude and longitude.

More specifically, the common rectangle determining module 5042 is used to determine the dynamically changing common rectangle according to the two third circumscribed rectangles, specifically: if the two third circumscribed rectangles are mutually included, the common rectangle is equal to the two third circumscribed rectangles If the two third circumscribed rectangles are partially overlapping or separated from each other, the common rectangle is equal to the smallest circumscribed rectangle covering the two third circumscribed rectangles. Among them, the two third circumscribed rectangles include a first circumscribed rectangle and a common rectangle, or include two first circumscribed rectangles; the second circumscribed rectangle at each level of the index tree is the common rectangle.

More specifically, the insertion level determination module 5043 is used to select the first circumscribed rectangle closest to the common rectangle at the highest level of the index tree under construction from several first circumscribed rectangles to be inserted, according to the closest first circumscribed rectangle The positional relationship with the unsaturated common rectangle in the index tree under construction determines the insertion level of the closest circumscribed rectangle. Specifically, if there are a plurality of unsaturated common rectangles and the closest circumscribed rectangle has a positional relationship that includes the closest first circumscribed rectangle, then the insertion level is determined to be below the smallest common rectangle among the several unsaturated public rectangles One layer; if the position relationship between the closest first circumscribed rectangle and the common rectangle of the highest layer of the index tree under construction is partially overlapping or separated from each other, then the insertion level is determined to be the highest layer of the index tree under construction. Among them, the index tree under construction corresponds to any state before the index tree is created; the unsaturated public rectangle is a public rectangle whose number of child nodes is less than the threshold of the number of nodes.

The fourth embodiment of the present application relates to an electronic device. FIG. 6 is a schematic diagram of an electronic device according to a fourth embodiment of the present application. The electronic device includes: at least one processor 601; Memory 602; and, respectively, a communication component 603 that is communicatively connected to the processor 601 and the memory 602, and the communication component 603 receives and sends data under the control of the processor 601; wherein, the memory 602 stores at least one processor 601 The executed instruction is executed by at least one processor 601 to achieve: obtain the user's geographic location, and use a pre-established index tree to find the first circumscribed rectangle covering the geographic location, where the first circumscribed rectangle is the smallest covering the merchant's distribution area Circumscribed rectangle; determine the target distribution area whose geographic location is covered by the distribution area corresponding to the first circumscribed rectangle; consider the merchant corresponding to the target distribution area as the distributable merchant corresponding to the geographical position; where the leaf nodes of the index tree correspond to the first circumscribed rectangle, The non-leaf nodes of the index tree correspond to the second circumscribed rectangle, and the second circumscribed rectangle is the smallest circumscribed rectangle determined according to at least two merchant distribution areas.

The electronic device includes: one or more processors 601 and a memory 602. In FIG. 6, a processor 601 is used as an example. The processor 601 and the memory 602 may be connected through a bus or in other ways. In FIG. 6, the connection through a bus is used as an example. The memory 602 is a non-volatile computer-readable storage medium, and can be used to store non-volatile software programs, non-volatile computer executable programs, and modules. The processor 601 executes various functional applications and data processing of the device by running non-volatile software programs, instructions, and modules stored in the memory 602, that is, implementing the above merchant search method.

The memory 602 may include a storage program area and a storage data area, where the storage program area may store an operating system and application programs required by at least one function; the storage data area may store a merchant's ID, longitude and latitude information of the merchant's distribution area, and the like. In addition, the memory 602 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices. In some embodiments, the memory 602 may optionally include memories set remotely with respect to the processor 601, and these remote memories may be connected to an external device through a network. Examples of the above network include but are not limited to the Internet, intranet, local area network, mobile communication network, and combinations thereof.

One or more modules are stored in the memory 602, and when executed by one or more processors 601, execute the merchant search method in any of the above method embodiments.

The above products can execute the method provided by the embodiments of the present application, and have the corresponding functional modules and beneficial effects of the execution method. For technical details not described in detail in this embodiment, please refer to the methods provided by the embodiments of the present application.

The fifth embodiment of the present application relates to a non-volatile storage medium for storing a computer-readable program, and the computer-readable program is used for a computer to execute some or all of the above method embodiments.

That is, those skilled in the art can understand that all or part of the steps in the method in the above embodiments can be completed by instructing relevant hardware through a program, which is stored in a storage medium and includes several instructions to make a device ( It may be a single chip microcomputer, a chip, etc.) or a processor to execute all or part of the steps of the methods of the embodiments of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program code .

Persons of ordinary skill in the art may understand that the above-mentioned embodiments are specific embodiments for implementing the present application, and in practical applications, various changes may be made in form and detail without departing from the spirit and range.

Claims

A merchant search method, including:

Obtain the user's geographic location, and use a pre-established index tree to find the first circumscribed rectangle that covers the geographic location, where the first circumscribed rectangle is the smallest circumscribed rectangle that covers the merchant's distribution area;

Determining a target distribution area covered by the distribution area corresponding to the first circumscribed rectangle of the geographic location;

Use the merchant corresponding to the target distribution area as the deliverable merchant corresponding to the geographic location;

Wherein, the leaf nodes of the index tree correspond to a first circumscribed rectangle, and the non-leaf nodes of the index tree correspond to a second circumscribed rectangle, and the second circumscribed rectangle is a minimum circumscribed rectangle determined according to at least two of the merchant distribution areas .
The method according to claim 1, wherein a child node of each non-leaf node of the index tree includes a first number of leaf nodes, and the first number is less than a node number threshold.
The method according to claim 1, wherein a child node of each non-leaf node of the index tree includes a second number of leaf nodes and a third number of non-leaf nodes; the second number and the third number The sum of is less than the threshold of the number of nodes.
The method according to any one of claims 1 to 3, wherein creating the index tree comprises: determining a dynamically changing common rectangle from two third circumscribed rectangles;

If the two third circumscribed rectangles are mutually included, the common rectangle is equal to the larger of the two third circumscribed rectangles;

If the two third circumscribed rectangles are partially overlapping or separated from each other, the common rectangle is equal to the smallest circumscribed rectangle covering the two third circumscribed rectangles;

Wherein, the two third circumscribed rectangles include one first circumscribed rectangle and one common rectangle, or two two first circumscribed rectangles;

The second circumscribed rectangle of each level of the index tree is the common rectangle of the corresponding level of the index tree when the creation is completed.
The method of claim 4, wherein creating the index tree further comprises:

Select the first circumscribed rectangle closest to the common rectangle at the highest level of the index tree under construction from several first circumscribed rectangles to be inserted;

Determine the level of insertion of the first closest circumscribed rectangle according to the positional relationship between the first closest circumscribed rectangle and the unsaturated common rectangle in the index tree under construction;

Wherein, the index tree under construction corresponds to any state before the index tree is created; the unsaturated common rectangle is the common rectangle whose number of child nodes is less than the threshold of the number of nodes.
The method according to claim 5, wherein the determining of the insertion of the closest first circumscribed rectangle according to the positional relationship between the closest first circumscribed rectangle and the unsaturated common rectangle in the index tree under construction Levels, including:

If the positional relationship between the plurality of unsaturated common rectangles and the closest first circumscribed rectangle includes the closest first circumscribed rectangle, it is determined that the insertion level is a number of the unsaturated common rectangles The next layer of the smallest common rectangle in

If the positional relationship between the closest first circumscribed rectangle and the common rectangle of the highest level of the index tree under construction is partially overlapping or separated from each other, then the insertion level is determined to be the highest level of the index tree under construction.
The method according to claim 1, wherein the acquiring the geographic location of the user and using a pre-established index tree to find the first circumscribed rectangle covering the geographic location includes:

In the index tree, starting from the root node, sequentially determining the second circumscribed rectangle of each level covering the geographic location;

From the leaf nodes included in the last circumscribed rectangle covering the geographic location, each first circumscribed rectangle covering the geographic location is determined.
The method according to claim 7, wherein before determining the second circumscribed rectangle covering each level of the geographic location in order from the root node in the index tree, further comprising:

The business district to which the user belongs and the index tree corresponding to the business district are determined according to the geographic location.
The method of claim 1, wherein the using a pre-established index tree to search for the first circumscribed rectangle covering the geographic location includes:

Determine whether the geographic location is within the latitude and longitude extremes of the first circumscribed rectangle; if so, determine that the first circumscribed rectangle covers the geographic location; otherwise, determine that the first circumscribed rectangle does not cover the geographic location position.
The method according to claim 9, wherein when there are at least two first circumscribed rectangles covering the geographic location, the target delivery that determines that the geographic location is covered by a delivery area corresponding to the first circumscribed rectangle Areas, including:

A parallel computing method is used to determine whether the geographic location is covered by the distribution area corresponding to each of the first circumscribed rectangles covering the geographic location, and if so, determine the distribution area corresponding to the first circumscribed rectangle as the target distribution region.
The method according to claim 1, wherein after the merchant corresponding to the target distribution area is taken as a deliverable merchant corresponding to the geographic location, further comprising:

Sending the deliverable merchant to the user's terminal device, and the terminal device displays the information of the deliverable merchant.
The method according to claim 1, wherein the geographic location and the distribution area are represented by latitude and longitude information.
The method according to claim 12, wherein the first circumscribed rectangle is determined according to the following steps:

Determining the extreme value of latitude and longitude in the distribution area of the merchant, the extreme value of latitude and longitude including maximum longitude, minimum longitude, maximum latitude and minimum latitude;

The first circumscribed rectangle is determined according to the longitude and latitude extreme value.
A merchant search device, including:

The search module is used to obtain the geographic location of the user, and use a pre-established index tree to search for the first circumscribed rectangle covering the geographic location, wherein the first circumscribed rectangle is the smallest circumscribed rectangle covering the distribution area of the merchant;

A target distribution area determining module, configured to determine a target distribution area covered by the distribution area corresponding to the first circumscribed rectangle of the geographic location;

A distributable merchant determination module, configured to use a merchant corresponding to the target distribution area as a distributable merchant corresponding to the geographic location;

Wherein, the leaf nodes of the index tree correspond to a first circumscribed rectangle, and the non-leaf nodes of the index tree correspond to a second circumscribed rectangle, and the second circumscribed rectangle is determined according to at least two of the merchant distribution areas in the business circle The smallest circumscribed rectangle.
An electronic device including: at least one processor; and

A memory in communication connection with 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 achieve: obtain the geographic location of the user, and search and cover the geographic location using a pre-established index tree The first circumscribed rectangle of the location, wherein the first circumscribed rectangle is the smallest circumscribed rectangle covering the distribution area of the merchant; determining the target distribution area where the geographic location is covered by the distribution area corresponding to the first circumscribed rectangle; The merchant corresponding to the target distribution area serves as a deliverable merchant corresponding to the geographic location; wherein, the leaf nodes of the index tree correspond to the first circumscribed rectangle, and the non-leaf nodes of the index tree correspond to the second circumscribed rectangle, and the second The circumscribed rectangle is the smallest circumscribed rectangle determined according to at least two of the merchant distribution areas.
The electronic device according to claim 15, wherein a child node of each non-leaf node of the index tree includes a first number of leaf nodes, the first number being less than a first node number threshold.
The electronic device according to claim 15, wherein a child node of each non-leaf node of the index tree includes a second number of leaf nodes and a third number of non-leaf nodes; the second number and the third The sum of the numbers is less than the second node number threshold.
The electronic device according to any one of claims 15 to 17, wherein, when the index tree is created, a dynamically changing common rectangle is determined by two third circumscribed rectangles;

If the two third circumscribed rectangles are mutually included, the common rectangle is equal to the larger of the two third circumscribed rectangles;

If the two third circumscribed rectangles are partially overlapping or separated from each other, the common rectangle is equal to the smallest circumscribed rectangle covering the two third circumscribed rectangles;

Wherein, the two third circumscribed rectangles include one first circumscribed rectangle and one common rectangle, or two two first circumscribed rectangles;

The second circumscribed rectangle of each level of the index tree is the common rectangle of the corresponding level of the index tree when the creation is completed.
The electronic device of claim 18, wherein creating the index tree further comprises:

Select the first circumscribed rectangle closest to the common rectangle at the highest level of the index tree under construction from several first circumscribed rectangles to be inserted;

Determine the level of insertion of the first closest circumscribed rectangle according to the positional relationship between the first closest circumscribed rectangle and the unsaturated common rectangle in the index tree under construction;

Wherein, the index tree under construction corresponds to any state before the index tree is created; the unsaturated common rectangle is the common rectangle whose number of child nodes is less than the threshold of the number of nodes.
The electronic device according to claim 19, wherein the determining of the insertion of the closest first circumscribed rectangle according to the positional relationship between the closest first circumscribed rectangle and the unsaturated common rectangle in the index tree under construction Levels, including:

If the positional relationship between the plurality of unsaturated common rectangles and the first circumscribed rectangle with the closest distance includes the first circumscribed rectangle with the closest distance, it is determined that the insertion level is a number of the unsaturated public rectangles The next layer of the smallest common rectangle in

If the positional relationship between the closest first circumscribed rectangle and the common rectangle of the highest level of the index tree under construction is partially overlapping or separated from each other, then the insertion level is determined to be the highest level of the index tree under construction.
The electronic device according to claim 15, wherein the acquiring the geographic location of the user and using a pre-established index tree to find the first circumscribed rectangle covering the geographic location includes: starting from a root node in the index tree Determine the second circumscribed rectangles covering each level of the geographic location in turn; from the leaf nodes contained in the second circumscribed rectangle covering the last level of the geographic location, determine each first circumscribed rectangle covering the geographic location.
The electronic device according to claim 21, wherein before determining, in order from the root node in the index tree, the second circumscribed rectangle covering each level of the geographic location, further comprising:

The business district to which the user belongs and the index tree corresponding to the business district are determined according to the geographic location.
The electronic device according to claim 15, wherein the using a pre-established index tree to search for the first circumscribed rectangle covering the geographical position includes: determining whether the geographical position is located at the latitude and longitude of the first circumscribed rectangle In the value interval, if yes, it is determined that the first circumscribed rectangle covers the geographic location, otherwise, it is determined that the first circumscribed rectangle does not cover the geographic location.
The electronic device according to claim 23, wherein when there are at least two first circumscribed rectangles covering the geographic location, the target of determining that the geographic location is covered by a distribution area corresponding to the first circumscribed rectangle The distribution area includes: using a parallel calculation method to determine whether the geographic location is covered by a distribution area corresponding to each of the first circumscribed rectangles covering the geographic location, and if so, determine the corresponding The delivery area is the target delivery area.
The electronic device according to claim 15, wherein after the merchant corresponding to the target distribution area is a deliverable merchant corresponding to the geographic location, comprising: sending the deliverable merchant to a terminal of the user The device displays the information of the distributable merchant from the terminal device.
The electronic device according to claim 15, wherein the geographic location and the distribution area are represented by latitude and longitude information.
The electronic device according to claim 26, wherein the first circumscribed rectangle is determined according to the following step: determining an extreme value of latitude and longitude in the distribution area of the merchant, the extreme value of latitude and longitude including maximum longitude, minimum longitude, maximum latitude and Minimum latitude; determine the first circumscribed rectangle according to the extreme value of the latitude and longitude.
A non-volatile storage medium for storing a computer-readable program for the computer to execute the merchant search method according to any one of claims 1 to 13.