JP2007087340A - Point exchange route search method and point exchange route search program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To present a more appropriate point exchange route in exchanging points by utilizing a plurality of point service. <P>SOLUTION: A management computer 21 specifies points (second points) used in the point service of a target store, and acquires remaining points (the number of the first points) of a user. Then, an exchange route from the points held by the user to the points (the second points) of the target store is searched for by using store data 231 and exchange ratio data 232 in an exchange ratio data storage part 23. The number of the exchange points (an exchange value) of the target store after the exchange is calculated on every exchange route, and the exchange route by which the number of the exchange points becomes maximum is specified. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a point exchange route search method and a point exchange route search program for searching for an exchange route when exchanging points provided in a plurality of point services.

  For the purpose of encouraging customers to purchase, etc., a point service that gives points at the time of sale of a product and can use this point at the time of subsequent purchase of the product is often used in stores and the like. Such a point service is often provided by a store or a company group in many cases, and a plurality of point services coexist at present. Usually, the acquired point of a specific store cannot be used in the point service of another store. On the other hand, by exchanging points between point services of different stores, the acquired points may be exchanged for points of another store.

Various techniques have been developed for such point exchange (see, for example, Patent Document 1). In this patent document 1, it is possible to determine alliance / non-affiliation flexibly and quickly without fixing all the participating companies that can exchange points, and without changing the exchange rate at the time of point exchange. A technique for enabling the exchange rate to be determined flexibly and quickly according to information is disclosed.
Japanese Patent Laying-Open No. 2004-280760 (pages 7-12)

  However, there is a limitation on the point exchange between point services of different stores, and there are cases where the points that are held cannot be directly exchanged for points of the store's point service desired by the customer. In addition, there may be a plurality of exchange routes when exchanging points for a point service of a desired store. In this case, since the exchange rate between the point services is uniquely set by the mutual relationship, the number of points finally obtained may differ depending on the selected exchange route.

  A specific example will be described with reference to FIG. As shown in FIG. 5, it is assumed that the point of the store “A” is exchanged for the point of the store “E”. In this example, it is not possible to exchange directly from the point of the store “A” to the point of the store “E”. Instead, from the “A” → “B” → “E” exchange route and the “A” → “C” → “E” exchange route from the store “A” point to the store “E” point. Exchanges can be made. Here, the point exchange rate of “A” → “B” is doubled, the point exchange rate of “B” → “E” is tripled, the point exchange rate of “A” → “C” is equivalent, “C” → The point exchange rate for “E” is 5 times. Here, when the point exchange is performed using the point number “100” of the store “A”, the exchange route “A” → “B” → “E” becomes “600”. On the other hand, in this case, the exchange route “A” → “C” → “E” is “500”. In this way, even when the points of the store “A” are exchanged for the points of the store “E”, if the exchange route is different, the final number of exchange points (the number of points of the store “E” after the point exchange) ) Will be different. For this reason, depending on the selection of the exchange route, there are cases where the points owned cannot be used effectively.

