Abstract: An information processing system, a data update method and a data update program are disclosed. In a data base system of master-slave configuration, the update result can be accessed also on slave side with the access request immediately after the particular update. The data base system DBS includes a master DB computer and at least a slave DB computer. The slave DB computer judges from the count on an update counter table whether the update log received from the master DB computer is to be reflected in a duplicate data base or not. Thus, the lost update problem is solved while at the same time realizing a high-speed process.

Abstract: A server to be changed is added to a destination unit in terms of configuration. The server to be changed is started to restore the database in the database storage region to which the server has access and to restore the transaction for the process that was executed when the server failed. The destination of the failed server (a system destination unit) when failure occurs is determined to stabilize the throughput of the entire system after the switchover of the system in the event of failure. The destination server is determined according to an instruction given in advance by the user. The database management system statistically determines the destination server in accordance with a policy designated by the user. Alternatively, the database management system dynamically determines the destination server according to the policy designated by the user when failure occurs.

Abstract: In response to an activation of a data processing system, a request for processing is accepted in parallel with loading a series of data (a data body) from an external storage into a main memory independent of whether the processing of individual data is requested or not, and if target data of the request for processing is not loaded into the main memory, apparent system starting time is reduced by executing processing corresponding to the request after the target data is loaded into the main memory.

Abstract: Even when the operation of web page referencing or search is discontinuous and implicit, relativity between web pages is extracted. A web relativity extraction unit is executed as a program by the processing unit of a recommendation server. The web relativity extraction unit extracts relativity between web pages about a search term related to the web pages. Further, it considers a user's information search model based on the process of accessing between web pages and quantitatively evaluates a relativity degree indicating the intensity of relativity and thereby extracts relativity between the web pages.

Abstract: It is an object of the present invention to appropriately display a related document at the time when a user browses a document in a survey business using a set of documents as electronic data. A related document display system of the present invention includes a related learning controller that stores both related documents as an available related link based on a past document preparation in a set of documents in a related link storage unit (related link management information), and a recommended controller (proxy unit) that then refers, when the user browses any one of documents in the set of documents, to the related link storage unit, extracts a document having an available related link along with the browsed document, and displays the extracted document on a display unit as a document related to the browsed document.

Abstract: An information processing system, a data update method and a data update program are disclosed. In a data base system of master-slave configuration, the update result can be accessed also on slave side with the access request immediately after the particular update. The data base system DBS includes a master DB computer and at least a slave DB computer. The slave DB computer judges from the count on an update counter table whether the update log received from the master DB computer is to be reflected in a duplicate data base or not. Thus, the lost update problem is solved while at the same time realizing a high-speed process.

Abstract: The present invention realize a high speed retrieval performance in a document retrieval system referring to partial data of documents including structured data such as XML documents and electric mails, without providing further memory. The present invention includes storage means for storing documents to be retrieved onto a disk device, a calculation means for calculating an allocated capacity of the memory, and storage means for saving, onto the memory, partial data of the documents stored on the disk device by the calculated allocated capacity of the memory. The present invention also includes a first retrieval means for retrieving partial data stored on the memory, determining means for determining whether or not to retrieve the documents stored on the disk device based on the result from the first retrieval, and a second means for retrieving the documents stored on the disk device based on the result from the above determination.

Abstract: Provided is a data management method. Data corresponds to an entry including a reference to another entry and is managed in a set which is a collection of pieces of the data. The set corresponds to a linked list where the entry corresponding to the data is linked in order of addition of the data. The entry includes an insertion time sequence number inserted into the linked list and information indicating if the data has been deleted from the set. In that case, the entry is separated from the linked list at a predetermined timing. The linked list is traced to refer to the data. When the insertion time sequence number of the reference entry is later than the insertion time sequence number of the entry which has already been referred to, it is judged that the reference entry has been separated from the linked list.

Abstract: The technology for changing the nodes in an information retrieving system using a computer. When information items are registered by allocating to n nodes, steps are used to extract index information as a set of pairs of index keys of information items and addresses of information items, divide the index information into m (m>n) buckets and produce a partial inverted file to be closed within each of the buckets. Here, m and n are respectively integers of 1 (one) or above. When the allocation of the search-targeted ranges to the nodes is altered, the allocation to the buckets to each of the nodes is changed, and the partial inverted file of each bucket and the inverted file of the existing indexes are merged to produce new indexes, so that the indexes can be produced and updated with high speed.

Abstract: In response to the activation of the data processing system, a request for processing is accepted in parallel with loading a series of data (a data body) from an external storage into a main memory independent of whether the processing of individual data is requested or not, and if target data of the request for processing is not loaded into the main memory, apparent system starting time is reduced by executing processing corresponding to the request after the target data is loaded into the main memory.

