Abstract: Data exchange section 104 has a step of determining whether or not pairs of the transmission selecting conditions and reception selecting conditions satisfy a standard for exchanging, through a determined pair, data between a transmission user who corresponds to a transmission selecting condition in the determined pair and a reception user who corresponds to a reception selecting condition in the determined pair. Data exchange system 100 exchanges data satisfying both the transmission selecting condition and the reception selecting condition in the determined pair between the transmission user and the reception user, respectively corresponding to the transmission selecting condition and the reception selecting condition in the determined pair.

Abstract: Data exchange section 104 has a step of determining whether or not pairs of the transmission selecting conditions and reception selecting conditions satisfy a standard for exchanging, through a determined pair, data between a transmission user who corresponds to a transmission selecting condition in the determined pair and a reception user who corresponds to a reception selecting condition in the determined pair. Data exchange system 100 exchanges data satisfying both the transmission selecting condition and the reception selecting condition in the determined pair between the transmission user and the reception user, respectively corresponding to the transmission selecting condition and the reception selecting condition in the determined pair.

Abstract: In the case where there is a plurality of data structures deployed in one or a plurality of storage units, while reducing communication traffic, easy yet efficient maintenance and management of a plurality of data structures is implemented.

Abstract: A database-management system easy for system integration and flexible to functional modifications, etc., is provided. A database stored in each main-memory area of a plurality of computers connected via network is managed as follows: a first computer storing original data of at least a piece of data of the database is designated as a base host. At least one second computer storing replica data of the original data is designated as a replica host. A retrieving procedure is performed to receive data to be stored in a third computer from the base host storing the original data or the replica host storing the replica data in startup of the third computer, and store the received data in the main-memory of the third computer.

Abstract: Is possible to flexibly and dynamically handle several data types with efficient retrieval and updating. Different indices are assigned to several storage regions that are discriminated from each other by their addresses. Entries corresponding to records containing address values to the storage regions are formed so that the entries and the address values contained have one-to-one correspondence. The entries are registered in the indices assigned to the storage regions that are designated by the address values corresponding to the entries.

Abstract: A data-management system manages identical data stored in main-memory areas of several computers connected via a network. The system has a transaction acceptor to accept a request for executing a transaction of accessing the database, a transaction executor to execute the transaction, a replication processor to process the replica data to reflect updated data sent from the original site and a data receiver and a data transmitter. An updating transaction for the data of the database is performed by the transaction executor but allowed only for the original site. The updated data is transmitted from the data transmitter of the original site and received by the data receiver of the replica site and reflected on the replica data of the replica site by the replication processing section.

Abstract: The object of the present invention is to provide a data processing method, a computer readable recording medium, and a data processing device with which it is possible to compactly store and surely and easily retrieve data items having overlapping portions. In the data processing method used for sorting and storing a plurality of data records for the purpose of retrieval, the field values used as sort keys are stored in storage areas indicated by pointers. In such a case, it is possible to distinguish records having the same field value but representing different information items without adding extra keys by using not only field values but also pointers as keys.

Abstract: A data processing system is provided for quickly and appropriately handling alteration to shared data stored in main-memory areas of a plurality of machines connected via a network. The system has a transaction acceptor for accepting a request for executing the transaction, a transaction-execution manager for managing the execution of the transaction, a transaction executor for executing the transaction, a transcription processor for reflecting updated data sent from the base host on the replica data, a data monitor for monitoring whether data has been altered, and a register/deleter for registering/deleting positional information on at least a piece of data to be monitored for alteration to the data contents and an alteration-synchronizing transaction to be executed when the data has been altered, the alteration-synchronizing transaction being registered/deleted in relation to the data.

Abstract: The object of the present invention is to provide a data processing method, a computer readable recording medium, and a data processing device with which it is possible to compactly store and surely and easily retrieve data items having overlapping portions. In the data processing method used for sorting and storing a plurality of data records for the purpose of retrieval, the field values used as sort keys are stored in storage areas indicated by pointers. In such a case, it is possible to distinguish records having the same field value but representing different information items without adding extra keys by using not only field values but also pointers as keys.

Abstract: The present invention is to make it possible to perform update processing and retrieval processing independently from each other and in parallel to each other. Even when a processing is interrupted due to occurrence of a system failure during update processing or the like, retrieval processing to the remaining date can be performed correctly, and such data can be judged to be data put in an interrupted state during the update processing. At a time of a new account registration, trust records showing preset unit amounts are registered in the new account by the number corresponding to the balance in the account. The trust record comprises a trust ID, a unit amount and an account number. At a time of money reception/payment in each account, a money reception/payment processing is conducted by additionally registering trust records of the number corresponding to a money reception amount or by performing retrieval/deletion of trust records of the number corresponding to a payment amount.

