Method and system of database divisional management for parallel database system

Claim 2

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system having a plurality of input/output nodes, each one of said plurality of input/output nodes having a storage medium and storage and management means for storing and managing a database in said storage medium, and a plurality of access nodes accessing said database in response to query inputs, said database divisional management method comprising the steps of: generating a procedure for processing said query inputs; dividing, in one of the nodes, said database into a plurality of partitions in accordance with the load pattern provided for executing the generated processing procedure; determining, in one of the nodes, the number of access nodes for simultaneously accessing the partitions of said database; and assigning a number of said plurality of processors to said access nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of access nodes.

Claim 3

A database divisional management method according to claim 1, wherein said one of the nodes in the determining step determines the physical addresses corresponding to logical addresses at which said plurality of access nodes access said partitions of said database.

Claim 4

A database divisional management method according to claim 1, wherein said load pattern is determined by the access efficiency of each of said access nodes and by the amount of information stored in said partitions of said database accessed by said access nodes.

Claim 5

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management method comprising the steps of: calculating, in one of the nodes, the load pattern by which to perform database processing using said processing procedure; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes and the number of processors assigned to said IOS node in accordance with said load pattern; and assigning said number of Processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 6

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management method comprising the steps of: calculating, in one of the nodes, the load pattern by which to perform database processing using said processing procedure; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes and the number of processors assigned to said IOS node in accordance with said load pattern; and assigning said number of Processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 7

A database divisional management method according to claim 4, further comprising the step of determining the number of storage medium units of said IOS node and the number of partitions in each of said storage medium units in accordance with said load pattern.

Claim 8

A database divisional management method according to claim 5, wherein said storage medium units are disk units and wherein the number of disk units of said IOS node and the number of partitions of said disk units are determined in accordance with said load pattern.

Claim 9

A database divisional management method according to claim 4, further comprising the step of causing said FES node to analyze and optimize said query input information.

Claim 10

A database divisional management method according to claim 4, further comprising the steps of: calculating the optimum number of accessible pages m; calculating the number of pages s (=m/p, wherein p denotes an expected degree of parallelism) in units of sub-key ranges if key range partitions exist; and having sub-key range partitions in units of s pages for inserting data into a disk apparatus.

Claim 11

A database divisional management method for use with a parallel database system having a plurality of Processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management method comprising the steps of: calculating, in one of the nodes, the load pattern by which to perform database processing using said processing procedure; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium in accordance with said load pattern; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 12

A database divisional management method for use with a parallel database system having a plurality of Processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management method comprising the steps of: calculating, in one of the nodes, the load pattern by which to perform database processing using said processing procedure; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium in accordance with said load pattern; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 13

A database divisional management method according to claim 9, further comprising the steps of: calculating the optimum number of accessible pages m; calculating the number of pages s (=m/p, wherein p denotes an expected degree of parallelism) in units of sub-key ranges if key range partitions exist; and having sub-key range partitions in units of s pages for inserting data into a disk apparatus.

Claim 14

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management method comprising the steps of: determining, in one of the nodes, the upper limit number of pages which are accessible in parallel and which require a constant time each when said database is scanned for access thereto; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of processors assigned to said IOS node in accordance with said upper limit number of pages; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 15

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management method comprising the steps of: determining, in one of the nodes, the upper limit number of pages which are accessible in parallel and which require a constant time each when said database is scanned for access thereto; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of processors assigned to said IOS node in accordance with said upper limit number of pages; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 16

A database divisional management method according to claim 11, further comprising the step of determining the number of storage medium units of said IOS nodes and the number of partitions in each of said storage medium units.

Claim 17

A database divisional management method according to claim 11, further comprising the steps of: calculating the optimum number of accessible pages m; calculating the number of pages s (=m/p, wherein p denotes an expected degree of parallelism) in units of sub-key ranges if key range partitions exist; and having sub-key range partitions in units of s pages for inserting data into a disk apparatus.

Claim 18

