International Business Machines Corporation

Philip Y Chang

Mark John Baugher

Daniel J Coyle, Jr

Alan Palmer Stephens

Gregory L Morris

Timothy Ray Malkemus

John W McInroy

Radhakrishna Aditham

Domingo S Hidalgo

Virginia M Hoffman

Paul H Kramer

Dan C Hargrove

Philip J Welti

Michael R Cross

Rebecca A Rodriguez

In a distributed computing environment, a token is issued to a remote user if a security mechanism initially can determine that the remote user is who he claims to be. Thereafter, a connection between a remote user and an application server requires the application server to first verify that a token associated with a connection request was issued by the security mechanism. If no token is associated with a connection request, or if any token associated with the request was not issued by the security mechanism, the connection is refused.

Authenticating remote users in a distributed environment

A method for providing files to a remote node including the steps of determining whether bandwidth is available for transmitting across a communications link a file requested by a remote node, reserving bandwidth for the requested file if bandwidth is determined to be available, and opening the requested file for transmission only if bandwidth is reserved. In addition, an apparatus for providing files to a remote node including apparatus for determining whether bandwidth is available for transmitting across a communications link a file requested by a remote node, apparatus for reserving bandwidth for the requested file if bandwidth is determined to be available, and apparatus for opening the requested file for transmission only if bandwidth is reserved.

Method and apparatus for reserving system resources to assure quality of

A pre-compiler for a host programming language contains a language dependent portion and a language independent portion. The language dependent portion extracts source file statements written in a supplemental language and converts them into a language independent format. The language independent statements are communicated to the language independent portion, which translates them into lists of tasks to be performed. These tasks are communicated back to the language dependent portion in a language independent format. The language dependent portion then translates the tasks into procedure calls in the host language.

Program source code translator

In a relational database system, a method is utilized that increases the performance of the sort operation. An optimizer routine in the relational database manager analyzes 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 optimizer 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 spring 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. The system and method of this invention reduces the total sort time by eliminating the overhead of writing the 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.

System and method for performing a sort operation in a relational

A sorting technique which relies on the operating system collating weights of characters to the extent that a collating weight difference exists in any of the pairs of corresponding characters of two different strings of characters being compared. While this comparision is being made, the first tie of collating weights for a pair of nonidentical corresponding characters triggers a comparison of the ASCII code values of the two corresponding characters which tied. Assuming that such a tie has occurred, and if, after reaching the end of this process no differences in the collating weights of corresponding characters are found, then if one string has a corresponding character with a lower ASCII value, that string is considered to precede the other string in the alphabetic sequence. This results in an automated alphabetizing procedure which is consistent regardless of the order in which the character strings are sorted, while retaining the flavor of the language conventions when possible, and while providing a solution not requiring substantial extra computing power.

Multilingual indexing system for alphabetical lysorting by comparing

Record data on a disk file is sorted in a text/data processor by means of an algorithm that transfers such records on the basis of rank to a sort buffer on the basis of qualifying criteria. Each qualified file record is compared with the lowest ranked record previously transferred and located in the sort buffer. When a higher ranked record is identified it is transferred into the buffer at a location based on qualification. Lower ranked records are deleted from the sort buffer if space does not permit the storing of such records within the space available. When the sort buffer has been loaded with the highest ranked records remaining in the disk file without overflowing the buffer is unloaded to an output device. The sort program recycles through a subsequent pass again transferring the highest ranked remaining records into the sort buffer. To minimize recycle time, a presort algorithm is run to set record identifying bits in a bit map section of the sort buffer. Each time the contents of the sort buffer is output the record identifying bits for the records in the sort buffer are reset to a second state. The second state of a record identifying bit indicates that that record will not be considered for future passes through the sort routine.

Growing community of inventors

Austin, TX, United States of America

Philip Y Chang