Abstract: A parallel database system retrieval method and system for transferring from database operation servers to a front end server only those data items that are used in subsequent processing, thereby shortening the query time when the unused data are massive. The invention allows an initial retrieval query to transfer only location information about the target data from a database operation server to the front end server. Using the location information the invention permits a subsequent query to get variable-bound location information so that the latter query will retrieve a desired sub-data item according to the acquired location information and dictionary information about the sub-data item locations within the data.

Abstract: A database access management unit manages accesses to databases managed by a plurality of data processing servers each provided for each data kind. A request analysis unit analyzes a request from an application containing a process request for each data kind. A process server selection unit selects the data processing server for executing a data process in accordance with the data kind. A data process request unit requests the data processing server to execute the data process. A process result edition unit edits the process result by the data processing server.

Abstract: A database management system for executing database operations in parallel by a plurality of nodes and a query processing method are described. The database management system contains a decision management node for deciding a distribution node for retrieving information so as to analyze a query received from an application program, generate a processing procedure for processing the query, and execute the process and a join node for sorting, merging, and joining the information retrieved by the distribution node. When the query process is executed, the distribution node decided by the decision management node retrieves the information to be processed and the join node decided by the decision management node also obtains the result for the query from the retrieved information. The query result is outputted from an output node and transferred to the application program.

Abstract: A parallel database system retrieval method and system for transferring from database operation servers to a front end server only those data items that are used in subsequent processing, thereby shortening the query time when the unused data are massive. The invention allows an initial retrieval query to transfer only location information about the target data from a database operation server to the front end server. Using the location information the invention permits a subsequent query to get variable-bound location information so that the latter query will retrieve a desired sub-data item according to the acquired location information and dictionary information about the sub-data item locations within the data.

Abstract: A database management system for executing database operations in parallel by a plurality of nodes and a query processing method for it are described. The database management system contains a decision management node for deciding a distribution node for retrieving information so as to analyze a query received from an application program, generate a processing procedure for processing the query, and execute the process and a join node for sorting, merging, and joining the information retrieved by the distribution node. When the query process is executed, the distribution node decided by the decision management node retrieves the information to be processed and the join node decided by the decision management node also obtains the result for the query from the retrieved information. The query result is outputted from an output node and transferred to the application program.

Abstract: A method and a system of database divisional management for use with a parallel database system comprising an FES (front end server), BES's (back end servers), an IOS (I/O server) and disk units. The numbers of processors assigned to the FES, BES's and IOS, the number of disk units, and the number of partitions of the disk units are determined in accordance with the load pattern in question. Illustratively, there may be established a configuration of one FES, four BES's, one IOS and eight disk units. The number of BES's is varied from one to four depending on the fluctuation in load, so that a scalable system configuration is implemented. When the number of BES's is increased or decreased, only the management information thereabout is transferred between nodes and not the data, whereby the desired degree of parallelism is obtained for high-speed query processing.

Abstract: A database processing method is provided for defining and operating data of file reference type which references a file. A column data insert request for specifying position information indicative of a storage location of a file and watch information for watching the file is received from a database client. A request for watching a file indicated by the position information is issued in accordance with the watch information. The position information and the watch information are stored in a database. The foregoing operations permit data in an external file placed outside a database to be treated as data equivalent to ordinary column data stored in the database, thereby making it possible to improve the integrity of the database.

Abstract: A database processing method for defining and operating data of file reference type which references a file. A column data insert request for specifying position information indicative of a storage location of a file and watch information for watching the file is received from a database client. A request for watching a file indicated by the position information is issued in accordance with the watch information. The position information and the watch information are stored in a database. The foregoing operations permit data in an external file placed outside a database to be treated as data equivalent to ordinary column data stored in the database to improve the integrity of the database.

Abstract: A user defined ADT function (to be implemented by an embedded module assigned to the function) is executed with module calling triggers other than the execution of the ADT function described in an SQL statement in a database management method which allows the user to define a data type. By creating a proper execution procedure command package, an embedded module implementing an ADT function can be executed even if the function is defined in a format to return execution results as a set. The database processing method includes an ADT function analysis for selecting a procedural model for creating a proper execution procedure command package in accordance with an evaluation style and a non-ADT function called embedded module analysis for adding information on embedded modules called on module calling triggers other than execution of ADT functions.

Abstract: An overloaded routines resolving method of analyzing an invocation for the group of overloaded routines to determine the routine to be called, the method including: the routine group sorting step of sorting the group of routines on the basis of the predetermined precedence; the reference utilization pruning step of determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and of deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates; and the sort order characteristic pruning step of comparing the data types of the arguments among the routines which still remain after having executed the reference utilization pruning step to delete any of the routines each of which has no possibility of being called from the candidates.

