JP2013003637A - Database system and control method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To perform suitable retrieval.SOLUTION: A database stores each data correspondingly to a combination of specific information and non-specific type information. A cache server, when receiving a data request, determines whether data are stored in a cache or not, and when the data are not stored, transmits the data request to the database. The database responds a combination of specific information and non-specific type information and the data to the cache server. When the transmitted combination of the specific information and the non-specific type information is stored in the cache, the cache server stores the received combination in the cache correspondingly to the data corresponding to the stored combination of the specific information and the non-specific type information, and when the combination is not stored in the cache, stores the transmitted combination of the specific information and the non-specific type information and the received combination in the cache correspondingly to the transmitted data.

Description

  The present invention relates to a database system and a control method.

  There is a cache search technique in the case where a database storing a plurality of records and a cache for accelerating the database response are linked. For example, there are a method using a data structure by an open hash method and a method using a k-d tree. The open hash method is also referred to as an external hash method.

  The cache search technique is used, for example, in processing of an authentication request and a data request for controlling a network.

  FIG. 27 is a diagram illustrating an example of a scene in which a target record is extracted using a search algorithm. In the example illustrated in FIG. 27, the network device 501 identifies the network device 503 or authenticates the user 502 based on a request from the user 502. In the example illustrated in FIG. 27, the network device 501 makes an inquiry to the authentication server 504 or the network control server 505 when the network device 503 is specified or the user 502 is authenticated. In the example shown in FIG. 27, the case where the authentication server 504 and the network control server 505 are connected to a database and a record is extracted will be described.

  In this case, the authentication server 504 and the network control server 505 identify what kind of authentication is performed by extracting records from the database based on information transmitted by the network device 501, and what kind of network Specify whether to perform control.

  Hereinafter, information used for record extraction is also referred to as “service identification information”. The service provided by the “service specifying information” is also referred to as “control service”, and the information used for providing the “control service” is also referred to as “control service data”. The “service specifying information” is composed of one or a plurality of “service specifying information elements”, and there are N service specifying information elements that constitute the service specifying information, each of which is designated as a service specifying information element (E1, E2,. ... EN).

  27, for example, the network device 501 transmits service specifying information to the authentication server 504 and the network control server 505. Here, the authentication server 504 and the network control server 505 extract a record from the database based on the service specifying information received from the network device 501.

  The service specific information element is also referred to as “specific information”. Here, in some control services, control service data is determined by all service specifying information elements, and in other cases, control service data is determined by a set of some service specifying information elements. For example, all of the plurality of pieces of specific information included in the service specific information transmitted by the network device 501 may be used, or some may be used.

  The open hash method will be briefly described with reference to FIG. FIG. 28 is a diagram illustrating an example of a basic data structure of the open hash method. As shown in FIG. 28, in the open hash method, a column to be searched is used as a key, and this key is divided into B finite classes. Also, an integer number of 0, 1,... B-1 is assigned to each of the B divided classes. Further, a hash function h is prepared that gives an integer h (x) from 0 to B−1 for x that can be a key. h (x) represents the class to which x belongs. Here, h (x) is also referred to as a hash value of x. x is also referred to as belonging to bucket h (x). As shown in FIG. 28, records including keys having the same hash value, in other words, records including keys belonging to the same bucket are managed as a list.

  An example of a record addition operation, a deletion operation, and a search operation in the open hash method will be described in order using the data structure shown in FIG. An example of an additional operation in the open hash method will be described. In this case, (1) the hash value h (x) of the key x of the record to be added is calculated, and the bucket is specified. (2) The specified list of buckets is examined in order, and if the record with the same key does not exist in the list until the end of the list, the record to be added is linked to the end of the list. In other words, a record to be added is added.

  Next, an example of a search operation in the open hash method will be described. In this case, (1) the hash value h (x) of the key x of the record to be added is calculated, and the bucket is specified. (2) The list of identified buckets is examined in order to determine whether the keys are the same. Thereafter, (3) if the same key exists, it is determined as a record to be searched.

  Next, an example of a deletion operation in the open hash method will be described. In this case, (1) the hash value h (x) of the key x of the record to be added is calculated, and the bucket is specified. (2) The list of identified buckets is examined in order to determine whether the keys are the same. Thereafter, (3) if the same key exists, the record of the corresponding key is deleted from the list.

  The kd tree method will be briefly described with reference to FIG. FIG. 29 is a diagram illustrating an example of a data structure of a method using a kd tree. In the kd tree method, k columns are to be verified. Hereinafter, the k columns to be verified are described as c0, c1,... Ck−1, respectively. FIG. 29 shows an example in which k is 3. A record is registered in a node in the data structure indicated by a circle in FIG. Each node is assigned a value called a discriminator corresponding to the depth from the node that is the root of the tree. The discriminator of node A, which is the root, is “0”. Further, the discriminators of the nodes B and C are “1”. The discriminators of the nodes D, E, and F are “2”. Further, the discriminator of the node G is “0”. As shown in this example, the discriminator of the root node is set to “0”, incremented to k−1 one by one in accordance with the depth, and then returned to “0” while repeating the discriminator. Is assigned to a node.

  Here, the discriminator indicates a column to be compared with the assigned node. For example, in a node with a discriminator of 1, column c1 is a comparison target.

  Hereinafter, the value of the column ci of the node P is described as Ki (P). Each node P has two child nodes and is described as LOSON (P) and HISON (P). Further, when the discriminator of the node P is “i”, the node is arranged so that the value of the column ci is smaller than Ki (P) for any node below LOSON (P). In addition, for any node below HISON (P), the node is arranged such that the value of the column ci is larger than Ki (P).

  An example of record addition operation, complete match search, partial match search, and deletion in the k-d tree method will be described in order using the data structure shown in FIG. The complete match search indicates a search when conditions for all columns are specified, and the partial match search indicates a search when conditions for some columns are specified.

  An example of an additional operation in the method using the k-d tree will be described. In this case, description will be made assuming that (1) a node when the record to be added is incorporated into the k-d tree is represented as a node P. Here, (2) if the root node does not exist, the record to be added is set as the root node, “empty” is assigned to LOSON (P) and HISON (P), and the process ends. On the other hand, when the root node exists, the following is performed with the root node as the node Q. Specifically, (3) Ki (P) and Ki (Q) are compared for all columns ci, and if all are the same, no addition is performed because they already exist. (4) On the other hand, if Ki (P) <Ki (Q), LOSON (Q) is set to SON (Q), and if Ki (P)> Ki (Q), HISON (Q) is set to SON (Q). To do. If (5) SON (Q) is “empty”, node P is connected to SON (Q), “empty” is assigned to LOSON (P) and HISON (P), and the process ends. When SON (Q) is not “empty”, the above (3) is executed with SON (Q) as Q. If Ki (P) = Ki (Q), Ki (P) and Ki (Q) are compared with a value obtained by connecting all the columns.

  An example of the exact match search operation in the method using the k-d tree will be described. (1) A description will be given assuming that a node when a record to be searched is incorporated in a k-d tree is represented as a node P. Here, (2) if the root node does not exist, the process ends as no search target, and if the root node exists, the following processing is executed with the root node as the node Q. Specifically, (3) Ki (P) and Ki (Q) are compared for all the columns ci, and if all are the same, the record assigned to Q is taken as the search result. (4) If Ki (P) <Ki (Q), LOSON (Q) is set to SON (Q), and if Ki (P)> Ki (Q), HISON (Q) Is SON (Q). (5) If SON (Q) is “empty”, the process ends as no search target. When SON (Q) is not “empty”, SON (Q) is set as Q and the above (3) is executed. If Ki (P) = Ki (Q), Ki (P) and Ki (Q) are compared with a value obtained by connecting all the columns.

  An example of the partial match search operation in the method using the k-d tree will be described. In this case, description will be made assuming that (1) a node when it is assumed that a record to be searched is incorporated in a k-d tree is represented as a node P. Here, (2) if there is no root node, the process ends as no search target. When the root node exists, the following is performed with the root node as the node Q. Specifically, (3) For all columns ci that are search conditions, the search conditions are compared with Ki (Q), and if all the conditions are met, Q is set as the search target, and the following is performed. That is, (4) when the discriminator of Q is J and the column cJ is designated as the search condition, the search condition of the column cJ is compared with Ki (Q). If Ki (Q) is large as a result of the comparison, the processing of (3) is recursively executed for LOSON (Q). If Ki (Q) is small as a result of the comparison, the process of (3) is recursively executed for HISON (Q). When the column cJ is not specified as a search condition, the process (3) is recursively executed for both LOSON (Q) and HISON (Q). (5) If Ki (P) <Ki (Q), LOSON (Q) is set to SON (Q). If Ki (P)> Ki (Q), HISON (Q) is set to SON ( Q). (6) If SON (Q) is “empty”, the search ends. When SON (Q) is not “empty”, the above (3) is executed with SON (Q) as Q. If Ki (P) = Ki (Q), Ki (P) and Ki (Q) are compared with a value obtained by connecting all the columns.

  An example of the deletion operation in the method using the k-d tree will be described. In this case, description will be made assuming that (1) a node having a record to be deleted is represented as a node P. Here, (2) For the node P, when both LOSON (P) and HISON (P) are “empty”, the LOSON (R) or HISON (R) of the parent node R pointing to the node P is “empty”. And remove the node P from the k-d tree. (3) For node P, if at least one of LOSON (P) and HISON (P) is not “empty”, assuming that the discriminator of node P is J, LOSON (P) is the root. In the subtree, Q is the node with the largest column cJ or Q is the node with the smallest column cJ in the subtree rooted at HISON (P), and node P is replaced with node Q. Q is similarly removed from the original position of the k-d tree.

  In some cases, a set of specific information necessary for extracting a record is unknown at the time of reception. In the example shown in FIG. 27, the authentication server 504 and the network control server 505 are necessary for extracting a record from the specific information included in the service specific information when the service specific information is received from the network device 501. The set of service specific information elements may be unknown. Further, for the network device 501, the service specifying information necessary for extracting the record from the specified information included in the service specifying information to be transmitted at the time of transmitting the control service to the authentication server 504 or the network control server 505. In some cases, the set of elements is unknown.

“Data Structure and Algorithm”, A.I. V. Aiho, J.H. E. Hopcroft, J.H. D. Written by Ullman, translated by Yoshio Ohno, Baifukan, published in 1987 “Multidimensional Binary Search Trees Used for Associate Searching”, J. Org. L. By Bentley, Communications of the ACM, Vol. 18, no. 9, pp. 509-517, September 1975

  Here, when the set of specific information necessary for extracting records from the database is unknown, it is possible to apply the conventional search algorithm described above and execute the processing described below. There is a problem that cannot be searched.

  In the following description, for convenience of explanation, a case where (E1, E2, E3) is included in the service identification information element will be described. Depending on E1, whether the set of service specification information elements necessary for specifying control service data is {E1}, {E1, E2}, or {E1, E2, E3} A description will be given using the case where is determined.

  For example, a two-time method of performing a search using the conventional search algorithm described above twice is conceivable. In this case, a table indicating a set of service specifying information elements used for specifying control service data is created in advance. FIG. 30 is a diagram illustrating an example of a table indicating a set of service specifying information elements used for specifying control service data. In the example illustrated in FIG. 30, when E1 is “ServiceName-001”, {E1} is used as a set of service specific information elements. Similarly, in the example illustrated in FIG. 30, when E1 is “ServiceName-002”, the case where {E1, E2, E3} is used as a set of service specific information elements is illustrated.

  In the two-time method, first, a set of service specifying information elements is searched from a previously created table. Thereafter, the control service data is specified by performing a second search using a set of service specifying information elements as a first search result as one column. 31-1 to 31-3 are diagrams illustrating an example of combinations of service specifying information elements used in the second search. FIGS. 31-1 to 31-3 respectively correspond to cases where the set of service specifying information elements is {E1} {E1, E2} {E1, E2, E3}. In the example shown in FIGS. 31-1 to 31-3, an example of the control service data is shown in association with the combination of the service specifying information elements.

  As described above, when the twice method is used, the search algorithm is executed twice, and the search performance is deteriorated.

  Further, in a search using a known search algorithm, all methods for performing a search for all keys using all combinations of service specifying information elements as keys can be considered. FIG. 32 is a diagram illustrating an example of a table indicating combinations of service specifying information elements used as keys in all methods. In the case of the table shown in FIG. 32, when E1 is “ServiceName-001”, the control service data associated with the value of E1 is the same, regardless of E2 or E3. The same value is registered for all combinations of E2 and E3. In the example shown in FIG. 32, six records including “ServiceName-001” are registered as E1, and all the control service data of the six records are “data 1”. In the example shown in FIG. 32, an example of the control service data is also shown in association with the combination of service specifying information elements. In the case of all methods, the search is performed using {E1, E2, E3} as one column, thereby specifying the control service data.

  As described above, when all the methods are used, a plurality of records having the same control service data are registered, and a server storage area such as a server memory or a hard disk is wasted. In addition, when the cache service is used to store control service data and process it at high speed, multiple records having the same control service data are registered in the cache server memory. As a result of being wasted due to duplicate control service data, the number of records that can be cached in the cache server is reduced, and only processing by a small number of control service data can be handled.

  Further, an aggregation method in which a method using a k-d tree is applied to all methods, records are aggregated, and complete matching and partial matching are used together is also conceivable. Referring to FIG. 32, in the table shown in FIG. 32, records having the same control service data are aggregated into one, and as a search method, a complete match search and a partial match search are used together. A method for identifying control service data is conceivable.

  FIG. 33 is a diagram illustrating an example of a table in which records having the same control service data are combined into one in the table illustrated in FIG. 32. In the example illustrated in FIG. 32, the number of records including the control service data “data 1” is 6, whereas in the example illustrated in FIG. 33, the records are aggregated into one record.

  In the aggregation method, for all combinations of service specifying information elements, a complete match search and a partial match search are performed to search for control service data. For example, in the aggregation method, first, an exact match search specifying {E1, E2, E3} is performed. If a record cannot be searched, a partial match search is performed by specifying {E1, E2}, Cannot be searched, the control service data is specified by performing a partial match search specifying only {E1}. In the aggregation method, if a record cannot be searched even if only {E1} is specified, it is determined that the corresponding record does not exist.

  As described above, when the aggregation method is used, the control service data may be searched a plurality of times, and the search performance may be deteriorated. When the aggregation method is used, when partial match search is used, both HISON and LOSON must be searched for in the two search paths in the k-d tree. The processing load for increasing the search performance decreases.

  The disclosed technique has been made in view of the above, and an object thereof is to provide a database system and a control method that can be appropriately searched.

  In one aspect, the disclosed database system includes a database and a cache server. The database includes a storage unit and a cache response unit. The cache server includes a cache, a determination unit, a specific information transmission unit, a storage unit, and a data transmission unit. The storage unit includes, for each data, specific information for specifying the data and non-specific type information indicating a non-specific type that is a type that is not used when specifying the data among a plurality of types of the specific information And remember the combination. The cache stores at least a part of the data stored in the database in association with at least one of a combination of the specific information and the non-specific type information and a combination of a plurality of types of the specific information. . When the determination unit receives the data request, the determination unit determines whether a combination of each of the plurality of types of specific information included in the data request is stored in the cache. The specific information transmission unit transmits the combination included in the data request to the database when the determination unit determines that the data is not stored. When the cache response unit receives the combination that is the combination transmitted by the specific information transmission unit, the cache response unit includes the specific information stored in the storage unit corresponding to the received combination that is the received combination and the non-specific type information. A combination and the data associated with the combination of the specific information and the non-specific type information are acquired from the storage unit and responded to the cache server. When the combination of the specific information and the non-specific type information transmitted by the cache response unit is stored in the cache, the storage unit stores the specific information and the non-specific type information stored in the cache. The cache response is stored in the cache in association with the data associated with the combination of the cache response and, if not stored in the cache, the cache response is associated with the data transmitted by the cache response unit. The combination of the specific information and the non-specific type information transmitted by the unit and the reception combination are stored in the cache. When it is determined that the data transmission unit is stored by the determination unit, the data transmission unit acquires the data from the cache, transmits the data to the transmission source of the data request, and determines that the data transmission unit is not stored by the determination unit If so, the data transmitted by the cache response unit is transmitted to the transmission source of the data request.

  According to one aspect of the disclosed database system, there is an effect that search can be appropriately performed.

