Abstract: Disclosed is a method, system, and program for diagnosing a computer over a network, such as the Internet. A program, such as an applet, is provided that executes on the computer. The program causes the computer to download at least one object from a server over the network. Performance data is determined with respect to downloading the object from the server to the computer over the network in order to diagnose performance problems with the computer. The determined performance data is then transmitted to a diagnostic system over the network.

Abstract: Provided is a gripper assembly including a gripper capable of engaging a storage device having a data interface through which data is transferred to a storage medium within the storage device. The gripper assembly includes extending members capable of engaging the storage device, a data interface capable of engaging the storage device data interface to allow data communication with the storage medium in the storage device, and movement electronics to move the gripper in at least one direction.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: Provided is a method, system, program, and data structures for decompressing a compressed data stream. The compressed data stream is decoded a first time to generate multiple reentry data sets. Each reentry data set includes a pointer to a location in the data stream and decoding information that enables decoding to start from the location addressed by the pointer. The compressed data stream is then decoded from the beginning to a point preceding a location addressed by a first reentry data set. For each generated reentry data set, the location in the compressed data stream addressed by the pointer in the reentry data set is accessed. The decoding information in the reentry data set is then used to decode compressed data from the accessed location to a point preceding the location addressed by the pointer in the next reentry data set. For concatenated bit planes, the original multi-bit pixel values are reassembled in buffers and then outputted.

Abstract: Disclosed is a system, method, and program for uninstalling a program and deleting files. The program is defined by a plurality of file sets. Each file set defines a set of functions performed by the program. A flag is provided with each file set of the program indicating one of a first and second value. The flag values indicate those files which are enabled and unenabled to be deleted. A determination is made as to the file sets having the first flag value. A graphical user interface (GUI) then displays at least one user selectable option to uninstall at least one determined file set or file having the first flag value. User input is then received indicating file sets or files to delete or uninstall and the file sets the user input indicated to uninstall are uninstalld.

Abstract: A database management system having a dropped table recovery flag. If the dropped table recovery flag is on at the time that a table is dropped, an entry will be made in a dropped table history file. The dropped table history file contains a timestamp of the time of table drop, a unique dropped table identifier, and table definition information. The system includes a command to permit the table-space of a dropped table to be restored and rolled forward to the point of the dropped table drop. The restored and rolled forward dropped table data is written to a flat file. The flat file data is loaded into a recreated table in the current table space to recover the dropped table.

Abstract: Disclosed is a semiconductor structure and manufacturing process for making an integrated FET and photodetector optical receiver on a semiconductor substrate. A FET is formed by forming at least one p channel in a p-well of the substrate and forming at least one n channel in the p-well of the substrate. A p-i-n photodetector is formed in the substrate by forming at least one p channel in an absorption region of the substrate when forming the at least one p channel in the p well of the FET and forming at least one n channel in the absorption region of the substrate when forming the at least one n channel in the p-well of the FET.

Abstract: Disclosed is a system, method, and program for implementing components of a user interface as an object. A user interface is implemented in a first user interface program object including elements compatible with a first user interface program. A standard application program interface (API) calling a first standard object to create a second standard object as an element of the first standard object is received. The standard API is a member of a set of standard APIs, such as the W3C APIs. A second user interface program API is generated to create a second user interface program object corresponding to the second standard object. The second user interface program object is embedded as an element in the first user interface program object.

Abstract: Disclosed is a system, method, and program for determining boundaries in a string of characters using a dictionary, wherein the substrings in the dictionary may comprise words. A determination is made of all possible initial substrings of the string in the dictionary. One initial substring is selected such that all the characters following the initial substring can be divided into at least one substring in the dictionary. The boundaries follow each of the initial substring and the at least one substring that includes all the characters following the initial substring.

Abstract: A method of searching a table in a database management system for free space for inserting a new record into the table. The table resides in a storage media, and includes a series of pages capable of storing a plurality of records. The table has a clustering index defined in a column of the table. The new record has a new record attribute for storing in the column of the table when the new record is stored in the table. The method comprises searching for a target page in the series of pages, the target page being selected to maintain clustering when the new record is inserted thereon. Once the target page has been located, it is searched for sufficient free space to accommodate the new record. If sufficient free space is found on the target page, then the new record is inserted on the target page. If sufficient free space is not found on the target page, then a target neighborhood of pages in the series of pages is searched for sufficient free space to accommodate the new record.

Abstract: Provided is a method, system, and program for configuring an attached storage device through a storage adaptor. The storage adaptor includes an initialization routine to generate initialization data to write to the storage device when adding storage space in the storage device to a system. A request is received to add storage space to the system. A command is transmitted to the storage adaptor capable of inhibiting the storage adaptor from performing the initialization routine. Initialization data is generated for the storage space and transmitted to the storage adaptor to write to the storage space to initialize the storage space.