A database divisional management method according to claim 11, further comprising the steps of: closing, when online processing is in progress, the key range of a database table if at least either the number of processors assigned to said BES nodes or the number of storage medium units is to be decreased, said database table being managed by either the processors or the storage medium units to be removed; determining either the processors or the storage medium units to be removed; succeeding lock information and directory information; updating the dictionary information necessary for node assignment control; moving data from the storage medium units to be removed to the storage medium units succeeding those units to be removed; and releasing the closing of said key range thereafter if said online processing is still in progress.

Claim 19

A database divisional management method according to claim 14, wherein either the number of processors or the number of storage medium units for database processing is changed dynamically.

Claim 20

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management method comprising the steps of: determining, in one of the nodes, the upper limit number of pages which are accessible in parallel and which require a constant time each when said database is scanned for access thereto; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium units in accordance with said upper limit number of pages; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 21

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management method comprising the steps of: determining, in one of the nodes, the upper limit number of pages which are accessible in parallel and which require a constant time each when said database is scanned for access thereto; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium units in accordance with said upper limit number of pages; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 22

A database divisional management method according to claim 10, further comprising the steps of: calculating the optimum number of accessible pages m; calculating the number of pages s (=m/p, wherein p denotes an expected degree of parallelism) in units of sub-key ranges if key range partitions exist; and having sub-key range partitions in units of s pages for inserting data into a disk apparatus.

Claim 23

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management method comprising the steps of: calculating, in one of the nodes, the expected degree of parallelism p according to the load pattern based on said processing procedure; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of processors assigned to said IOS node in accordance with said expected degree of parallelism p; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 24

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management method comprising the steps of: calculating, in one of the nodes, the expected degree of parallelism p according to the load pattern based on said processing procedure; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of processors assigned to said IOS node in accordance with said expected degree of parallelism p; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 25

A database divisional management method according to claim 12, further comprising the steps of: calculating the optimum number of accessible pages m; calculating the number of pages s in units of sub-key ranges if key range partitions exist, said number of pages s being equal to said optimum number of accessible pages m divided by said expected degree of parallelism p; and having sub-key range partitions in units of s pages for inserting data into a disk apparatus.

Claim 26

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management method comprising the steps of: calculating, in one of the nodes, the expected degree of parallelism p according to the load pattern based on said processing procedure; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium units in accordance with said expected degree of parallelism p; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 27

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management method comprising the steps of: calculating, in one of the nodes, the expected degree of parallelism p according to the load pattern based on said processing procedure; determining, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium units in accordance with said expected degree of parallelism p; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 28

A database divisional management method according to claim 20, further comprising the steps of: calculating the optimum number of accessible pages m; calculating the number of pages s in units of sub-key ranges if key range partitions exist, said number of pages s being equal to said optimum number of accessible pages m divided by said expected degree of parallelism p; and having sub-key range partitions in units of s pages for inserting data into a disk apparatus.

Claim 29

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management method comprising the steps of: detecting, in one of the nodes, a load unbalance on the basis of at least one of the load information items consisting of the number of accessed pages, the number of hit rows and the number of communications acquired during execution of said processing procedure; changing, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of processors assigned to said IOS node, and the number of storage medium units of said IOS node so as to eliminate said load unbalance; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the changed number of processors.

Claim 30

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management method comprising the steps of: detecting, in one of the nodes, a load unbalance on the basis of at least one of the load information items consisting of the number of accessed pages, the number of hit rows and the number of communications acquired during execution of said processing procedure; changing, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of processors assigned to said IOS node, and the number of storage medium units of said IOS node so as to eliminate said load unbalance; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the changed number of processors.

Claim 31

A database divisional management method according to claim 22, further comprising the steps of: closing, when online processing is in progress, the key range of a database table if at least one of the three numbers consisting of the number of processors assigned to said BES nodes, the number of processors assigned to said IOS node and the number of storage medium units is to be increased, said database table being the object to be managed by either the processors or the storage medium units to be added; assigning the processors and the storage medium units anew; succeeding lock information and directory information; updating the dictionary information necessary for node assignment control; and releasing the closing of said key range thereafter if said online processing is still in progress.