FIG. 1 is a diagram illustrating an example of an overall image of the database system according to the first embodiment. FIG. 2 is a block diagram illustrating an example of the configuration of the database server in the first embodiment. FIG. 3 is a diagram illustrating an example of information stored in the user information DB according to the first embodiment. FIG. 4 is a diagram illustrating an example of information stored in the IR information DB according to the first embodiment. FIG. 5 is a diagram illustrating an example of a response data determination table used by the cache response unit according to the first embodiment. FIG. 6 is a diagram illustrating an example of the configuration of the cache server according to the first embodiment. FIG. 7A is a schematic diagram illustrating an example of information stored in the cache according to the first embodiment. FIG. 7-2 is a diagram illustrating an example of information stored in the cache according to the first embodiment. FIG. 7C is a diagram of an example of information stored in the cache according to the first embodiment. FIG. 8A is a diagram illustrating an example of information stored in the cache after the record is added by the cache determination unit according to the first embodiment. FIG. 8-2 is a diagram illustrating an example of information stored in the cache after the record is added by the cache determination unit according to the first embodiment. FIG. 8C is a diagram illustrating an example of information stored in the cache after the record is added by the cache determination unit according to the first embodiment. FIG. 9 is a flowchart illustrating an example of a process flow of the cache response process of the database server according to the first embodiment. FIG. 10 is a flowchart illustrating an example of a process flow by the IR information response unit according to the first embodiment. FIG. 11 is a flowchart illustrating an example of a flow by the IR information deletion unit of the database server in the first embodiment. FIG. 12 is a flowchart illustrating an example of a process flow by the user information update unit of the database server in the first embodiment. FIG. 13 is a flowchart illustrating an example of a flow of processing performed by the cache determination unit of the cache server according to the first embodiment. FIG. 14 is a flowchart illustrating an example of a flow of cache registration processing according to the first embodiment. FIG. 15 is a flowchart illustrating an example of the flow of cache deletion processing according to the first embodiment. FIG. 16 is a flowchart illustrating an example of a processing flow by the IR information determination unit of the cache server according to the first embodiment. FIG. 17 is a flowchart illustrating an example of a flow of processing by the response unit of the cache server according to the first embodiment. FIG. 18A is a diagram illustrating an example of information stored in a cache according to the second embodiment. FIG. 18-2 is a diagram illustrating an example of information stored in the cache according to the second embodiment. FIG. 18C is a diagram illustrating an example of information stored in the cache according to the second embodiment. FIG. 19 is an example of a list of service specific element values determined in advance in the second embodiment. FIG. 20A is a diagram illustrating an example of information stored in the cache after the record registration processing by the cache determination unit according to the second embodiment. FIG. 20B is a diagram illustrating an example of information stored in the cache after the record registration process by the cache determination unit according to the second embodiment. FIG. 20C is a diagram illustrating an example of information stored in the cache after the record registration process by the cache determination unit according to the second embodiment. FIG. 21 is a flowchart illustrating an example of a cache registration process according to the second embodiment. FIG. 22 is a diagram illustrating an example of information stored in the user information DB according to the third embodiment. FIG. 23 is a diagram illustrating an example of information stored in the IR information DB according to the third embodiment. FIG. 24 is a flowchart illustrating an example of a process flow by the cache response unit of the database server according to the third embodiment. FIG. 25 is a flowchart illustrating an example of the flow of cache deletion processing according to the third embodiment. FIG. 26 is a diagram showing that the information processing by the control program for executing the processing by the database system by the program is specifically realized by using a computer. FIG. 27 is a diagram illustrating an example of a scene in which a target record is extracted using a search algorithm. FIG. 28 is a diagram illustrating an example of a basic data structure of the open hash method. FIG. 29 is a diagram illustrating an example of a data structure of a method using a kd tree. FIG. 30 is a diagram illustrating an example of a table indicating a set of service specifying information elements used for specifying control service data. FIG. 31A is a diagram illustrating an example of combinations of service specifying information elements used in the second search. FIG. 31-2 is a diagram illustrating an example of combinations of service specifying information elements used in the second search. FIG. 31C is a diagram illustrating an example of combinations of service specifying information elements used in the second search. FIG. 32 is a diagram illustrating an example of a table indicating combinations of service specifying information elements used as keys in all methods. FIG. 33 is a diagram illustrating an example of a table in which records having the same control service data are combined into one in the table illustrated in FIG. 32.

  Hereinafter, embodiments of the disclosed database system and control method will be described in detail with reference to the drawings. Note that the invention disclosed by this embodiment is not limited. Each embodiment can be appropriately combined within a range in which processing contents do not contradict each other.

[Overall Configuration in Example 1]
An image of the database system in the first embodiment will be briefly described with reference to FIG. FIG. 1 is a diagram illustrating an example of an overall image of the database system according to the first embodiment. As shown in FIG. 1, the database system includes a client 100, a database server 200, and a cache server 300. The client 100, the database server 200, and the cache server 300 are connected via a network. In the example shown in FIG. 1, the case where there is one client 100, one database server 200, and two cache servers 300 is shown, but the present invention is not limited to this, and each device is arbitrary. There may be a number.

  The client 100 transmits a data request for requesting data stored in the cache server 300 or the database server 200 to the cache server 300. Further, the client 100 receives a data response from the cache server 300 or the cache server 300. Thereafter, for example, the client 100 executes various services using data included in the data response. The client 100 corresponds to an information processing terminal used by a user, for example.

  The database server 200 has a large-capacity storage unit. The database server 200 stores data referred to by the client 100 in the storage unit. Specifically, for each data, the database server 200 specifies specific information for specifying data and a non-specific type that is a type that is not used when specifying data among a plurality of types of specific information. The combination with the specific type information is stored in the storage unit.

  Further, as shown in (i) of FIG. 1, when the data is updated, the database server 200 generates information (IR information) changed on the database by using the Invalidation Report technology. As will be described below, the database server 200 and the cache server 300 share updated information among information stored in the database server 200 using IR information. However, the present invention is not limited to this, and the database server 200 and the cache server 300 may be shared by using any method instead of using IR information.

  The cache server 300 stores data used by the cache server 300 in the past among the data stored in the database server 200 in the cache 311. Specifically, the cache server 300 corresponds to at least one of a combination of specific information and non-specific type information and a combination of multiple types of specific information for at least a part of the data stored in the database server 200. In addition, it is stored in the cache 311. The cache server 300 realizes high-speed access by storing and using data used in the past in the cache 311.

  When the cache server 300 receives the data request from the client 100 and stores the data requested by the data request in the cache 311 of its own device, as shown in (4) of FIG. The stored data is transmitted as a data response. On the other hand, when the data requested by the data request is not stored in the cache 311 of the own device, the cache server 300 transmits a data search request to the database server 200 as shown in (2) of FIG. . Thereafter, as shown in (3) of FIG. 1, the cache server 300 receives the data response as a response to the data search request from the database server 200, thereby acquiring the data requested by the data request from the database server 200. To do. The cache server 300 stores the received data in the cache 311 of its own device, and transmits it as a data response to the client 100 as shown in (4) of FIG.

  In other words, when receiving the data request, the cache server 300 determines whether a combination of each of a plurality of types of specific information included in the data request is stored in the cache 311. Here, if the cache server 300 determines that the data is not stored, the cache server 300 transmits the combination included in the data request to the database server 200. After that, when the database server 200 receives the combination that is the combination transmitted by the cache server 300, the combination of the specific information and the non-specific type information corresponding to the received combination that is the received combination, the specific information and the non-specific type Data associated with the combination with the information is acquired from the storage unit and responds to the cache server 300. Thereafter, when the combination of the specific information and the non-specific type information transmitted from the database server 200 is stored in the cache 311, the cache server 300 combines the stored specific information and the non-specific type information. The received combination is stored in the cache in association with the data associated with. In addition, if the cache server 300 is not stored in the cache 311, the cache server 300 is associated with the data transmitted by the database server 200 and a combination of specific information and non-specific type information transmitted by the database server 200; The received combination is stored in the cache 311. When the cache server 300 determines that the data is stored in the cache 311, the cache server 300 acquires the data from the cache 311, transmits the data to the transmission source of the data request, and determines that the data is not stored in the cache 311. In this case, the data transmitted by the database server 200 is transmitted to the transmission source of the data request.

  Further, the cache server 300 transmits an IR information request for requesting IR information to the database server 200 as shown in FIG. 1A, and a response to the IR information request as shown in FIG. An IR information response is received. That is, the cache server 300 confirms the presence / absence of IR information for its own device. Here, the case where there is IR information for the own device indicates that the data stored in the database server 200 is updated, and the data stored in the cache 311 of the cache server 300 is past data. When the IR information exists in the database server 200, the cache server 300 deletes the data stored in the cache 311 so that the past data stored in the cache 311 of the own device is not transmitted to the client 100.

  Further, when the IR information is applied to the cache 311 of the own device, the cache server 300 issues an IR information deletion request, which is a request for deleting the IR information, as shown in FIG. Send to. Thereafter, in the database server 200, the IR information applied to the cache server 300 is deleted, and the cache server 300 sends an IR information deletion response, which is a response to the IR information deletion request, to the database as shown in FIG. Receive from server 200.