Abstract: In a database management system using a shared-nothing architecture and adopting a system takeover in a DB storage area unit, correspondence information is provided which indicates a relation between a DB storage area and a DB processing server in charge of an access to the DB storage area, when a takeover occurs to some DB storage area, the correspondence information is changed in such a manner that an access process to the DB storage area is made in charge of another running DB processing server, and when some DB storage area is accessed in response to an inquiry request from a user, a DB processing server as an access request destination is determined by referring to the correspondence information.

Abstract: The present invention provides a system switching function for database management systems which requires no standby resources idling during normal operation. One aspect of the invention is directed to a method for processing databases in a system which includes a plurality of storage areas each storing a database and a plurality of computers each having a database management program running thereon which manages one of the plurality of storage areas. Each storage area is associated with only the computer managing the storage area.

Abstract: A server to be changed is added to a destination unit in terms of configuration. The server to be changed is started to restore the database in the database storage region to which the server has access and to restore the transaction for the process that was executed when the server failed. The destination of the failed server (a system destination unit) when failure occurs is determined to stabilize the throughput of the entire system after the switchover of the system in the event of failure. The destination server is determined according to an instruction given in advance by the user. The database management system statistically determines the destination server in accordance with a policy designated by the user. Alternatively, the database management system dynamically determines the destination server according to the policy designated by the user when failure occurs.

Abstract: The present invention provides a system switching function for database management systems which requires no standby resources idling during normal operation. One aspect of the invention is directed to a method for processing databases in a system which includes a plurality of storage areas each storing a database and a plurality of computers each having a database management program running thereon which manages one of the plurality of storage areas. Each storage area is associated with only the computer managing the storage area.

Abstract: A server to be changed is added to a destination unit in terms of configuration. The server to be changed is started to restore the database in the database storage region to which the server has access and to restore the transaction for the process that was executed when the server failed. The destination of the failed server (a system destination unit) when failure occurs is determined to stabilize the throughput of the entire system after the switchover of the system in the event of failure. The destination server is determined according to an instruction given in advance by the user. The database management system statistically determines the destination server in accordance with a policy designated by the user. Alternatively, the database management system dynamically determines the destination server according to the policy designated by the user when failure occurs.

Abstract: The present invention realize a high speed retrieval performance in a document retrieval system referring to partial data of documents including structured data such as XML documents and electric mails, without providing further memory. The present invention includes storage means for storing documents to be retrieved onto a disk device, a calculation means for calculating an allocated capacity of the memory, and storage means for saving, onto the memory, partial data of the documents stored on the disk device by the calculated allocated capacity of the memory. The present invention also includes a first retrieval means for retrieving partial data stored on the memory, determining means for determining whether or not to retrieve the documents stored on the disk device based on the result from the first retrieval, and a second means for retrieving the documents stored on the disk device based on the result from the above determination.

Abstract: The technology for changing the nodes in an information retrieving system using a computer. When information items are registered by allocating to n nodes, steps are used to extract index information as a set of pairs of index keys of information items and addresses of information items, divide the index information into m (m>n) buckets and produce a partial inverted file to be closed within each of the buckets. Here, m and n are respectively integers of 1 (one) or above. When the allocation of the search-targeted ranges to the nodes is altered, the allocation to the buckets to each of the nodes is changed, and the partial inverted file of each bucket and the inverted file of the existing indexes are merged to produce new indexes, so that the indexes can be produced and updated with high speed.

Abstract: In a database management system using a shared-nothing architecture and adopting a system takeover in a DB storage area unit, correspondence information is provided which indicates a relation between a DB storage area and a DB processing server in charge of an access to the DB storage area, when a takeover occurs to some DB storage area, the correspondence information is changed in such a manner that an access process to the DB storage area is made in charge of another running DB processing server, and when some DB storage area is accessed in response to an inquiry request from a user, a DB processing server as an access request destination is determined by referring to the correspondence information.

Abstract: A server to be changed is added to a destination unit in terms of configuration. The server to be changed is started to restore the database in the database storage region to which the server has access and to restore the transaction for the process that was executed when the server failed. The destination of the failed server (a system destination unit) when failure occurs is determined to stabilize the throughput of the entire system after the switchover of the system in the event of failure. The destination server is determined according to an instruction given in advance by the user. The database management system statistically determines the destination server in accordance with a policy designated by the user. Alternatively, the database management system dynamically determines the destination server according to the policy designated by the user when failure occurs.

Abstract: The present invention provides a system switching function for database management systems which requires no standby resources idling during normal operation. One aspect of the invention is directed to a method for processing databases in a system which includes a plurality of storage areas each storing a database and a plurality of computers each having a database management program running thereon which manages one of the plurality of storage areas. Each storage area is associated with only the computer managing the storage area.