The present invention has been made to solve the above-described problem, and an object of the present invention is to provide a point exchange route for presenting a more appropriate point exchange route when performing point exchange using a plurality of point services. The object is to provide a search method and a point exchange route search program.

  In order to solve the above problem, the invention according to claim 1 uses a point exchange route search server comprising an exchange rate data storage means for recording a point exchange rate between different point services and a management computer. A point exchange route search method for searching for an exchange route to be used when exchanging points from the first point to the second point, wherein the management computer exchanges with the first point to be exchanged. A point specifying step for specifying a second point, and an exchange route from the first point to the second point are searched using the exchange rate data storage means, and from the first point to the second point for each exchange route. The exchange route search stage that calculates the exchange value of the exchange route and the exchange value for each exchange route is compared, and the maximum exchange route that calculates the maximum conversion value is calculated. And summarized in that to perform the replacement route specific stage of the constant.

  In the point exchange route search method according to claim 1, the point exchange route search server is a product in which the point exchange route search server records a product identifier and a sales price associated with each other at a store providing a point service. Sales data storage means, and the management computer specifies a target product desired to be purchased and obtains a product identifier of the target product, and uses the product sales data storage means, A product information acquisition stage for specifying a merchandise store is further executed, and in the point identification stage, the point used in the point service of each merchant is used as the second point for each merchandise shop handling the target product. In the exchange route search stage and the exchange route identification stage, the maximum exchange route is determined for each handling store. The management computer uses the product sales data storage means to specify the sales price for each store handling the target product, and the maximum conversion value at the second point used in each store. A purchase route specifying step of calculating a payment amount when using the credit card and identifying a handling store that minimizes the payment amount and a maximum exchange route of the second point used in the point service of the handling store. The gist is to do it.

  According to a third aspect of the present invention, in the point exchange route search method according to the second aspect, in the purchase route specifying step, when the product can be purchased using only the second number of points, the purchase of the target product is performed. The gist is to calculate the number of remaining points obtained by subtracting the first point used for the exchange to the second point necessary for each store, and to identify the exchange route that maximizes the number of remaining points.

  According to a fourth aspect of the present invention, there is provided a point exchange route search server comprising an exchange rate data storage means for recording a point exchange rate between different point services, and a management computer. A point exchange route search program for searching for an exchange route to be used when exchanging points to a point, wherein the management computer identifies a first point that is an exchange target and a second point that is an exchange purpose And an exchange route search for searching an exchange route from the first point to the second point using the exchange rate data storage means and calculating an exchange value from the first point to the second point for each exchange route The exchange route specification that compares the converted value for each exchange route and specifies the maximum exchange route that calculates the maximum conversion value And summarized in that to function as a step.

The invention according to claim 5 is the point exchange route search program according to claim 4, wherein the point exchange route search server records the product identifier and the sales price that are recorded in association with the store that provides the point service. Further comprising sales data storage means, the management computer using the product sales data storage means for specifying the target product desired to be purchased and acquiring the product identifier of the target product, Product information acquisition means for specifying a merchandise handling store is further functioned, and in the point identifying means, the point used in the point service of each handling merchant is set as the second point for each handling merchandise for the target product. In the exchange route searching means and the exchange route specifying means, the most suitable for each handling store. The exchange route is specified, the management computer uses the product sales data storage means to specify the sales price for each store handling the target product, and the maximum conversion at the second point used at each store. As a purchase route specifying means for calculating the payment amount when the value is used and specifying the handling store that minimizes this payment amount and the maximum exchange route of the second point used in the point service of this handling store The gist is to further function.

  According to a sixth aspect of the present invention, in the point exchange route search program according to the fifth aspect, when the purchase route specifying means can purchase the product using only the second number of points, the purchase of the target product is performed. The point is to calculate the number of remaining points obtained by subtracting the first point used for the exchange to the second point necessary for each store, and to function as a means for specifying an exchange route that maximizes the number of remaining points. To do.

(Function)
According to the first or fourth aspect of the invention, the management computer searches the exchange route from the first point to the second point using the exchange rate data storage means, and the first point to the second point for each exchange route. The exchange value for is calculated. Then, the management computer compares the converted values for each exchange route, and specifies the maximum exchange route for calculating the maximum converted value. Thereby, in the 2nd point, the exchange route which can use the 1st point effectively can be searched efficiently.

  According to the invention described in claim 2 or 5, the management computer specifies the maximum exchange route for each handling store, with the point used at each handling store of the target product as the second point. Next, the sales price is specified for each handling store of the target product, and the payment amount when the maximum converted value is used at the second point used in each handling store is calculated. And the handling store which makes this payment amount the minimum, and the maximum exchange route of the 2nd point currently used by the point service of this handling store are specified. Thereby, the exchange point which can acquire the target goods with the minimum payment amount can be specified by effectively utilizing the first point.

  According to the invention described in claim 3 or 6, when the management computer can purchase the product using only the second point number, the management computer is used to exchange the second point necessary for purchasing the target product. The number of remaining points obtained by subtracting the first point is calculated for each handling store. Then, an exchange route that maximizes the number of remaining points is specified. Accordingly, the target product can be acquired by effectively using the first point, and the number of remaining points can be maximized.

  According to the present invention, when exchanging points using a plurality of point services, a more appropriate point exchange route can be presented.

