Method, system, and program for optimizing aggregate processing

• US 7,243,098 B2
• Filed: 12/19/2002
• Issued: 07/10/2007
• Est. Priority Date: 12/19/2002
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Lin, Fen-Ling, Wang, Yun, Zhang, Guogen, Cu, Jason Alexander, Cai, Mengchu, Lebovitz, Allan Benjamin, Lee, Li-Mey, Chen, Yao Ching Stephen
• Primary Examiner(s): Gaffin; Jeffrey
• Assistant Examiner(s): MAHMOUDI, HASSAN
• Application Number:
  US10/325,854
• Publication Number:
  US 20040122815A1
• Time in Patent Office: 1,664 Days
• Field of Search: 707/1, 707/3, 707/4, 707/5, 707/100, 715/513
• US Class Current: 1/1
• CPC Class Codes: G06F 16/20 of structured data, e.g. relational data
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

Disclosed is a method, system, and program for processing an aggregate function. Rows that contain a reference to intermediate result structures are grouped to form groups. For each group, aggregate element structures are formed from the intermediate result structures and, if the aggregate function specifies ordering, the aggregate element structures are sorted based on a sort key.

Claims

1. A computer-implemented method for processing an aggregate function, comprising:

if a first argument of the aggregate function is a nested function,

generating a composite structure that includes a tagging template for the nested function; and

generating an intermediate result structure for each row to be processed by the aggregate function, wherein each intermediate result structure references the tagging template;

grouping rows that contain a reference to intermediate result structures to form groups, wherein each of the intermediate result structures holds intermediate results including argument input values to represent different levels of nested functions; and

for each group,

forming aggregate element structures in memory from the intermediate result structures; and

if the aggregate function specifies ordering, sorting the aggregate element structures based on a sort key in memory.

2. The method of claim 1, wherein the first argument of the aggregate function is a column representing intermediate result structures.

3. The method of claim 1, wherein grouping is based on one or more grouping columns.

4. The method of claim 1, further comprising:

performing serialization after the aggregation function has been processed.

5. The method of claim 1, wherein the aggregate element structures form a doubly-linked list.

6. The method of claim 1, wherein each group of aggregate element structures has a group header.

7. The method of claim 6, wherein the group header references a first aggregate element structure and a last aggregate element structure in a group of aggregate element structures.

8. The method of claim 1, wherein sorting the aggregate element structures based on the sort key further comprises an in-memory sort for the aggregate element structures for a group based on the sort key.

9. The method of claim 8, wherein the aggregate element structures form a doubly-linked list and wherein sorting further comprises manipulating links of the doubly-linked list without moving data.

10. A system for processing an aggregate function, comprising:

a processor;

a memory coupled to the processor;

at least one program executed by the processor in the memory to cause the processor to perform;

if a first argument of the aggregate function is a nested function,

generating a composite structure that includes a tagging template for the nested function; and

generating an intermediate result structure for each row to be processed by the aggregate function, wherein each intermediate result structure references the tagging template;

grouping rows that contain a reference to intermediate result structures to form groups, wherein each of the intermediate result structures holds intermediate results including argument input values to represent different levels of nested functions; and

for each group,

forming aggregate element structures from the intermediate result structures; and

if the aggregate function specifies ordering, sorting the aggregate element structures based on a sort key.

11. The system of claim 10, wherein the first argument of the aggregate function is a column representing intermediate result structures.

12. The system of claim 10, wherein grouping is based on one or more grouping columns.

13. The system of claim 10, wherein the at least one program further causes the processor to perform:

serialization after the aggregation function has been processed.

14. The system of claim 10, wherein the aggregate element structures form a doubly-linked list.

15. The system of claim 10, wherein each group of aggregate element structures has a group header.

16. The system of claim 15, wherein the group header references a first aggregate element structure and a last aggregate element structure in a group of aggregate element structures.

17. The system of claim 10, wherein sorting the aggregate element structures based on the sort key further comprises an in-memory sort for the aggregate element structures for a group based on the sort key.

18. The system of claim 17, wherein the aggregate element structures form a doubly-linked list and wherein sorting further comprises manipulating links of the doubly-linked list without moving data.

19. An article of manufacture embodied as a computer readable medium comprising one of volatile and non-volatile storage and including a program for processing an aggregate function, wherein the program causes operations to be performed, the operations comprising:

if a first argument of the aggregate function is a nested function,

generating a composite structure that includes a tagging template for the nested function; and

generating an intermediate result structure for each row to be processed by the aggregate function, wherein each intermediate result structure references the tagging template;

grouping rows that contain a reference to intermediate result structures to form groups, wherein each of the intermediate result structures holds intermediate results including argument input values to represent different levels of nested functions; and

for each group,

forming aggregate element structures from the intermediate result structures; and

if the aggregate function specifies ordering, sorting the aggregate element structures based on a sort key.

20. The article of manufacture of claim 19, wherein the first argument of the aggregate function is a column representing intermediate result structures.

21. The article of manufacture of claim 19, wherein grouping is based on one or more grouping columns.

22. The article of manufacture of claim 19, the operations further comprising:

performing serialization after the aggregation function has been processed.

23. The article of manufacture of claim 19, wherein the aggregate element structures form a doubly-linked list.

24. The article of manufacture of claim 19, wherein each group of aggregate element structures has a group header.

25. The article of manufacture of claim 24, wherein the group header references a first aggregate element structure and a last aggregate element structure in a group of aggregate element structures.

26. The article of manufacture of claim 19, wherein sorting the aggregate element structures based on the sort key further comprises an in-memory sort for the aggregate element structures for a group based on the sort key.

27. The article of manufacture of claim 26, wherein the aggregate element structures form a doubly-linked list and wherein sorting further comprises manipulating links of the doubly-linked list without moving data.