Abstract: A request accepting server accepts a processing request of data of a predetermined type, analyzes the request, and allocates a process corresponding to the request to either one of the request accepting server and at least one database processing server. A handle is a control block to manage a storage area of data as a processing target and has a server in which the processing target data has been stored and information regarding its storing position. When the processing target data corresponding to the processing request is processed in accordance with the processing request, the request accepting server executes a process according to the processing request by using a handle regarding the processing target data. When an entity of the processing target data is necessary the entity of the processing target data is obtained on the basis of the handle and is processed.

Abstract: In a parallel database system having an execution device on a front end side (hereinafter referred to as the “front end side”) and a plurality of execution devices on a database operation side (hereinafter referred to as the “divided data side”), the front end side analyzes a definition statement of a routine such as a function or a procedure inputted from a user to create routine execution process instructions for executing the routine. Simultaneously, the front end side determines whether or not a database operation statement is contained in the routine, and creates check information indicative of the determination result. The front end side analyzes a query statement inputted from the user to create a first query execution precess instruction to be executed on the front end side and a second query execution process instruction to be executed on the divided data side.

Abstract: The system manages at least a database in multiple database storage units, and the database is duplicated for redundancy. The system maintains the database redundancy for security. The system enables the maintenance and reorganization of the database storage units without interrupting the on-going operations involving the access to the database storage units. The non-stop ongoing database access is available by allocating a pair of a main storage unit and an intermediate storage unit that maintains the substantially identical data. During certain predetermined operations, the main storage unit is being dedicating to the on-going transactions while the intermediate database storage unit is manipulated to contain data that corresponds to a specified time. For example, the content of the intermediate storage is subsequently copied or used to update another database.

Abstract: The system manages at least a database in multiple database storage units, and the database is duplicated for redundancy. The system maintains the database redundancy for security. The system enables the maintenance and reorganization of the database storage units without interrupting the on-going operations involving the access to the database storage units. The non-stop ongoing database access is available by allocating a pair of a main storage unit and an intermediate storage unit that maintains the substantially identical data. During certain predetermined operations, the main storage unit is being dedicating to the on-going transactions while the intermediate database storage unit is manipulated to contain data that corresponds to a specified time. For example, the content of the intermediate storage is subsequently copied or used to update another database.

Abstract: A request accepting server accepts a processing request of data of a predetermined type, analyzes the request, and allocates a process corresponding to the request to either one of the request accepting server and at least one database processing server. A handle is a control block to manage a storage area of data as a processing target and has a server in which the processing target data has been stored and information regarding its storing position. When the processing target data corresponding to the processing request is processed in accordance with the processing request, the request accepting server executes a process according to the processing request by using a handle regarding the processing target data. When an entity of the processing target data is necessary, the entity of the processing target data is obtained on the basis of the handle and is processed.

Abstract: A request accepting server accepts a processing request of data of a predetermined type, analyzes the request, and allocates a process corresponding to the request to either one of the request accepting server and at least one database processing server. A handle is a control block to manage a storage area of data as a processing target and has a server in which the processing target data has been stored and information regarding its storing position. When the processing target data corresponding to the processing request is processed in accordance with the processing request, the request accepting server executes a process according to the processing request by using a handle regarding the processing target data. When an entity of the processing target data is necessary, the entity of the processing target data is obtained on the basis of the handle and is processed.

Abstract: A request accepting server accepts a processing request of data of a predetermined type, analyzes the request, and allocates a process corresponding to the request to either one of the request accepting server and at least one database processing server. A handle is a control block to manage a storage area of data as a processing target and has a server in which the processing target data has been stored and information regarding its storing position. When the processing target data corresponding to the processing request is processed in accordance with the processing request, the request accepting server executes a process according to the processing request by using a handle regarding the processing target data. When an entity of the processing target data is necessary, the entity of the processing target data is obtained on the basis of the handle and is processed.

Abstract: An overloaded routines resolving method of analyzing an invocation for the group of overloaded routines to determine the routine to be called, the method including: the routine group sorting step of sorting the group of routines on the basis of the predetermined precedence; the reference utilization pruning step of determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and of deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates; and the sort order characteristic pruning step of comparing the data types of the arguments among the routines which still remain after having executed the reference utilization pruning step to delete any of the routines each of which has no possibility of being called from the candidates.

Abstract: In a parallel database system having an execution device on a front end side and a plurality of execution devices on a database operation side (hereinafter referred to as the “divided data side”), the front end side analyzes a definition statement of a routine such as a function or a procedure inputted from a user to create routine execution process instructions for executing the routine. Simultaneously, the front end side determines whether or not a database operation statement is contained in the routine, and creates check information indicative of the determination result. The front end side analyzes a query statement inputted from the user to create a first query execution process instruction to be executed on the front end side and a second query execution process instruction to be executed on the divided data side.

Abstract: A parallel database system retrieval method and system for transferring from database operation servers to a front end server only those data items that are used in subsequent processing, thereby shortening the query time when the unused data are massive. The invention allows an initial retrieval query to transfer only location information about the target data from a database operation server to the front end server. Using the location information the invention permits a subsequent query to get variable-bound location information so that the latter query will retrieve a desired sub-data item according to the acquired location information and dictionary information about the sub-data item locations within the data.