[Configuration of Database Server in Embodiment 1]
FIG. 2 is a block diagram illustrating an example of the configuration of the database server in the first embodiment. As shown in FIG. 2, the database server 200 includes a communication control I / F unit 201, a storage unit 210, and a control unit 220.

  The communication control I / F unit 201 is connected to the control unit 220. The communication control I / F unit 201 controls communication related to various information exchanged with the cache server 300. Specifically, the communication control I / F unit 201 transmits a data request, an IR information request, and an IR information deletion request to the cache server 300 based on control by the control unit 220. Further, the communication control I / F unit 201 transmits a cache 311 response, an IR information response, and an IR information deletion response to the cache server 300 based on the control by the control unit 220.

  The storage unit 210 is connected to the control unit 220. The storage unit 210 stores data used for various processes performed by the control unit 220. The storage unit 210 is, for example, a semiconductor memory device such as a random access memory (RAM), a read only memory (ROM), or a flash memory, a hard disk, an optical disk, or the like. In the example illustrated in FIG. 2, the storage unit 210 includes a user information DB 211 and an IR information DB 212.

  The user information DB 211 is a type that is not used when data is specified from among a plurality of types of specific information and a plurality of types of specific information for each data specified by at least one type of specific information. A combination with non-specific type information indicating a non-specific type is stored. For example, the user information DB 211 stores, for each data, a combination of specific information belonging to a specific information type used when specifying data and non-specific type information.

  For example, the user information DB 211 stores key information and attribute values in association with each other. The attribute value is data referred to by the client 100. In other words, it is the data to be requested by the data request. The key information is information for uniquely identifying the attribute value. The key information includes one or more specific elements. The key information is also referred to as “service specific information”, and each element included in the key information is also referred to as “service specific information element” or “specific information”. The key information is included in the data request transmitted by the client 100. The data request includes a plurality of types of specific information, and all of the specific information included in the data request may not be used as key information. In other words, the data request may include specific information belonging to a non-specific type that is a type that is not used when specifying data.

  The relationship between the attribute value and the key information will be briefly described using an example in which N elements are included in the key information included in the data request. Some attribute values are specified by all N elements out of N elements, and some attribute values are specified by some of the N elements.

  FIG. 3 is a diagram illustrating an example of information stored in the user information DB according to the first embodiment. As illustrated in FIG. 3, the user information DB 211 stores key information and attribute values in association with each other. In the example illustrated in FIG. 3, the case where the key information includes three elements is illustrated, but the present invention is not limited to this, and the number of elements may be arbitrary. In the example shown in FIG. 3, the three elements included in the key information are indicated as “K1”, “K2”, and “K3”, respectively. Note that “ANY” in FIG. 3 indicates matching with an arbitrary element. In other words, it indicates a non-specific type. “ANY” is also described as “ANY element” and “non-specific type information”. Similarly, in the example illustrated in FIG. 3, a case where one attribute value is associated with each key information is illustrated, but the present invention is not limited to this, and the number of attribute values may be arbitrary.

  In the example illustrated in FIG. 3, the user information DB 211 stores key information including K1 “ServiceName-001”, K2 “ANY”, and K3 “ANY” in association with the attribute value “data 1”. That is, when the key information is “ServiceName-001, UserType-001, AccountType-001”, or “ServiceName-001, UserType-002, AccountType-002”, the user information DB 211 has an attribute value “data 1”. Remember that is identified. In other words, when a data request including “ServiceName-001, UserType-001, AccountType-001” or “ServiceName-001, UserType-002, AccountType-002” is transmitted by the client 100, The fact that the attribute value “data 1” is transmitted to the client 100 is stored.

  In the example illustrated in FIG. 3, the user information DB 211 associates key information including K1 “ServiceName-002”, K2 “UserType-001”, and K3 “AccountType-001” with the attribute value “data 100”. Add and remember. In other words, the user information DB 211 stores attribute values in association with key information not including “ANY”. In this case, when a data request is transmitted by the client 100 using “ServiceName-002”, “UserType-001”, and “AccountType-001” as key information, the attribute value “data 100” is transmitted to the client 100. Remember that.

  The IR information DB 212 stores IR information. Specifically, the IR information DB 212 stores IR information including a cache server name that identifies the cache server 300 to which the IR information is applied, and key information that specifies the updated attribute value.

  FIG. 4 is a diagram illustrating an example of information stored in the IR information DB according to the first embodiment. As shown in FIG. 4, the IR information DB 212 stores IR information including a cache server name “cache server A”, key information including K1 “ServiceName-001”, K2 “ANY”, and K3 “ANY”. To do. That is, the IR information DB 212 indicates that the attribute value specified by K1 “ServiceName-001”, K2 “ANY”, and K3 “ANY” has been updated, and stores IR information applied to the cache server A. .

  The IR information stored in the IR information DB 212 is stored when the user information DB 211 is updated, and is deleted after being applied to the cache server 300.

  The control unit 220 is connected to the communication control I / F unit 201 and the storage unit 210. The control unit 220 has an internal memory for storing a control program such as an OS (Operating System), a program defining various processing procedures, and necessary data, and controls various processes. The control unit 220 is, for example, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a central processing unit (CPU), or a micro processing unit (MPU). In the example illustrated in FIG. 2, the control unit 220 includes a cache response unit 221, an IR information response unit 222, an IR information deletion unit 223, and a user information update unit 224.

  When the cache response unit 221 receives the data search request from the cache server 300, the cache response unit 221 determines whether the key information included in the data search request is stored in the user information DB 211. In other words, the cache response unit 221 searches the user information DB 211 to acquire a record that matches the key information included in the data search request as a search result.

  For example, when the service specification information elements (E1, E2, E3) are included in the key information, the cache response unit 221 searches the user information DB 211 to search for the service specification information elements (E1, E2, E3). A record including corresponding key information is used as a search result.

  Note that the user information DB 211 may store “ANY” as specific information. As a result, there may be a plurality of records including key information corresponding to the service specifying information elements (E1, E2, E3). Based on this, the cache response unit 221 generates a response data determination table that is a determination table for determining a priority record among a plurality of records, and sets all the records that match the generated response data determination table as user information. After searching from the DB 211, one record having the highest priority is selected as a search result.

  FIG. 5 is a diagram illustrating an example of a response data determination table used by the cache response unit according to the first embodiment. In the example illustrated in FIG. 5, the case where “K1”, “K2”, and “K3” are included in the key information as service identification information elements is illustrated as an example. In other words, for example, of the data stored in the user information DB 211, not only records including “K1”, “K2”, and “K3” as key information but also “K1”, “K2”, and “ANY” are included as key information. As an example, a record, a record including “K1”, “ANY”, and “K3” as key information, a record including “K1”, “ANY”, and “ANY” as key information are used as search results. In the example illustrated in FIG. 5, a combination of service specific information elements stored in the response data determination table that can be a search result is associated with a priority. In the example illustrated in FIG. 5, the search result is given priority as the priority number increases. That is, in the example illustrated in FIG. 5, when a record including “K1”, “K2”, and “K3” as key information is a search result, this record is the search result. Next, when a record including “K1”, “K2”, and “ANY” as key information is a search result, this indicates that the record is a search result.

  In the example illustrated in FIG. 5, the cache response unit 221 selects one search result using the response data determination table, but the processing by the cache response unit 221 is not limited to this. Any method may be used. For example, it may be realized by a data inquiry language.

  Here, a detailed example will be described using the user information DB 211 shown in FIG. 3 and the response data determination table shown in FIG. Further, the case where the key information included in the data search request from the cache server 300 is “ServiceName-003, UserType-001, AccountType-003” will be described. In this case, the cache response unit 221 searches the user information DB 211 using the response data determination table of FIG. 5 to obtain “ServiceName-003, UserType-001, AccountType-003, data 105” with the priority “4”. And a record including “ServiceName-003, UserType-001, ANY, data 10” having a priority “3”. Here, in the response data determination table illustrated in FIG. 5, the priority “4” is treated as higher priority than the priority “3”, and the cache response unit 221 uses “ServiceName-003” as a search result. , UserType-001, AccountType-003, data 105 "is selected.

  When the user information DB 211 stores a record corresponding to the key information included in the data search request received from the cache server 300, the cache response unit 221 acquires the record stored in the user information DB 211, It transmits to the server 300 as a data response. For example, the cache response unit 221 acquires the key information and attribute value of the record that is the search result from the user information DB 211, and transmits a data response to the cache server 300. In addition, when the user information DB 211 does not store the record including the key information included in the data search request received from the cache server 300, the cache response unit 221 responds “no key information” to the cache server 300. .

  Note that the key information included in the data response transmitted by the cache response unit 221 may not be the same as the key information different from the key information included in the data search request. For example, when the cache response unit 221 selects a record including “ANY” from the user information DB 211 as a search result, the key information included in the data search request is not the same. This is because “ANY” is not included in the key information included in the data search request. Based on this, hereinafter, the specific information included in the key information included in the data response will be described as “partial specific information element” “D1” “D2” “D3” or the like.

  As described above, when the cache response unit 221 receives the combination of specific information included in the data search request transmitted by the cache server 300, the specific information corresponding to the received combination that is the received combination and the non-specific type information And the data associated with the combination of specific information and non-specific type information are acquired from the user information DB 211 and responded to the cache server 300. More specifically, when the cache response unit 221 receives the reception combination transmitted by the cache server 300, the cache response unit 221 selects one of the combinations of the specific information corresponding to the combination and the non-specific type information, and selects the selected specific A combination of information and non-specific type information and data stored in association with the selected combination are transmitted.

  When receiving the IR information request from the cache server 300, the IR information response unit 222 determines whether or not IR information including the cache server name of the cache server 300 that is the transmission source of the IR information request is stored in the IR information DB 212. To do. If the IR information response unit 222 determines that the IR information is stored in the IR information DB 212, the IR information response unit 222 acquires key information from all IR information including the cache server name that is the transmission source, and obtains the acquired key information. The IR information response including the information is transmitted to the cache server 300. Here, the key information included in the IR information response is key information for specifying the attribute value updated in the user information DB 211. If the IR information response unit 222 determines that the IR information DB 212 is not stored in the IR information DB 212, the IR information response unit 222 responds “no IR information” to the cache server 300.

  When receiving the IR information deletion request from the cache server 300, the IR information deletion unit 223 deletes the IR information including the cache server name of the cache server 300 that is the transmission source of the IR information deletion request from the IR information DB 212, and displays the deletion result. Responds to the cache server 300.

  Each time the user information DB 211 is updated, the user information update unit 224 generates IR information including key information indicating the updated record and the cache server name of the cache server 300 connected to the database server 200. Store in the IR information DB 212. When the user information DB 211 is updated, for example, when a user updates a record stored in the user information DB 211, when a new record is added to the user information DB 211, This is the case when the stored record is deleted.

