IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0501493
(2000-02-09)
|
발명자
/ 주소 |
- Garth,John Marland
- Ruddy,James Alan
- Shibamiya,Akira
|
출원인 / 주소 |
- International Business Machines Corporation
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
2 인용 특허 :
32 |
초록
▼
A method, apparatus, and article of manufacture of a computer-implemented parallel database loading system. The optimum number of tasks to be processed by the system is determined by identifying the memory constraints of the system, by identifying available processing capabilities, and by determinin
A method, apparatus, and article of manufacture of a computer-implemented parallel database loading system. The optimum number of tasks to be processed by the system is determined by identifying the memory constraints of the system, by identifying available processing capabilities, and by determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities. Optimizing the number of load and sort processes increases overall system processing speed.
대표청구항
▼
What is claimed is: 1. A computer-implemented method of loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel base
What is claimed is: 1. A computer-implemented method of loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of indexes is less than half of the processing capabilities, wherein a number of sort processes is equal to the number of indexes, and further comprising determining that a number of load processes is the smaller of the difference of the processing capabilities available for the load processes and the number of sort processes, and a number of partitions. 2. A computer-implemented method of loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of partitions is less than half of the processing capabilities, wherein a number of load processes is equal to the number of partitions, and further comprising determining that a number of sort processes is the smaller of the difference of the processing capabilities available for the sort processes and the number of load processes, and a number of indexes. 3. A computer-implemented method of loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of indexes is less than the difference of the total amount of available memory and the amount of memory required for a main process, divided by the amount of memory required for each load and sort process, wherein a number of sort processes is equal to the number of indexes, and further comprising determining that the number of load processes is the smaller of the difference of a total amount of available memory and the amount of memory required for the main process, and the amount of memory for each sort process multiplied by the number of indexes, divided by the memory required for each load process, and a number of partitions. 4. A computer-implemented method of loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein the number of partitions is less than the difference of the total amount of available memory and the amount of memory required for a main process, divided by the amount of memory required for each load an sort process, wherein a number of load processes is equal to the number of partitions, and further comprising determining that the number of sort processes is the smaller of the difference of the total amount of available memory, the amount of memory required for the main process, and the amount of memory for each load process multiplied by the number of partitions, divided by the memory required for each sort process, and a number of indexes. 5. A computer-implemented method of loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of load processes is equal to a number of sort processes which is equal to the difference of the total amount of available memory available and the amount of memory required for a main process, divided by the amount of memory required for each load and sort process. 6. A computer-implemented method of loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein the number of indexes is less than the difference of the total amount of available memory, the amount of memory required for a main process, and the amount of memory required for each load process multiplied by the processing capabilities, divided by the difference of the amount of memory required for each sort process and each load process, wherein a number of sort processes is equal to the number of indexes, and further comprising determining that the number of load processes is the smaller of the difference of the processing capabilities and the number of indexes, and a number of partitions. 7. A computer-implemented method of loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein the number of partitions is less than the difference of the sum of the amount of memory required for each sort process multiplied by the processing capabilities, the total amount of memory required for a main process, and the amount of memory required for each load process, divided by the difference of the amount of memory required for reach sort process and each load process, wherein a number of load processes is equal to the number of partitions, and further comprising determining that the number of sort processes is the smaller of the difference of the total amount of available memory, the amount of memory required for the main process, and the amount of memory for each load process multiplied by the number of partitions, divided by the memory required for each sort process, and a number of indexes. 8. A computer-implemented method of loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of sort processes is equal to difference of the total amount of available memory, the amount of memory required for a main process, and the amount of memory required for each load process, divided by the difference of the amount of memory required for each sort process and each load process, and wherein the number of load processes is equal to the difference of the processing capabilities and the number of sort processes. 9. An apparatus for executing parallel load operations, comprising: a computer having a data store coupled thereto, wherein the data score stores data; and one or more computer programs, performed by the computer, for identifying memory constrains, identifying processing capabilities, and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of indexes is less than half of the processing capabilities, wherein a number of sort processes is equal to the number of indexes, and further comprising determining that a number of load processes is the smaller of the difference of the processing capabilities available for the load processes and the number of sort processes, and a number of partitions. 10. An apparatus for executing parallel load operations, comprising: a computer having a data store coupled thereto, wherein the data store stores data; and one or more computer programs, performed by the computer, for identifying memory constrains, identifying processing capabilities, and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of partitions is less than half of the processing capabilities, wherein a number of load processes is equal to the number of partitions, and further comprising deter that a number of sort processes is the smaller of the difference of the processing capabilities available for the sort processes and the number of load processes, and a number of indexes. 11. An apparatus for executing parallel load operations, comprising: a computer having a data store coupled thereto, wherein the data store stores data; and one or more computer programs, performed by the computer, for identifying memory constrains, identifying processing capabilities, and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of indexes is less than the difference of the total amount of available memory and the amount of memory required for a main process, divided by the amount of memory required for each load and sort process, wherein a number of sort processes is equal to the number of indexes, and further comprising determining that the number of load processes is the smaller of the difference of a total amount of available memory and the amount of merry required for the main process, and the amount of memory for each sort process multiplied by the number of indexes, divided by the memory required for each load process, and on a number of partitions. 12. An apparatus for executing parallel load operations, comprising: a computer having a data store coupled thereto, wherein the data store stores data; and one or more computer programs, performed by the computer, for identifying memory constrains, identifying processing capabilities, and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein the number of partitions is less than the difference of the total amount of available memory and the amount of memory requited for a main process, divided by the amount of memory required for each load and sort process is equal to the number of partitions, and further comprising determining that the number of sort processes is the smaller of the difference of the total amount of available memory, the amount of memory required for the main process, and the amount of memory for each load process multiplied by the number of partitions, divided by the memory required for each sort process, and a number of indexes. 13. An apparatus for executing parallel load operations, comprising: a computer having a data store coupled thereto, wherein the data store stores data; and one or more computer programs, performed by the computer, for identifying memory constrains, identifying processing capabilities, and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of load processes is equal to a number of sort processes which is equal to the difference of the total amount of available memory available and the amount of memory required for a main process, divided by the amount of memory required for each load and sort process. 14. An apparatus for executing parallel load operations, comprising: a computer having a data store coupled thereto, wherein the data store stores data; and one or more computer programs, performed by the computer, for identifying memory constrains, identifying processing capabilities, and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein the number of indexes is less than the difference of the total amount of available memory, the amount of memory required for a main process, and the amount of memory required for each load process multiplied by the processing capabilities, divided by the difference of the amount of memory required for each sort process and each load process, wherein a number of sort processes is equal to the number of indexes, and further comprising determining that the number of load processes is the smaller of the difference of the processing capabilities and the number of indexes and, a number of partitions. 15. An apparatus for executing parallel load operations, comprising: a computer having a data store coupled thereto, wherein the data store stores data; and one or more computer programs, performed by the computer, for identifying memory constrains, identifying processing capabilities, and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein the number of partitions is less than the difference of the sum of the amount of memory required for each sort process multiplied by the processing capabilities, the total amount of memory required for a main process, and the amount of memory required for each load process, divided by the difference of the amount of memory required for each sort process and each load process, wherein a number of load processes is equal to the number of partitions, and further comprising determining that the number of sort processes is the smaller of the difference of the total amount of available memory, the amount of memory required for the main process, and the amount of memory for each load process multiplied by the number of partitions, divided by the memory required for each sort process, and a number of indexes. 16. An apparatus for executing parallel load operations, comprising: a computer having a data store coupled thereto, wherein the data store stores data; and one or more computer programs, performed by the computer, for identifying memory constrains, identifying processing capabilities, and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of sort processes is equal to difference of the total amount of available memory, the amount of memory required for a main process, and the amount of memory required for each load process, divided by the difference of the amount of memory required for each sort process and each load process, and wherein the number of load processes is equal to the difference to the processing capabilities and the number of sort processes. 17. An article of manufacture comprising a program storage medium readable by a computer and embodying one or more instructions executable by the computer to perform a method for loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of indexes is less than half of the processing capabilities, wherein a number of sort processes is equal to the number of sort processes is equal to the number of indexes, and further comprising, determining that a number of load processes is the smaller of the difference of the processing capabilities available for the load processes and the number of sort processes, and a number of partitions. 18. An article of manufacture comprising a program storage medium readable by a computer and embody one or more instructions executable by the computer to perform a method for loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes, to be started in parallel based on the identified memory constants and processing capabilities, wherein a number of partitions if less than half of the processing capabilities, wherein a number of load processes is equal to the number of partitions, and further comprising deter that a number of sort processes is the smaller of the difference of the processing capabilities available for the sort processes and the number of load processes, and on a number of indexes. 19. An article of manufacture comprising a program storage medium readable by a computer and embodying one or more instructions executable by the computer to perform a method for loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of indexes is less than the difference of the total amount of available memory and the amount of memory required for a main process, divided by the amount of memory required for each load and sort process, wherein a number of sort processes is equal to the number of indexes, and further comprising determining that the number of load processes is the smaller of the difference of a total amount of available memory and the amount of memory required for the main process, and the amount of memory for each sort process multiplied by the number of indexes, divided by the memory required for each load process and, a number of partitions. 20. An article of manufacture comprising a program storage medium readable by a computer and embodying one or more instructions executable by the computer to perform a method for loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein the number of partitions is less than the difference of the total amount of available memory and the amount of memory required for a main process, divided by the amount of memory required for each load and sort process, wherein a number of load processes is equal to the number of partitions, and further comprising determining that the number of sort processes is the smaller of the difference of the total amount of available memory, the amount of memory required for the main process, and the amount of memory for each load process multiplied by the number of partitions, divided by the memory required for each sort process, and a number of indexes. 21. An article of manufacture comprising a program storage medium readable by a computer and embodying one or more instructions executable by the computer to perform a method for loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of load processes is to a number of sort processes which is equal to the difference of the total amount of available memory available and the amount of memory required for a main process, divided by the amount of memory required for each load and sort process. 22. An article of manufacture comprising a program storage medium readable by a computer and embodying one or more instructions executable by the computer to perform a method for loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein the number of indexes is less than the difference of the total amount of available memory, the amount of memory required for a main process, and the amount of memory required for each load process multiplied by the processing capabilities, divided by the difference of the amount of memory required for each sort process and each load process, wherein a number of sort processes is equal to the number of indexes, and further comprising determining that the number of load processes is the smaller of the difference of the processing capabilities and the number of indexes and, a number of partitions. 23. An article of manufacture comprising a program storage medium readable by a computer and embodying one or more instructions executable by the computer to perform a method for loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein the number of partitions is less than the difference of the sum of the amount of memory required for each sort process multiplied by the processing capabilities, the total amount of memory required for a main process, and the amount of memory required for each load process, divided by the difference of the amount of memory required for each sort process and each load process, wherein a number of load processes is equal to the number of partitions, and further comprising determining that the number of sort processes is the smaller of the difference of the total amount of available memory, the amount of memory required for the main process, and the amount of memory for each load process multiplied by the number of partitions, divided by the memory required for each sort process, and a number of indexes. 24. An article of manufacture comprising a program storage medium readable by a computer and embodying one or more instructions executable by the computer to perform a method for loading data into a data store connected to a computer, the method comprising the steps of: identifying memory constraints; identifying processing capabilities; and determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities, wherein a number of sort processes is equal to difference of the total amount of available memory, the amount of memory required for a main process, and the amount of memory required for each load process, divided by the difference of the amount of memory required for each sort process and each load process, and wherein number of load processes is equal to the difference of the processing capabilities and the number of sort processes.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.