Abstract: The object of the present invention is to provide a data processing method, a computer readable recording medium, and a data processing device with which it is possible to compactly store and surely and easily retrieve data items having overlapping portions. In the data processing method used for sorting and storing a plurality of data records for the purpose of retrieval, the field values used as sort keys are stored in storage areas indicated by pointers. In such a case, it is possible to distinguish records having the same field value but representing different information items without adding extra keys by using not only field values but also pointers as keys.

Abstract: The present invention provides a data management system that efficiently uses data areas and significantly increases search efficiency. According to this invention, in the data management system coordinate data 1 is stored in an index 2. An index generating means 3 generates the index from the coordinate data. A range search means 4 finds all coordinate data included in a specified range in the n-dimensional space, that is, one or more pieces of coordinate data which exist in an outmost area and which is included in a specified range. A nearest data search means 5 finds coordinate data nearest to a specified coordinate data. The index contains area nests in the form of code strings representing coordinates of dimensions and sequences of terms representing divisions.

Abstract: In the case where there is a plurality of data structures deployed in one or a plurality of storage units, while reducing communication traffic, easy yet efficient maintenance and management of a plurality of data structures is implemented.

Abstract: A database-management system easy for system integration and flexible to functional alteration, etc., is provided. In a database-management system, a database is stored in each main-memory of a plurality of computers connected via a network. A computer storing original data of at least piece of data of the database is an original host. At least one another computer storing replica data of the original data is a replica host. A definer defines system-administration information on at least a piece of data to be subjected to base-host switching, a base host storing the data and the location of the base host. A storage stores the system-administration information. A base-switching controller controls the base-host switching based on the system-administration information. A transcription manager performs communications on information on the base-host switching among the computers.

Abstract: A database-management system easy for system integration and flexible to functional modifications, etc., is provided. A database stored in each main-memory area of a plurality of computers connected via network is managed as follows: a first computer storing original data of at least a piece of data of the database is designated as a base host. At least one second computer storing replica data of the original data is designated as a replica host. A retrieving procedure is performed to receive data to be stored in a third computer from the base host storing the original data or the replica host storing the replica data in startup of the third computer, and store the received data in the main-memory of the third computer.

Abstract: A data processing system is provided for quickly and appropriately handling alteration to shared data stored in main-memory areas of a plurality of machines connected via a network. The system has a transaction acceptor for accepting a request for executing the transaction, a transaction-execution manager for managing the execution of the transaction, a transaction executor for executing the transaction, a transcription processor for reflecting updated data sent from the base host on the replica data, a data monitor for monitoring whether data has been altered, and a register/deleter for registering/deleting positional information on at least a piece of data to be monitored for alteration to the data contents and an alteration-synchronizing transaction to be executed when the data has been altered, the alteration-synchronizing transaction being registered/deleted in relation to the data.

Abstract: A data-management system manages identical data stored in main-memory areas of several computers connected via a network. The system has a transaction acceptor to accept a request for executing a transaction of accessing the database, a transaction executor to execute the transaction, a replication processor to process the replica data to reflect updated data sent from the original site and a data receiver and a data transmitter. An updating transaction for the data of the database is performed by the transaction executor but allowed only for the original site. The updated data is transmitted from the data transmitter of the original site and received by the data receiver of the replica site and reflected on the replica data of the replica site by the replication processing section.

Abstract: Is possible to flexibly and dynamically handle several data types with efficient retrieval and updating. Different indices are assigned to several storage regions that are discriminated from each other by their addresses. Entries corresponding to records containing address values to the storage regions are formed so that the entries and the address values contained have one-to-one correspondence. The entries are registered in the indices assigned to the storage regions that are designated by the address values corresponding to the entries.

Abstract: The object of the present invention is to provide a data processing method, a computer readable recording medium, and a data processing device with which it is possible to compactly store and surely and easily retrieve data items having overlapping portions. In the data processing method used for sorting and storing a plurality of data records for the purpose of retrieval, the field values used as sort keys are stored in storage areas indicated by pointers. In such a case, it is possible to distinguish records having the same field value but representing different information items without adding extra keys by using not only field values but also pointers as keys.

Abstract: A production plan is made for a production line for producing finished products from a raw material. Based on the stock number of works in respective process steps at a planning time, the number of works processed at the respective process steps up to the planning time is calculated as the current cumulated processed works of the respective process steps. The target of the stock number of works in the respective process steps at a planned time following a passage of a plan period is calculated based on a target production representing the number of finished products outputted up to the planned time and an average cycle time of production from the raw material to finished products. The target cumulated processed works of the respective process steps at the planned time is calculated based on the target of the stock number of works in the respective process steps.