(First embodiment)
Hereinafter, a first embodiment of the present invention will be described with reference to FIGS. In the present embodiment, a point exchange route search method and a point exchange route search program used when a user's points are exchanged for points of a target store will be described.

In this embodiment, as shown in FIG. 1, a user terminal 30 and a point exchange route search server 20 connected via a network 40 such as the Internet are used.
The user terminal 30 is a computer terminal used when a user makes a point exchange request. The user terminal 30 includes control means (CPU) (not shown), storage means (RAM, ROM, hard disk, etc.), input means (keyboard, pointing device, etc.), output means (display, etc.), communication means, and the like.

  On the other hand, the point exchange route search server 20 is a computer system that searches for point exchange routes, and includes a management computer 21. This management computer 21 has a CPU, RAM, ROM, communication means, etc. (not shown), and will be described later for a point exchange search service (a process including a point specifying stage, an exchange route searching stage, an exchange route specifying stage, etc. )I do. By executing the point exchange route search program for that purpose, the management computer 21 functions as point specifying means, exchange route searching means, exchange route specifying means, and the like.

The point specifying means specifies a first point that is an exchange target and a second point that is an exchange purpose.
The exchange route search means searches for an exchange route from the first point to the second point using the exchange rate data storage means, and calculates an exchange value from the first point to the second point for each exchange route.

The exchange route specifying means compares the converted values for each exchange route, and specifies the maximum exchange route for calculating the maximum converted value.
The management computer 21 is connected to a user data storage unit 22 and an exchange rate data storage unit 23 as an exchange rate data storage unit.

  User data 220 is recorded in the user data storage unit 22 for each user ID and store identifier. This user data 220 is set when member registration for the point service of each store is performed. The user data 220 includes data relating to a user ID, a store identifier, and the number of possessed points.

  In the user ID data area, data relating to the user ID as an identifier for identifying the user is recorded. By using this user ID, a password recorded in association with this user ID can be obtained from a user authentication data storage unit (not shown). This password is used when performing user authentication.

In the store identifier data area, data relating to a store identifier of a store that provides a point service of points owned by the user is recorded.
In the possessed point number data area, data relating to the number of points possessed by the user for the point service provided by the store is recorded.

  In the exchange rate data storage unit 23, store data 231 relating to a store providing a point service and exchange rate data 232 relating to a point exchange rate are recorded. The store data 231 is set when a store providing a point service is registered. The store data 231 includes data relating to a store identifier for specifying a store that can exchange points.

  The exchange rate data 232 is set when a point exchange contract is determined between the point exchange source store and the exchange destination store and a point exchange contract is made. The exchange rate data 232 includes data relating to an exchange source store identifier, an exchange destination store identifier, and an exchange rate.

In the exchange source store data identifier area and the exchange destination shop data identifier area, data relating to identifiers for specifying the point exchange source shop and the exchange destination shop are recorded, respectively.
In the exchange rate data area, data relating to the exchange rate from the point of the exchange source store to the point of the exchange destination store is recorded.

Next, a processing procedure in the case where the user's possession points are exchanged for the target store points using the system as described above will be described with reference to FIG.
First, the user accesses the point exchange route search server 20 using the user terminal 30. Then, the user ID and password are transmitted to the point exchange route search server 20. The management computer 21 of the point exchange route search server 20 performs user authentication by comparing the user ID and password recorded in the user authentication data storage unit with the received user ID and password. And when authenticated, the exchange route search process shown in FIG. 2 is performed.

  Here, first, the management computer 21 executes a process for specifying a target store as a point exchange destination (step S1-1). Specifically, the management computer 21 transmits point exchange destination selection screen data for causing the user terminal 30 to select a target store as a point exchange destination. The user selects a target store as a point exchange destination on the point exchange selection screen displayed on the display of the user terminal 30. Then, the user terminal 30 transmits data related to the point exchange destination target store to the point exchange route search server 20 based on the user input. Based on this data, the management computer 21 specifies a target store as a point exchange destination, and specifies a point used in the point service of this target store as a target point (second point).

  Next, the management computer 21 acquires the user's point balance as the number of retained points (first number of points) to be exchanged (step S1-2). Specifically, the management computer 21 extracts the user data 220 from the user data storage unit 22 based on the user ID authenticated by the user, and determines the store identifier and the number of points owned by the user. get.

  Then, the management computer 21 searches for an exchange route from the point held by the user (first point) to the point of the target store (second point) (step S1-3). Here, an exchange route is generated using all registered stores. This exchange route is configured by combining exchange paths between one or more shops. Specifically, all the store data 231 is extracted from the exchange rate data storage unit 23 and the extracted stores are combined to calculate a possible exchange route from the possession point to the target point. In each exchange route, the point service provided by each store is used at most once. For example, as store data 231, five stores “A”, “B”, “C”, “D”, and “E” are recorded, and points of store “A” owned by the user (A point) ) Are exchanged for points (E points) of the store “E” which is the target store, as shown in FIG. 3, 16 routes are calculated.

Then, the management computer 21 calculates the number of exchange points (exchange value from the first point to the second point) for each exchange route (step S1-4). Specifically, for the searched exchange route, a conversion value (number of exchange points) at the target store is calculated using the exchange rate of the exchange rate data 232. For example, in the case of the exchange route R5 of FIG. 3, point exchange is sequentially performed on a plurality of exchange paths (“A” → “B”, “B” → “C”, “C” → “E”). Here, first, “A” → “B” is exchanged, and the number of exchange points at the store “B” is calculated. Specifically, the exchange rate data 232 in which the store identifier of the store “A” is set as the exchange source store identifier and the store identifier of the store “B” is set as the exchange destination store identifier is extracted, and the exchange rate data 232 is exchanged. Using the rate, the number of exchange points is calculated. Then store "B
"B" → "C" point exchange for the number of points at "C", and point exchange of "C" → "E" for the number of points at store "C" in order, finally the target store The number of exchange points for the store “E” is acquired. In this way, the number of exchange points of the target store (here, the number of points at the E point) is calculated for each exchange route. Then, the management computer 21 records the calculated number of exchange points in association with each exchange route in a predetermined memory.

  There are cases where points cannot be exchanged between specific stores, or point exchange is allowed only in one direction. For such a store combination, the exchange rate data 232 including the corresponding exchange source store identifier and exchange destination store identifier is not recorded in the exchange rate data storage unit 23. When the generated exchange route includes a path that is not allowed to be exchanged, a non-exchangeable flag is recorded in association with such an exchange route in a predetermined memory. For example, if the exchange rate data 232 of the exchange destination store “D” is not recorded for the exchange source store “B”, point exchange of “B” → “D” is not permitted. For this reason, point exchange cannot be performed on the exchange routes (R6, R12, R13) including the exchange path “B” → “D” among the exchange routes shown in FIG. Therefore, the management computer 21 records a non-exchangeable flag in association with these exchange routes in a predetermined memory.

In this way, the management computer 21 records the number of exchange points or the non-exchangeable flag in association with each other for all exchange routes.
Then, the management computer 21 specifies an exchange route for calculating the maximum number of exchange points (step S1-5). Specifically, the number of exchange points recorded in a predetermined memory is compared to identify the maximum number of exchange points, and the exchange route recorded in association with the number of exchange points is identified.

  Then, the management computer 21 provides the user terminal 30 with information relating to an exchange route for exchanging points from the points held by the user (first point) to the points of the target store (second point) (step S1). -6). For example, when the maximum number of exchange points is reached in the exchange route R5, the management computer 21 displays a screen related to the exchange route (“A” → “B”, “B” → “C”, “C” → “E”). Data is transmitted to the user terminal 30.

As described above, according to the present embodiment, the following effects can be obtained.
(1) In the above embodiment, the management computer 21 specifies the points (second points) used in the point service of the target store, and acquires the user's point balance (first point number). Then, the exchange route from the point held by the user (first point) to the point of the target store (second point) is searched using the store data 231 and the exchange rate data 232 in the exchange rate data storage unit 23. Then, the number of exchange points (exchange value) of the target store after the exchange is calculated for each exchange route. Then, the exchange route that maximizes the number of exchange points is specified. Thereby, it is possible to search for an exchange route that maximizes the number of points of the target store after the exchange. Accordingly, it is possible to effectively use the points owned by the user and exchange points for the points of the target store.

(Second Embodiment)
Hereinafter, a second embodiment of the present invention will be described with reference to FIG. In the present embodiment, a point exchange route search method and a point exchange route search program for searching for a point exchange route in the case of using a point held by a user for use in purchasing a target product will be described. In the present embodiment, points (first points) possessed by the user are used when purchasing the target product. By exchanging the possessed points for points (second points) in the point service of the merchant handling the target product, the point exchange route with the lowest user payment amount is searched.

  In the present embodiment, processing described later (processing including a point identification stage, an exchange route search stage, an exchange route identification stage, a target product identification stage, a product information acquisition stage, a purchase route identification stage, etc.) is performed. By executing the point exchange route search program for that purpose, the management computer 21 functions as point specifying means, exchange route searching means, exchange route specifying means, target product specifying means, product information obtaining means, purchase route specifying means, and the like. .

  Each of the point specifying unit, the exchange route searching unit, and the exchange route specifying unit has the same function as that of the first embodiment. In particular, the point specifying means specifies a first point that is an exchange target and a second point that is an exchange purpose. The exchange route searching means and the exchange route specifying means specify the maximum exchange route for each handling store.

The target product specifying means specifies a target product desired to be purchased, and acquires a product identifier of the target product.
The merchandise information acquisition means uses the merchandise sales data storage means to acquire information relating to the handling merchandise of the target merchandise and the sales price at each handling merchant.

  The purchase route specifying means specifies a selling price for each store handling the target product, and calculates a payment amount when the maximum converted value is used at the second point used in each store. And the maximum exchange route of the 2nd point used in the handling store which makes this payment amount the minimum, and the point service of this handling store is specified.

In this embodiment, the management computer 21 of the point exchange route search server 20 is further connected to a product price data storage unit (not shown) as product sales data storage means.
The product price data storage unit stores sales price data for each product sold at each store. This sales price data is recorded based on the registration of products handled at each store. When the sales price of the product is changed, the sales price data is updated accordingly. When the sales are stopped, the sales price data is deleted. The sales price data includes data relating to a store identifier, a product identifier, and a sales price.

In the store identifier data area, data relating to a store identifier for specifying a store selling this product is recorded.
In the product identifier data area, data relating to an identifier for specifying a product is recorded for the product handled in the store.

In the sales price data area, data relating to the sales price of the product in this store is recorded.
Also in the present embodiment, the management computer 21 is connected to the user data storage unit 22 and the exchange rate data storage unit 23. Further, in the store data 231 recorded in the exchange rate data storage unit 23, data on the cash conversion rate of points in the point service of each store is recorded for each store identifier.

  Next, the points exchange route that minimizes the amount of payment when using points for purchase of products by exchanging points held by the user for points of the target product store using the system as described above A processing procedure in the case of searching for will be described with reference to FIG.

First, the user uses the user terminal 30 to access the point exchange route search server 20 using the user ID and password. The management computer 21 of the point exchange route search server 20 performs user authentication by comparing the user ID and password recorded in the user authentication data storage unit with the received user ID and password. If authenticated, the following processing is performed.

  As shown in FIG. 4, first, the management computer 21 specifies a target product (step S2-1). Specifically, the management computer 21 transmits a product selection screen for selecting a product to the user terminal 30. The user selects a product on the product selection screen displayed on the display of the user terminal 30. Then, the user terminal 30 transmits data related to the product identifier of the selected product to the point exchange route search server 20 based on the user input. The management computer 21 specifies the target product based on this data.

  And a user's point balance is acquired as a point number (1st point number) used as exchange object (Step S2-2). Specifically, the management computer 21 extracts the user data 220 from the user data storage unit 22 based on the user ID, and acquires the number of possessed points. In the present embodiment, description will be made assuming that each user uses a point service of one store.

  Next, the management computer 21 specifies a store handling the target product and its selling price (step S2-3). Specifically, the management computer 21 searches the product price data storage unit with the product identifier of the selected target product, and extracts the store identifier and the sales price. Here, the point used in the point service of the handling store specified by the extracted store identifier is set as the second point.

  Next, the management computer 21 searches for an exchange route from the point (first point) held by the user to the second point (step S2-4). When a plurality of handling stores are specified for the target product, this exchange route search is executed for each handling store. Here, the route search from the point (first point) possessed by the user to the point (second point) of the store handling the target product is the same as the process of step S1-3 in the first embodiment. Done.

  Then, the management computer 21 calculates the number of exchange points (exchange value from the first point to the second point) for each exchange route for all the handling stores of the target product (step S2-5). Specifically, the same processing as that in step S1-4 in the first embodiment is performed. That is, using the exchange rate of the exchange rate data 232, the number of exchange points is calculated for the searched exchange route. Then, the calculated number of exchange points is recorded in association with the exchange route.

When the exchange rate data 232 including the corresponding exchange source store identifier and exchange destination store identifier is not recorded, an exchange impossible flag is recorded in association with the corresponding exchange route.
Then, the management computer 21 calculates a payment amount for each handling store (step S2-6). Specifically, the management computer 21 specifies a point exchange route that maximizes the number of exchange points for each handling store. Then, the management computer 21 calculates the payment amount when purchasing the target product using the number of exchange points. That is, the amount of money obtained by converting the maximum number of exchange points using the cash conversion rate for each store is calculated. Further, the amount of payment is calculated by subtracting this amount from the sales price at each store. Then, the management computer 21 records the calculated payment amount in a predetermined memory in association with the exchange route and store identifier for which the payment amount was calculated.

Next, the management computer 21 specifies a store for calculating the minimum amount and an exchange route (step S2-7). Specifically, the management computer 21 specifies the lowest payment amount calculated, and specifies the store identifier and exchange route associated with the lowest payment amount.

  Then, the management computer 21 provides the specified exchange route to the user terminal 30 (step S2-8). Thereby, it is possible to grasp a store where the target product can be purchased with the minimum payment amount.

As described above, according to the present embodiment, in addition to the effect (1) of the first embodiment, the following effects can be obtained.
In the above embodiment, the management computer 21 first identifies the target product, and uses the product price data storage unit to identify the store handling the target product and the sales price of the target product at each store. And about the 2nd point currently used in the store which handles the target goods, the exchange route from a user's possession point (1st point) is searched. Then, the second point number after the exchange is calculated for each exchange route, and the exchange route for calculating the maximum second point number is specified. Then, the payment amount is calculated using the maximum second point number calculated for each handling store and the selling price of each handling store. Then, a dealer that minimizes the payment amount is specified. Thereby, the handling store which can acquire target goods with the minimum payment amount using a user's possession point can be grasped.

In addition, you may change the said embodiment into the following aspects.
-In the second embodiment, when the second point exchanged from the user's possession point (first point) is used with the point used in the point service of the store handling the target product as the second point Identified dealers and point exchange routes that minimize payments. If the product can be acquired with only the second point, the first point is exchanged as much as the second number of points necessary for acquiring the product, and the number of remaining points of the first point after the point exchange is maximized As such, the handling store and the exchange route may be specified. Specifically, if the value obtained by converting the number of second points after exchange is higher than the sale price of the product, the corresponding store and exchange route will be exchanged for the second point necessary for obtaining the product. The number of remaining points of the first points that are not used is calculated. Specifically, first, using the cash conversion rate, the number of first points necessary for the exchange to the second point corresponding to the selling price of the product is calculated. Then, the number of remaining points of the first point after the point exchange is calculated by subtracting the first number of points from the number of possessed points. And the handling store and exchange route which maximize the number of remaining points of the 1st point after exchange are specified. As a result, when the product can be acquired with only the second point, only the necessary number of points can be exchanged for the second point, and the handling store and the exchange route that maximize the remaining first point number can be selected. The user can efficiently acquire the target product.

In the second embodiment described above, it is assumed that when a product is purchased using points, the point of one point service held by the user is exchanged for the point of a store handling the target product. did. Instead of this, the point exchange route search method of the present invention may be used when the user has a plurality of types of point service points. In this case, the point exchange route is searched and the number of exchange points is calculated for each point of the plurality of point services held by the user when the point is exchanged for the point of the store handling the target product. And about the point of each point service which a user holds, the exchange route and exchange point number in which the number of exchange points becomes the maximum are specified for every handling store. Then, the cash conversion amount is calculated by summing up the number of exchange points when the exchange route that maximizes the number of exchange points is used for each point service point. By subtracting this amount from the sales price of the product, the amount of payment at each store is calculated. Then, the calculated payment amount is compared, and the store with the lowest payment amount and the exchange route are specified. Thereby, even when the user holds points of a plurality of different point services, the user can efficiently purchase the target product using these points.

  In the first and second embodiments, the user data storage unit 22 is provided in the point exchange route search server 20, and user data 220 including the number of points owned by the user is recorded. Alternatively, the number of points owned by the user may be recorded on a recording medium owned by the user. For example, the user ID, the store identifier, and the number of possessed points are recorded on the IC card. The point exchange route search server may read the IC card information using an IC card reader / writer. In this case, the number of possessed points may be recorded on the IC card in association with a plurality of store identifiers. Accordingly, the present invention can be realized without centrally managing user data by the point exchange route search server 20.

  In the first and second embodiments, the management computer 21 provides the specified exchange route to the user terminal 30. In addition to this, the management computer 21 may execute point exchange using the specified exchange route. Thereby, the user can acquire the target point promptly.

  In the first and second embodiments, after the exchange route is created for all stores using the store data 231, the second point number is calculated using the exchange rate data 232. Instead, an exchange route may be created using only the exchange rate data 232. Specifically, a point exchange route is created by sequentially arranging store identifiers using the exchange source store identifier and exchange destination store identifier of the exchange rate data 232. Thereby, when there are few possible exchange routes with respect to a store participating in the point exchange route search service, it is possible to search for possible exchange routes more efficiently.

  In the second embodiment, the present invention is applied to the case where points are used when purchasing a product. However, the present invention is not limited to this, and any point can be used if points are used instead of cash. It is also applicable to such cases.

  In the first and second embodiments, the management computer 21 acquires the user's point balance as the number of points to be exchanged (first point number) (step S1-2). In this case, when a plurality of pieces of user data 220 are extracted, a selection screen for a store to be exchanged may be transmitted to the user terminal 30 to allow the user to select a store to be exchanged. Further, the user may be allowed to exchange only a part of the number of possessed points, and the user may be allowed to select the number of points to be exchanged.