[Configuration of Cache Server in Embodiment 1]
FIG. 6 is a diagram illustrating an example of the configuration of the cache server according to the first embodiment. In the example illustrated in FIG. 6, the cache server 300 includes a communication control I / F unit 301, a storage unit 310, and a control unit 320.

  The communication control I / F unit 301 is connected to the control unit 320. The communication control I / F unit 301 controls communication related to various information exchanged between the database server 200 and the client 100. Specifically, the communication control I / F unit 301 receives a data request from the client 100 and transmits a data response to the client 100 based on control by the control unit 320. In addition, the communication control I / F unit 301 transmits a data search request, an IR information request, and an IR information deletion request to the database server 200 based on control by the control unit 320, and sends a data response, an IR information response, and an IR information deletion response. Receive.

  Storage unit 310 is connected to control unit 320. The storage unit 310 stores data and programs necessary for various processes performed by the control unit 320. The storage unit 310 corresponds to, for example, the cache 311. In the example illustrated in FIG. 6, the storage unit 310 includes a cache 311.

  The cache 311 stores a part of the information stored in the user information DB 211 of the database server 200. That is, the cache 311 stores at least a part of the data stored in the database in association with at least one of a combination of specific information and non-specific type information and a combination of plural types of specific information. Specifically, a cache of data used by the cache server 300 among the information stored in the user information DB 211 is stored. Hereinafter, a data structure based on the open hash method will be described as an example.

  FIGS. 7A to 7C are diagrams illustrating an example of information stored in the cache according to the first embodiment. In the example illustrated in FIG. 7, the cache 311 includes a hash table, a record table, and an attribute information table. 7A to 7C illustrate examples of a hash table, a record table, and an attribute information table. As shown in FIGS. 7A to 7C, the hash table, the record table, and the attribute information table are linked by “record ID” and “attribute information ID”. In other words, in the example illustrated in FIGS. 7A to 7C, in the cache 311, “record ID” and “attribute information ID” are used as data for identifying data stored in the cache 311. . However, the present invention is not limited to this, and an arbitrary method may be used. For example, an address on a memory for each record may be used.

  In the example illustrated in FIG. 7A, the hash table stores “hash value” and “record ID” in association with each other. Here, the hash value stored in the hash table is a value obtained by converting the key information using a predetermined hash function. The record ID stored in the hash table is used for connecting the hash table and the record table. In the example illustrated in FIG. 7A, the hash table stores the record ID “0” in association with the hash value “0”. Similarly, the hash table stores the record ID “1” in association with the hash value “1”.

  As illustrated in FIG. 7B, the record table stores “record ID”, key information, and “attribute information ID” in association with each other. The record ID stored in the record table corresponds to the record ID stored in the hash table. The “attribute information ID” is used to connect the record table and the attribute information table. In the example illustrated in FIG. 7B, the record table includes a record ID “0”, key information including K1 “ServiceName-001”, K2 “ANY”, and K3 “ANY”, and an attribute information ID “0”. Are stored in association with each other.

  As shown in FIG. 7C, the attribute information table associates “attribute information ID”, “attribute value”, “expiration date” indicating the expiration date of the attribute value, and “reference source record list”. Remember. Here, “reference source record list” indicates a list of record IDs of records included in the record table associated with the same attribute information ID. The reference source record list has a structure that can include a plurality of elements such as a variable length array. In the example illustrated in FIG. 7C, the attribute information table associates the attribute information ID “0”, the attribute value “1”, the expiration date “2011/1/1”, and the reference source record list “0, 1”. And remember. The expiration date is, for example, a date after a certain period from the time when the record is added to the cache 311. However, the present invention is not limited to this, and an arbitrary date may be used.

  Although FIG. 7 shows an example in which the hash table structure is stored using the open hash method, the data structure is not limited to this. For example, a closed hash method may be used. Further, in the example shown in FIG. 7, the case where the key information is three pieces of information and the attribute value is one piece of information is illustrated, but the present invention is not limited to this, and it is configured by an arbitrary number of pieces of information. Also good.

  The control unit 320 is connected to the communication control I / F unit 301 and the storage unit 310. The control unit 320 includes an internal memory for storing a control program such as an OS, a program defining various processing procedures, and necessary data, and controls various processes. The control unit 320 is, for example, an ASIC, FPGA, CPU, MPU, or the like. In the example illustrated in FIG. 6, the control unit 320 includes a cache determination unit 321, an IR information determination unit 322, and a response processing unit 323.

  When the cache determination unit 321 receives a data request from the client 100, the cache determination unit 321 acquires a service specifying information element included in the received data request, and searches the cache 311 using the acquired service specifying information element as key information. That is, when the cache determination unit 321 receives a data request, the cache determination unit 321 determines whether a combination of each of a plurality of types of specific information included in the data request is stored in the cache 311.

  In addition, the cache determination unit 321 executes processing described below according to the determination result. Specifically, when the cache determination unit 321 determines that the data is not stored in the cache 311, the cache determination unit 321 transmits the combination included in the data request to the database server 200. Thereafter, the cache determination unit 321 receives a combination of specific information and non-specific type information transmitted by the database server 200. Here, when the combination of the specific information and the non-specific type information transmitted by the database server 200 is stored in the cache 311, the cache determination unit 321 stores the stored specific information and non-specific type information. The received combination is stored in the cache 311 in association with the data associated with the combination. On the other hand, when the cache determination unit 321 is not stored in the cache, the cache determination unit 321 associates the data transmitted by the database server 200 with the combination of the specific information and the non-specific type information transmitted by the database server 200, and The received combination is stored in the cache 311.

  If the cache determination unit 321 determines that the data is stored in the cache 311, the cache determination unit 321 acquires data from the cache 311 and transmits the data to the transmission source of the data request. If the cache determination unit 321 determines that the data is not stored in the cache 311, the cache determination unit 321 transmits the data transmitted by the database server 200 to the transmission source of the data request. The cache determination unit 321 is also referred to as “determination unit”, “specific information transmission unit”, “storage unit”, and “data transmission unit”.

  Here, the cache determination unit 321 will more specifically describe a series of processes to be executed according to the search result of the cache 311 after classifying the cases.

  In the following, a process when key information is stored in the cache 311 will be described first. Next, of the processes performed by the cache determination unit 321, a process when key information is not stored in the cache 311 and attribute information can be acquired from the database server 200 will be described. Next, a process performed when the key information is not stored in the cache 311 and attribute information cannot be acquired from the database server 200 among the processes performed by the cache determination unit 321 will be described.

  Of the processes performed by the cache determination unit 321, the process in the case where key information is stored in the cache 311 will be described. In this case, the cache determination unit 321 acquires an attribute value corresponding to the key information stored in the cache 311 from the cache 311 and transmits a data response to the client 100.

  Here, when the expiration date associated with the acquired attribute value has expired, the cache determination unit 321 executes a process of deleting the corresponding record without executing a data response. To do. The cache determination unit 321 identifies all the key information associated with the acquired attribute value from the cache 311 and deletes the identified key information and attribute value. For example, the cache determination unit 321 acquires the record ID “3” included in the reference source record list associated with the attribute information ID “2”, and deletes the record including the acquired record ID from the record table of the cache 311. To do. In this case, after that, a process when key information is not stored in a cache 311 described later is performed.

  This will be specifically described with reference to FIGS. Further, the case where the data request received from the client 100 includes K1 “ServiceName-002”, K2 “UserType-001”, and K3 “AccountType-002” will be described. In this case, the cache determination unit 321 calculates a hash value from “ServiceName-002, UserType-001, AccountType-002” as key information. In the following description, it is assumed that the hash value “B-1” has been calculated. The cache determination unit 321 acquires the record ID “3” by searching the hash table of the cache 311 using the hash value “B-1”. Then, the cache determination unit 321 searches the record table of the cache 311 using the record ID “3”, and obtains the key information included in the record that is the search result and the key information acquired from the data request from the client 100. By comparison, it is determined that the key information to be searched is already stored. Thereafter, the cache determination unit 321 acquires the attribute information ID “2” from the record including the record ID “3” among the records stored in the record table of the cache 311, and acquires the attribute information ID from the attribute information table of the cache 311. The attribute value “data 101” associated with “2” is acquired. Further, the cache determination unit 321 outputs the acquired attribute value “data 101” to the response processing unit 323.

  Here, if the expiration date associated with the attribute information ID “2” has expired, the cache determination unit 321 executes processing for deleting the cache. Thereafter, processing is performed when key information is not stored in a cache 311 described later.

  Next, of the processes performed by the cache determination unit 321, a process when key information is not stored in the cache 311 and attribute information can be acquired from the database server 200 will be described. That is, for example, as described in the processing in the case where key information is stored in the cache 311, the cache determination unit 321 determines that key information to be searched is already stored. At this time, a case where it is determined that the key information acquired from the data request from the client 100 is not stored is applicable.

  In this case, the cache determination unit 321 transmits a data search request including key information acquired from the data request to the database server 200. For example, the cache determination unit 321 transmits a data search request including service identification information elements (E1, E2, E3) to the database server 200. Thereafter, the cache determination unit 321 receives a data response including the partial identification information elements (D1, D2, D3) and the attribute value as a data search result from the database server 200.

  Here, a case where the partial identification information elements (D1, D2, D3) included in the received data response are already stored as key information in the cache 311 of the own device will be described. In this case, the cache determination unit 321 associates the service identification information elements (E1, E2, E3) acquired from the data request with the attribute values already stored in association with the partial identification information elements (D1, D2, D3). The data is stored in the cache 311 in association with each other. To explain with a more detailed example, the cache determination unit 321 uses the service identification information elements (E1, E2, E3) acquired from the data request as key information, and corresponds to the partial identification information elements (D1, D2, D3). In addition, a record including the attribute value that has already been stored and the newly assigned record ID is stored in the record table of the cache 311. In addition, the cache determination unit 321 stores the newly assigned record ID in the hash table in association with the hash value calculated from the service identification information elements (E1, E2, E3). In addition, the cache determination unit 321 selects, among the records stored in the attribute information table of the cache 311, for records including attribute values that are already stored in association with the partial identification information elements (D 1, D 2, D 3). The newly assigned record ID is added to the “reference source record list”. Then, the cache determination unit 321 outputs the attribute values that are already stored in association with the partial identification information elements (D1, D2, D3) to the response processing unit 323.

  This will be specifically described with reference to FIGS. Further, a case where the data request received from the client 100 includes K1 “ServiceName-001”, K2 “UserType-001”, and K3 “AccountType-002” will be described. In this case, the cache determination unit 321 calculates a hash value from K1 “ServiceName-001”, K2 “UserType-001”, and K3 “AccountType-002” which are key information. In the following description, it is assumed that the hash value “2” has been calculated. In this case, since the hash table of the cache 311 does not store the record ID associated with the hash value “2”, the cache determination unit 321 determines that K1 “ServiceName-001” and K2 “UserType-001”. A data search request is transmitted to the database server 200 after including K3 “AccountType-002”. Thereafter, for example, the cache determination unit 321 includes “ServiceName-001, ANY, ANY” and the attribute value “data 1” as the partial identification information elements (D1, D2, D3) from the database server 200. Receive a data response. Thereafter, the cache determination unit 321 searches the hash table of the cache 311 of the own device using the hash value as key information from the partial identification elements (D1, D2, D3). Here, when the record ID “0” is obtained, the cache determination unit 321 determines that the partial identification elements (D1, D2, D3) are already stored as key information. As a result, the cache determination unit 321 acquires the attribute information ID “0” from the record table of the cache 311 using, for example, the record ID “0”. The cache determination unit 321 then adds the newly assigned record ID “4”, K1 “ServiceName-001”, K2 “UserType-001”, and K3 “AccountType-002” to the record table of the cache 311 and attribute information. A new record including ID “0” is stored in the record table of the cache 311. The cache determination unit 321 also stores the hash value calculated by K1 “ServiceName-001”, K2 “UserType-001”, and K3 “AccountType-002” in the hash table of the cache 311. On the other hand, the record ID “4” is stored in association with the hash value “2”. Further, the cache determination unit 321 adds the record ID “4” to the reference source record list of the record including the attribute information ID “0” in the attribute information table of the cache 311. Thereafter, the cache determination unit 321 acquires the attribute value “data 1” associated with the attribute information ID “0” and outputs the attribute value “data 1” to the response processing unit 323.

  8A to 8C are diagrams illustrating an example of information stored in the cache after the record is added by the cache determination unit according to the first embodiment. FIGS. 8-1 to 8-3 correspond to FIGS. 7-1 to 7-3, respectively. In the example illustrated in FIGS. 8A to 8C, the record IDs “5” and “6” are added in addition to the record ID “4”.

  If the expiration date associated with the attribute information ID “2” has expired, the records corresponding to the record IDs “0”, “1”, and “3” included in the reference source record list are The record is deleted from the record table or the hash table of the cache 311 and the record including the attribute information ID “2” is deleted from the attribute information table.

  Here, a case where the partial identification information elements (D1, D2, D3) included in the received data response are not already stored as key information in the cache 311 of the own device will be described. In this case, the cache determination unit 321 associates the partial identification information elements (D1, D2, D3) with the attribute values acquired from the database server 200 and stores them in the cache 311 of the own device. Thereafter, the cache determination unit 321 stores the records in the cache 311 in association with the attribute values stored in association with the partial identification information elements (D1, D2, D3) and the service identification information elements (E1, E2, E3). The attribute value is output to the response processing unit 323.

  This will be specifically described with reference to FIGS. Further, a case where the data request received from the client 100 includes K1 “ServiceName-003”, K2 “UserType-001”, and K3 “AccountType-001” will be described. In this case, the cache determination unit 321 calculates a hash value from K1 “ServiceName-003”, K2 “UserType-001”, and K3 “AccountType-001” that are key information. In the following description, it is assumed that the hash value “3” has been calculated. In this case, since the hash table of the cache 311 does not store the record ID associated with the hash value “3”, the cache determination unit 321 uses K1 “ServiceName-003” and K2 “UserType-001”. A data search request is transmitted to the database server 200 after including K3 “AccountType-001”. Thereafter, for example, the cache determination unit 321 includes “ServiceName-003, UserType-001, ANY” and the attribute value “data 10” from the database server 200 as the partial identification information elements (D1, D2, D3). Receive a data response. Thereafter, the cache determination unit 321 searches the hash table of the cache 311 of the own device using the hash value as key information from the partial identification elements (D1, D2, D3). Here, when the record ID “3” is not obtained, the cache determination unit 321 determines that the partial identification elements (D1, D2, D3) are not already stored as key information. As a result, the cache determination unit 321 stores a record including the newly assigned attribute information ID “3” and the attribute value “data 10” in the attribute information table of the cache 311. In addition, the cache determination unit 321 adds the newly added record “5” to the record table of the cache 311 and the partial identification information elements (D1, D2, D3) “ServiceName-003, UserType-001, A record including “ANY” and attribute information ID “3” is newly stored. Further, the cache determination unit 321 stores the newly stored record ID “5” in association with the hash value “4” in the hash table of the cache 311. Thereafter, the cache determination unit 321 adds the newly added record “5” to the record table of the cache 311 and the key information (K1, K2, K3) “ServiceName-003, UserType-001, A record including “AccountType-001” and attribute information ID “3” is stored. In addition, when the hash value calculated from the key information (K1, K2, K3) included in the data request is “3” with respect to the hash table of the cache 311, the cache determination unit 321 has the hash value “ Record ID “6” is stored in association with “3”. Thereafter, the cache determination unit 321 acquires the attribute value “data 10” from the attribute information of the attribute information ID “3”, and outputs the attribute value “data 10” to the response processing unit 323.

  Finally, of the processes performed by the cache determination unit 321, a process when key information is not stored in the cache 311 and attribute information cannot be acquired from the database server 200 will be described. In this case, the cache determination unit 321 transmits “no data” to the client 100.

  The IR information determination unit 322 transmits an IR information request to the database server 200. For example, the IR information determination unit 322 periodically transmits an IR information request or transmits an IR information request at an arbitrary timing. Further, the IR information determination unit 322 receives the IR information for the IR information request from the database server 200, and thereby the attribute value stored in the user information DB 211 as IR information for the own cache server 300 from the database server 200. Among them, “key information (K1, K2, K3)” indicating the updated attribute value is acquired.

  The IR information determination unit 322 updates the cache 311 using the IR information received from the database server 200. That is, the IR information determination unit 322 updates the cache 311 information. Description will be made using a case where the key information included in the IR information is (K1, K2, K3). When the IR information determination unit 322 stores key information that matches the key information (K1, K2, K3) in the cache 311 of the own device based on the “key information (K1, K2, K3)” of the IR information. In this case, “key information (K1, K2, K3)” and “attribute value” associated with “key information (K1, K2, K3)” are deleted from the cache 311 of the own apparatus. That is, the IR information determination unit 322 executes a cache deletion process described later or causes the cache determination unit 321 to execute a cache deletion process.

  Further, when the IR information determination unit 322 updates the cache 311 based on the IR information, the IR information determination unit 322 transmits the IR information deletion request including the key information included in the IR information to the database server 200, thereby receiving the IR received from the database server 200 The information is deleted from the database server 200.

  This will be specifically described with reference to FIG. Further, the case where the key information (K1, K2, K3) included in the IR information is “ServiceName-001, User Type-001, AccountType-001” will be described. In other words, the description will be made using a case where the attribute value specified by “ServiceName-001, User Type-001, AccountType-001” has been updated or newly stored. In this case, for example, the IR information determination unit 322 first calculates a hash value from the key information. Hereinafter, the case where the hash value “1” is calculated will be described. The IR information determination unit 322 acquires the record ID “1” corresponding to the hash value “1” from the hash table of the cache 311, and acquires the record corresponding to the record ID “1” from the record table of the cache 311. Then, the IR information determination unit 322 deletes the record including the record ID “1” from the record table of the cache 311. In addition, the IR information determination unit 322 performs an operation of deleting the corresponding record from the hash table at this timing. Further, the IR information determination unit 322 acquires the attribute information ID “0” in the record including the acquired record ID “1”, and acquires the record including the attribute information ID “0” from the attribute information table of the cache 311. The record ID “1” is deleted from the reference source record list. Here, in the above-described example, the record IDs “0” and “4” remain in the reference source record list of the records acquired from the attribute information table, and the IR information determination unit 322 records the records acquired from the attribute information table. Do not delete it. However, the IR information determination unit 322 deletes the acquired record itself from the attribute information table when the record ID does not exist in the reference source record ID list by deleting the record ID from the reference source record list. Also, the IR information determination unit 322 transmits an IR information deletion request including “ServiceName-001, User Type-001, AccountType-001” as key information to the database server 200.

  Here, a case where the ANY element is included in the key information (K1, K2, K3) will be described. In this case, a plurality of records may be associated with the attribute value indicated by the key information included in the IR information. Based on this, the IR information determination unit 322 deletes all the key information that refers to the attribute value indicated by the key information included in the IR information, using the reference record list of the attribute value to be deleted.

  For example, the case where the key information (K1, K2, K3) included in the IR information is “ServiceName-003, User Type-001, ANY” will be described. In other words, description will be made using a case where the attribute value specified by “ServiceName-003, User Type-001, ANY” has been updated or newly stored. In this case, the IR information determination unit 322 first calculates a hash value from the key information. Hereinafter, the case where the hash value “4” is calculated will be described. The IR information determination unit 322 acquires the record ID “5” corresponding to the hash value “4” from the hash table of the cache 311, and acquires the record corresponding to the record ID “5” from the record table of the cache 311. Then, the IR information determination unit 322 acquires the attribute information ID “3” included in the acquired record, and acquires a record including the attribute information ID “3” from the attribute information table of the cache 311. Then, the IR information determination unit 322 deletes the records with the record IDs “5” and “6” included in the reference source record list of the records acquired from the attribute information table from the record table of the cache 311. In addition, the IR information determination unit 322 performs an operation of deleting a corresponding record (records with record IDs “5” and “6”) from the hash table at this timing. Also, the IR information determination unit 322 deletes the record with the attribute information ID “3” from the attribute information table. Thereafter, the IR information determination unit 322 transmits an IR information deletion request including “ServiceName-003, User Type-001, ANY” as key information to the database server 200.

  The response processing unit 323 transmits the attribute value received from the cache determination unit 321 to the client 100. Specifically, the response processing unit 323 transmits a data response including the attribute value received from the cache determination unit 321 and key information included in the data request received from the client 100 to the client 100. In the above description, the case where the response processing unit 323 transmits the data response including the key information included in the data request received from the client 100 is described as an example, but the present invention is not limited to this. It is not necessary to include information.

