Sort merge output

Abstract: In a relational database system, a method is used that increases the performance of the sort operation. An optimiser routine in the relational database manager analyses a user's complete query to determine whether the final sorted results can be used directly by the user as sorting occurs. If the sort results can be used, the sort results are sent to Relational Data Services in the relational database manager for output to the user. Depending upon the determination made by the optimiser routine, one of two output modes for the final sorted sequence string of data are selected by the relational database manager. In disk output mode, the last pass of the final sorted sequence string is written to disk. In fast direct output mode, the records of data are sent to the user as the final sorted sequence string is being merged during the last pass. Such an arrangement reduces the total sort time by eliminating the overhead of writing to disk during the fast direct output mode. Also, the response time, or availability for each record is reduced since each record is retrieved or sent to the Relational Data Services immediately after it has been sorted into the final sort order instead of completing the entire sort first, and then writing to disk.

Description: This invention relates to sort merge output in computerised databases. A database is used to store vast quantities of data for future retrieval upon request by a user. A user can be either an application program or an end user interacting with the database system through an input device. Related groups of data are commonly referred to as files of data, or tables, as commonly used in relational databases. The rows of data in a table are referred to as logical records, and the columns of data are referred to as fields. In a relational database system, the user perceives the data only as tables, and not in any other organisational form, e.g. a hierarchical structure of data. These database systems typically include a computer program, commonly referred to as a database manager, for storing, editing, updating, inserting, deleting, and retrieving data in response to various commands entered through a user interface. A database manager handles all requests from users to the database to perform the various functions as listed above. Specifically, with respect to retrieval of data, numerous computer languages were devised for formulating search commands or "queries" to which the database manager was responsive in providing the requested data. These queries were basically search instructions encoded so as to cause a computer and associated database manager to carry out the desired search. Several problems have been associated with these languages for formulating database queries. First, many of the query languages differed from conventional programming languages. The database user with programming experience was thus required to learn an entirely new set of commands just to get meaningful data out of the database. Users without such experience, such as many terminal operators who are also without computer experience of any kind, were thus forced to learn a form of computer programming just to interact with the database. Moreover, such query languages required knowledge of highly complex syntax and semantics rules, thereby further limiting the numbers who could successfully retrieve data to only a highly and expensively trained few. This, in turn, adversely affected the utility of such computer systems and seriously inhibited their use by a widespread number of individuals. The structured query language (SQL) is an interactive query language for end-users to use to interface with the database manager to retrieve information, and a database programming language which can be embedded in an application program to access the data in the database through the database manager. SQL is an easy way to specify the type of information needed. A representative of such query language is the Standard Query Language or "SQL" detailed in the Draft Proposal, ANA Database Language SQL, Standard X3.135-1986, American National Standard Institute, Inc., 1430 Broadway, New York, New York 10018. A detailed discussion of SQL is also set forth in "IBM Database 2 SQL Reference" Document Number SC26-4346-3, IBM Corporation. A major advantage of a relational database system is that instead of performing an explicit operation by the control of the user, the database receives inputs independently of the user that increases performance of retrieval of the data. All the user has to do is to specify the type of information that the user wants to retrieve from the database. For example, if a user wants information from two different tables of data, a relational database system will figure out how to retrieve the information from both tables of data in the most efficient way. In database systems prior to relational database systems, the programmer controlled how the information was retrieved. In a relational database system, the system decides how to retrieve the data. In many database processing systems, the sort function is an important part of the system. In some instances, half of the computing power of a database processing system can be used for the sort function alone. In a relational database, a user uses a sort command if the user wants the output ordered in a certain way. There is also an implicit sort which is used by the database system when the system decides that a sort function is needed to efficiently retrieve information for a user. For example, a relational database system uses a sort when two tables are to be joined together more efficiently. A sort function is an expensive function in a processing system since it requires a lot of processing time to perform compare instructions that are necessary to the sort command. In addition, if a large amount of data is to be sorted, the database system will write an intermediate portion of the data being sorted to a disk or hard file. This portion of data is read back and further sorted. If all the data that is to be sorted can be stored at one time in the memory of the CPU, no external sort using an I/O operation is needed. If all of the data can not be stored at one time in the memory of the CPU, a portion of that data is sorted, the result is stored to disk, and a portion of the sorted data on a hard file is read back into memory to be further sorted with another portion of unsorted data. Writing and reading back from a file can occur multiple times during a sort operation. The time that it takes to perform an I/O operation can be very costly in a sort operation. Sort time performance is a critical competitive measure of relational database products for several reasons. First, the sort operation is one of the most frequently used operations in a relational database system. Second, improvements in query performances, such as those queries that use a sort operation, are very perceptible by the end user by the amount of time that a user has to wait for the result of the query. Therefore, sort performance in a relational database is an important competitive bench mark in database products. For more background on relational databases and the SQL language, the following reference is also mentioned, Date, C. J. An Introduction to Database Systems , The Systems Programming Series, Volume 1, Fourth Edition, Addison-Wesley Publishing Company, 1986. 11th Annual International Symposium on Computer Architecture, 5 June 1984, Ann Arbor, USA, pages 134-141 discloses a database system, and in particular an architecture for dealing with SQL queries. It has, as an object, minimising disk I/O by optimising the query. It does not disclose the use of different modes; that is passing the result back to the user or into memory. 12th Annual International Symposium on Computer Architecture, 17 June 1985, Boston, USA, pages 250-257, the closest prior art, discloses a database system including a sorter and a merger. Results which are further needed are automatically entered into the process via memory. The present invention provides a method of processing a query statement in a relational database to produce a sorted query result, the method comprising the steps of performing a sort operation; characterised in that said sort operation comprises the steps of: ordering a plurality of rows in the relational database into a plurality of ordered sequence strings; and merging the ordered sequence strings into a plurality of merged sequence strings during at least one intermediate merge pass; and that the method further comprises the steps of: generating by a database manager a plan for processing of said query statement; determining by the database manager, a first mode for directing a sort output of the sort operation if said output will be used less than or equal to a predetermined number of times, and a second mode for directing a sort output of the sort operation if said output will be used more than a predetermined number of times; in said first mode, returning sequentially and directly, to a user of said relational database, a plurality of final sorted rows resulting from a final merge pass of the merged sequence strings as each one of the final sorted rows are ordered; and in said second mode, writing said final sorted rows to disk. The present invention also provides a counterpart system for performing the method. When sorting a significant amount of data, i.e. more data than can be stored in the memory of the CPU at one time, only the amount of data that can be stored in memory at one time is used, and then it is stored to a hard file disk. It is typically stored to disk in sorted order. A next group of data is then stored in memory of the CPU, sorted, and stored to disk. This is repeated until all the data has been separately grouped, sorted, and stored separately to disk. The groups of sorted data on disk are then merged together. A first portion of all the groups are brought together and sorted and stored back to disk. This is repeated such that the remaining portions of the groups of data are sorted together and stored back to disk. Such an arrangement increases the performance of a relational database as seen by a user by eliminating the I/O operations of writing the final sorted data out to disk. Instead, the results of the sorted data are presented to the user as they are organised into the final sort order. The overhead of writing the final sorted data to disk and reading it back into memory is eliminated. Since the ordered data is passed back to the requestor as the data is actually ordered, the requestor does not have to wait until the entire set of data is ordered. Sort services, a component of a relational database manager using this technique, provides a capability to receive rows of data and organise them into the requested ascending or descending order. There are two major parts to a sort. First is the insert phase where rows of data are received from relational data services (RDS) and placed into ordered sequence strings. Second is the merge phase that is done after all rows of data are received. The merge phase takes the sequence strings and merges them together into a single string of ordered data. Previous database management systems place this final string of data in a temporary file on disk. Writing to disk is referred to herein as the disk output mode. In the present arrangement, relational data services can read this data as it needs it in a fast direct output mode. An optimiser routine determines which mode, disk output mode or fast direct output mode, will be the most efficient for a given query statement. The mode selected will depend upon whether the query statement will use the sorted data only one time or multiple times. In the cases of some SQL operations such as Order By, Group By, or the outer pass of a Merge/Join, the direct output mode is more efficient than the disk output mode by removing much of the overhead of the merge phase. The insert phase is done the same regardless of whether output is going to be to an output file or directly to relational data services. At the start of the merge phase, sort services tests to find whether the optimiser routine of relational data services indicated that the final sorted data does not need to be placed on disk in the form of an ordered temporary file. If the data is not required to be placed on disk, sort services proceeds with its merge until it gets to its final pass. The final pass is recognised by comparing the number of sequence strings remaining to the number of merge buffers. If the number of merge buffers is equal or greater than the number of sequence strings, then it is the last pass. This means that each row selected from the top entries of all sequence strings is the next entry in the final sorting output. When sort services recognises that it is ready to start the final merge pass, and it is doing fast direct output, it returns to relational data services indicating that it is ready to accept sort fetches from relational data services. When relational data services does a sort fetch, sort services chooses the correct next row from the remaining sequence strings, and returns it to relational data services. This process is repeated until all rows are returned to relational data services. As disclosed hereinafter by way of example, an embodiment of the invention comprises means in a relational database manager, for determining, by analysis of a query statement and/or the execution thereof, a first or second mode for directing a final sort output of the sort operation; means for ordering a plurality of rows in a relational database into a plurality of ordered sequence strings; means for merging the ordered sequence strings into a plurality of merged sequence strings during at least one intermediate merge pass; means for selecting sequentially one of the rows from a top entry from each of the merged sequence strings as a next entry in a final single ordered string during a final merge pass; means for returning sequentially, to a user of the relational database system, the one of the rows as the row is being selected as the next entry in the final single ordered string, in the first mode; and means for writing the final single ordered string to disk in the second mode together with the counterpart method. There are two major areas of improved performance with such a system and method. Firstly, total end-to-end sort time is reduced by eliminating a disk write and read of all sorted data. Secondly, the response time for each sorted row is improved since the records are returned to the user through the relational data services as the records are put in final sort order, rather than waiting for all the records to be sorted before returning any of them to the user through relational data services. The present invention will be described further by way of example with reference to an embodiment thereof as illustrated in the accompanying drawings, in which: Fig. 1A and Fig. 1B are generalised views of the relational data base processing system of this invention; Fig. 2A and Fig. 2B illustrate sample tables for use in the relational data base; Fig. 3 is a flow chart of the overall data base operation; Fig. 4 is a flow chart of the sort insert phase; Fig. 5 is a flow chart of the sort open phase; Fig. 6 is a flow chart of the sort fetch phase; Fig. 7 is a flow chart of the optimiser for determining the output mode; Fig. 8 illustrates the data in internal buffers in memory and the resulting multiple sequence strings on disk; and Fig. 9 illustrates merging the multiple sequence strings to a final sorted string to disk or to a user through relational data services, depending on the output mode. Beginning with reference to the block diagram of Fig. 1A and Fig. 1B, a generalised view of the processing apparatus which may be used to carry out the present invention is shown. Fig. 1A shows a typical personal computer architecture, such as the configuration used in the IBM Personal System/2. The focal point of this architecture comprises a microprocessor 1 which may, for example, be an Intel 80286 or 80386 or similar microprocessor. The microprocessor 1 is connected to a bus 2 which comprises a set of data lines, a set of address lines and a set of control lines. A plurality of I/O devices or memory or storage devices 3-8 are connected to the bus 2 through separate adapters 9-14, respectively. For example, the display 4 may be the IBM Personal/System Color Display 8514 in which the adapter 10 may be integrated into the planar board. The other devices 3 and 5-8 and adapters 9 and 11-14 are either included as part of an IBM Personal System/2 or are available as plug-in options from the IBM Corporation. For example, the random access memory 6 and the read-only memory 7 and their corresponding adapters 12 and 13 are included as standard equipment in the IBM Personal System/2, although additional random access memory to supplement memory 6 may be added via a plug-in memory expansion option. Within the read-only memory 7 are stored a plurality of instructions, known as the basic input/output operating system, or BIOS, for execution by the microprocessor 1. The BIOS controls the fundamental operations of the computer. An operating system 15 such as OS/2 is loaded into the memory 6 and runs in conjunction with the BIOS stored in the ROM 7. It will be understood by those skilled in the art that the personal computer system could be configured so that parts or all of the BIOS are stored in the memory 6 rather than in the ROM 7 so as to allow modifications to the basic system operations by changes made to the BIOS program, which would then be readily loadable into the random access memory 6. For more information on the Personal System/2, and the operating system OS/2, the following reference manuals are suggested. Technical Reference Manual, Personal System/2 (Model 50,60 systems) , IBM Corporation, part number 68X2224, order number S68X2224. Technical Reference Manual, Personal System/2 (Model 80) , IBM Corporation, part number 68X2256, order number S68X-2256. IBM Operating System/2 version 1.0 Standard Edition Technical Reference , IBM Corporation, part number 6280201, order number 5871-AAA. Iacobucci, Ed, OS/2 Programmer's Guide , McGraw Hill, 1988. In the apparatus of this invention, an application program 18 such as a relational database manager 20 may also be loaded into the memory 6 or be resident on media 5. Media 5 may include, but is not limited to, a diskette, or a hard file. The relational database manager 20 may also be considered an extension of the operating system 15. The relational database manager 20 comprises a comprehensive set of relational database manager tasks, including but not limited to, a sort task 23, a relational data services task 25, and an optimiser task 27. The relational database manager tasks provide instructions to the microprocessor 1 to enable the processing system shown in Fig. 1A and Fig. 1B to perform relational database functions. An application program 18, loaded into the memory 6 is the to run in conjunction with the operating system previously loaded into the memory 6. In the processing system of Fig. 1A and Fig. 1B, the operator 19 accesses the relational database manager 20 through operator control keys on keyboard 3. The keyboard drives the processor 1 which is operably connected to the display 4 as well as the media storage 5 and memory 6 through bus 2. As a user interacts through the keyboard 3 with the relational database manager 20, the relational database manager 20 and its data are displayed to the user through display 4. In addition to a user interacting with the relational database manager 20, an application 18 could interact with the database manager 20 through SQL commands in the application 18. The present invention will be described with reference to the database tables shown in Fig. 2A and Fig. 2B. In the SQL language, the database table 22, Fig. 2A, would be defined and described by a user as follows: CREATE TABLE is an example of a SQL data definition statement. Each CREATE TABLE statement gives the name 24 of the table 22 to be created, the names of its columns 26, 28, and the data types of those columns. After the user executes the CREATE TABLE statement, the table will be empty initially, i.e., the table will not contain any data rows 202. However, a user can immediately insert the data rows 202 using the SQL INSERT statement to get the table as shown in Fig. 2A. The user is now able to do some useful operations with this table, along with any other tables that have been created as shown in Fig. 2B. For example, the user could order the data in the table 22 by ID number, could join table 22 with another table, e.g., with a table 21 having corresponding salaries for each of the ID numbers, or perform a GROUP BY operation such as selecting the maximum salary and grouping by department. If the operation MERGE JOIN is used to join multiple tables two at a time, the relational database manager performs a sort operation, if indexes are not available, to order the rows sequentially from the tables. Referring to Fig. 3, the user 19 or an application 18 would enter the statement for the operation desired, step 31. For example, the user/application may issue the following statement: SELECT * FROM STAFF ORDER BY ID. The command SELECT * is used to get all the columns of a row. The optimiser 27 Fig. 1A, 1B, would then determine which output mode would be used for the given operation statement entered by the user/application, step 32 Fig. 3. The default mode is the disk output mode, step 34, which may be changed for certain sort plans to the fast direct output mode by the optimising routine 32. The optimiser 27 is a component of relational data service 25 which decides which of several methods, i.e. plans, of accessing data should be used for a given query statement. For example, whether an index should be used or a sequential scan, or whether a sort operation should be performed. The optimising routine, step 32, Fig. 3 is further shown and described with reference to Fig. 7, which is a routine that is invoked after the optimiser 27 has produced all the plans needed to process a query statement. A plan represents an operation on a table such as a table access or a join which is used to produce the result of a query. For example, a join plan has two input plans; one for the outer table, and one for the inner table. The outer table is accessed first with matching rows of the inner table being joined with each row of the outer table. The optimiser routine 32 is invoked for each of the plans for the query. When sort plans are first created, they have the disk output option. The following optimiser routine 32 may change the disk output option of certain sort plans to the fast direct output option. The optimiser routine 32, Fig. 7, first determines if the plan is a table access plan, step 121, Fig. 7. A table access plan is a request to read the rows of a table, one at a time. If the plan is a table access plan, step 123 determines if the plan is the root plan of a query. A root plan produces the final result of the query. If it is not, the routine returns without enabling fast direct output. If it is, step 125 determines if the table access plan has a sort input plan. If it does, the sort plan is enabled for fast direct output, step 127. Otherwise, fast direct output is not enabled, and the routine exits. If the plan is not a table access plan as determined in step 121, step 129 determines if the plan is a join plan. A join plan represents the accessing of two tables, and combining them. If it is not, fast direct output is not enabled, and the routine exits. If it is a join plan, step 131 determines if the join plan's outer plan is a table access plan. If it is not, fast direct output is not enabled and the routine exits. If it is, step 133 determines if the table access plan has an input sort plan. If it does, fast direct output is enabled for that sort plan, and the routine exits. Otherwise, fast direct output is not enabled, and the routine exits. Referring back to Fig. 3, after the user/application entered the query statement, step 31, and the optimiser determined the appropriate output mode for that operation, step 32, the relational data services 25 of the relational database manager 20 would then fetch a row 211-218 one at a time from the table 22 (Fig. 2A) that has been stored on disk 5, step 33, Fig. 3. Several of the query statements, including the ORDER BY statement, require the relational database manager 20 (Fig. 1A, 1B) to perform a sort operation to get the rows of data 202 (Fig. 2A) in the requested order. As shown in the flow diagram of Fig. 3, the sort function 23 has three major phases. In the insert phase 41, the rows are received by sort 23 in unknown order. The insert phase 41 will be further described with reference to Fig. 4. In the open phase 45 of sort 23, the sort 23 prepares the data for returning in sorted order. The open phase 45 will be further described with reference to Fig. 5. In the fetch phase 51 of sort 23, the data is returned through the relational data service 25 to the caller in sorted order. The fetch phase will be further described with reference to Figure 6. As the relational data service 25 receives a row 211 from the table 22, step 33 Fig. 3, relational data service 25 passes this row 211 to the sort function 23 in the sort insert phase, step 41. During the sort insert phase, rows of data are received from the relational data service component 25 of the database manager 20. This data is received in unordered form, and there is no indication of how much data will be received. The sort insert phase is further described in reference to Fig. 4 and Fig. 8. Sort receives one row of data with each call from relational data service 25 during the sort insert phase 41. A test is made, step 61, to determine if space is available in the internal buffers 62 for the data. If space is available, sort 23 places the data 211-218 (Fig. 2A) into internal buffers 62 (Fig. 8) in sequential order as the data is received, step 65, (Fig. 4). Sort 23 then builds an entry for a balanced binary tree 64 to point to the row of data in the buffer 62, step 67. The binary tree 64 is used to track the sorted order of the data. If the internal buffers 62 are full, step 61, the data is written to disk as an ordered sequence string 66 (Fig. 8), step 63 (Fig. 4), of all of the data from all the buffers 62 combined. As additional rows are received from relational data service 25, the internal buffers 62 will be filled again, with the process being repeated as many times as needed to handle all the data received. Each time the internal buffers 62 are written to disk 5, step 63 (Fig. 4) a new sequence string 66 is formed of all of the data from all of the newly filled buffers 62. Referring back to Fig. 3, if all the rows have been fetched from the table by relational data service 25 and sent to the sort insert phase, step 37, then relational data service 25 signals the end of the data to be sorted, step 43. The second phase of the sort function 23, sort open 45, is invoked by a call from relational data service 25 signalling that no more data rows will be passed to sort 23. At this time, sort 23 prepares to return the sorted rows to relational data service 25. Such an arrangement allows the sorted rows to be returned to relational data service 25, in one of two modes. One mode, disk output mode, results in all the sorted data being written to disk in the form of an ordered temporary file. In the other mode, called fast direct output mode, as each row is placed into final sorted order, it can be passed directly back through relational data service 25 to the user/application when requested. Each method has performance advantages that depend on how the results will be used. If the sorted data is only going to be used once, as determined by the optimiser routine 32 in Fig. 7, it is best to pass it directly back to avoid the time needed to write it to a file and later retrieve it. However, if the sorted data is to be used more than once, it is best to write the data to disk so it is only sorted once prior to multiple usages. For example, if the optimiser routine 32 Fig. 7, determined that the plan was a root plan, then the sorted data would be used only once and the fast direct output mode was enabled. Also, if the outer table is joined, the sorted data will only be used once and the fast direct output mode is enabled. If not, the inner table was joined meaning the sorted data would be used more than once. In this case, the fast direct output mode was not enabled. Relational data service 25 pre-compiles the SQL statements that require sort 23. Relational data service 25 goes through a decision process to determine if it is more efficient to have the sorted data go directly back to relational data service 25, or be written to disk. The determining factor is whether the data will be used one time or multiple times. Relational data service 25 recognises this by examining the operation type requested. Generally, if an ORDER BY or GROUP BY operation is called for, direct return of data to relational data service 25 can be implemented. However, for a MERGE/JOIN operation, the output mode depends on the part of data being processed. When an outer pass of a MERGE/JOIN is performed, the direct output mode can be used for increased performance. For all other sorts required during a MERGE/JOIN operation, the output to disk mode would be preferable. The optimiser 27 of the relational data service 25 selects the optimal method for sort output with no special knowledge of action by the user/application. The sort open phase 45 will be further described in reference to Fig. 5, Fig. 8, and Fig. 9. If the optimiser 27 of relational data service 25 selects the output to disk mode, the following steps are performed. First, sort 23 writes any data remaining in its internal buffers 62 (Fig. 8) to disk 5 as an ordered sequence string 66, step 77. If there is only one sequence string on disk, step 84, the data is in its final sorted order. Sort 23 will then read the first page of the sequence string 66, step 89. The sort open phase 45 is then completed. If there are multiple sequence strings on disk, sort 23 must combine them into a single sequence string through a merge operation, step 81. The merge operation, Fig. 9, involves comparing the top rows 221 from each sequence string 66, picking the next one in the overall ordered sequence from the sequence strings, and placing it into the merged sequence string 68. This process is continued until there only remains one final sequence string 68, on disk, containing all the sorted data. Referring to Fig. 3, during the output to disk mode, the third phase of sort 23, called the fetch phase 51, is invoked by relational data service after the insert phase 41, and the open phase 45 have been completed. The fetch phase 51 consists of relational data service issuing a fetch request for each row of sorted data, step 44. In response to each fetch, sort 23 retrieves a row of data from the final sequence string on disk, and passes it to relational data service 25. The above disk output mode is used if the sorted data is to be used repeatedly. In this case, the fast direct output mode is not enabled, and the sort function 23 operates as previously described. The fast direct output mode is enabled for those cases where the sorted data will be accessed only once by relational data service. Relational data service enables the fast direct output mode for the SQL operations such as ORDER BY, GROUP BY, or the outer pass of a MERGE/JOIN. During the direct output mode, sort 23 has the same three phases as described previously. The insert phase 41 (Fig. 4) is performed in the same way regardless of whether the disk output mode of the direct output mode is selected. However, the open phase 45 (Fig. 5) and the fetch phases 51 (Fig. 6) are changed if the direct output mode is selected. Referring to Fig. 3, when sort 23 is called by the relational data service 25 to open, step 41, it signals the end-of-data, step 43, and the preparation of the fetch operation. Referring to Fig. 5, the sort open phase 45 tests to find if relational data service enabled the fast direct output mode, step 73. If the fast direct output mode is enabled, the final sorted data will not be placed on disk in the form of an ordered temporary file. Sort 23 tests to find if all of the data is in memory, step 71 (Fig. 5). If all of the data is in memory, sort 23 creates an array of pointers to the rows of data in the buffers, step 75. Then, sort 23 returns to relational data service 25 indicating that it is ready to accept sort fetches from relational data services 25, step 91. If there is more data than fits in memory, and fast direct output mode has been selected, sort proceeds as previously described through steps 77, 79, and 81 (Fig. 5). If there are multiple sequence strings, sort will continue merging them until sort is ready for the final pass. The final pass is recognised by comparing the number of sequence strings remaining to the number of merge buffers, step 79. If the number of merge buffers is equal or greater than the number of sequence strings, then it is the last pass. After this time, each row selected from the top entries of all sequence strings is the next entry in the final sorted output, step 89. When sort recognises that it is ready to start a final merge pass (or there was only one or no merge pass required), it returns to relational data service indicating that it is ready to accept sort fetches from relational data service, step 91. Referring to Fig. 3, after completion of the open phase step 45, relational data service 25 can fetch sorted data rows from sort 23. The sort fetch phase 51, is further described in Fig. 6. Each time relational data service calls sort for a sort fetch operation, sort fetch determines if there is a next row, step 101. If there is not a next row, sort fetch sets an end of data indicator for relational data service, step 103, and returns to relational data service, step 117. If there is a next row, and fast direct output has been selected, a test is made to determine if the data is coming from disk, or if the data is coming from memory, step, 107. If all of the data is in memory, sort fetch selects the next row from the buffers, and returns the row to relational data service, step 113, 115. If the data is coming from sequence strings on disk, the sort fetch phase selects the next row from the top of all strings, step 109. This is also illustrated in Fig. 9. The row of data is then passed to relational data service, step 115. In cases with multiple sequence strings, sort with direct output is, in effect, returning a row of data prior to all remaining rows being merged into a single ordered string. Relational data service continues the process of fetch calls until all rows are returned to relational data service. It is transparent to relational data service whether the data is being returned under the fast direct output mode or not. Such an arrangement reduces the overhead associated with a sort, and returns sorted data to the caller as fast as possible. Two benefits of this are reduced load on the system, which leaves it available for other functions, and improved response time and throughput for the user of the sort function. In the fast direct output method of this arrangement, sort does not write the final sorted data to a temporary file on disk as the prior art database systems have done. Instead, it returns the data directly to the caller. This technique does not wait until all data is in final sorted order before starting to return sorted data to the caller. With the fast direct output method of this arrangement, when sort recognises that it is starting to get the data into final sorted order, it will pass each row directly to the caller as soon as the row is picked as the next in the sorted sequence. Several gains are realised from this technique. Since the final sorted data is not written to a temporary file on disk, and then read back when requested by the user, total sort time is reduced. Also, elimination of that disk write and read reduces the load on a system leaving it available for other users. Another gain is in the response time for each sorted row. Since the rows are returned immediately as they are put in final sorted order, rather than sorting all rows before returning any of them to the caller, response time for each sorted row is improved. When the caller gets sorted data back, it may either display it immediately to the user, or use it in another step of an operation. In either case, any improvement in the individual response time is useful. Although in the foregoing, the various aspects of the present invention have been particularly shown and described with reference to the preferred embodiments thereof, it will be understood by those skilled in the art that other changes in form may be made without departing from the scope of the claims.

