CN117573707A - Business service method and device - Google Patents
Business service method and device Download PDFInfo
- Publication number
- CN117573707A CN117573707A CN202311361918.4A CN202311361918A CN117573707A CN 117573707 A CN117573707 A CN 117573707A CN 202311361918 A CN202311361918 A CN 202311361918A CN 117573707 A CN117573707 A CN 117573707A
- Authority
- CN
- China
- Prior art keywords
- store
- identification
- grid
- service
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000012544 monitoring process Methods 0.000 claims description 6
- 230000004044 response Effects 0.000 abstract description 5
- 230000001413 cellular effect Effects 0.000 description 38
- 230000015654 memory Effects 0.000 description 19
- 238000012545 processing Methods 0.000 description 18
- 238000004422 calculation algorithm Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 238000004590 computer program Methods 0.000 description 4
- 238000013500 data storage Methods 0.000 description 4
- 230000003247 decreasing effect Effects 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000002085 persistent effect Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000007781 pre-processing Methods 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24552—Database cache management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/957—Browsing optimisation, e.g. caching or content distillation
- G06F16/9574—Browsing optimisation, e.g. caching or content distillation of access to content, e.g. by caching
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0639—Item locations
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Computing Systems (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The specification provides a business service method and device, wherein the business service method comprises the following steps: receiving a business service request of a user, wherein the business service request carries position coordinates of the user request; determining the identification of a target space grid corresponding to the position coordinates requested by the user; acquiring a first target store identifier set corresponding to the target space grid identifier; selecting at least one target store identifier from the first target store identifier set, and feeding back a selection result to a user; the earth surface space is divided into a plurality of space grids, and each store identification set corresponding to each space grid identification is uniformly stored on each storage server node in the storage server cluster. The scheme is not easy to cause the problems of a hot spot server and a large KEY, and can improve the response speed to the user request when the service is in a peak.
Description
Technical Field
The present application relates to the field of internet application technologies, and in particular, to a business service method and apparatus.
Background
With the development of internet application technology, more and more services provide service sources for offline stores based on the internet, and users can conveniently find offline service stores. Such as online car rental services, delivery services for take-away, flowers, express, etc. In this business service mode, the service platform usually defines a service range for an offline store, and the boundary line of the service range is also called an electronic fence, that is, the range within the electronic fence is the service range. As off-line stores continue to join the platform, the platform can provide more and more alternative stores for a user request. In the case of a large number of off-line stores, how to screen out stores near the user request service point from among a large number of off-line stores becomes a large computational challenge.
The prior art generally records the longitude and latitude of all stores in each city, calculates the distance between all stores in the target city and the user request position after obtaining the user request in the target city, and performs inverted arrangement according to the distance, and screens a certain number of stores; or, in the prior art, using an open source cache service REDIS to place the longitude and latitude of the urban store in a geoash structure, and calculating to obtain a store list around the user according to the longitude and latitude of the user request position and the geoash.
In the above-mentioned existing method, every time a service request of a target area is received, the longitude and latitude of all stores (stores with obvious distance are also needed) of the area need to be obtained, which results in higher concurrent access amount of store information of the area, higher reading pressure of a storage server and slower response of a service processing server.
The above-described existing methods generally divide data to be stored by region (e.g., country, city, etc.), and store the divided regions together in one server node. The concurrent access volume of server nodes corresponding to more developed regions is typically greater, while the concurrent access volume of server nodes corresponding to less developed regions is typically less. After the areas are divided, the longitude and latitude of each store in the areas are stored in the corresponding server nodes. However, with the development of economy, the service demand of each city may change, so that the server node with smaller concurrent access is converted into the server node with larger concurrent access. It can be seen that such a data storage manner is easy to form a hot spot server, and in a high concurrency scenario, the hot spot server generally causes instability of the storage system.
In addition, since data is generally stored in a server in a form of < KEY, VALUE >, where KEY refers to a divided region (for example, shanghai city, suzhou city, qinghai province, etc.), the above data storage manner also easily causes a problem of large KEY, which results in a long overall response time of a user request and reduces user experience of using the system.
For example, the longitude and latitude of each store in the Shanghai city are stored in the first server node, the longitude and latitude of each store in the Suzhou city are stored in the second server node, and the longitude and latitude of each store in each city in the Qinghai province are stored in the third server node. Because the economy of Shanghai city is developed, the service demand of the user is large, and the first server node needs to be accessed every time the service demand of one Shanghai city is processed, so that the first server node becomes a hot spot server in a high concurrency scene. Compared with Shanghai city, the service demand of Qinghai province is smaller, and the data access of the third server node is smaller. With the development of economy or policy, a certain amount of service demand in Qinghai province may increase rapidly, so that the third server node becomes a hotspot server in a high concurrency scenario.
Disclosure of Invention
The specification provides a business service method and device, which are used for solving the problem that a hot spot server and a large KEY are easy to appear in the existing business service mode.
To solve the above technical problem, a first aspect of the present disclosure provides a business service system, including: receiving a business service request of a user, wherein the business service request carries position coordinates of the user request; determining the identification of a target space grid corresponding to the position coordinates requested by the user; acquiring a first target store identifier set corresponding to the target space grid identifier; selecting at least one target store identifier from the first target store identifier set, and feeding back a selection result to a user; the earth surface space is divided into a plurality of space grids, and each store identification set corresponding to each space grid identification is uniformly stored on each storage server node in the storage server cluster.
In some embodiments, the plurality of spatial grids are hexagons of equal size.
In some embodiments, the storage server cluster is a cluster of cache servers.
In some embodiments, a set of store identifications corresponding to each spatial grid identification of each region is determined by: acquiring a set of space grids of a current region and a set of service ranges of stores in the current region from a storage server; determining a plurality of space grid areas corresponding to the service ranges of each store respectively, so as to determine a space grid identification set corresponding to each store identification respectively; and determining a store identification set corresponding to each space grid identification according to the space grid identification set corresponding to each store identification.
In some embodiments, the method further comprises: monitoring whether the set of the space grids of each region and the set of the service ranges of each store in each region stored in the storage server are updated or not; in the case of an update, determining a target area with the update; redetermining a store identifier set corresponding to each spatial grid identifier of the target region by: acquiring a set of space grids of a target area and a set of service ranges of stores in the target area from a storage server; determining a plurality of space grid areas corresponding to the service ranges of each store respectively, so as to determine a space grid identification set corresponding to each store identification respectively; and determining a store identification set corresponding to each space grid identification according to the space grid identification set corresponding to each store identification.
In some embodiments, a collection of spatial grids for a region is stored in the storage server using a data structure; and/or a set of service areas of stores within a region is stored in the storage server using a data structure.
In some embodiments, determining a plurality of spatial grid regions corresponding to a service range of each store, thereby determining a set of spatial grid identifiers respectively corresponding to each store identifier, comprises: determining a first area formed by each space grid intersected with the service range of the current store; wherein, the intersection of a space grid and the service range of the current store means that the area exceeding the preset proportion in the space grid is positioned in the service range of the current store; acquiring a second area formed after the first area extends outwards by a preset distance; determining an identified target set for each spatial grid intersecting the second region; and taking the target set as a space grid identification set corresponding to the current store identification.
In some embodiments, determining a plurality of spatial grid regions corresponding to a service range of each store, thereby determining a set of spatial grid identifiers respectively corresponding to each store identifier, comprises: determining a first area formed by each space grid intersected with the service range of the current store; wherein, the intersection of a space grid and the service range of the current store means that the area exceeding the preset proportion in the space grid is positioned in the service range of the current store; acquiring adjacent space grids adjacent to each space grid at the edge of the first area; and taking the space grid identification sets of each adjacent space grid and each space grid in the first area as the space grid identification set corresponding to the current store identification.
In some embodiments, selecting at least one target store identifier from the first target store identifier set, and feeding back the selection result to the user, including: sequentially judging whether the service range of each store in the first target store identification set covers the position coordinates requested by the user; taking an identification set of stores with a service range covering the position coordinates requested by the user as a second target store identification set; and selecting at least one target store identifier from the second target store identifier set according to the service requirement, and feeding back a selection result to the user.
A second aspect of the present specification provides a business service apparatus, comprising: the receiving unit is used for receiving a business service request of a user, wherein the business service request carries the position coordinates of the user request; the first determining unit is used for determining the identification of the target space grid corresponding to the position coordinate requested by the user, and acquiring a first target store identification set corresponding to the target space grid identification from a storage server cluster; the selecting unit is used for selecting at least one target store identifier from the first target store identifier set and feeding back a selection result to a user; and the storage unit is used for uniformly storing each store identification set corresponding to each space grid identification of each space grid of the earth surface space on each storage server node in the storage server cluster.
In some embodiments, the apparatus further comprises: an acquisition unit for acquiring a set of spatial grids of a current region and a set of service ranges of stores in the current region from a storage server; a first determining unit, configured to determine a plurality of spatial grid areas corresponding to service ranges of each store, so as to determine a spatial grid identifier set corresponding to each store identifier; and the second determining unit is used for determining the store identification set corresponding to each space grid identification according to the space grid identification set corresponding to each store identification.
In some embodiments, the apparatus further comprises: a monitoring unit, configured to monitor whether a set of spatial grids of each region and a set of service ranges of stores in each region stored in the storage server are updated; a third determining unit configured to determine, in the case of an update, a target area having the update; a fourth determining unit, configured to redetermine a store identifier set corresponding to each spatial grid identifier of the target area by: acquiring a set of space grids of a target area and a set of service ranges of stores in the target area from a storage server; determining a plurality of space grid areas corresponding to the service ranges of each store respectively, so as to determine a space grid identification set corresponding to each store identification respectively; and determining a store identification set corresponding to each space grid identification according to the space grid identification set corresponding to each store identification.
In some embodiments, the first determining unit comprises: a first determination subunit configured to determine a first area formed by each spatial grid intersecting with a service range of a current store; wherein, the intersection of a space grid and the service range of the current store means that the area exceeding the preset proportion in the space grid is positioned in the service range of the current store; the first acquisition subunit is used for acquiring a second area formed after the first area extends outwards by a preset distance; a first determining subunit configured to determine an identified target set for each spatial grid intersecting the second region; and the second determining subunit is used for taking the target set as a space grid identification set corresponding to the current store identification.
In some embodiments, the first determining unit comprises: a third determining subunit, configured to determine a first area formed by each spatial grid intersecting with a service range of the current store; wherein, the intersection of a space grid and the service range of the current store means that the area exceeding the preset proportion in the space grid is positioned in the service range of the current store; a second acquisition subunit, configured to acquire adjacent spatial grids adjacent to each spatial grid at an edge of the first area; and a fourth determining subunit, configured to use, as a spatial grid identifier set corresponding to the current store identifier, a spatial grid identifier set of each adjacent spatial grid and each spatial grid in the first area.
In some embodiments, the selecting unit includes: the judging subunit is used for sequentially judging whether the service range of each store in the first target store identification set covers the position coordinates requested by the user; a fifth determining subunit, configured to use, as a second target store identifier set, a set of identifiers of stores whose service range covers the location coordinates requested by the user; and the selecting subunit is used for selecting at least one target store identifier from the second target store identifier set according to the service requirement and feeding back a selection result to the user.
A third aspect of the present specification provides an electronic device, comprising: the system comprises a memory and a processor, wherein the processor and the memory are in communication connection, the memory stores computer instructions, and the processor realizes the steps of the method in any one of the first aspect by executing the computer instructions.
According to the business service method and device provided by the specification, the store identifier sets corresponding to the space grid identifiers are determined in advance, the identifiers of the target space grids corresponding to the position coordinates of the user request can be directly determined when the business service request of the user is processed, the first target store identifier set corresponding to the target space grid identifiers is further obtained, the identifiers of at least one target store are selected from the first target store identifier set, and the selection result is fed back to the user. On the one hand, compared with the data storage method in the existing business service mode, the data stored for business processing service access in the scheme is a store identifier set corresponding to the space grid identifier, and the data can be uniformly stored on each server node in the storage server cluster, so that the problems of a hot spot server and a large KEY are not easy to occur. On the other hand, the scheme can continuously scan the service range data of the store from the persistent mysql database through the timing task, establish the corresponding relation between the space grid identification and the store identification set, and write the cache service in batches when the service is not in a service peak, so that the response speed of the service peak to the user request is improved, and the user experience is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments described in the present application, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of a business service system provided in the present specification;
FIG. 2 is a flow chart of a business service method provided in the present specification;
FIG. 3 is a schematic diagram of determining a store identifier set corresponding to each spatial grid identifier;
FIG. 4 is a flow chart of a method of determining a set of spatial grid identifications corresponding to a store identification, respectively;
FIG. 5 is a schematic diagram of a method for determining a set of spatial grid identifications corresponding to a store identification, respectively;
FIG. 6 is a flowchart of another method for determining a set of spatial grid identifications corresponding to a store identification, respectively;
FIG. 7 is a schematic diagram of another method for determining a set of spatial grid identifications corresponding to a store identification, respectively;
FIG. 8 is a schematic diagram of a method for updating a set of spatial grid identifiers respectively corresponding to store identifiers;
FIG. 9 is a schematic diagram of a business service device provided in the present specification;
fig. 10 shows a schematic diagram of an electronic device provided in the present specification.
Detailed Description
In order to make the technical solutions in the present application better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only some embodiments of the present application, but not all embodiments. All other embodiments, based on the embodiments herein, which would be apparent to one of ordinary skill in the art without undue burden are intended to be within the scope of the present application.
The data acquisition, storage, use, processing and the like in the technical scheme meet the relevant regulations of national laws and regulations.
The present specification provides a business service system, as shown in fig. 1, including a storage server cluster and a business processing server.
The business processing server is used for receiving a business service request of a user, wherein the business service request carries the position coordinates of the user request; determining the identification of a target space grid corresponding to the position coordinate requested by the user, acquiring a first target store identification set corresponding to the target space grid identification from the storage server cluster, selecting the identification of at least one target store from the first target store identification set, and feeding back the selection result to the user.
As shown in fig. 2, the business service method provided in the present specification includes the following steps:
s01: and receiving a business service request of a user, wherein the business service request carries the position coordinates of the user request.
S02: and determining the identification of the target space grid corresponding to the position coordinates requested by the user.
S03: and acquiring a first target store identifier set corresponding to the target space grid identifier.
S04: and selecting at least one target store identifier from the first target store identifier set, and feeding back a selection result to a user.
The term "traffic" as used in this specification refers to a target service traffic. For example, the "service" may be a car rental service provided by an online car rental service platform. The online car renting service platform is a platform which is based on the Internet, takes a car as a carrier, provides online car renting service for users by means of the Internet of things, cloud computing and big data technology, and can provide car renting users for online stores on one hand and car use convenience for the users in various car demand scenes on the other hand. Under the condition that a user needs to rent a car at a site A, the user can send a business service request to a business processing server of an online car renting service platform, wherein the business service request carries a request position: and the online renting service platform determines a plurality of shops which are near the site A and meet the requirements of the user according to the pre-stored position information of the offline shops, and feeds back the shop information to the user. After the user selects one of the stores and determines a rental order, the selected store delivers the vehicle to site a, and the user goes to site a to pick up the vehicle and completes the delivery of the rental order. Similarly, the user can also determine a car returning place B through the online car renting service platform, send the car to the place B, and return the car to a car renting shop to complete the car returning work of the car renting order. In addition to the online car renting service, the service described in the specification can also be an express delivery service, a nearby food recommendation service and the like.
In the present specification, "user-requested location coordinates" refers to coordinates of a location where a user requests an offline store to provide a service. In some cases, the "user requested location coordinates" may or may not be consistent with the current location coordinates of the user sending the service request.
The "position coordinates" may be represented by latitude and longitude, or may be represented by administrative division, street, or other means.
The storage server cluster is used for storing a store identification set corresponding to the space grid identification. The term "storage server cluster" as used herein refers to a plurality of storage server nodes that cooperate to store data. Each storage server node comprises a main storage server and a standby storage server, and the main storage server and the standby storage server are in a backup relationship.
The earth surface space is divided into a plurality of spatial grids. The spatial grid may be regular or irregular in shape.
For example, uber developed an H3 hierarchical index system that uses equal sized hexagons to tile the earth's surface, H3 constructing its hexagonal mesh on an icosahedron (a shape with 20 triangular faces and 12 vertices), where each hexagonal mesh is a spatial mesh. That is, the geographic area of the earth's surface is divided into a plurality of cellular grid areas, each having a spatial grid identification. For any one geographic coordinate, the identity of its corresponding cellular grid may be determined.
For another example, the spatial grid may be determined based on administrative divisions, streets, and the like. For example, the district or county level city under each district level city may be regarded as a spatial grid.
The size design of the space grid should be set individually according to city size and store density, so that the store list is scattered relatively uniformly on the corresponding space grid. In the scheme, the service range of the store can be set to be larger than the union area of at least two space grid areas.
A store refers to an off-line location that provides a target service. The geographic location of the store is unchanged over a longer period of time, and therefore the locations of the store stored in the storage server of the service platform become less frequent. In the storage server, each store is represented by a store identifier.
In this scheme, the service range of the store corresponding to each store identifier in the store identifier set covers the corresponding space grid region. Therefore, after the spatial grid corresponding to the position coordinate requested by the user is determined, the store identification set corresponding to the identification of the spatial grid can be searched, and the service range of the store corresponding to each store identification in the store identification set covers the position coordinate requested by the user.
However, it should be noted that although there is a technique of determining a spatial grid on the surface of the earth, the prior art does not relate the identification of the spatial grid to the identification of a store. The shape of the spatial grid is generally different from the shape of the service area of a store, and there is no existing method for processing the cellular grid in relation to the method developed by Uber, which can conveniently determine the cellular grid covered by the service area of a store. Therefore, associating the identification of the spatial grid with the identification of the store is a technical difficulty of the present solution, and is also an important point of the technical idea.
The present specification provides a method of determining a set of store identifications corresponding to each spatial grid identification of a respective region. The method can be executed by a service server or a storage server cluster, or can be executed by other devices outside the service server or the storage server cluster. As shown in fig. 3, the method includes:
s11: a set of spatial grids of a current region, a set of service ranges of stores within the current region, and a set of spatial grids of the current region are obtained from a storage server.
The "storage server" here is for storing information of each store. In some cases, a "storage server" may be part of a "storage server cluster". In other cases, a "storage server" may be a "storage server cluster" or may be different. For example, the storage server may be a persistent mysql database, while the storage server cluster is a REDIS cache server cluster.
The above-described "region" may be a region division manner generally employed in the prior art in dividing store position data to be stored. By way of example in the background, the above-mentioned region may be Shanghai city, suzhou city, qinghai province, etc. For example, the method shown in fig. 3 may determine a plurality of space grid areas corresponding to the service ranges of each store in the Shanghai city, so as to determine a space grid identifier set corresponding to each store identifier, and then determine a store identifier set corresponding to each space grid identifier in the Shanghai city according to the space grid identifier set corresponding to each store identifier. Similarly, the method described in the steps S11 to S13 may be used to determine a store identifier set corresponding to the identifier of each space grid in the su-state city, and the method described in the steps S11 to S13 may be used to determine a store identifier set corresponding to the identifier of each space grid in the Qinghai province.
It should be noted that the method shown in fig. 3 relates to a region, because the definition of "region" is only because the prior art generally stores information such as a service range of a store in units of regions, and each time information is acquired from a storage server, information of each store in "one region" is acquired at least. In some embodiments, the "region" in the method shown in fig. 3 may also be a union region of all regions obtained by dividing in the prior art, that is, a set of service ranges of all stores in all regions is obtained at one time. In this case, a store identifier set to which the identifier of each spatial grid corresponds is determined without distinction.
S12: and determining a plurality of space grid areas corresponding to the service range of each store respectively, thereby determining a space grid identification set corresponding to each store identification.
As shown in fig. 4, in some embodiments, step S12 includes the following steps S121 to S124.
S121: determining a first area formed by each space grid intersected with the service range of the current store; wherein, the intersection of a space grid with the service range of the current store means that the area exceeding the predetermined proportion in the space grid is located in the service range of the current store.
For example, in fig. 5, a rectangular area represents a service area (also referred to as an electronic fence) defined by one store, all cell grid areas intersecting the rectangular area can be calculated by a processing method for cell grids developed by Uber, and a union area of the cell grid areas is taken as a first area. The area surrounded by the curve indicated by X in fig. 5 is the first area.
In the method of processing the cellular grid developed by Uber, the cellular grid intersecting with one area means that a predetermined proportion (for example, 50%) or more of the area of the cellular grid is covered by the area. If a smaller proportion of the area of a cellular grid is covered by the area, then the cellular grid is considered to be unwanted from the area; if a majority of the area of a cellular grid is covered by the region, although some of the area of the cellular grid is not covered by the region, then the cellular grid is also considered to intersect the region. Thus, in fig. 5, although the partial area of the cellular grid indicated by M is covered by the rectangular area, the cellular grid intersecting with the rectangular area obtained by the intersection algorithm of the cellular grid does not include the cellular grid indicated by M; although the partial area of the cellular grid indicated by N is not covered by the rectangular area, the cellular grid intersected with the rectangular area obtained by the intersecting algorithm of the cellular grid also comprises the cellular grid indicated by N. It follows that the "spatial grid intersecting with the service area of the store" obtained by the existing intersection algorithm alone is inaccurate.
S122: and acquiring a second region formed after the first region extends outwards by a preset distance.
S123: an identified target set of spatial grids intersecting the second region is determined.
S124: and taking the target set as a space grid identification set corresponding to the current store identification.
In order to solve the problem that the 'space grid intersected with the service range of a store' obtained through the existing intersection algorithm is inaccurate, the scheme provides that a second area is formed by extending a preset distance outwards in a first area, and a set of identifications of the space grid intersected with the second area is used as a set of space grid identifications corresponding to the store identifications.
The "predetermined distance" extending outward in step S122 may be a distance of one side length of the spatial grid, or a distance of one radius of the spatial grid. The predetermined distance may also be a distance greater than one side and less than one radius.
As shown in fig. 5, the area surrounded by the curve indicated by Y after the first area extends outwards by a predetermined distance is the second area. The cellular grid intersecting the second region can include the cellular grid indicated by M in fig. 5.
The union area of each spatial grid area in the spatial grid identification set determined in the steps S121 to S124 is not smaller than the service range of the store, so that the store is not missed when each store of the target spatial grid is covered by the service range, that is, each store of the target spatial grid is covered by the service range can be more accurately determined, and further, the store which can provide service for the user is not missed when the user request is processed.
The method described in steps S121 to S124 determines that the set of spatial grid identifications may have spatial grids that are not actually covered by the store service area.
As shown in fig. 6, in other embodiments, step S12 includes the following steps S125 to S127.
S125: determining a first area formed by each space grid intersected with the service range of the current store; wherein, the intersection of a space grid with the service range of the current store means that the area exceeding the predetermined proportion in the space grid is located in the service range of the current store.
For example, in fig. 7, a rectangular area represents a service area (also referred to as an electronic fence) defined by one store, all cell grid areas intersecting the rectangular area can be calculated by a processing method for cell grids developed by Uber, and a union area of the cell grid areas is taken as a first area. The area surrounded by the curve indicated by X in fig. 7 is the first area.
In the method of processing the cellular grid developed by Uber, the cellular grid intersecting with one area means that a predetermined proportion (for example, 50%) or more of the area of the cellular grid is covered by the area. If a smaller proportion of the area of a cellular grid is covered by the area, then the cellular grid is considered to be unwanted from the area; if a majority of the area of a cellular grid is covered by the region, although some of the area of the cellular grid is not covered by the region, then the cellular grid is also considered to intersect the region. Thus, in fig. 7, although the partial area of the cellular grid indicated by M is covered by the rectangular area, the cellular grid intersecting with the rectangular area obtained by the intersecting algorithm of the cellular grid does not include the cellular grid indicated by M; although the partial area of the cellular grid indicated by N is not covered by the rectangular area, the cellular grid intersected with the rectangular area obtained by the intersecting algorithm of the cellular grid also comprises the cellular grid indicated by N. It follows that the "spatial grid intersecting with the service area of the store" obtained by the existing intersection algorithm alone is inaccurate.
S126: an adjacent spatial grid adjacent to each spatial grid at the edge of the first region is acquired.
S127: and taking the space grid identification sets of each adjacent space grid and each space grid in the first area as the space grid identification set corresponding to the current store identification.
As shown in fig. 7, the spatial grid of the mark 1 is a spatial grid of the edge of the first region, and the adjacent spatial grids 2, 3, 4, 5, 6, 7, etc. adjacent to the spatial grid 1 can be determined. For each space grid at the edge of the first area, adjacent space grids are determined in this way, and the space grid identification sets of all adjacent space grids of all edge space grids are used as the space grid identification sets corresponding to the current store identifications. In performing step S127, the spatial grid needs to be deduplicated.
Although the set of spatial grid identifications corresponding to the determined current store identification by the above method is larger than the method described in the above steps S121 to S124, this defect can be remedied by processing the actual business, although there are more spatial grids that are not covered by the store service area.
The method described in steps S125 to S127 may also be the same as the method described in steps S121 to S124 in that the union area of each space grid area in the determined space grid identification set is not smaller than the service range of the store, so that when each store of the target space grid is covered by the service range is determined, the store is not missed, that is, each store of the target space grid is covered by the service range can be determined more accurately, and further when the user request is processed, the store that can provide the service for the user is not missed.
Because the shapes of the space grids and the shapes of the service ranges of the stores are generally different, the determined space grid identification set corresponding to one store identification is inaccurate, the space grid identification set may have an identification of a space grid whose service range cannot be covered by the store, and thus, part or all of the space grid cannot be covered by the service range of part of the store in the determined space grid identification set corresponding to the store.
For example, the store identifier set corresponding to the space grid identifier W1 includes S3, but the service range of the store S3 only covers a part of the space grid identifier W1, and the position coordinate requested by the user is just located in another part of the space grid, that is, the service range of the store S3 is not covered. The following may also be the case: the store identifier set corresponding to the spatial grid representation W1 includes S4, but the service range of the store S4 does not cover any portion of the spatial grid W1 at all.
To solve the above problems, the present specification provides a remedy. After determining the first target store identification set, the service server can sequentially judge whether the service range of each store in the first target store set covers the position coordinates requested by the user; taking an identification set of stores with a service range covering the position coordinates requested by the user as a second target store identification set; and selecting at least one target store identifier from the second target store identifier set according to the service requirement, and feeding back a selection result to the user. That is, the business server may further screen the store whose service range covers the location coordinates requested by the user from the first target store identification, and combine the further screening result with the business requirement to determine the store content fed back to the user.
The above-mentioned "service requirement" refers to a service policy of the target service. For example, in a rental car service scenario, the business requirement may be any one or more of the following: recommending the store for the user according to the lowest cost of the vehicle, recommending the store for the user according to the closest target of the position coordinates which are requested by the user, and recommending the store for the user according to the store evaluation.
S13: and determining a store identification set corresponding to each space grid identification according to the space grid identification set corresponding to each store identification.
For example, the spatial grid identifications corresponding to the store identification S1 are W1, W2, and W3, the spatial grid identifications corresponding to the store identification S2 are W2, W3, and W4, and the spatial grid identifications corresponding to the store identification S3 are W3, W4, and W5. Then, it can be determined that the store identifier corresponding to the space grid W1 is S1, the store identifiers corresponding to the space grid W2 are S1 and S2, the store identifiers corresponding to the space grid W3 are S1, S2 and S3, the store identifier corresponding to the space grid W4 is S2 and S3, and the store identifier corresponding to the space grid W5 is S3.
In the storage server cluster, the store identification sets corresponding to the space grid identifications are uniformly stored on storage server nodes in the storage server cluster.
For example, all the space grid identifications respectively calculate HASH codes, and store a store identification set corresponding to the space grid identifications on a storage server node corresponding to the calculated HASH.
The business service system provided by the specification is used for presetting a store identifier set corresponding to each space grid identifier, directly determining the identifier of the target space grid corresponding to the position coordinate of the user request when the business service request of the user is processed, further obtaining a first target store identifier set corresponding to the target space grid identifier, selecting the identifier of at least one target store from the first target store identifier set, and feeding back the selection result to the user. On the one hand, compared with the data storage method in the existing business service mode, the data stored for business processing service access in the scheme is a store identifier set corresponding to the space grid identifier, and the data can be uniformly stored on each server node in the storage server cluster, so that the problems of a hot spot server and a large KEY are not easy to occur. On the other hand, the scheme can continuously scan the service range data of the store from the persistent mysql database through the timing task, establish the corresponding relation between the space grid identification and the store identification set, and write the cache service in batches when the service is not in a service peak, so that the response speed of the service peak to the user request is improved, and the user experience is improved.
The scheme adopts a cache preheating mode, a business service system updates cache data at regular time, monitors store service range change events, and updates a store identifier set corresponding to a space grid identifier; even in a high concurrency scene, after a user sends a service request, the search range of the store can be quickly determined and reduced to a first target store identification set, and a target store is selected from the first target store identification set with smaller data volume based on service requirements and fed back to the user; in a high concurrency scene, when all user requests are processed, all server nodes in the storage server cluster are uniformly accessed, different user requests are sent to corresponding different space grids, the number of REDIS KEY access requests is relatively uniform, and the occurrence probability of hot spot servers is reduced.
One specific embodiment of the scheme can be as follows: when a user requests commodity quotation of a nearby store car model, the system firstly carries out H3 coding calculation based on the longitude and latitude address of the user car, determines which spatial grid the requested geographic position falls on, and then accesses REDIS cache service to accurately inquire a store set bound with the corresponding spatial grid through the cloud service system.
In some embodiments, as shown in fig. 8, the method further comprises:
S71: and monitoring whether the set of the space grids of each region and the set of the service ranges of each store in each region stored in the storage server are updated or not.
Whether there is an update to the "set of spatial grids for each region" includes at least one of: whether the region has increased, decreased or renamed, whether the spatial grid has increased, decreased or renamed, whether the "set of service areas for each store within each region" has an update includes at least one of: whether the region has increased, decreased or renamed, whether the number of stores has increased, decreased or renamed, and whether the service area of the store has changed.
S72: in the event of an update, the target region with the update is determined.
S73: redetermining a store identifier set corresponding to each spatial grid identifier of the target region by: acquiring a set of space grids of a target area and a set of service ranges of stores in the target area from a storage server; determining a plurality of space grid areas corresponding to the service ranges of each store respectively, so as to determine a space grid identification set corresponding to each store identification respectively; and determining a store identification set corresponding to each space grid identification according to the space grid identification set corresponding to each store identification.
Steps S72 and S73 are to redetermine the store identifier set corresponding to each space grid identifier if there is an update.
The steps S71 to S73 monitor whether the set of the spatial grids of each region and the set of the service ranges of each store in each region stored in the storage server are updated, and timely redetermine the store identifier set corresponding to each spatial grid identifier of the target region according to the updated content if the set of the service ranges of each store in each region is updated, so that the store identifier set corresponding to each spatial grid identifier is always accurate, and the information fed back to the user is ensured to be more accurate and have no hysteresis; according to the collection of the space grids of each region and the collection of the service ranges of the stores in each region, the store identification collection corresponding to each space grid identification is obtained through preprocessing, so that service requests can be processed directly according to preprocessing results, a service server does not need to frequently request the collection of the space grids of each region and the collection of the service ranges of the stores in each region stored in a storage server, the data return amount is reduced, the data amount during service request processing is reduced, the service request processing efficiency is improved, and therefore the service requests can be responded quickly under a high concurrency scene; in a high concurrency scene, when all user requests are processed, all server nodes in the storage server cluster are uniformly accessed, different user requests are sent to corresponding different space grids, the number of REDIS KEY access requests is relatively uniform, and the occurrence probability of hot spot servers is reduced.
In some embodiments, a collection of spatial grids for a region is stored in the storage server using a data structure; and/or a set of service areas of stores within a region is stored in the storage server using a data structure.
The data structure herein refers to an abstract data structure, not an actual memory space. A data structure may be a key-value pair, an array, etc. For example, a set of spatial grids in an Shanghai region may be stored as < Shanghai, [ G1, G2 … Gn ] >, where Shanghai is a key, [ G1, G2 … Gn ] is a set of spatial grids, gn identifies an nth grid identification.
The collection of the space grids of a region is stored by adopting a data structure, so that the space grids can be managed conveniently; the service range set of each store in a region is stored by adopting a data structure, so that the management of the store can be facilitated. Therefore, in the storage server, a set of spatial grids of one region and a set of service ranges of each store in one region are generally stored by using one data structure.
The present disclosure provides a business service device, which may be used to implement the above-mentioned determination and storage operations of the store identifier sets corresponding to the spatial grid identifiers. As shown in fig. 9, the apparatus includes a receiving unit 10, a first determining unit 20, a selecting unit 30, and a storing unit 40.
The receiving unit 10 is configured to receive a service request of a user, where the service request carries a location coordinate of the user request.
The first determining unit 20 is configured to determine an identifier of a target space grid corresponding to the location coordinate requested by the user, and obtain a first target store identifier set corresponding to the target space grid identifier from a storage server cluster.
The selecting unit 30 is configured to select at least one target store identifier from the first target store identifier set, and feed back a selection result to the user.
The storage unit 40 is configured to store, on each storage server node in the storage server cluster, a respective store identifier set corresponding to a spatial grid identifier of each spatial grid of the earth surface space in a balanced manner.
In some embodiments, the apparatus further comprises: an acquisition unit, a first determination unit, and a second determination unit.
The acquisition unit is used for acquiring a set of space grids of the current region and a set of service ranges of stores in the current region from the storage server.
The first determining unit is used for determining a plurality of space grid areas corresponding to the service range of each store respectively, so as to determine a space grid identification set corresponding to each store identification respectively.
The second determining unit is used for determining a store identifier set corresponding to each space grid identifier according to the space grid identifier set corresponding to each store identifier.
In some embodiments, the apparatus further comprises a listening unit, a third determination unit, and a fourth determination unit.
The monitoring unit is used for monitoring whether the set of the space grids of each region and the set of the service ranges of each store in each region stored in the storage server are updated or not.
The third determination unit is used for determining the target area with the update in the case of the update.
The fourth determining unit is configured to redetermine a store identifier set corresponding to each spatial grid identifier of the target area by: acquiring a set of space grids of a target area and a set of service ranges of stores in the target area from a storage server; determining a plurality of space grid areas corresponding to the service ranges of each store respectively, so as to determine a space grid identification set corresponding to each store identification respectively; and determining a store identification set corresponding to each space grid identification according to the space grid identification set corresponding to each store identification.
In some embodiments, the first determining unit comprises:
A first determination subunit configured to determine a first area formed by each spatial grid intersecting with a service range of a current store; wherein, the intersection of a space grid and the service range of the current store means that the area exceeding the preset proportion in the space grid is positioned in the service range of the current store;
the first acquisition subunit is used for acquiring a second area formed after the first area extends outwards by a preset distance;
a first determining subunit configured to determine an identified target set for each spatial grid intersecting the second region;
and the second determining subunit is used for taking the target set as a space grid identification set corresponding to the current store identification.
In some embodiments, the first determining unit comprises:
a third determining subunit, configured to determine a first area formed by each spatial grid intersecting with a service range of the current store; wherein, the intersection of a space grid and the service range of the current store means that the area exceeding the preset proportion in the space grid is positioned in the service range of the current store;
a second acquisition subunit, configured to acquire adjacent spatial grids adjacent to each spatial grid at an edge of the first area;
And a fourth determining subunit, configured to use, as a spatial grid identifier set corresponding to the current store identifier, a spatial grid identifier set of each adjacent spatial grid and each spatial grid in the first area.
In some embodiments, the selecting unit includes:
the judging subunit is used for sequentially judging whether the service range of each store in the first target store identification set covers the position coordinates requested by the user;
a fifth determining subunit, configured to use, as a second target store identifier set, a set of identifiers of stores whose service range covers the location coordinates requested by the user;
and the selecting subunit is used for selecting at least one target store identifier from the second target store identifier set according to the service requirement and feeding back a selection result to the user.
The description and the functions of the above devices can be understood by referring to the content of the business service system part, and are not repeated.
The embodiment of the invention also provides the electronic equipment which can be used as a service processing server. As shown in fig. 10, the electronic device may include a processor 1001 and a memory 1002, where the processor 1001 and the memory 1002 may be connected by a bus or otherwise, as exemplified by a bus connection in fig. 10.
The processor 1001 may be a central processing unit (Central Processing Unit, CPU). The processor 1001 may also be a chip such as other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or a combination thereof.
The memory 1002 is used as a non-transitory computer readable storage medium, and may be used to store a non-transitory software program, a non-transitory computer executable program, and modules, such as program instructions/modules (e.g., the receiving unit 10, the first determining unit 20, the selecting unit 30, and the storage unit 40 in fig. 9) corresponding to the service method in the embodiment of the present invention. The processor 1001 executes various functional applications of the processor and data processing, i.e., implements the business service method in the above-described method embodiment, by running non-transitory software programs, instructions, and modules stored in the memory 1002.
Memory 1002 may include a storage program area that may store an operating system, at least one application program required for functionality, and a storage data area; the storage data area may store data created by the processor 1001, and the like. In addition, the memory 1002 may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, memory 1002 may optionally include memory located remotely from processor 1001, such remote memory being connectable to processor 1001 through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The one or more modules are stored in the memory 1002 that, when executed by the processor 1001, perform the business service methods described previously.
The specific details of the electronic device may be correspondingly understood by referring to the corresponding related descriptions and effects in the method embodiment, which are not repeated herein.
The present specification also provides a computer storage medium storing computer program instructions which, when executed, implement the steps of the business service method described above.
The present specification also provides a computer program product comprising a computer program which, when executed by a processor, implements the steps of the business service method described above.
It will be appreciated by those skilled in the art that implementing all or part of the above-described embodiment method may be implemented by a computer program to instruct related hardware, where the program may be stored in a computer readable storage medium, and the program may include the above-described embodiment method when executed. Wherein the storage medium may be a magnetic Disk, an optical Disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a Flash Memory (Flash Memory), a Hard Disk (HDD), or a Solid State Drive (SSD); the storage medium may also comprise a combination of memories of the kind described above.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are referred to each other, and each embodiment is mainly described as different from other embodiments.
The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function.
For convenience of description, the above devices are described as being functionally divided into various units, respectively. Of course, the functions of each element may be implemented in one or more software and/or hardware elements when implemented in the present application.
From the above description of embodiments, it will be apparent to those skilled in the art that the present application may be implemented in software plus a necessary general purpose hardware platform. Based on such understanding, the technical solutions of the present application may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the methods of some parts of the embodiments of the present application.
The subject application is operational with numerous general purpose or special purpose computer system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The application may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
Although the present application has been described by way of embodiments, those of ordinary skill in the art will recognize that there are many variations and modifications of the present application without departing from the spirit of the present application, and it is intended that the appended claims encompass such variations and modifications without departing from the spirit of the present application.
Claims (10)
1. A business service method, comprising:
receiving a business service request of a user, wherein the business service request carries position coordinates of the user request;
determining the identification of a target space grid corresponding to the position coordinates requested by the user;
acquiring a first target store identifier set corresponding to the target space grid identifier;
selecting at least one target store identifier from the first target store identifier set, and feeding back a selection result to a user;
the earth surface space is divided into a plurality of space grids, and each store identification set corresponding to each space grid identification is uniformly stored on each storage server node in the storage server cluster.
2. The method of claim 1, wherein the plurality of spatial grids are hexagons of equal size.
3. The method of claim 1, wherein the storage server cluster is a cluster of cache servers.
4. The method of claim 1, wherein the set of store identifications corresponding to each spatial grid identification of each region is determined by:
acquiring a set of space grids of a current region and a set of service ranges of stores in the current region from a storage server;
Determining a plurality of space grid areas corresponding to the service ranges of each store respectively, so as to determine a space grid identification set corresponding to each store identification respectively;
and determining a store identification set corresponding to each space grid identification according to the space grid identification set corresponding to each store identification.
5. The method according to claim 4, wherein the method further comprises:
monitoring whether the set of the space grids of each region and the set of the service ranges of each store in each region stored in the storage server are updated or not;
in the case of an update, determining a target area with the update;
redetermining a store identifier set corresponding to each spatial grid identifier of the target region by: acquiring a set of space grids of a target area and a set of service ranges of stores in the target area from a storage server; determining a plurality of space grid areas corresponding to the service ranges of each store respectively, so as to determine a space grid identification set corresponding to each store identification respectively; and determining a store identification set corresponding to each space grid identification according to the space grid identification set corresponding to each store identification.
6. The method of claim 5, wherein a set of spatial grids for a region is stored in the storage server using a data structure; and/or a set of service areas of stores within a region is stored in the storage server using a data structure.
7. The method of claim 4, wherein determining a plurality of spatial grid regions corresponding to the service area of each store, thereby determining a set of spatial grid identifiers corresponding to each store identifier, respectively, comprises:
determining a first area formed by each space grid intersected with the service range of the current store; wherein, the intersection of a space grid and the service range of the current store means that the area exceeding the preset proportion in the space grid is positioned in the service range of the current store;
acquiring a second area formed after the first area extends outwards by a preset distance;
determining an identified target set for each spatial grid intersecting the second region;
and taking the target set as a space grid identification set corresponding to the current store identification.
8. The method of claim 4, wherein determining a plurality of spatial grid regions corresponding to the service area of each store, thereby determining a set of spatial grid identifiers corresponding to each store identifier, respectively, comprises:
Determining a first area formed by each space grid intersected with the service range of the current store; wherein, the intersection of a space grid and the service range of the current store means that the area exceeding the preset proportion in the space grid is positioned in the service range of the current store;
acquiring adjacent space grids adjacent to each space grid at the edge of the first area;
and taking the space grid identification sets of each adjacent space grid and each space grid in the first area as the space grid identification set corresponding to the current store identification.
9. The method of claim 1, wherein selecting at least one target store identifier from the first set of target store identifiers and feeding back the selection to the user comprises:
sequentially judging whether the service range of each store in the first target store identification set covers the position coordinates requested by the user;
taking an identification set of stores with a service range covering the position coordinates requested by the user as a second target store identification set;
and selecting at least one target store identifier from the second target store identifier set according to the service requirement, and feeding back a selection result to the user.
10. A business service apparatus, comprising:
the receiving unit is used for receiving a business service request of a user, wherein the business service request carries the position coordinates of the user request;
the first determining unit is used for determining the identification of the target space grid corresponding to the position coordinate requested by the user, and acquiring a first target store identification set corresponding to the target space grid identification from a storage server cluster;
the selecting unit is used for selecting at least one target store identifier from the first target store identifier set and feeding back a selection result to a user;
and the storage unit is used for uniformly storing each store identification set corresponding to each space grid identification of each space grid of the earth surface space on each storage server node in the storage server cluster.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311361918.4A CN117573707A (en) | 2023-10-19 | 2023-10-19 | Business service method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311361918.4A CN117573707A (en) | 2023-10-19 | 2023-10-19 | Business service method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117573707A true CN117573707A (en) | 2024-02-20 |
Family
ID=89863286
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311361918.4A Pending CN117573707A (en) | 2023-10-19 | 2023-10-19 | Business service method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117573707A (en) |
-
2023
- 2023-10-19 CN CN202311361918.4A patent/CN117573707A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110399441B (en) | Mass point data aggregation rendering method, device, equipment and storage medium | |
| US7392247B2 (en) | Method and apparatus for fusing context data | |
| US9241240B2 (en) | Techniques for server-controlled tiling of location-based information | |
| CN107026881B (en) | Method, device and system for processing service data | |
| CN111859187B (en) | POI query method, device, equipment and medium based on distributed graph database | |
| CN109815419B (en) | Interest point indexing method, device, medium and electronic equipment based on geographic position | |
| CN107092623B (en) | Interest point query method and device | |
| CN105512320A (en) | User ranking obtaining method and device and server | |
| CN105893565A (en) | Method and device for establishing a three-dimensional map database and transmitting three-dimensional map data | |
| CN111861296A (en) | Piece collecting task allocation method and device, piece collecting system, equipment and medium | |
| CN111813875B (en) | Map point location information processing method, device and server | |
| CN105975627A (en) | Room choosing method and device | |
| CN104301354B (en) | A kind of method and system of the spatial class business datum GISization service based on cloud computing | |
| CN111680210B (en) | Information searching method, device, searching gateway and storage medium | |
| US10007677B1 (en) | System and method for geospatial indexing | |
| CN114048280B (en) | Vector slice processing method, device, server and storage medium | |
| CN102831169B (en) | Plane figure relation determining method and system in geographical information system | |
| CN116049576A (en) | Aggregation display method and device for map data and electronic equipment | |
| CN104461736A (en) | Resource allocation and search method and system and cloud server | |
| CN114064829A (en) | Method and device for carrying out aggregation display on positioning points and electronic equipment | |
| CN113656527A (en) | Map resource processing method and device, computer equipment and storage medium | |
| US20210311971A1 (en) | Geocoding methods and systems of correcting latitude and longitude of a point of interest | |
| CN117573707A (en) | Business service method and device | |
| CN116595025A (en) | Dynamic updating method, terminal and medium of vector tile | |
| CN112035760B (en) | Task allocation method and computer equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |