JP2019101640A - Information managing device, information managing method, and program - Google Patents

Abstract

To present a shop considered to be suitable for a user from the viewpoint of turn waiting.SOLUTION: An information managing device includes: first storage means for storing first data indicating a glossary and a shop name related to the glossary; second storage means for storing second data indicating the shop name and the details of a turn waiting-related service which is provided to a user by a shop indicated by the shop name; third storage means for storing third data for defining the details of the service and the point corresponding thereto; searching means for, upon receiving a search request including a prescribed search word from a user terminal, searching for shops satisfying the search request on the basis of the first data; calculation means for calculating the point of the turn waiting-related service which is provided to the user by the shop, on the basis of the second data and the third data; and display processing means for causing the user terminal to display the shops retrieved by the searching, in the descending order of the calculated points.SELECTED DRAWING: Figure 7

Description

  The present invention relates to an information management apparatus, an information management method, and a program.

  Generally, a user who uses a restaurant or the like often searches for a store that he / she wants to visit under a desired condition, and searches for a store that is suitable for him / her.

  In recent years, a system has been developed which can present, to such a user, a store having a high evaluation of the provided food among the stores meeting the conditions desired by the user. (E.g., Patent Document 1).

JP 2017-134491

  However, in the above system, a store with high evaluation of the provided food, that is, a store where waiting for a queue is likely to occur, is presented to the user, so we would like to utilize the gap time from one business to the next It is inconvenient for the user.

  The present invention has been made in view of the above circumstances, and it is an object of the present invention to provide an information management device, an information management method, and a program capable of presenting a store considered to be suitable for a user from the viewpoint of waiting for order.

  According to one aspect of the present invention, the information management apparatus is communicably connected to the user terminal used by the user. The information management apparatus includes: a first storage unit storing first data indicating a vocabulary and a shop name related to the vocabulary; the shop name; and a shop indicated by the shop name to the user Second storage means for storing second data indicating the content of the service related to the provided waiting, and third storage means for storing third data in which the content of the service and the score for the service are defined. A search unit for searching for a store that satisfies the search request based on the first data when receiving a search request including a predetermined search word from the user terminal; Calculation means for calculating the score for the service based on the second data and the third data, and a table for displaying the searched shops on the user terminal in the descending order of the calculated score Comprising a processing unit.

  According to the present invention, it is possible to present, to a user, a store that seems to be suitable for the user from the viewpoint of waiting for a turn.

FIG. 1 is a diagram showing an example of a schematic configuration of an information management system according to an embodiment. The block diagram which shows an example of the hardware constitutions of the server apparatus which concerns on the embodiment. The figure which shows an example of the data structure of the reference data at the time of search concerning the embodiment. FIG. 8 is another view showing an example of the data structure of reference data at the time of search according to the embodiment; The figure which shows an example of the data structure of the shop data which concern on the same embodiment. The figure which shows an example of the data structure of the score table which concerns on the embodiment. The block diagram showing an example of the main functional composition of the server apparatus concerning the embodiment. The flowchart which shows an example of operation | movement of the server apparatus which concerns on the embodiment. The figure which shows an example of the search screen which concerns on the embodiment. The figure which shows an example of the search result screen which concerns on the embodiment. The other figure which shows an example of the data structure of the shop data which concern on the same embodiment. The other flowchart which shows an example of operation | movement of the server apparatus which concerns on the same embodiment. The other figure which shows an example of the search screen which concerns on the same embodiment. The other figure which shows an example of the search result screen which concerns on the same embodiment.

  Hereinafter, embodiments will be described with reference to the drawings.

  In the present embodiment, a user (user) refers to a user who has registered user information in advance in the server device 10 (information management device) described later.

  Moreover, in this embodiment, a shop (facility) shall refer to the shop in which the shop terminal 30 mentioned later is installed. In the present embodiment, it is assumed that the store is a restaurant, but the store type is not particularly limited.

  FIG. 1 shows a schematic configuration example of an information management system (network system) according to an embodiment. The information management system is a system that manages the congestion status of various stores and manages the order of queue (queue) that occurs when the stores are full. In addition, the information management system is a system that searches for stores that match the conditions desired by the user among various stores, and provides the search results to the user. As shown in FIG. 1, the information management system includes a server device 10, a user terminal 20, a shop terminal 30, and the like.

  The server device 10 communicates with the user terminal 20 and the shop terminal 30 via the network N by the application installed in the server device 10. The server device 10 manages the queue waiting that occurs in the store where the store terminal 30 is installed.

  Here, the type of waiting for order managed by the server device 10 will be described. In the present embodiment, it is assumed that the server device 10 can manage at least three types of queued calls.

  One is waiting for the order to be performed using the shop terminal 30 (hereinafter referred to as “waiting for the shop order”). When waiting for the store order, the user can go to the store and operate the store terminal 30 when the store is fully occupied, so that the user can line up at the end of the queue waiting for the order.

  The other is waiting for the order to be performed using the user terminal 20. There are two types of order waiting performed using the user terminal 20, and one is a waiting order that does not specify the scheduled entrance time to enter the store (hereinafter referred to as "portable order waiting") . In the case of waiting for mobile order, the user can line up at the tail end of the queue for queue by operating the user terminal 20 when the store is full without having to go to the store. According to this, the user can join the queue before going to the store, instead of joining the queue after going to the store, so the waiting time at the store can be reduced. .

  Another queue waiting performed using the user terminal 20 is queue waiting (hereinafter referred to as “waiting for the future queue”) for specifying a scheduled arrival time for entering the store. In the case of waiting for the turn in the future, the user can wait for the turn for which the scheduled entrance time is specified by operating the user terminal 20 when the store is full, without having to go to the store. According to this, since the user does not join the waiting queue at the time of operating the user terminal 20, it is sufficient to go to the store at the designated entry scheduled time, further reducing the waiting time at the store Can.

  In addition, the waiting to be performed by operating the user terminal 20 is a waiting to be performed by only the user who has registered the user information in the server device 10 in advance.

  The server device 10 searches for a store that matches the conditions desired by the user according to the request from the user terminal 20, in addition to the management of the above-mentioned waiting for order, and also executes generation of screen data indicating the search result . The generated screen data is transmitted to the user terminal 20.

  The user terminal 20 is an information processing apparatus used by a user, and is, for example, a smartphone, a tablet terminal, a personal computer (PC), a feature phone, or the like. The user terminal 20 is communicably connected to the server device 10. The user terminal 20 can receive screen data generated by the server device 10 using an application or a browser installed in advance, and can display a screen indicated by the screen data on the display of the user terminal 20.

  The user can transmit various requests to the server device 10 by performing a predetermined operation on the screen displayed on the display of the user terminal 20. For example, the user can search for a desired store based on the store name and the place (area) in which the store is located, and can wait for the desired store searched.

  The store terminal 30 is a terminal installed in a store capable of waiting for a turn. The store terminal 30 is installed, for example, in the vicinity of the entrance (storefront) of a store, and is mainly used by a user (customer) who visits the store. As described above, when the store is fully occupied when the user visits the store, the user can wait for the turn at the store by operating the store terminal 30.

  Although FIG. 1 illustrates a case where one user terminal 20 is communicably connected to the server device 10 for convenience, a large number of user terminals 20 are communicably connected to the server device 10. It may be done. Similarly, FIG. 1 illustrates the case where one shop terminal 30 is communicably connected to the server device 10, but a large number of shop terminals 30 are communicably connected to the server device 10. It is good.

  FIG. 2 shows an example of the hardware configuration of the server device 10 shown in FIG. As shown in FIG. 2, in the server device 10, a non-volatile memory 12, a central processing unit (CPU) 13, a main memory 14, a communication unit 15, and the like are connected to the bus 11. The non-volatile memory 12 and the main memory 14 constitute a storage device of the server device 10.

  The non-volatile memory 12 stores (stores), for example, an operating system (OS), various application programs, reference data for search Da, store data Db, and a score table T. The application program includes a program for managing waiting for a turn and a program for searching for a store desired by the user (hereinafter referred to as “store search program”).

  The CPU 13 is a processor that executes, for example, various application programs stored in the non-volatile memory 12. The CPU 13 also controls each part included in the server device 10.

  The main memory 14 is used, for example, as a work area required when the CPU 13 executes various application programs. The search reference data Da, the store data Db, and the score table T may be stored in the main memory 14 as well.

  Although only the non-volatile memory 12 and the main memory 14 are shown as storage devices included in the server device 10 in FIG. 2, the server device 10 may be a hard disk drive (HDD) or a solid state drive (SSD). And the like, and may further include other storage devices.

  The communication unit 15 connects the server device 10 to the network N by wire or wirelessly. The communication unit 15 controls transmission and reception of commands, addresses, data, signals, and the like with the user terminal 20 and the shop terminal 30 via the network N.

  FIG. 3 shows an example of the data structure of reference data Da at the time of search stored in the storage device of the server device 10.

  The search reference data Da is data to be referred to when searching for a store that matches the conditions desired by the user. Although details will be described later, the user inputs characters (hereinafter referred to as “search word”) as desired conditions in a search field on the screen displayed on the display of the user terminal 20, and the screen is displayed. By pressing the upper search button, it is possible to transmit a search request including the search word to the server device 10.

  As shown in FIG. 3, the search reference data Da includes at least a keyword and an output store name as items. The keyword indicates a vocabulary for matching with a search word included in the search request described above. The output store name indicates the store name that is output as a search result when the linked keyword is included in the search word described above.

  For example, according to the reference data for searching Da1 shown in FIG. 3, it is indicated that the keyword is "○○○" and the output store name is "○○○ ΔEkimae store". According to this, when the user of the user terminal 20 inputs “○○○” as a search word, it is understood that “○○○ ΔEkimae store” is output as a search result.

  Similarly, according to the reference data at search time Da2 shown in FIG. 3, it is indicated that the keyword is "round round" and the output store name is "○○ 駅 Ekimae store". According to this, even if "round" is input by the user to the user terminal 20, "○○ △ Ekimae store" is output as the search result, as in the reference data Da1 at the time of search It can be understood that

  Note that, as in the reference data for searching Da1 and Da2, although the wording of the vocabulary is different, the reference data for searching having the same output store name may be combined into one. In other words, even if reference data Da1 and Da2 at the time of search are single search reference data that includes "○○○" and "marumarumaru" as keywords and "○○○ Δ Ekimae store" as the output store name good.

  According to reference data Da3 at the time of search shown in FIG. 3, the keyword is "△ station", and the output store names are "○○ △ Δ station front store", "××× △ station front store" and "□□□□ station It is shown that it is a store in the middle. According to this, when the user of the user terminal 20 inputs “△ station” as the search word, “○○ ○ Δ Ekimae store”, “××× Δ Ekimae store”, and “X station store” are displayed as the search results. □□□ 駅 Store in the middle of the station is output.

  Although FIG. 3 exemplifies a case where one keyword item is included in the search reference data Da, the present invention is not limited to this, and a plurality of keyword items may be included in the search reference data. good. For example, as shown in FIG. 4, the reference data for searching Da ′ is a first word indicating a vocabulary related to the store name (eg, “○○○”, “×××”, “□□□”, etc.) A keyword and a second keyword indicating a vocabulary related to the place where the store is located (for example, “△ station” and the like, and a vocabulary related to the service content provided by the store (for example, if the store is a restaurant It is also possible to include a third keyword indicating “Japanese food”, “western food”, “stand-meal soba”, etc., and an output store name. According to this, it is possible to realize AND search and OR search using the first to third keywords.

  For example, when AND search is selected as a search method by the user of the user terminal 20, and when "○○○", "△ station" and "Japanese food" are input as search words, all the input search words are input. Only the "○○ △ Ekimae store" is output as the search result based on the reference data Da1 'at the time of search including.

  On the other hand, after the OR search is selected as the search method by the user of the user terminal 20 and the search word “○○○”, “△ station” and “Japanese food” are input, the input search word At the time of search including at least one reference data Da1 'to Da3', based on "○○ △ Ekimae store", "× △ 駅 Ekimae store", and "□□□ 駅 station store" as search results It is output.

  In addition, although the reference data for search time Da includes at least one keyword and the output store name as items here, the present invention is not limited to this, for example, to identify the store indicated by the output store name It may further include a unique identification code of. According to this, although details will be described later, it becomes possible to easily link the search reference data Da with the store data Db described later using the above-described identification code.

  FIG. 5 shows an example of the data structure of the store data Db stored in the storage device of the server device 10.

  The store data Db is data indicating the features of the store. As shown in FIG. 5, the store data Db includes at least the store name, the availability of waiting for the mobile order, the availability of displaying the waiting time, and the availability of waiting for the future order, as shown in FIG. The store name indicates the name of the store indicated by the store data.

  Whether or not the store indicated by the stringed store name can receive the queue waiting (the mobile queue waiting) to be performed without specifying the scheduled entrance time from the user terminal 20 (Yes or No) In other words, it indicates whether or not the store corresponds to waiting for mobile order. The display availability of the waiting time is an item that is required when the store indicated by the linked store name corresponds to the mobile order waiting, and the user who entered the mobile order waiting enters the store It indicates whether the waiting time until store can be presented (that is, whether the waiting time is displayed on the user terminal 20).

  Whether or not the store indicated by the linked store name can receive a queue waiting to be performed by designating a store entering scheduled time from the user terminal 20 (that is, a queue for the future queue) can be received , Indicates whether the store corresponds to waiting for the future).

  For example, according to the store data Db1 shown in FIG. 5, the store name is "○○ 駅 Ekimae store", and the acceptance or non-acceptance of the mobile order waiting is "possible (that is, corresponding to the mobile order waiting)" It is indicated that the display availability of the time is "OK" and the acceptance availability of the waiting for the future waiting is "No (that is, it does not correspond to the waiting for the future waiting)". The same applies to the other shop data Db2 and Db3 shown in FIG. 5, and thus detailed description thereof is omitted here.

  Here, the store data Db includes the various items described above as items, but items other than the store name include items corresponding to the points to be added included in the score table T described later. . That is, items other than the store name included in the store data Db are determined in accordance with the points to be added included in the score table T.

  Further, the item of the store name included in the store data Db may be replaced with the above-described identification code. That is, when the store data Db has the data structure shown in FIG. 5 and the search reference data Da has the data structure shown in FIG. 3, the store data Db and the search reference data Da are tied by the store name. Although the identification code described above is included in each of the data Da and Db, it is possible to associate the store data Db with the reference data for retrieval at the time of the identification code.

  In the present embodiment, for convenience, reference data Da at the time of search and store data Db are linked as separate data, but reference data Da at the time of search and store data Db are collectively one data. It may be.

  FIG. 6 shows an example of the data structure of the score table T stored in the storage device of the server device 10.

  The score table T is a table that defines points for calculating a score to be used at the time of rearrangement processing described later. As shown in FIG. 6, the score table T at least includes, as items, points to be added and points to be added thereto. The points to be added indicate events (acts) necessary to obtain the tied points, and, for example, the contents of services provided by the store to the user correspond to this. According to the score table T shown in FIG. 6, at the time of the above score calculation, “five points” are given to the stores “supporting waiting for mobile order” and “corresponding to the display of waiting time” It can be seen that "3 points" are given to existing stores, and "1 point" is given to stores that are "ready for waiting in the future".

  In addition, although the event related to "waiting for turn" is included as an example of the service that the store provides to the user in the item for adding points here, the item for adding points relates to the wait for order Things other than events may be included. For example, "Providing coupons to users", "Takeout support", "All you can drink & drink bar", "All you can eat", "Support for credit card", "Children's seat", "Ozari" , "Possible to smoke", "With lunch sales", "With sales after 22:00", etc. may be included as points to be added. In addition to the contents of the service provided by the store to the user, for example, "a predetermined number or more of images (posted images) for introducing the store to a web page that can be browsed by the user", "There is a predetermined number or more of reviews showing the store's reputation on the Web page", "Post an image showing the appearance of the store on the Web page", "Post a URL that can access the store's home page on the Web page", "Pay the notice from the store on the Web page", "Put the menu on the Web page", "Put the access method to the store on the Web page", "It is relatively easy to enter the store on the Web page" The time (target time) is posted, "posting the price per user on the Web page", and "posting the number of seats on the Web page" are included as points to be added. It may be.

  FIG. 7 shows a main functional configuration of the server device 10 realized by the CPU 13 of the server device 10 executing the above-described shop search program. The store search program can be distributed by storing it in a computer readable storage medium in advance. Also, this program may be downloaded to the server device 10 via the network N, for example.

  As shown in FIG. 7, the server device 10 includes an input unit 101, a search unit 102, a calculation unit 103, a rearrangement unit 104, a display processing unit 105, and the like. In the storage device constituted by the non-volatile memory 12 and the main memory 14, the above-described search reference data Da, the store data Db and the score table T are stored.

  In the present embodiment, the units 101 to 105 are described as being realized by the CPU 13 executing the store search program (that is, software), but the present invention is not limited to this. Or a combination of software and hardware.

  The input unit 101 receives a search request from the user terminal 20 via the communication unit 15. The received search request is transferred to the search unit 102.

  When receiving the search request transferred from the input unit 101, the search unit 102 executes a search process based on the search word included in the search request. Specifically, the search unit 102 reads from the storage device reference data Da at the time of search including the search word as a keyword, and the read reference data Da at the time of search (or included in the reference data Da at the time of read) The information indicating the output store name to be output is transmitted to the calculation unit 103.

  When receiving the search reference data Da transmitted from the search unit 102, the calculation unit 103 reads out from the storage device store data Db including the output store name included in the search reference data Da as a store name. The calculation unit 103 calculates, for each of the read shop data Db, a score to be used at the time of rearranging processing described later, based on the read shop data Db and the score table T stored in the storage device. The calculated score is linked to the store data Db and transmitted to the sorting unit 104.

  Upon receiving the store data Db transmitted from the calculation unit 103, the sorting unit 104 executes sorting processing to rearrange the store data Db in accordance with the score associated with the store data Db. Specifically, the sorting unit 104 sorts the shop data Db in the descending order of the tied scores.

  The display processing unit 105 generates screen data to be displayed by the user terminal 20 based on the result of the rearrangement process by the rearrangement unit 104. The generated screen data is transmitted to the user terminal 20 via the communication unit 15.

  Here, the processing procedure of the server apparatus 10 until the screen data of the screen 202 shown in FIG. 10 is generated will be described with reference to the flowchart of FIG. 8 and the screen examples of FIG. 9 and FIG. Here, it is assumed that the storage device of the server device 10 stores in advance reference data Da at the time of search shown in FIG. 3, store data Db shown in FIG. 5, and a score table T shown in FIG. Do.

  In addition, although the case where a score is calculated when a search is performed by a user is demonstrated below, it is not limited to this, Before a search is performed by a user (for example, once daily) beforehand It is also possible to calculate and rearrange shop data Db described later using the result.

  First, a user operating the user terminal 20 inputs a login ID and a password on a predetermined Web page provided by the server device 10, and logs in to the information management system (server device 10). The login ID and password of the user are set, for example, when the user accesses a predetermined web page for the first time and performs member registration and the like. The login ID and password of the user are managed by the server device 10 providing a predetermined web page. That is, the login ID and password input by the user are transmitted from the user terminal 20 to the server device 10, and the login ID and password match the login ID and password of the user managed by the server device 10. In this case, the user can log in to a predetermined web page.

  When login to a predetermined web page is successful, a search screen 201 shown in FIG. 9 is displayed on the display of the user terminal 20. The user inputs a search word to be searched in the search field 201a of the search screen 201, and performs an operation of pressing the search button 201b. According to this, a search request including the search word input in the search field 201 a is transmitted from the user terminal 20 to the server device 10. Here, it is assumed that a search request including the search word “Δ station” is transmitted from the user terminal 20 to the server device 10.

  Here, although the search screen 201 is displayed only on the user terminal 20 of the user who logged in to the information management system, the search screen 201 is displayed on the user terminal 20 of the user who is not logged in to the information management system. It may be displayed as well. However, in this case, it is assumed that a user who is not logged in to the information management system can not wait for the order on the search result screen 202 shown in FIG.

  The input unit 101 of the server device 10 receives the search request transmitted from the user terminal 20, and transfers the received search request to the search unit 102 (step S1). Here, as described above, it is assumed that the search request including the search word “Δ station” is received and transferred to the search unit 102.

  When the search unit 102 receives the search request transferred from the input unit 101, the search unit 102 reads out from the storage device reference data Da at the time of search including the search word included in the search request as a keyword, and meets the conditions desired by the user. A store is searched (step S2).

  In this case, since the search request includes the search word “Δ station”, the search unit 102 reads out the reference data Da3 at the time of search including “Δ station” as a keyword from the storage device, and the user desires As stores matching the conditions, search for (extract) “○○ 駅 Ekimae store”, “XXD △ Ekimae store”, and “□□□ 駅 Everyplace store”. The read out reference data Da3 at the time of search is transmitted to the calculation unit 103.

  Next, upon receiving the search reference data Da transmitted from the search unit 102, the calculation unit 103 reads out from the storage device store data Db including the output store name included in the search reference data Da as a store name. Thereafter, the calculation unit 103 refers to the score table T stored in the storage device to calculate the score of the shop (that is, the searched shop) indicated by the read shop data Db (step S3).

  In this case, since the reference data Da3 at the time of search is transmitted from the search unit 102, the calculation unit 103 uses the store names “○○ ○ Δ Ekimae store”, “××× Δ Ekimae store”, “□□□ △”. Store data Db1 to Db3 each including a store in the station are read from the storage device, and a score is calculated for each store indicated by the store data Db1 to Db3.

  As shown in the store data Db1, “○○ △ Ekimae store” is “support for waiting for mobile order”, “support for display of waiting time”, and “non-support for waiting for future order”. The score is calculated as “8 points (= 5 + 3)” based on the score table T.

  As shown in the store data Db 2, “××× Ekimae store” is “support for waiting for mobile order”, “support for display of waiting time”, and “support for waiting for future order”. The score is calculated as “9 points (= 5 + 3 + 1)” based on the score table T.

  As shown in the store data Db3, "□□□ 駅 station store" is "non-support for waiting for mobile order", "non-display for waiting time", and "non-support for future queue" Therefore, the score is calculated as “0 point” based on the score table T.

  The store data Db1 to Db3 used to calculate each of the scores are transmitted to the sorting unit 104 after the calculation results (that is, the scores) are linked.

  Subsequently, when the sorting unit 104 receives the shop data Db linked with the score transmitted from the calculating unit 103, the sorting unit 104 sorts the shop data Db in descending order of the score tied to the shop data Db (step S4).

  In this case, the score "8 points" is linked to the store data Db1, the score "9 points" is linked to the store data Db2, and the score "0 points" is linked to the store data Db3. The sorting unit 104 sorts the shop data Db in the order of the shop data Db2, the shop data Db1, and the shop data Db3. The rearrangement result data indicating the rearrangement result is transmitted to the display processing unit 105.

  Thereafter, when the display processing unit 105 receives the rearrangement result data transmitted from the rearrangement unit 104, the display processing unit 105 generates screen data based on the rearrangement result data, and the user transmits the screen data to the communication unit 15 via the communication unit 15. It transmits to the terminal 20 (step S5), and ends the processing here.

  In this case, the rearrangement result data indicates that the shop data Db is arranged in the order of the shop data Db2, the shop data Db1, and the shop data Db3. Therefore, the display processing unit 105 determines the shop name included in the shop data Db2. A screen in which “XX × 駅 station square store”, store name “○ XX △ station square store” included in store data Db 1, and store name “□□□ 駅 station middle store” included in store data D b 3 are arranged in the order Generate data. According to this, on the display of the user terminal 20, the search result screen 202 shown in FIG. 10 is displayed.

In addition, in the search result screen 202 shown in FIG. 10, next to the store name waiting for mobile order or waiting for the future order, that is, next to “XX × Δ Ekimae store” and “○○ Δ Ekimae store” Is displayed with a queue button 202a capable of queuing for the store. According to this, the user can easily perform a series of operations from the search of the store to the waiting for the order. It should be noted that next to the store name that can not be queued for carrying and waiting for the queue in the future, that is, next to “□□□ Δ Station store”, the above queue button 202a can not be selected (gray scale). Alternatively, it is assumed that the queue button 202a is not displayed.
<Modification>
Next, modifications will be described with reference to FIGS. Here, a series of processing procedures of the server device 10 when the business hours of the store are further considered will be described. Note that, in order to realize processing in which the business hours of the store are further taken into consideration, it is assumed that the store data Db further includes an item of "business hours" as shown in FIG.

  For example, according to the store data Db1 ′ shown in FIG. 11, the store name is “○○ △ Ekimae store”, the operating time is “17: 00-22: 00”, and the availability of waiting for mobile order is "Available (that is, corresponding to the mobile order waiting)", the display availability of the waiting time is "Available", and the reception availability of the waiting for the future order is "No (that is, not supported for the future order waiting)" Is shown. The same applies to the other shop data Db2 'and Db3' shown in FIG. 11, and thus the detailed description thereof is omitted here.

  Hereinafter, with reference to the flowchart of FIG. 12 and the screen examples of FIG. 13 and FIG. 14, a series of processing procedures of the server device 10 when the business hours of the store are considered will be described. In the storage device of the server device 10, reference data Da at the time of search shown in FIG. 3, store data Db 'shown in FIG. 11, and a score table T shown in FIG. 6 are stored in advance.

  As in the case of FIG. 8, first, the user operating the user terminal 20 logs in to the information management system (server apparatus 10) and causes the display of the user terminal 20 to display a search screen 201 'shown in FIG. The search screen 201 'shown in FIG. 13 is different from the search screen 201 shown in FIG. 9 in that the current time is displayed. However, although the search screen 201 'in which the current time is displayed is shown here for convenience of explanation, the search screen may be similar to that of FIG. The user inputs a search word to be searched for in the search field 201a of the search screen 201 'and performs an operation of pressing the search button 201b. According to this, a search request including the search word input in the search field 201 a is transmitted from the user terminal 20 to the server device 10. Here, it is assumed that a search request including the search word “Δ station” is transmitted from the user terminal 20 to the server device 10.

  When a search request is transmitted from the user terminal 20, the input unit 101 and the search unit 102 of the server device 10 execute the same processing as the above-described steps S1 and S2 (step S11, step S12).

  According to the processing in steps S11 and S12, since the search request includes the search word “Δ station”, reference data Da3 at the time of search including “Δ station” as a keyword is read from the storage device and used As a store that meets the conditions desired by the person, "○○ 駅 Ekimae store", "× △ 駅 Ekimae store", and "□□□ 駅 Station middle store" are searched (extracted). The read out reference data Da3 at the time of search is transmitted to the calculation unit 103.

  Next, when receiving the reference data at the time of search sent from the search unit 102, the calculation unit 103 obtains the current time from the internal clock built in the server device 10 (step S13). Here, as shown in the search screen 201 ′ of FIG. 13, it is assumed that the search request is transmitted from the user terminal 20 to “17:30”, so the calculation unit 103 sets “17:30” as the current time. Is obtained from the internal clock of the server device 10.

  Subsequently, the calculation unit 103 reads out, from the storage device, store data Db 'including the output store name included in the received search reference data Da as the store name. After that, the calculation unit 103 determines that the store indicated by the store data Db ′ including the acquired current time in the business hours among the read store data Db ′ (that is, the stores currently searched among the retrieved stores). Store) is selected, and the score of the selected store is calculated with reference to the score table T stored in the storage device (step S14).

  In this case, since the reference data Da3 'at the time of search is transmitted from the search unit 102, the calculation unit 103 uses the store name "○○ ○ Δ Ekimae store", "××× Δ Ekimae store", "□□□店舗 Although store data Db1 ′ to Db3 ′ including the station store, respectively, are read from the storage device, “×× Δ station front store” indicated by store data Db2 ′ is open at the current time “17:30” Since the shop data Db 'other than the shop data Db2' is not calculated, a score is calculated for each shop indicated by the shop data Db1 'and Db3'.

  As shown in the store data Db1 ′, “○○ △ Ekimae store” is “support for waiting for mobile order”, “support for display of waiting time”, and “non-support for waiting for future order”. The score is calculated as “8 points (= 5 + 3)” based on the score table T.

  As shown in the store data Db3, "□□□ 駅 station store" is "non-support for waiting for mobile order", "non-display for waiting time", and "non-support for future queue" Therefore, the score is calculated as “0 point” based on the score table T.

  The store data Db1 'and Db3' used to calculate each of the above scores are transmitted to the sorting unit 104 after the calculation results (that is, the scores) are linked.

  After that, the reordering unit 104 and the display processing unit 105 execute processes similar to the above-described steps S4 and S5 (steps S15 and S16).

  In this case, since the score “8 points” is linked to the store data Db1 ′ and the score “0 point” is linked to the store data Db3 ′, the sorting unit 104 sorts the store data Db ′ The display processing unit 105 rearranges the store data Db1 ′ and the store data Db3 ′ in this order, and the display processing unit 105 stores the store name “○○ △ Ekimae store” included in the store data Db1 ′ and the store name “□□” included in the store data Db3 ′. □ △ Generate station data in which the station store is lined up in that order. According to this, on the display of the user terminal 20, a search result screen 202 'shown in FIG. 14 is displayed.

  Although the store name indicated by the store data Db2 'for which the score is not calculated is not displayed in the search result screen 202' of FIG. 14, the present invention is not limited to this. Store data Db2 for which the score is not calculated The store name “XX × Δ Ekimae store” indicated by 'may be displayed at the end, that is, under “□□□ Δ Station Naka store”.

  Further, although the processing in the case where the business hours of the store are further taken into consideration is described here, for example, processing taking into consideration the reception waiting time (acceptable time) of waiting for mobile order and waiting for the future order may be executed. In this case, the above-described processing may be executed by replacing the above-described business hours with the reception time waiting for mobile order and waiting for the future order. Alternatively, processing may be performed in consideration of both the store's business hours and the above-described acceptable hours.

  In the present embodiment, the calculation unit 103 calculates the score for determining the order of arrangement in accordance with the service content related to the orderly waiting provided by the store, so the arrangement order considered to be suitable for the user from the viewpoint of order waiting is It is possible to make a decision.

  Further, in the present embodiment, the display processing unit 105 generates screen data including an order waiting button 202a for waiting the order next to the store name waiting for the mobile order or waiting for the order in the future. The user can easily carry out a series of operations from store search to queue waiting.

  Furthermore, in the present embodiment, the calculation unit 103 does not calculate the score for stores that are not open at the time when the search request is transmitted from the user terminal 20, so stores that are not currently open are set as search results. It is possible to prevent the situation of presenting to the user. That is, the user can select a shop suitable for the user from shops currently operating.

  According to the embodiment described above, it is possible to provide an information management apparatus, an information management method, and a program capable of presenting to a user a store that seems preferable to the user from the viewpoint of waiting for a turn .

  Further, in the present embodiment, although the server device 10 has been described as one device, for example, the configuration may be such that the function of the server device 10 is distributed to a plurality of devices.

  The method described in the above embodiment is a program that can be executed by a computer, such as a magnetic disk (floppy (registered trademark) disk, hard disk, etc.), optical disk (CD-ROM, DVD, etc.) magneto-optical disk (MO), It can also be stored and distributed in a storage medium such as a semiconductor memory.

  Further, as the storage medium, any storage format may be used as long as it can store a program and can be read by a computer.

  In addition, an operating system (OS) operating on a computer based on an instruction of a program installed in the computer from a storage medium, MW (middleware) such as database management software, network software, etc. realize this embodiment. A part of each process may be executed.

  Furthermore, the storage medium in the present invention is not limited to a medium independent of a computer, but includes a storage medium downloaded and stored or temporarily stored a program transmitted by a LAN, the Internet or the like.

  Further, the storage medium is not limited to one, and the processing in the present embodiment may be executed from a plurality of media, and the storage medium in the present invention may be included, and the medium configuration may be any configuration.

  Note that the computer in the present invention executes each process in the present embodiment based on a program stored in a storage medium, and an apparatus comprising a single personal computer or the like, and a system in which a plurality of apparatuses are connected to a network It may be any configuration such as.

  Further, the computer in the present invention is not limited to a personal computer but also includes an arithmetic processing unit, a microcomputer and the like included in an information processing device, and generically refers to devices and devices capable of realizing the functions of the present invention by a program. .

  The present invention is not limited to the above embodiment as it is, and at the implementation stage, the constituent elements can be modified and embodied without departing from the scope of the invention. In addition, various inventions can be formed by appropriate combinations of a plurality of components disclosed in the above embodiments. For example, some components may be deleted from all the components shown in the embodiment. Furthermore, components in different embodiments may be combined as appropriate.

  DESCRIPTION OF SYMBOLS 10 Server apparatus 20 User terminal 30 Store terminal 101 Input part 102 Search part 103 Calculation part 104 Sorting part 105 Display processing part

Claims (9)

An information management apparatus communicably connected to a user terminal used by a user, comprising:
First storage means for storing first data indicating a vocabulary and a store name associated with the vocabulary;
A second storage unit for storing second data indicating the store name and contents of a service related to waiting for a store provided to the user by the store name;
Third storage means for storing third data in which the content of the service and the score for the service are defined;
Search means for searching for a store that satisfies the search request based on the first data when receiving a search request including a predetermined search word from the user terminal;
Calculation means for calculating a score for a service related to a queue provided to the user by the store based on the second data and the third data;
An information management apparatus comprising: display processing means for displaying the searched stores on the user terminal in descending order of the calculated points. The search means is
Reading out first data including the predetermined search word;
The calculation means is
The second data including the store name indicated by the read first data is read, the score is calculated for each of the read second data, and the calculated score is linked to the corresponding second data. ,
The display processing means is
The second data is rearranged in descending order of points according to the points linked to the second data, and the shop name indicated by the second data is displayed on the user terminal in the order after the rearrangement. The information management device described in. The display processing means is
The information management apparatus according to claim 1, wherein screen data including information that can be queued to the searched store is generated. The second data is
The information management device according to claim 1, further indicating the business hours of the store indicated by the store name, in addition to the store name and the content of the service. The calculation means is
The information management device according to claim 4, wherein a shop currently in operation is selected from the searched shops based on the second data, and the score is calculated for the selected shop. The second data is
The information management device according to claim 1, further indicating an acceptable time in which a store indicated by the store name can receive a queue from the user terminal, in addition to the store name and the content of the service. The calculation means is
The information management according to claim 6, wherein a shop whose current time is within the acceptable time is selected from the searched shops based on the second data, and the score is calculated for the selected shop. apparatus. The user is connected to the user terminal used by the user in a communicable manner, the first data indicating the vocabulary, the store name related to the vocabulary, the store name, and the store indicated by the store name Executed by the information management apparatus having a memory for storing the second data indicating the content of the service related to the waiting to be provided, the content of the service, and the third data in which the score for the service is defined Information management method, and
Searching for a store meeting the search request based on the first data when receiving a search request including a predetermined search word from the user terminal;
Calculating, on the basis of the second data and the third data, a score for a service related to queuing, provided by the store to the user;
Displaying the searched stores on the user terminal in the descending order of the calculated score. The user is connected to the user terminal used by the user in a communicable manner, the first data indicating the vocabulary, the store name related to the vocabulary, the store name, and the store indicated by the store name A computer of an information management apparatus having a memory for storing second data indicating contents of a service related to waiting to be provided to the user, contents of the service, and third data in which a score for the service is defined. A program to be executed by
On the computer
Searching for a store meeting the search request based on the first data when receiving a search request including a predetermined search word from the user terminal;
Calculating, on the basis of the second data and the third data, a score for a service related to queuing, provided by the store to the user;
A program for causing the user terminal to display the searched stores in descending order of the calculated score.

Images