[Processing flow by the cache response unit of the database server]
FIG. 9 is a flowchart illustrating an example of a process flow of the cache response process of the database server according to the first embodiment.

  As shown in FIG. 9, when the cache response unit 221 receives a data search request from the cache server 300 (step S101), the cache response unit 221 acquires key information K1 to KN from the received data search request (step S102).

  Then, the cache response unit 221 obtains a response data determination table from the key information (step S103). Specifically, the cache response unit 221 creates a response data determination table as shown in FIG. 5 based on the acquired key information. Then, the cache response unit 221 acquires all data that matches the response data determination table from the user information DB 211 (step S104). Specifically, the cache response unit 221 searches the user information DB 211 in the own apparatus for data that matches the key information described in the response data determination table, and acquires all the matched data.

  Here, when there is data (Yes at Step S105), the cache response unit 221 sets data having the highest priority in the response data determination table as a data response among the search results (Step S106). Specifically, the cache response unit 221 selects the attribute value that is the highest priority data in the response data determination table as a search result, and the response data determination table used when the attribute value is selected as the search result. A data response including the key information as the partial identification information elements (D1 to DN) and including the attribute value acquired as the search result is transmitted to the cache server 300. On the other hand, when there is no data (No at Step S105), the cache response unit 221 responds that there is no key information (Step S107). That is, the cache response unit 221 transmits a data response indicating that the key information included in the data search request does not exist in the user information DB 211 of the own device to the cache server 300.

[Flow of processing by IR information response unit of database server]
FIG. 10 is a flowchart illustrating an example of a process flow by the IR information response unit according to the first embodiment.

  As shown in FIG. 10, when receiving the IR information request from the cache server 300 (step S201), the IR information response unit 222 acquires the requesting cache server name from the received IR information request (step S202). . That is, the IR information response unit 222 acquires the cache server name of the cache server 300 that is the transmission source of the IR information request.

  Then, the IR information response unit 222 acquires an IR information list from the IR information DB 212 of the own device (step S203). That is, the IR information response unit 222 acquires all IR information corresponding to the acquired cache server name.

  Here, the IR information response unit 222 stores the IR information including the acquired cache server name in the IR information DB 212 when the corresponding data exists in the IR information DB 212 of the own device (Yes in Step S204). If IR information is acquired, the IR information response unit 222 transmits a list of IR information corresponding to the cache server name to the cache server 300 as an IR information response (step S205). In other words, the IR information response unit 222 transmits a list of IR information applied to the cache server 300 that is the transmission source of the IR information request. On the other hand, when the corresponding data does not exist in the IR information DB 212 of the own device (No at Step S204), the IR information response unit 222 responds “no IR information” to the cache server 300 (Step S206). That is, an IR information response indicating that there is no IR information is transmitted to the cache server 300.

[Flow by IR information deletion unit of database server]
FIG. 11 is a flowchart illustrating an example of a flow by the IR information deletion unit of the database server in the first embodiment.

  As shown in FIG. 11, when receiving the IR information deletion request from the cache server 300 (step S301), the IR information deletion unit 223 receives the request source cache server name and the key to be deleted from the received IR information deletion request. Information (K1 to KN) is acquired (step S302).

  Then, the IR information deletion unit 223 deletes the record corresponding to the acquired cache server name and key information (K1 to KN) from the IR information DB 212 of the own device (step S303). That is, when the IR information corresponding to the acquired “cache server name” and “key information” is stored in the IR information DB 212, the IR information deletion unit 223 deletes the corresponding IR information from the IR information DB 212. . Then, the IR information response unit 222 transmits an IR deletion response to the cache server 300 (step S304).

[Processing by the database server user information update unit]
FIG. 12 is a flowchart illustrating an example of a process flow by the user information update unit of the database server in the first embodiment.

  As shown in FIG. 12, when the user information update unit 224 receives registration target data (step S401), the user data update unit 224 operates the target data from the received registration target data (addition, update, deletion, etc.), and records to be operated. “Key information (K1 to KN)” and “attribute value” are acquired (step S402). For example, the user information update unit 224 receives registration target data from the user. Note that the registration target data includes, for example, information for specifying the operation content, key information, attribute values, and the like.

  Then, the user information update unit 224 edits the record of “key information (K1 to KN)” in the user information DB 211 (step S403). Specifically, when the operation content is “addition”, the user information update unit 224 associates “key information” acquired from the registration target data with “attribute value” and stores them in the user information DB 211. . When the operation content is “update”, the user information update unit 224 updates the attribute value of the record to be updated among the records stored in the user information DB 211. When the operation content is “delete”, the user information update unit 224 deletes the record specified by the key information acquired from the registration target data from the user information DB 211.

  Then, the user information update unit 224 acquires a list of cache server names connected to the own device (step S404). Then, the user information update unit 224 acquires the first cache server name in the list of cache server names (step S405). Then, the user information update unit 224 stores the key information part of the information stored in the user information DB 211 in the IR information DB 212 (step S406). That is, the user information DB 211 generates IR information including the acquired cache server name and key information for specifying a record that is an operation target for the user information DB 211, and stores the IR information in the IR information DB 212. For example, when the record is deleted, the user information update unit 224 generates and stores IR information including the key information and the cache server name included in the deleted record.

  Then, the user information update unit 224 determines whether or not the entire list of cache server names has been processed, and if not processed (No at step S407), acquires the next cache server name from the list of cache server names. (Step S408), the process returns to step S406 described above, and the process is repeated. On the other hand, when all the cache server name lists have been processed (Yes at step S407), the user information update unit 224 ends the process.

[Flow of processing by cache judgment unit of cache server]
FIG. 13 is a flowchart illustrating an example of a flow of processing performed by the cache determination unit of the cache server according to the first embodiment.

  As illustrated in FIG. 13, when the cache determination unit 321 receives a data request from the client 100 (step S501), the cache determination unit 321 acquires service specification information elements (E1 to EN) from the received data request, and acquires the acquired service specification information element. As a key information, the hash table of the cache 311 is searched (step S502). For example, the cache determination unit 321 concatenates each of the service identification information elements (E1 to EN) acquired from the data request by a method determined in advance, and sets the concatenated value as x to a hash function h (x) Input. Then, the cache determination unit 321 narrows down the records stored in the hash table of the cache 311 using the hash value calculated by the hash function h (x). Then, the cache determination unit 321 searches the narrowed list of records for records having key information (K1 to KN) that matches the service identification elements (E1 to EN). The cache determination unit 321 has been described using the case where “E1 to EN” is connected as “x”, but the present invention is not limited to this, and any method may be used. For example, the cache determination unit 321 may derive and use “x” by a specific operation with respect to “E1 to EN”, and a function having N values from “E1 to EN” as parameters as a hash function It may be used as

  If there is no record having “E1 to EN” as key information in the hash table of the cache 311 (No in step S503), the cache determination unit 321 uses the service identification information element (E1 to EN) as the key information. A data search request including the following is transmitted to the database server 200 (step S504). And the cache determination part 321 receives a partial specific information element (D1-DN) and an attribute value from the database server 200 as a data response with respect to a data search request (step S505). Here, if the data response from the database server 200 indicates that there is no search result (No at Step S506), the cache determination unit 321 determines that there is no key information (Step S509), and outputs the result to the response processing unit 323 ( Step S514).

  On the other hand, returning to the above-described step S506, if the search result from the database server 200 is a search result (Yes at step S506), the cache determination unit 321 determines that the service specifying information element (E1 to EN) Using the result of the expiration date information calculation method determined in advance as the partial identification information elements (D1 to DN) included in the data response, the attribute value included in the data response from the database server 200, and the expiration date information Then, a cache registration process is performed (step S507). The flow of the cache registration process will be described later with reference to FIG.

  When the cache registration process is completed, the cache determination unit 321 acquires a record registered in the cache 311 as a result of the cache registration process, acquires attribute information from the attribute information ID included in the acquired record (step S508), An attribute value is acquired from the attribute information (step S513). That is, the cache determination unit 321 acquires a record including the attribute information ID included in the acquired record from the attribute information table of the cache 311 and acquires an attribute value included in the acquired record. Then, the cache determination unit 321 outputs the result to the response processing unit 323 (step S514). That is, the cache determination unit 321 outputs the acquired attribute value to the response processing unit 323.

  Returning to step S503 described above, if there is a record having E1 to EN as key information in the hash table of the cache 311 (Yes in step S503), the cache determination unit 321 determines the attribute from the attribute information ID in the record. Information is acquired, and expiration date information is acquired from the attribute information (step S510). If the attribute information has not expired (No at step S511), the cache determination unit 321 acquires the attribute value from the attribute information (step S513), and uses the acquired attribute value to respond to the response processing unit 323. The attribute value is output to (Step S514).

  Returning to step S511 described above, if the attribute information has expired (Yes in step S511), the cache determination unit 321 uses the service identification information elements (E1 to EN) as key information to delete the cache. Processing is performed (step S512). The cache deletion process will be described later with reference to FIG. In the cache deletion process, if a record with the specified key information exists in the hash table of the cache 311, the corresponding record is deleted from the hash table. Thereafter, when the cache deletion process is completed, the cache determination unit 321 continues the process from step S504.