Claim 32

A database divisional management method according to claim 23, further comprising the steps of: closing, when online processing is in progress, the key range of a database table if at least one of the three numbers consisting of the number of processors assigned to said BES nodes, the number of processors assigned to said IOS node and the number of storage medium units is to be decreased, said database table being managed by either the processors or the storage medium units to be removed; determining either the processors or the storage medium units to be removed; succeeding lock information and directory information; updating the dictionary information necessary for node assignment control; and releasing the closing of said key range thereafter if said online processing is still in progress.

Claim 33

A database divisional management method according to claim 23, wherein either the number of processors or the number of storage medium units for database processing is changed dynamically.

Claim 34

A database divisional management method according to claim 22, further comprising the steps of: closing, when online processing is in progress, the key range of a database table if at least one of the three numbers consisting of the number of processors assigned to said BES nodes, the number of processors assigned to said IOS node and the number of storage medium units is to be decreased, said database table being managed by either the processors or the storage medium units to be removed; determining either the processors or the storage medium units to be removed; succeeding lock information and directory information; updating the dictionary information necessary for node assignment control; and releasing the closing of said key range thereafter if said online processing is still in progress.

Claim 35

A database divisional management method according to claim 22, wherein either the number of processors or the number of storage medium units for database processing is changed dynamically.

Claim 36

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management method comprising the steps of: detecting, in one of the nodes, a load unbalance on the basis of at least one of the load information items consisting of the number of accessed pages, the number of hit rows and the number of communications acquired during execution of said processing procedure; changing, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of storage medium units of said BES nodes so as to eliminate said load unbalance; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the changed number of processors.

Claim 37

A database divisional management method for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management method comprising the steps of: detecting, in one of the nodes, a load unbalance on the basis of at least one of the load information items consisting of the number of accessed pages, the number of hit rows and the number of communications acquired during execution of said processing procedure; changing, in one of the nodes, the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of storage medium units of said BES nodes so as to eliminate said load unbalance; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the changed number of processors.

Claim 38

A database divisional management method according to claim 28, further comprising the steps of: closing, when online processing is in progress, the key range of a database table if either the number of processors assigned to said BES nodes or the number of storage medium units is to be increased, said database table being the object to be managed by either the processors or the storage medium units to be added; assigning either the processors or the storage medium units anew; succeeding lock information and directory information; updating the dictionary information necessary for node assignment control; moving data from the existing group of storage medium units to the newly added storage medium units; and releasing the closing of said key range thereafter if said online processing is still in progress.

Claim 39

A database divisional management method according to claim 29, further comprising the steps of: closing, when online processing is in progress, the key range of a database table if at least either the number of processors assigned to said BES nodes or the number of storage medium units is to be decreased, said database table being managed by either the processors or the storage medium units to be removed; determining either the processors or the storage medium units to be removed; succeeding lock information and directory information; updating the dictionary information necessary for node assignment control; moving data from the storage medium units to be removed to the storage medium units succeeding those units to be removed; and releasing the closing of said key range thereafter if said online processing is still in progress.

Claim 40

A database divisional management method according to claim 29, wherein either the number of processors or the number of storage medium units for database processing is changed dynamically.

Claim 41

A database divisional management method according to claim 28, wherein either the number of processors or the number of storage medium units for database processing is changed dynamically.

Claim 42

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system having a plurality of input/output nodes, each of said plurality of input/output nodes having a storage medium and storage and management means for storing and managing a database in said storage medium, and a plurality of access nodes for accessing said database in response to query inputs, said database divisional management system comprising: generation means for generating a procedure for processing said query inputs; division means, located in one of the nodes, for dividing said database into a plurality of partitions in accordance with the load pattern provided for executing the generated processing procedure; determination means, located in one of the nodes, for determining the number of access means for simultaneously accessing the partitions of said database; and assigning a number of said plurality of processors to said access means, and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of access means.

