DATABASE SYSTEM

• US 20070143253A1
• Filed: 12/08/2006
• Published: 06/21/2007
• Est. Priority Date: 12/19/2005
• Status: Active Grant

• Current Assignee: Teradata US, Inc. (Teradata Corporation)
• Original Assignee: Teradata US, Inc. (Teradata Corporation)
• Inventors: Kostamaa, Pekka, Ramesh, Bhashyam
• Granted Patent: US 7,792,809 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24532 of parallel queries

Abstract

There is provided a parallel database system 1. System 1 includes a storage device 2 for maintaining a plurality of rows 3. System 1 also includes a plurality of access modules 4 for accessing in parallel a respectively assigned one or more of rows 3. An interface 5 receives data 6 indicative of a table 7 defined by a selection 8 of rows 3. A processor 9 is responsive to data 6 for selectively designating table 7 to be a single-module table. In this single module table, selection 8 is collectively assigned to an owning one of modules 4, indicated by reference numeral 10.

Claims

1. A database system including:

a storage device for maintaining a plurality of rows;

a plurality of access modules for accessing in parallel a respectively assigned one or more of the rows;

an interface for receiving data indicative of a table defined by a selection of the rows; and

a processor responsive to the data for selectively designating the table to be a single-module table wherein the selection of rows are collectively assigned to an owning one of the access modules.

2. A system according to claim 1 making use of massively parallel processing architecture.

3. A system according to claim 1 wherein the data is in the form of a user command.

4. A system according to claim 3 wherein the user command is provided by a user for designating the table to be a single module table.

5. A system according to claim 1 wherein the storage device maintains the table and of a copy of the table, and the rows defining the copy of the table are distributively assigned to a plurality of the access modules.

6. A system according to claim 5 including an optimizer responsive to a submitted database query of the table for determining whether either or both of the table and the copy of the table is to be used in the execution of the query.

7. A system according to claim 6 wherein the optimizer makes the determination on the basis of estimated processing costs of the query.

8. A system according to claim 5 wherein the single-module table is a fallback copy of the multiple-module table.

9. A system according to claim 5 wherein the multiple-module table is a fallback copy of the single-module table.

10. A system according to claim 1 wherein the owning access module is dynamic.

11. A system according to claim 10 wherein the owning access module is dynamic to provide load balancing among the plurality of modules.

12. A system according to claim 10 wherein the database system includes a plurality of nodes, each node carrying a parsing processor and one or more of the modules, and the owning access module is dynamic to allow co-location of processing and parsing to a single node for a given query.

13. A system according to claim 1 wherein the storage device includes a predefined location for maintaining the single module table.

14. A system according to claim 13 wherein the predefined location is a common disk area accessible by a predetermined one or more of the modules.

15. A system according to claim 13 wherein the common disk area is accessible by all of the plurality of modules.

16. A database system including:

a plurality of nodes for accessing data; and

a plurality of primary storage locations each for maintaining a portion of the data, each portion being maintained for access by a respective associated one of the nodes; and

a secondary storage location for selectively maintaining one or more portions of the data for access by a predetermined one or more of the nodes.

17. A system according to claim 16 wherein the secondary storage location maintains the one or more portions of the data for access by any of the nodes.