Claims: A method of processing a query statement in a relational database to produce a sorted query result, the method comprising the steps of: performing (41,45,51) a sort operation; characterised in that said sort operation comprises the steps of: ordering (67) a plurality of rows in the relational database into a plurality of ordered sequence strings; and merging (81,85) the ordered sequence strings into a plurality of merged sequence strings during at least one intermediate merge pass; and that the method further comprises the steps of: generating by a database manager, a plan for processing of said query statement; determining (32) by the database manager, a first mode for directing a sort output of the sort operation if said output will be used less than or equal to a predetermined number of times, or a second mode for directing a sort output of the sort operation if said output will be used more than a predetermined number of times; in said first mode, returning (53) sequentially and directly, to a user of said relational database, a plurality of final sorted rows resulting from a final merge pass of the merged sequence strings as each one of the final sorted rows are ordered; and in said second mode, writing (45,51) said final sorted rows to disk. A method as claimed in claim 1 wherein said predetermined number of times is one. A method as claimed in claim 2 wherein the plan has a sort input plan to a root plan of a table access plan or the plan has a sort input plan to an outer plan of a join plan. A method as claimed in claim 1 or claim 2, wherein the database manager determines if said output will be used more than said predetermined number of times by analysis of the query statement, per se. A method as claimed in claim 4, wherein the first mode is selected if the query statement is an ORDER BY statement or a GROUP BY statement. A relational database system (20) for processing a query statement to produce a sorted query result, the system comprising: means (23) for performing a sort operation; characterised in that said means (23) for performing a sort operation comprises: means (67) for ordering a plurality of rows in the relational database into a plurality of ordered sequence strings; and means (81,85) for merging the ordered sequence strings into a plurality of merged sequence strings during at least one intermediate merge pass; the system further comprises: means (31) for generating a plan for processing of said query statement; means (32) for selecting a first or a second mode of output to be used, said first mode directing a sort output of the sort operation if said output will be used less than or equal to a predetermined number of times, or said second mode directing a sort output of the sort operation if said output will be used more than a predetermined number of times; means (53), responsive to selection of said first mode, for returning sequentially and directly, to a user of said relational database, a plurality of final sorted rows resulting from a final merge pass of the merged sequence strings as each one of the final sorted rows are ordered; and means (45,51), responsive to selection of said second mode, for writing said final sorted rows to disk. A system as claimed in claim 6 wherein said predetermined number of times is one.

Inventors: CHANG PHILIP YEN-TAN, COYLE DANIEL JEROME JR, MALKEMUS TIMOTHY RAY, RODRIGUEZ REBECCA ANN, WELTI PHILIP JOHN, CHANG, PHILIP YEN-TAN, COYLE, DANIEL JEROME, JR., MALKEMUS, TIMOTHY RAY, RODRIGUEZ, REBECCA ANN, WELTI, PHILIP JOHN
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1989
Main classification: G06F17
IPC codes: G06F7, G06F17, G06F12