1 is a schematic diagram of a system according to a first embodiment of the present invention. Explanatory drawing of the process sequence of the 1st Embodiment of this invention. Explanatory drawing for demonstrating a point exchange route. Explanatory drawing of the process sequence of the 2nd Embodiment of this invention. Explanatory drawing for demonstrating the example of point exchange.

Explanation of symbols

  20 ... Point exchange route search server, 21 ... Management computer, 23 ... Exchange rate data storage unit as an exchange rate data storage unit.

Claims (6)

Used when exchanging points from the first point to the second point using a point exchange route search server provided with an exchange rate data storage means that records the point exchange rate between different point services and a management computer. A point exchange route search method for searching for an exchange route,
The management computer is
A point identification stage for identifying a first point to be exchanged and a second point to be exchanged;
An exchange route search step of searching for an exchange route from the first point to the second point using the exchange rate data storage means, and calculating an exchange value from the first point to the second point for each exchange route;
A point exchange route search method comprising: performing an exchange route specifying step of comparing a converted value for each exchange route and specifying a maximum exchange route for calculating a maximum converted value. The point exchange route search server further comprises a product sales data storage means for recording a product identifier and a sales price associated with the product that is sold at a store that provides the point service,
The management computer is
A target product identification stage in which the target product desired to be purchased is identified and the product identifier of the target product is obtained;
Using the product sales data storage means, further executing a product information acquisition step for specifying a store handling the target product,
In the point specifying stage, for each handling store of the target product, the point used in the point service of each handling store is specified as a second point,
In the exchange route search step and the exchange route identification step, the maximum exchange route is specified for each handling store,
The management computer is
Using the product sales data storage means, specify the sales price for each store handling the target product,
Calculate the payment amount when using the maximum converted value at the second point used at each store.
The purchase route specifying step of specifying the handling store that minimizes the payment amount and the maximum exchange route of the second point used in the point service of the handling store is further executed. The point exchange route search method described. The purchase route specifying step includes:
If the product can be purchased using only the second number of points, calculate the number of remaining points by subtracting the first point used to exchange for the second point necessary for the purchase of the target product for each store.
The point exchange route search method according to claim 2, wherein an exchange route that maximizes the number of remaining points is specified. Used when exchanging points from the first point to the second point using a point exchange route search server provided with an exchange rate data storage means that records the point exchange rate between different point services and a management computer. A point exchange route search program for searching for an exchange route,
The management computer,
Point specifying means for specifying the first point to be exchanged and the second point to be exchanged;
An exchange route search means for searching for an exchange route from the first point to the second point using the exchange rate data storage means and calculating an exchange value from the first point to the second point for each exchange route;
A point exchange route search program that functions as an exchange route specifying means for comparing a converted value for each exchange route and specifying a maximum exchange route for calculating a maximum converted value. The point exchange route search server further comprises a product sales data storage means for recording a product identifier and a sales price associated with the product that is sold at a store that provides the point service,
The management computer,
A target product identification means for identifying a target product to be purchased and obtaining a product identifier of the target product;
Using the product sales data storage means, further function product information acquisition means for specifying a store handling the target product,
In the point specifying means, for each handling store of the target product, the point used in the point service of each handling store is specified as a second point,
In the exchange route search means and the exchange route specification means, the maximum exchange route is specified for each handling store,
The management computer,
Using the product sales data storage means, specify the sales price for each store handling the target product,
Calculate the payment amount when using the maximum converted value at the second point used at each store.
5. The apparatus according to claim 4, further comprising a purchase route specifying means for specifying a handling store that minimizes the payment amount and a maximum exchange route of the second point used in the point service of the handling store. The listed point exchange route search program. The purchase route specifying means is:
If the product can be purchased using only the second number of points, calculate the number of remaining points by subtracting the first point used to exchange for the second point necessary for the purchase of the target product for each store.
6. The point exchange route search program according to claim 5, wherein the point exchange route search program functions as means for specifying an exchange route that maximizes the number of remaining points.

Images