Kabushiki Kaisha Toshiba

Sophia Co., Ltd.

Mutsumi Fujihara

Shuichi Kamimura

Hideo Sakamoto

Ken Iriuchijima

Takeshi Ozeki

Kiyoshi Wada

Hiromasa Shin

Yoshiaki Hasegawa

Toshifumi Tamura

Yukio Fujimoto

Takuro Iida

Data exchange sectionhas 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 systemexchanges 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.

Data exchange system and data exchange method

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. A data structure management apparatus according to the present invention is a data structure management apparatus (), which manages a plurality of mutually equal data structures stored in one or a plurality of storage units, comprising a data structure storage unit (), which stores an arbitrary first data structure; a data structure modification unit (), which modifies the first data structure; a modified data extraction unit (), which extracts only the data necessary for making the first data structure on the modification source side and a second data structure on the modification target side be equal, from the modified data in the first data structure by the data structure modification unit; and a modified data transmission unit (), which outputs the extracted, modified data so as to reflect onto the second data structure.

Data structure managing device, data structure managing system, data structure managing method, and recorded medium where data structure managing program is stored

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.

Distributed-processing database-management system

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.

System and method of data-management and data-management program

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.

Data processing method, computer readable recording medium, and data processing device

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. On detection of alteration made to the data being monitored by the data monitor, the alteration-synchronizing transaction registered in relation to the altered data is read out and executed by the transaction executor.

Data processing system and method and storage medium storing data processing program

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 is stored in an index . An index generating means generates the index from the coordinate data. A range search means 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 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.

System and method for data management

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. The number of works necessary to be processed in the respective process steps during a period from a planning time to a planned time is calculated, as a process step load of the respective process steps, based on the current cumulated processed works of the respective process steps at the planning time and the target of the total number of the respective process steps at the planned time.

Production planning method, a storage medium and a production planning apparatus

In order to manage a plurality of sets of multidimensional data positioned in a specific area of a computer, when hierarchically dividing a first area within the specific area into second areas that are to constitute child areas thereof, a decision is made as to whether or not a division condition, which is based upon the state achieved when the sets of multidimensional data are allocated to the first area and the state achieved when the sets of multidimensional data are allocated to the second areas, is satisfied. When it is decided that the division condition will be satisfied, the first area is hierarchically divided into the second areas to allocate the sets of multidimensional data to the second areas.

Multidimensional data management method, multidimensional data

A production control is applied to control a production machine for producing a product from a material in a process divided into a plurality of steps. The execution numbers are counted on a per-step basis. A priority order is allocated on the basis of the counted execution numbers. The information relating to the priority order is output to the production machine. The production machine can select the next step in accordance with the input priority order. The execution numbers can be properly controlled by such control method on the per-step basis.

Production control apparatus and a production control method

A data retrieval system which updates data quickly. A divider determines the first substring and second substring based on the code string from which a key string is retrieved. For each substring, a generator generates the dictionary data showing the correspondence between a trailing string, which is a trailing part of data in the substring, and the start position of the trailing string within the code string. A retriever a trailing string whose leading string is a key string or a part of the key string, based on the dictionary data. A remover removes duplicate trailing strings. When a changer changes the code string, an updater updates dictionary data associated with the substring based on the contents of the change. A first maintaining device maintains the boundary interval at a maximum key length or longer, and a second maintaining device maintains the boundary interval at a specified length or less.

Code string processing system and method using intervals

A contention-type data communication system such as an optical star-configured network comprises a plurality of stations connected with one another through data bus. To detect a signal collision quickly, each of the stations is arranged to transmit a collision-detecting packet which has a predetermined time length T.sub.1 and a predetermined pulse pattern, and then transmit a data packet after a time interval T.sub.2. The number or pattern of pulses received during a time period T.sub.1 +T.sub.2 from the start of reception of a collision-detecting packet is compared with that of the self-transmitted collision-detecting packet so that the signal collision is detected when noncoincidence occurs.

Growing community of inventors

Tokyo, Japan

Mutsumi Fujihara