[Flow of cache registration processing]
FIG. 14 is a flowchart illustrating an example of a flow of cache registration processing according to the first embodiment.

  As illustrated in FIG. 14, the cache determination unit 321 acquires service identification information elements (E1 to EN), partial identification information elements (D1 to DN), attribute values, and expiration date information (step S601). Then, the cache determination unit 321 calculates a hash value using the partial identification information elements (D1 to DN) as key information, and searches the hash table of the cache 311 (step S602).

  If there is no record in the hash table of the cache 311 (No at Step S603), the cache determination unit 321 creates new attribute information using the attribute value and the expiration date information (Step S604). For example, the cache determination unit 321 stores a record including the newly assigned attribute information ID in the attribute information table of the cache 311 in addition to the acquired attribute value and expiration date information. Then, the attribute information ID of the created attribute information is acquired (step S605), a new record ID is assigned to the record table of the cache 311, and the key information (D1 to DN) and the created attribute information ID are obtained. In addition to adding records in association with each other, the newly assigned record ID is added to the hash table (step S606).

  Specifically, the cache determination unit 321 concatenates the partial identification information elements (D1 to DN) using a method determined in advance, and sets the concatenated value as x to the hash function h (x). As input. Then, the cache determination unit 321 narrows down the records of the hash table using the hash value calculated by the hash function h (x), and D1 to DN and attribute information ID as the key information of the records in the narrowed list of records. Add a record with. In addition, the cache determination unit 321 adds a new record ID to the hash table.

  Then, the cache determination unit 321 acquires the record ID of the record added to the record table of the cache 311 (step S607), and adds the record ID to the attribute information reference source record list (step S608). That is, the cache determination unit 321 adds the record ID of the record stored in the record table in step S606 described above to the reference source record list of the record stored in the attribute information table in step S604 described above.

  Then, the cache determination unit 321 compares the service specific information elements (E1 to EN) acquired in step S601 and the partial specific information elements (D1 to DN), respectively, and the elements are all equal. (Yes in step S613), the newly added record is returned to the hash table (step S617), and the process is terminated.

  Returning to step S613, if the service identification information elements (E1 to EN) and the partial identification information elements (D1 to DN) are different (No in step S613), the cache determination unit 321 In addition, a record ID is newly assigned, a service identification information element (E1 to EN) as key information is associated with the attribute information ID, and a record is added, and the newly assigned record ID is added to the hash table. (Step S614).

  Then, the cache determination unit 321 acquires the record ID of the record added to the record table of the cache 311 (Step S615), and adds the record ID to the reference record list of attribute information (Step S616). Thereafter, the newly added record is returned to the hash table (step S617), and the process ends.

  Returning to step S603, if a record exists in the record table (Yes in step S603), the cache determination unit 321 acquires attribute information from the attribute information ID in the corresponding record, and is included in the attribute information. The expiration date information is acquired (step S609). Then, when the expiration date information of the attribute information is not expired (No at Step S610), the cache determination unit 321 acquires the attribute information from the attribute information ID of the corresponding record (Step S611), and after Step S613 Continue processing.

  On the other hand, returning to step S610, if the expiration date information of the attribute information is expired (Yes at step S610), a cache deletion process is performed using the partial identification information elements (D1 to DN) as key information. In the cache deletion process, the cache determination unit 321 deletes the record of the specified key information from the hash table when the record of the specified key information exists in the hash table. Thereafter, when the cache deletion processing is completed, the cache determination unit 321 continues the processing from step S604.

[Flow of cache deletion processing]
FIG. 15 is a flowchart illustrating an example of the flow of cache deletion processing according to the first embodiment. Hereinafter, a case where the cache deletion process is performed using the service identification information elements (K1 to KN) as key information will be described as an example. Hereinafter, the cache determination unit 321 will be described as an example. However, the present invention is not limited to this, and the IR information determination unit 322 may execute the cache determination unit 321.

  As illustrated in FIG. 15, the cache determination unit 321 acquires service specifying information elements (K1 to KN) that are key information indicating deletion targets (step S701). Then, the cache determination unit 321 calculates a hash value using the service identification information elements (K1 to KN) as key information, and searches the hash table of the cache 311 (step S702). Then, if there is no record in the hash table (No in step S703), the cache determination unit 321 ends the process because there is no record to be deleted.

  On the other hand, if there is a record in the hash table (Yes at step S703), the cache determination unit 321 determines whether it has been called as deletion based on the expiration date (step S704). If the deletion is not due to expiration (No in step S704), the cache determination unit 321 determines whether there is an ANY element in the records corresponding to the key information K1 to KN (step S705). If there is no ANY element in the key information K1 to KN (No at Step S705), the cache determination unit 321 acquires the attribute information ID from the record corresponding to the key information K1 to KN (Step S706). A reference source record list is acquired from the attribute information indicated by the information ID (step S707). That is, the cache determination unit 321 acquires a record including the attribute information ID from the attribute information table, and acquires a reference source record list included in the acquired record.

  Then, the cache determination unit 321 deletes the record from the reference source record list (step S708). That is, the cache determination unit 321 deletes the record IDs corresponding to the key information K1 to KN from the record IDs existing in the reference source record list. If the reference source record list becomes an empty list as a result of step S708 (Yes at step S709), the cache determination unit 321 deletes attribute information whose reference source record list is empty (step S709). S710). That is, the cache determination unit 321 deletes a record whose reference source record list is empty from the attribute information table. Then, the cache determination unit 321 uses the key information K1 to KN to delete the record from the record table and delete the record ID from the hash table (step S711). On the other hand, returning to step S709, if the reference source record list is not an empty list (No in step S709), the processing from step S711 is continued.

  Next, returning to step S704, the case of deletion due to expiration (Yes in step S704) or the case of returning to step S705 and having an ANY element in the key information (Yes in step S705) will be described. Note that the deletion due to the expiration date corresponds to, for example, the case where the cache deletion process is executed in step S511 in FIG.

  In this case, the cache determination unit 321 acquires the attribute information ID from the corresponding record (step S712), and acquires the reference source record list from the attribute information indicated by the attribute information ID (step S713). Then, the cache determination unit 321 acquires the first record ID of the reference source record list (step S714). Thereafter, the cache determination unit 321 acquires the record indicated by the acquired record ID from the record table of the cache 311, and acquires the acquired record from the record table when the key information of the acquired record matches the key information K1 to KN. In addition to deleting, the record ID is deleted from the hash table (step S715).

  If all the record IDs in the reference source record list have not been deleted from the hash table (No in step S716), the cache determination unit 321 acquires the next record ID in the reference source record list (step S717). The process of step S715 is continued.

  Returning to step S716, when the records indicated by all record IDs of the reference source records are deleted from the hash table (Yes in step S716), the cache determination unit 321 deletes the attribute information (step S718), End the process. That is, the cache determination unit 321 deletes the record including the attribute information ID acquired in step S712 from the attribute information table.

[Flow of processing by IR information determination unit of cache server]
FIG. 16 is a flowchart illustrating an example of a processing flow by the IR information determination unit of the cache server according to the first embodiment.

  As shown in FIG. 16, the IR information determination unit 322 periodically transmits an IR information request to the database server 200 (step S801), and receives a list of IR information from the database server 200 (step S802).

  Then, the IR information determination unit 322, when the received IR information list exists (Yes at Step S803), that is, when the IR information is received in the IR information response that received the IR information from the database server 200, IR information at the head of the IR information list is acquired (step S804), and key information K1 to KN are acquired from the IR information (step S805). Then, the IR information determination unit 322 performs the cache deletion process shown in FIG. 15 using the key information K1 to KN (step S806), and after the cache deletion process is finished, An information deletion request is transmitted (step S807). That is, the IR information determination unit 322 gives an instruction to delete the IR information that has been applied to the cache server 300 based on the fact that the cache server 300 has deleted the records including the key information K1 to KN. Send to.

  After that, when all the IR information has not been processed (No at Step S808), the IR information determination unit 322 acquires the next IR information from the list of IR information (Step S809), and performs the processing from Step S805. repeat.

  On the other hand, if the list of IR information does not exist (No at Step S803) or if all IR information has been processed by returning to Step S808 (Yes at Step S808), the IR information determination unit returns to Step S803. In step 322, the process ends.

[Flow of processing by the response unit of the cache server]
FIG. 17 is a flowchart illustrating an example of a flow of processing by the response unit of the cache server according to the first embodiment.

  As shown in FIG. 17, the response processing unit 323 assembles the attribute information designated by the cache determination unit 321 as a response to the client (step S901). That is, the response processing unit 323 generates a data response including the attribute value received from the cache determination unit 321 and the key information included in the data request received from the client 100, or a data response indicating that there is no key information. Or generate. In the above description, the case where the response processing unit 323 transmits the data response including the key information included in the data request received from the client 100 is described as an example, but the present invention is not limited to this. It is not necessary to include information.

  Then, the response processing unit 323 transmits the generated data response to the client 100 (step S902), and ends the process.

[Effects of Example 1]
For each piece of data specified by at least one type of specific information, specific information for specifying data and a non-specific type that is a type not used when specifying data among a plurality of types of specific information The information is stored in association with the combination with the specific type information. Further, the cache server 300 stores at least a part of the data stored in the database server 200 in association with at least one of a combination of specific information and non-specific type information and a combination of plural types of specific information. A cache 311 is provided. Here, when the cache server 300 receives the data request, the cache server 300 determines whether a combination of each of a plurality of types of specific information included in the data request is stored in the cache. Are transmitted to the database server 200. When the database server 200 receives the combination that is the combination transmitted by the cache server 300, the database server 200 receives the combination of the specific information corresponding to the received combination that is the received combination and the non-specific type information, the specific information, and the non-specific type. Data associated with the combination with the information is acquired from the storage unit and responds to the cache server 300. Further, when the combination of the specific information and the non-specific type information transmitted from the database server 200 is stored in the cache 311, the cache server 300 stores the combination of the stored specific information and the non-specific type information. The received combination is stored in the cache 311 in association with the data associated with. If the database server 200 is not stored in the cache 311, the database server 200 is associated with the data transmitted by the database server 200 and a combination of specific information and non-specific type information transmitted by the database server 200. The received combination is stored in the cache 311. When the cache server 300 determines that the data is stored in the cache 311, the cache server 300 acquires the data from the cache 311 and transmits the data to the transmission source of the data request. The data transmitted by the database server 200 is transmitted to the data request transmission source. As a result, it becomes possible to search appropriately.

  Specifically, a database server having a data structure having an ANY element and a cache server can be combined. In addition, it is possible to save the cache capacity even under the situation where the set of specific information necessary for extracting data from the database server is unknown at the time of reception, it is possible to save the cache once. It is possible to prevent a decrease in search performance by being extracted with.

  That is, for example, in the cache 311, as a result of data being shared with a plurality of key information, the capacity of the cache 311 can be saved. In addition, the cache server 300 can determine whether or not data is stored in the cache in one search, and can prevent a decrease in search performance.

  Further, in the database server 200, a plurality of key information can be expressed by one record {E1, ANY,... ANY}, and consumption of the storage device of the database server 200 can be prevented. Further, in the cache server 300, as a result of associating a plurality of attribute values with a plurality of key information, it is possible to prevent redundant storage devices such as a memory. As described above, according to the first embodiment, the attribute value is shared by a plurality of pieces of key information, so that the capacity of the cache 311 can be saved.

  Further, as described above, whether or not a combination of each of a plurality of types of specific information included in the data request is stored in the cache 311 is determined using the hash value to determine whether the combination is stored in the cache 311. Judgment can be made quickly.

  Further, the database server 200 stores, for each data, a combination of the specific information belonging to the specific information type used when specifying the data and the non-specific type information in association with each other. In addition, when the database server 200 receives the reception combination transmitted by the cache server 300, the database server 200 selects one of the combinations of specific information and non-specific type information corresponding to the combination, and selects the specific information and non-specific information. A combination with the type information and data stored in association with the selected combination are transmitted. As a result, the database server 200 stores the record including the ANY element, so that the capacity used in the storage unit can be saved.

  In addition to the first embodiment, when the cache server 300 receives a combination including non-specific type information and an attribute value, each specific information that may be applied to the non-specific type information using the received attribute value A case where the information is shared with each combination in which specific type information is replaced will be described.

  That is, for example, when the cache server 300 receives a combination including an ANY element, each combination is generated by replacing the ANY element included in the received combination with each specific information that may be applied to the ANY element. Each of the combinations may be stored in the cache 311 in association with the received data. Below, a different point from Example 1 is demonstrated and description is abbreviate | omitted suitably about another point.