Claim 43

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system having a plurality of input/output nodes, each of said plurality of input/output nodes having a storage medium and storage and management means for storing and managing a database in said storage medium, and a plurality of access nodes for accessing said database in response to query inputs, said database divisional management system comprising: generation means for generating a procedure for processing said query inputs; division means, located in one of the nodes, for dividing said database into a plurality of partitions in accordance with the load pattern provided for executing the generated processing procedure; determination means, located in one of the nodes, for determining the number of access means for simultaneously accessing the partitions of said database; and assigning a number of said plurality of processors to said access means, and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of access means.

Claim 44

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management system comprising; calculation means, located in one of the nodes, for calculating the load pattern by which to perform database processing using said processing procedure; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes and the number of processors assigned to said IOS node in accordance with said load pattern; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 45

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management system comprising; calculation means, located in one of the nodes, for calculating the load pattern by which to perform database processing using said processing procedure; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes and the number of processors assigned to said IOS node in accordance with said load pattern; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 46

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management system comprising: calculation means, located in one of the nodes, for calculating the load pattern by which to perform database processing using said processing procedure; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium in accordance with said load pattern; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 47

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management system comprising: calculation means, located in one of the nodes, for calculating the load pattern by which to perform database processing using said processing procedure; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium in accordance with said load pattern; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 48

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management system comprising: determination means, located in one of the nodes, for determining the upper limit number of pages which are accessible in parallel and which require a constant time each when said database is scanned for access thereto; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of processors assigned to said IOS node in accordance with said upper limit number of pages; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 49

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management system comprising: determination means, located in one of the nodes, for determining the upper limit number of pages which are accessible in parallel and which require a constant time each when said database is scanned for access thereto; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of processors assigned to said IOS node in accordance with said upper limit number of pages; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 50

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node and a network for connecting the FES and BES nodes, said database divisional management system comprising: determination means, located in one of the nodes, for determining the upper limit number of pages which are accessible in parallel and which require a constant time each when said database is scanned for access thereto; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium units in accordance with said upper limit number of pages; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 51

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node and a network for connecting the FES and BES nodes, said database divisional management system comprising: determination means, located in one of the nodes, for determining the upper limit number of pages which are accessible in parallel and which require a constant time each when said database is scanned for access thereto; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium units in accordance with said upper limit number of pages; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 52

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management system comprising: calculation means, located in one of the nodes, for calculating the expected degree of parallelism p according to the load pattern based on said processing procedure; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of processors assigned to said IOS node in accordance with 5 said expected degree of parallelism p; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 53

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes for accessing a database on the basis of said processing procedure generated by said FES node, an IOS node having a storage medium and capable of storing and managing said database in said storage medium, and a network for connecting the FES, BES and IOS nodes, said database divisional management system comprising: calculation means, located in one of the nodes, for calculating the expected degree of parallelism p according to the load pattern based on said processing procedure; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, and the number of processors assigned to said IOS node in accordance with 5 said expected degree of parallelism p; and assigning said number of processors to said FES nodes, BES nodes and IOS node and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 54

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management system comprising: calculation means, located in one of the nodes, for calculating the expected degree of parallelism p according to the load pattern based on said processing procedure; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium units in accordance with said expected degree of parallelism p; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.

Claim 55

A database divisional management system for use with a parallel database system having a plurality of processors operable in parallel, said parallel database system comprising an FES node for generating a processing procedure in response to query input information, BES nodes having a storage medium in which to store and manage a database and capable of accessing said database on the basis of said processing procedure generated by said FES node, and a network for connecting the FES and BES nodes, said database divisional management system comprising: calculation means, located in one of the nodes, for calculating the expected degree of parallelism p according to the load pattern based on said processing procedure; determination means, located in one of the nodes, for determining the number of processors assigned to said FES node, the number of processors assigned to said BES nodes, the number of storage medium units of said BES nodes, and the number of partitions of said storage medium units in accordance with said expected degree of parallelism p; and assigning said number of processors to said FES nodes and BES nodes and selecting an access path to achieve concurrent use of the assigned processors in correspondence with the determined number of processors.