Abstract: Provided is a method, system, and program for performing a cursor operation. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. A command is received to perform a cursor operation with respect to a subject row in the result table. A lock is obtained on a row in the base table corresponding to the subject row in the result table. An operation specified in the received command is performed with respect to the subject row after obtaining the lock. The lock on the row in the base table is released after performing the operation.

Abstract: Disclosed is a system, method, and program for determining a structure of objects in a document, such as an XML document. The document is parsed to determine instances of objects within the document. Each instance of each object is parsed to determine whether a value is provided for the object. Information is returned on each instance of each object in the document and location information is returned of the value for each object in the document having a value. The returned information identifies the objects in the documents and the location of any values for identified objects in the document. When the location information is returned, a string comprising the value from the document is not returned.

Abstract: Disclosed is a method, system, program, and data structures for transforming an instruction in a first bit architecture, e.g., 32 bit, to an instruction in a second bit architecture, e.g., 64 bit. Code is transformed from an instruction in the first bit architecture having an operation code and at least one operand. A transform table is accessed including information for transforming the instruction in the first bit architecture to the second bit architecture. The instruction in the first bit architecture is transformed to a corresponding instruction in the second bit architecture if the transform table includes information indicating to modify the instruction in the first bit architecture. The transformation is based on transformation operations that modify the instruction in the first bit architecture to generate the instruction in the second bit architecture.

Abstract: Disclosed is a system and method for caching data. A processor receives data from a host to modify a track in a first storage device. The processor stores a copy of the modified data in a cache and indicates in a second storage device the tracks for which there is modified data in cache. During data recovery operations, the processor processes the second storage device and data therein to determine the tracks for which there was modified data in cache. The processor then marks the determined tracks as failed to prevent data at the determined tracks in the first storage device from being returned in response to a read request until the failure is resolved. In further embodiments, in response to detecting a partial failure within the storage system, the processor would scan the cache to determine tracks for which there is modified data stored in the cache.

Abstract: Methods and apparatus for accessing files on networked digital data processing system provide for plurality of digital data processing nodes and a storage device, e.g., a disk drive, a “jukebox,” other mass storage device or other mapped device (collectively referred to herein after as “disk drive” or “storage device”). First and second ones of the nodes, which may be a client and a server node, respectively, are coupled for communication over a first communications pathway, e.g., a LAN or other network. Both the first and the second nodes are in communication coupling with the storage device over the same or different logical or physical communications pathways. A file system or other functionality in the second (server) node receives and responds to at least selected requests—e.g., file OPEN requests—from the first (client) node for access to a file on the storage device, by generating a “lease”.

Abstract: A method, system and program for accessing records in a database object, such as an index or table. A cursor is maintained that points to a start entry in the database object. The database object has rows and columns of values. A runtime component receives a command to return a kth entry in the object having column values that satisfy predicates in a query statement. The runtime component calls a manager component that accesses entries in the database object to return the kth entry in the object having column values that satisfy the predicates. The manager component moves the cursor through sequential entries in the database object, in either the forward or reverse direction, until a kth entry that satisfies the predicates from the start entry is reached. The manager component positions the cursor to an entry that is the kth entry that satisfies the predicates from the start entry and returns data from the kth entry pointed to by the cursor to the runtime component.

Abstract: Implementations describe the expansion of storage space in an array of storage units. The storage space formed by the storage units is configured as logical units to store data. Storage units are added to the array to form an expanded storage space. The storage units in the array prior to the addition of the storage units are in a pre-expansion storage space. At least one additional logical unit is configured in the expanded storage space such that the logical units existing prior to the addition of the storage units in the pre-expansion storage space are not affected by the logical units configured in the expanded storage space.

Abstract: A system for interacting with a database report is disclosed. The database is responsive to a query to produce an associated report comprising one or more objects, each object comprising a plurality of attributes. The system comprises means for storing one or more reports from respective database queries; and means for rendering at least one object from the stored reports. A user interface enables a user to navigate through objects composing the stored reports to select an object; select one or more attributes of the selected object and determine a value of a selected attribute to be used as a condition in a subsequent database query. A query generator receives the selected attribute values and generates the subsequent database query.

Abstract: A system, method, program, and data structure for performing a backup operation of a target file. At least one operation is initiated to perform at least one delta backup of the target file to at least one delta backup set. A delta backup set includes changes made to a version of a full backup set of the target file generated at a first time, such as an incremental or differential backup operation. The at least one delta backup set is assigned a name component indicating the version of the full backup set generated at the first time subject to the delta backup and an operation is initiated to perform a full backup of the target file to a version of the full backup set at a second time. The second time follows the first time. A determination is made of all delta backup sets having the name component indicating the version of the full backup set generated at the first time during the full backup operation at the second time.