[Configuration of Cache Server in Embodiment 2]
The cache server according to the second embodiment is the same as the first embodiment except for the cache determination unit 321b, and a description thereof is omitted.

  In the second embodiment, the cache determination unit 321b obtains service identification information elements (E1, E2, E3) from the data request received from the client 100, and uses this as key information for attribute information stored in the cache 311. Search for. The cache determination unit 321b performs a process according to the result of the cache 311 search and makes a response.

  A process when key information is not stored in the cache 311 and attribute information can be acquired from the database server 200 will be described. That is, a case where key information acquired from a data request from the client 100 is not stored in the cache 311 will be described.

  In this case, the cache determination unit 321b transmits a data search request including key information acquired from the data request to the database server 200. For example, the cache determination unit 321 transmits a data search request including service identification information elements (E1, E2, E3) to the database server 200. Thereafter, the cache determination unit 321 receives a data response including the partial identification information elements (D1, D2, D3) and the attribute value as a data search result from the database server 200.

  Here, the cache determination unit 321b determines that the service specification information element to be developed in advance in the cache 311 when the partial specification information elements (D1, D2, D3) already exist in the cache 311 of the own device. (E1, E2, E3) and the partial identification information elements (D1, D2, D3) are determined not to correspond to each other, and the cache 311 is deleted using the partial identification information elements (D1, D2, D3). Thus, the process in the case where the partial identification information elements (D1, D2, D3) do not already exist in the cache 311 is executed. The processing when the partial identification information elements (D1, D2, D3) are not already present in the cache 311 will be described later.

  In the second embodiment, when an ANY element is obtained, each combination of specific information that may be applied to the ANY element is generated and associated with the received attribute value in the cache 311. It will be registered in advance. As a result, when inquiring to the database server 200, no record corresponding to the cache 311 is stored, and when no inquiry is made to the database server 200, all records corresponding to the cache 311 are stored. It will be the case. Based on this, when the cache determination unit 321b has inquired and the partial identification information elements (D1, D2, D3) received from the database server 200 already exist in the cache 311 of the own device, A series of processing is executed after it is determined to be strange and deleted from the cache 311.

  This will be specifically described with reference to FIG. Description will be made using a case where the key information (K1, K2, K3) acquired from the data request is “ServiceName-001, UserType-001, AccountType-002”. The cache determination unit 321b calculates a hash value from the key information. Hereinafter, the case where the hash value calculated by the cache determination unit 321b is “2” will be described. Here, since the cache ID of the cache 311 does not have a record ID associated with the hash value “2”, the cache determination unit 321b sends a data search request including key information (K1, K2, K3) to the database. Transmit to server 200. For example, the cache determination unit 321b includes “ServiceName-001, ANY, ANY” as the partial identification information elements (D1, D2, D3) from the database server 200, and a data response including the attribute value “data 1”. Receive. Thereafter, the cache determination unit 321 searches the hash table of the cache 311 of the own device using the partial identification elements (D1, D2, D3) as key information. Here, when the record ID “0” is obtained, the cache determination unit 321 acquires the attribute information ID “0” associated with the record ID “0” from the record table of the cache 311. Then, the cache determination unit 321b acquires the record including the attribute information ID “0” from the attribute information table, acquires the record ID “0” “1” included in the reference source record list of the acquired record, and records ID A record including “0” and “1” is deleted from the record table of the cache 311. In addition, the cache determination unit 321b deletes the record including the attribute information ID “0” from the attribute information table.

  A process when key information is not stored in the cache 311 and the partial identification information elements (D1, D2, D3) included in the data response received from the database server 200 are not present in the cache 311 will be described. Hereinafter, processing after receiving a data response from the database server 200 will be described.

  The cache determination unit 321b performs a cache registration process on the partial identification information elements (D1, D2, D3) received from the database server 200 and the attribute values acquired from the database server.

  In addition, the cache determination unit 321 b acquires a column that is an ANY element among the partial identification information elements received from the database server 200. Then, the cache determination unit 321b acquires a list of service identification information element values that may enter the ANY element determined in advance from the position of each column where the ANY element exists. Then, the cache determination unit 321b calculates a list of service specific information elements obtained by developing the ANY element by combining the list of service specific information elements in each column. Thereafter, the cache determination unit 321b registers a record in which the attribute information already stored in the cache 311 is associated with a combination of each service specification information element (E1, E2, E3) in the list of calculated service specification information elements. . That is, the cache determination unit 321b executes a cache registration process for each of the calculated list of service specifying information elements and the attribute value acquired from the database server 200. At this time, the cache determination unit 321b adds record IDs corresponding to the calculated list of service specific information elements to the reference source record list of the attribute information table of the cache 311. Thereafter, the cache determination unit 321 b outputs the attribute value received from the database server 200 to the response processing unit 323.

  A specific description will be given with reference to FIGS. FIG. 18A to FIG. 18C are diagrams illustrating an example of information stored in the cache according to the second embodiment. In the example illustrated in FIGS. 18A to 18C, the cache 311 includes a hash table, a record table, and an attribute information table. 18A to 18C illustrate an example of the hash table, the record table, and the attribute information table according to the second embodiment. In the following description, the cache determination unit 321b uses the case where the data request received from the client 100 includes “ServiceName-001, UserType-001, AccountType-001” in the key information (K1, K2, K3). I will explain. In the following description, the cache determination unit 321b includes “ServiceName-001, ANY, ANY” as the partial identification information elements (D1, D2, D3) from the database server 200, and includes the attribute value “data 1”. A case where a response is received will be described.

  In this case, the cache determination unit 321b confirms the cache 311 of the own device using the partial identification elements (D1, D2, D3) included in the data response from the database server 200 as key information. That is, the cache determination unit 321b calculates a hash value from the partial identification elements (D1, D2, D3), and searches the hash table of the cache 311 using the calculated hash value. In the following description, it is assumed that the calculated hash value is “0”. In the example illustrated in FIG. 18A, there is no record ID in the hash value “0” of the hash table. In this case, the cache determination unit 321 b stores a record including the newly assigned attribute information ID “0” and the attribute value “data 1” in the attribute information table of the cache 311. Then, the cache determination unit 321b, the newly assigned record ID “0”, the partial identification information elements (D1, D2, D3) “ServiceName-001, ANY, ANY” and the attribute information ID “0” as key information. Are stored in the record table of the cache 311. Further, the cache determination unit 321b adds the record ID “0” to the reference source record list of the record stored in the attribute information table including the attribute information ID “0”, and the hash value of the hash table of the cache 311 The record ID “0” is stored in association with “0”.

  In addition, the cache determination unit 321b lists the values of the service specific elements determined in advance among the elements D2 and D3, which are elements that are ANY among the partial specific elements (D1, D2, and D3). Get each. FIG. 19 is an example of a list of service specific element values determined in advance in the second embodiment. In the example illustrated in FIG. 19, when the partial specifying element “D2” is ANY, it indicates that “UserType-001” or “UserType-002” can be taken, and when D3 is ANY, , “AccountType-001” or “AccountType-002”. For example, the list illustrated in FIG. 19 is generated in advance, or is appropriately generated by the cache determination unit 321b. Here, the cache determination unit 321b calculates all combinations of ANY columns as a list of service specifying elements. For example, “ServiceName-001” that is the value of the element (D1) that is not ANY and the list of service specific element values of D2 and D3 shown in FIG. 19 are used to calculate each combination described below. The list shown in FIG. 19 is information unique to the database system, and is stored in the cache server.

Combination (1) {ServiceName-001, UserType-001, AccountType-001},
Combination (2) {ServiceName-001, UserType-001, AccountType-002},
Combination (3) {ServiceName-001, UserType-002, AccountType-001},
Combination (4) {ServiceName-001, UserType-002, AccountType-002}

  In the following description, it is assumed that the hash values calculated from the above combinations (1) to (4) are “1” to “4”, respectively. In this case, for example, the cache determination unit 321b adds a record including the record ID “1”, the combination (1) as key information, and the attribute information ID “0” to the record table of the cache 311. The record ID “1” is added to the reference source record list of the record stored in the attribute information table including the attribute information ID “0”, and the record ID “1” is stored in association with the hash value “1” of the hash table. To do. Similarly, the cache determination unit 321b executes processing for other combinations. 20A to 20C are diagrams illustrating an example of information stored in the cache after the record registration processing by the cache determination unit according to the second embodiment. 20-1 to 20-3 correspond to the hash table, the record table, and the attribute information table of the cache 311 respectively.

[Flow of cache registration processing]
FIG. 21 is a flowchart illustrating an example of a cache registration process according to the second embodiment. Of the series of processes shown in FIG. 21, S1001 to S1003, S1005 to S1010, and S1019 correspond to steps S601 to S603, S604 to S608, S613, and S617 in FIG. Hereinafter, differences from the series of processes illustrated in FIG. 14 will be described, and similar points will be omitted as appropriate.

  As illustrated in FIG. 21, the cache determination unit 321b acquires service identification information elements (E1 to EN), partial identification information elements (D1 to DN), attribute values, and expiration date information (step S1001). The hash table of the cache 311 is searched using the partial identification information elements (D1 to DN) as key information (step S1002).

  If there is no record in the hash table of the cache 311 (No at Step S1003), the record is stored in the record table or attribute information table of the cache 311 (Steps S1005 to S1009). Thereafter, the cache determination unit 321b compares each element of the service specific information element (E1 to EN) and the partial specific information element (D1 to DN), and when all the elements are equal (Yes in step S1010), The newly added record is returned to the hash table (step S1019), and the process ends.

  On the other hand, returning to step S1010, the cache determination unit 321b describes a case where the service specifying information elements (E1 to EN) and the partial specifying information elements (D1 to DN) are different (No in step S1010). The cache determination unit 321b acquires a list of service specification information element values corresponding to the ANY column among the partial specification information elements (D1 to DN) (step S1011). For example, the cache determination unit 321b acquires a list of service specifying information elements based on the table shown in FIG. 19 generated in advance.

  Then, the cache determination unit 321b indicates the ANY element based on the list of service identification information element values of all columns that are ANY elements and the service identification information of columns that are non-ANY elements. A list of all combinations of service specifying information elements is acquired (step S1012). Then, the cache determination unit 321b acquires the first service identification information element in the list of all combinations of service identification information elements (step S1013).

  Then, the cache determination unit 321b adds a record in the hash table of the cache 311 in association with the service identification information elements (E1 to EN) and the attribute information ID as key information (step S1014). That is, the cache determination unit 321b includes the acquired combination as key information, includes the attribute information ID assigned in step S1005, and stores the record including the newly assigned record ID in the record table of the cache 311.

  Then, the cache determination unit 321b acquires the record ID of the record added to the record table of the cache 311 (step S1015), and adds the record ID to the reference record list of attribute information (step S1016).

  When the list of all combinations of service specific information elements has been processed (Yes at Step S1017), the cache determination unit 321b corresponds to the service specific information elements (E1 to EN) newly added to the hash table. The record is returned (step S1019), and the process ends. On the other hand, returning to step S1017, when not processing all the list of all combinations of service specific information elements (No at step S1017), the cache determination unit 321b determines from the list of all combinations of service specific information elements, The next service specifying information element is acquired, and step S1014 and subsequent steps are continued (step S1018).

  Returning to step S1003, the case where a record exists in the hash table (Yes in step S1003) will be described. In this case, the cache determination unit 321b performs a cache deletion process using the partial identification information elements (D1 to DN) as key information (step S1004). Note that the flow of the cache deletion process is the same as that in the first embodiment, and a description thereof will be omitted. When the cache deletion process is completed, the cache determination unit 321b continues the process from step S1005.

[Effect of Example 2]
As described above, according to the second embodiment, the cache server 300 generates each combination in which the non-specific type information included in the combination is replaced with each specific information that may be applied to the non-specific type information. Each of the generated combinations is also stored in the cache 311 in association with the data transmitted by the database server 200. As a result, after that, each combination of specific information corresponding to the ANY element is stored in the cache 311 in advance in the cache server 300, and the hit rate of the cache 311 can be improved.

  In the third embodiment, the user information DB 211c of the database server 200 further stores non-specific element information in association with key information and attribute values including a plurality of elements. That is, in the following, for each data, the database server 200 includes a combination of a plurality of types of specific information for which data is specified, and non-specific type information indicating a non-specific type included in the type of specific information included in the combination. A case of storing the combination will be described. In the following description, points other than those where there are differences from the first embodiment will be omitted as appropriate.

[Configuration of Database Server in Embodiment 3]
The user information DB 211c further stores non-specific element information in association with key information and attribute values including a plurality of elements. That is, the user information DB 211c stores, for each data, a combination of a plurality of types of specific information for which data is specified and a non-specific type information indicating a non-specific type included in the type of specific information included in the combination. To do. Here, the non-specific element information is information indicating a service specific information element treated as ANY among the key information.

  FIG. 22 is a diagram illustrating an example of information stored in the user information DB according to the third embodiment. In the example illustrated in FIG. 22, the user information DB 211c stores “key information (K1, K2, K3)”, “non-specific element information (K2, K3)”, and “attribute values” in association with each other. In the example shown in FIG. 22, the case where “K2” or “K3” is an ANY element is stored as non-specific element information, but the present invention is not limited to this, and arbitrary information may be used. .

  In the example illustrated in FIG. 22, the user information DB 211c includes key information “ServiceName-001, UserType-001, AccountType-001”, non-specific element information “K2: ANY”, “K3: ANY”, and an attribute value “data 1”. "Is stored. That is, the user information DB 211c stores that “UserType-001” and “AccountType-001” among the service specifying information elements are ANY elements. That is, the user information DB 211c stores that the attribute value “data 1” is shared with “ServiceName-001, ANY, ANY”.

  In addition, the user information DB 211c stores a record that includes key information “ServiceName-002, UserType-001, AccountType-001” and an attribute value “data 100” and has no data in the non-specific element information. In other words, the user information DB 211c stores that the attribute value “data 100” is not shared with key information other than “ServiceName-002, UserType-001, AccountType-001”. In other words, the user information DB 211c indicates that the attribute value is not shared when there is no non-specific element information “ANY”.

  The IR information DB 212c stores IR information. FIG. 23 is a diagram illustrating an example of information stored in the IR information DB according to the third embodiment. As shown in FIG. 23, the IR information DB 212c records “cache server A, ServiceName-001, UserType-001, AccountType-001” and the like as “cache server name and key information (K1, K2, K3)”. .

  When the cache response unit 221c receives the data search request from the cache server 300, the key information is stored in the user information DB 211c using the service identification information elements (E1, E2, E3) included in the received data search request as key information. Search whether or not. Here, the non-specific element information is stored in the user information DB 211c as described above. Based on this, if there is data, the cache response unit 221c replaces the value of the column whose non-specific element information is ANY with the ANY element, and then replaces the key information with the ANY element. Is transmitted to the cache server 300 together with the attribute value as a partial identification information element.

  The user information DB 211c shown in FIG. 22 will be further described as an example. Further, the case where the key information included in the data search request from the cache server 300 is “ServiceName-001, UserType-001, AccountType-001” will be described. In this case, the cache response unit 221c transmits the partial identification information element “ServiceName-001, ANY, ANY” and the attribute value “data 1” as a data response.

  That is, when the cache response unit 221c receives the reception combination transmitted by the cache server 300, the cache response unit 221c acquires a combination of a plurality of types of specific information that matches the combination and a combination of non-specific type information from the storage unit, and acquires the specified After the specific information indicated by the acquired non-specific type information in each piece of information is replaced with non-specific type information, the combination after replacement and the data stored in association with the combination are transmitted.

[Configuration of Cache Server in Embodiment 3]
The IR information determination unit 322c updates the cache 311 using the IR information received from the database server 200. For example, the case where “key information (K1, K2, K3)” is included in the received IR information will be described. In this case, if the key information that matches the key information included in the received IR information exists in the cache 311 of the own device, the IR information determination unit 322c corresponds to the “key information (K1, K2, K3)”. Then, the cache 311 is updated by deleting the attribute value associated with the corresponding key information.

  Here, the IR information determination unit 322c deletes all the key information referring to the attribute value to be deleted using the reference source record list associated with the attribute value to be deleted. Then, after deleting the record from the cache 311, the IR information determination unit 322 c deletes the IR information from the database server 200 based on the “key information” included in the received IR information. That is, the IR information determination unit 322c transmits an IR information deletion request including key information included in the received IR information to the database server 200.

  This will be specifically described with reference to FIG. Description will be made using a case where the key information (K1, K2, K3) included in the IR information is “ServiceName-001, User Type-001, AccountType-001”. In other words, the description will be made using the case where the attribute values indicated by “ServiceName-001, User Type-001, AccountType-001” are updated in the database server 200.

  In this case, the IR information determination unit 322c deletes all the records that share the attribute value because the corresponding key information may have an arbitrary column shared with other key information. Specifically, the IR information determination unit 322c calculates a hash value from “ServiceName-001, User Type-001, and AccountType-001”. In the following description, it is assumed that the calculated hash value is “1”. In this case, the IR information determination unit 322c acquires the record ID “1” associated with the hash value “1” from the hash table of the cache 311 and acquires a record including the record ID “1” from the record table. Then, the IR information determination unit 322c acquires the attribute information ID “0” in the acquired record, acquires a record including the attribute information ID “0” from the attribute information table, and refers to the reference source record included in the acquired record Record IDs “0”, “1”, “4” shown in the list are acquired. Then, the IR information determination unit 322c deletes the record including the record IDs “0”, “1”, and “4” from the record table, and deletes the record including the attribute information ID “0” from the attribute information table. Then, the IR information determination unit 322c transmits an IR information deletion request including “ServiceName-001, User Type-001, AccountType-001” as key information to the database server 200.

[Flow of processing by cache response unit of database server in Embodiment 3]
FIG. 24 is a flowchart illustrating an example of a process flow by the cache response unit of the database server according to the third embodiment.

  As illustrated in FIG. 24, when the cache response unit 221c receives a data search request from the client 100 (step S1101), the cache response unit 221c acquires key information K1 to KN from the received data search request (step S1102).

  Then, the cache response unit 221c searches the user information DB 211c in the own device for a record having the received key information, and obtains matching data (step S1103). Here, when there is data (Yes in step S1104), the cache response unit 221c replaces the non-specific element information column of the search result with “ANY element” and responds with the partial specific information element and the attribute value ( Step S1105). That is, the cache response unit 221c replaces the element corresponding to the non-specific element information “ANY” among the key information included in the record obtained as the search result with the ANY element, and then replaces the key. A data response including the information and the attribute value is transmitted to the cache server 300.

  On the other hand, returning to step S1104, if there is no data in the user information DB 211c in the own apparatus (No in step S1104), the cache response unit 221c responds that there is no key information (step S1106).

[Flow of Cache Deletion Processing in Embodiment 3]
FIG. 25 is a flowchart illustrating an example of the flow of cache deletion processing according to the third embodiment.

  As illustrated in FIG. 25, the IR information determination unit 322c acquires service identification information elements (K1 to KN) that are key information indicating the deletion target (step S1201). Then, the IR information determination unit 322c calculates a hash value using the acquired K1 to KN as key information, and searches the hash table of the cache 311 (step S1202).

  Here, when there is no record corresponding to the key information K1 to KN in the hash table (No in step S1203), the IR information determination unit 322c ends the process because there is no record to be deleted.

  On the other hand, when the records corresponding to the key information K1 to KN exist in the hash table in the own device (Yes at Step S1203), the IR information determination unit 322c acquires the attribute information ID from the corresponding record (Step S1203). In step S1204, a reference source record list is acquired from the attribute information indicated by the attribute information ID (step S1205). Then, the IR information determination unit 322c acquires the first record ID of the reference source record list (step S1206).

  Then, the IR information determination unit 322c deletes the record indicated by the acquired record ID from the record table and deletes the record ID of the deleted record from the hash table (step S1207). Then, if all the record IDs in the reference source record list have not been deleted from the hash table (No in step S1208), the IR information determination unit 322c acquires the next record ID in the reference source record list (step S1209). ), The process of step S1207 is continued. On the other hand, returning to step S1208, when the records indicated by all record IDs of the reference source records are deleted from the hash table (Yes at step S1208), the records acquired from the attribute information table are deleted (step S1210), and processing is performed. Exit.

[Effect of Example 3]
As described above, according to the third embodiment, the database server 200 determines, for each data, a combination of a plurality of types of specific information for which data is specified and a non-specific type included in the types of specific information included in the combination. The combination with the non-specific type information to be shown is stored. In addition, when the database server 200 receives the reception combination transmitted by the specific information transmission unit, the database server 200 acquires a combination of a plurality of types of specific information that matches the combination and a combination of non-specific type information from the storage unit, and acquires the specific After the specific information indicated by the acquired non-specific type information in each piece of information is replaced with non-specific type information, the combination after replacement and the data stored in association with the combination are transmitted. As a result, the search process in the database server 200 can be executed quickly.

  Although the embodiments of the present invention have been described so far, the present invention may be implemented in other embodiments besides the above-described embodiments. Therefore, other embodiments will be described below.

  For example, in the above-described third embodiment, when the cache server 300 receives a combination including non-specific type information, the specific type may be applied to each specific information that may be applied to the non-specific type information included in the specific information. Each combination in which information is replaced may be transmitted to the database.

[System configuration]
Also, among the processes described in this embodiment, all or part of the processes described as being performed automatically can be performed manually, or the processes described as being performed manually can be performed. All or a part can be automatically performed by a known method. In addition, the processing procedures, control procedures, specific names, and information including various data and parameters shown in the above-mentioned documents and drawings (FIGS. 1 to 25) are arbitrarily changed unless otherwise specified. be able to.

  Further, each component of each illustrated apparatus is functionally conceptual, and does not necessarily need to be physically configured as illustrated. That is, the specific form of distribution / integration of each device is not limited to the one shown in the figure, and all or a part of the distribution / integration may be functionally or physically distributed in arbitrary units according to various loads or usage conditions. Can be integrated and configured. For example, a part of the cache server 300 and the database server 200 may be integrated.

[program]
FIG. 26 is a diagram showing that the information processing by the control program for executing the processing by the database system by the program is specifically realized by using a computer. As illustrated in FIG. 26, the computer 3000 includes, for example, a memory 3010 and a CPU (Central Processing Unit) 3020. Each part of the computer 3000 is connected by a bus 3100.

  The memory 3010 includes a ROM 3011 and a RAM 3012 as illustrated in FIG. The ROM 3011 stores a boot program such as BIOS (Basic Input Output System).

  Here, as illustrated in FIG. 26, the hard disk drive 3080 stores, for example, an OS 3081, an application program 3082, a program module 3083, and program data 3084. In other words, the control program according to the disclosed technique is stored in, for example, the hard disk drive 3080 as the program module 3083 in which instructions executed by the computer are described. Specifically, a program module in which each procedure for executing the same information processing as the control unit 220 and the control unit 320 described in the above embodiment is described is stored in the hard disk drive 3080.

  Further, like the data stored in the storage unit 210 and the storage unit 310 described in the above embodiment, data used for information processing by the control program is stored as, for example, the hard disk drive 3080 as the program data 3084. The CPU 3020 reads the program module 3083 and program data 3084 stored in the hard disk drive 3080 to the RAM 3012 as necessary, and executes various procedures.

  Note that the program module 3083 and the program data 3084 related to the control program are not limited to being stored in the hard disk drive 3080. For example, the program module 3083 and the program data 3084 may be stored in a removable storage medium. In this case, the CPU 3020 reads data via a removable storage medium such as a disk drive. Similarly, the program module 3083 and the program data 3084 related to the control program may be stored in another computer connected via a network (LAN (Local Area Network), WAN (Wide Area Network), etc.). . In this case, the CPU 3020 reads various data by accessing another computer via the network interface 3070.

[Others]
Note that the control program described in this embodiment can be distributed via a network such as the Internet. The control program can also be executed by being recorded on a computer-readable recording medium such as a hard disk, a flexible disk (FD), a CD-ROM, an MO, and a DVD, and being read from the recording medium by the computer.

100 Client 200 Database Server 201 Communication Control I / F Unit 210 Storage Unit 211 User Information DB
212 IR Information DB
220 Control unit 221 Cache response unit 222 IR information response unit 223 IR information deletion unit 224 User information update unit 300 Cache server 301 Communication control I / F unit 310 Storage unit 311 Cache 320 Control unit 321 Cache determination unit 322 IR information determination unit 323 Response processing unit 501 Network device 502 User 503 Network device 504 Authentication server 505 Network control server

Claims (5)

For each data, a combination of specific information for specifying the data and non-specific type information indicating a non-specific type that is a type that is not used when specifying the data among a plurality of types of the specific information A database having a storage unit for storing;
A cache that stores at least one of a combination of the specific information and the non-specific type information and a combination of a plurality of types of the specific information in association with at least a part of the data stored in the storage unit. A cache server having
The cache server is
When a data request is received, a determination unit that determines whether a combination of each of the plurality of types of specific information included in the data request is stored in the cache;
A specific information transmission unit that transmits a combination included in the data request to the database when it is determined that the data is not stored by the determination unit;
The database is
When the combination transmitted by the specific information transmitting unit is received, the combination of the specific information corresponding to the received combination that is the received combination and the non-specific type information, and the combination of the specific information and the non-specific type information A cache response unit that acquires the associated data from the storage unit and transmits the data to the cache server;
The cache server is
When the combination of the specific information and the non-specific type information transmitted by the cache response unit is stored in the cache, it corresponds to the combination of the stored specific information and the non-specific type information The received combination is stored in the cache in association with the data to be attached, and is transmitted by the cache response unit in association with the data transmitted by the cache response unit when not stored in the cache. A storage unit that stores the combination of the specific information and the non-specific type information and the reception combination in the cache;
When it is determined that the data is stored by the determination unit, the data is acquired from the cache and transmitted to the transmission source of the data request, and when it is determined that the data is not stored by the determination unit And a data transmission unit that transmits the data transmitted by the cache response unit to a transmission source of the data request. The storage unit of the database stores, for each data, a combination of the specific information belonging to the specific information type used when specifying the data and a combination of the non-specific type information,
When the cache response unit receives the reception combination transmitted by the specific information transmission unit, the cache response unit selects one of the combinations of the specific information and the non-specific type information corresponding to the combination, and the selected specific The database system according to claim 1, wherein a combination of information and the non-specific type information and the data stored in association with the selected combination are transmitted. The storage unit of the database includes, for each data, a combination of a plurality of types of the specific information for which the data is specified, and a non-specific type indicating specific information among the types of specific information included in the combination. Memorize combinations with specific types of information,
When the cache response unit receives the reception combination transmitted by the specific information transmission unit, the cache response unit acquires the combination of the specific information that matches the combination and the combination of the non-specific type information from the storage unit, and acquires the combination The specific information indicated by the acquired non-specific type information in each of the specific information is replaced with the non-specific type information, and the combination after replacement and the data stored in association with the combination are The database system according to claim 1, wherein transmission is performed.   The storage unit generates each combination by replacing the non-specific type information included in the combination transmitted by the cache response unit with specific information that may be applied to the non-specific type information. The database system according to claim 1, wherein each of the combinations is stored in the cache in association with the data transmitted by the cache response unit. For each data, a combination of specific information for specifying the data and non-specific type information indicating a non-specific type that is a type that is not used when specifying the data among a plurality of types of the specific information A database having a storage unit for storing;
A cache that stores at least one of a combination of the specific information and the non-specific type information and a combination of a plurality of types of the specific information in association with at least a part of the data stored in the database. A control method executed in a database system having a cache server having
When the cache server receives a data request, a determination step of determining whether a combination of each of the plurality of types of specific information included in the data request is stored in the cache;
A specific information transmission step of transmitting a combination included in the data request to the database when it is determined that the cache server is not stored in the determination step;
When the database receives the combination transmitted by the specific information transmission step, the combination of the specific information and the non-specific type information stored in the storage unit corresponding to the received combination that is the received combination, A cache response step of acquiring from the storage unit the data associated with a combination of specific information and the non-specific type information, and transmitting to the cache server;
When the cache server stores a combination of the specific information and the non-specific type information transmitted in the cache response step in the cache, the stored specific information and the non-specific type information The received combination is stored in the cache in association with the data associated with the combination, and if the cache is not stored in the cache, the cache is associated with the data transmitted in the cache response step. A storing step of storing the combination of the specific information and the non-specific type information transmitted by the response unit and the reception combination in the cache;
When it is determined that the cache server is stored in the determination step, the data is acquired from the cache and transmitted to the transmission source of the data request, and is determined not to be stored in the determination step. And a data transmission step of transmitting the data transmitted by the cache response step to a transmission source of the data request.

Images