Abstract: A method and apparatus are disclosed for managing software components in a network of computers such as a local area network or the Internet. Each software component includes a binary object and at least one interface to the binary object. Suitable software components include OLE components. The network includes a registry file identifying currently registered components and their locations. The network also includes a component server computer on which unregistered components reside. A database associates software component identifiers with software component locators. Suitable databases include Novell NetWare Directory Services databases and Internet search engine databases. Database objects or entries representing unregistered components are found by a search based on the class identifier of a desired component. Software components found by the search are selected, transferred as needed, and then registered, thereby making them available to clients.

Abstract: A circuit arrangement synchronizes data transfers between a first device and a second device operating at different data rates. The circuit arrangement is comprised of a plurality of registers for storing data received from a device with the higher data rate. A scan logic circuit counts strobe pulses provided by the device with the higher data rate when data is available on its output bus. Selected counts from the scan logic circuit cause data on the output bus to be sequentially transferred into the plurality of registers. Strobe latch logic keeps track of the loading sequence and, in response thereto, select logic and gate arrangement causes the content of a selected register to be transferred to an output register at each clock signal of the slower device.

Abstract: An improved method to dramatically reduce the time required to reorganize DB2 tablespaces and index files by not utilizing conventional sort techniques. Viewing access is allowed during the reorganization process by setting the files to read only status. The process is basically non-destructive, allowing a prompt return to the original state, and is checkpointed, allowing restarting at selected intervals. Briefly, the original table and indices are considered as A files and read into memory. New row IDs or RIDs are developed using a non-sorting technique so that the proper order of the data is developed. After the new RIDs have been developed, both the clustering index and the row data are read out of memory and written to a new table and clustering index files in the proper order as B files. All of the table files are then stopped to allow exclusive access. Next, a series of AMS statements are built to do the renaming operations.

Abstract: The software tool of this invention estimates the costs of an application program accessing a database. These costs may be execution costs of the application or of a transaction, SQL statement, and/or a utility. Execution costs include CPU time, I/O time and minimum elapsed time. For estimating the execution costs, the tool receives simplified and partial definitions of tables, utilities, SQL statements, transactions, and applications. The estimator tool requires only a minimal amount of information to calculate the various execution costs.

Abstract: A reference storage process populates a data structure so that the data structure contains all of the molecular structures and/or rigid substructures in the database classified according to attributes of tuples. In a preferred embodiment, the tuples are derived from sites (e.g. atomic sites) of the molecular structures and the attributes can be derived from geometric (and other) information related to the tuples. The attributes are used to define indices in the data structure that are associated with invariant vector information (e.g. information about rotatable bond(s) in skewed local coordinate frames created from tuples). These representations are invariant with respect to the rotation and translation of molecular structures and/or the rotation of substructures about attached rotatable bond(s). Accordingly, the invariant vector information is classified in the data structure with the respective tuple attributes in locations determined by the index derived from the respective tuple.

Abstract: A method for ensuring reliable interactions between principals within a database or between databases. The method involves the creation of database contracts which are, in essence, binding constraints on the behavior of entities within a database system that can be enforced by the system. A database contract is formed when two or more principals agree on the terms and conditions of the contract, and a monitor puts in to place the constraints necessary to enforce the agreed-upon terms and conditions after determining that each of the principals has the requisite authority and ability to carry out the contract.

Abstract: A header analyzing unit extracts a header area and each table unit area in each of an old and a new executable files, and calls a difference extracting unit for each area. A segment data associating unit associates a segment data in the old executable file with a corresponding segment data in the new executable file, and calls the difference extracting unit for the associated areas. A resource associating unit associates a resource data in the old executable file with a corresponding resource data in the new executable file, and calls the difference extracting unit for the associated areas. The difference extracting unit extracts the differences in byte units between the new and the old executable files from start to end in a specified area, and saves the differences in an update file.

Abstract: A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

Abstract: When storing backup data in a primary memory, memory space is optimized by selectively storing objects in storage locations in the primary memory. Only objects which have not been updated since the latest backup are stored in a backup area of the primary memory, and only updated objects are stored in a data-base area. The data base accesses objects in the backup area. The backup area may be write-protected.

Abstract: A system and method for storing data and program code on an external card has been provided. Information is stored on the external card by first transferring data from a source database to a first computer (a server). The data is then transferred from the first computer to at least one additional computer (a loader). The additional computer is then utilized to i) load data on the external card, and to ii) load program code on the external card. Further, an external reader is provided for accepting the external card. The external reader includes circuitry therein which is controlled by the program code on the external card for accessing the data on the external card.

Abstract: A document production system is provided for preparing documents and managing a database of information pertaining to investigational studies of medical products. The document production system includes a data management user interface for providing user access to the database and for retrieving information from the database as specified by selected document templates for placement into word processor-compatible documents. Additionally, the data management user interface is capable of updating information stored within the database in accordance with information specified within a previously-prepared document.

Abstract: The software tool of this invention estimates the costs of an application program accessing a database. These costs may be execution costs of the application or of a transaction, SQL statement, and/or a utility. Execution costs include CPU time, I/O time and minimum elapsed time. For estimating the execution costs, the tool receives simplified and partial definitions of tables, utilities, SQL statements, transactions, and applications. The estimator tool requires only a minimal amount of information to calculate the various execution costs.

Abstract: A method and apparatus for retrieving data on a database and inputting the retrieved data to an electronic spreadsheet so as to record the data thereon includes inputting, through an input apparatus by a natural language, a descriptive sentence relating to the data to be recorded in the spreadsheet. The input descriptive sentence is processed by a natural language interface to generate a retrieval formula for retrieval on the database. A retrieval result extractor executes data retrieval on the database by the retrieval formula, eliminates unnecessary accompanying data from results of the retrieval, and inputs the thus obtained table data to the spreadsheet so as to record the data therein.

Abstract: Storage and access of compressed data via separately compressed and stored variable size logical blocks. Portions of a data file are compressed until they reach a logical block size which matches a given sector size or block of storage space. The compressed logical block (portion of compressed data) is stored into a sector allocated to it and a table is built correlating the range of original data to the sector storing the compressed data. When it is desired to read a given portion of data within a stored compressed data file, it is first determined where within the original data file the desired portion resided. Then, the correlation table created as part of the compression and storage sequence is used to determine which sector contains the desired data.

Abstract: An apparatus for adaptable performance evaluation of an application including queries by analytical resolution of a data base, and operating on an information processing system having a given architecture, including a library for knowledge of the specific environment of a data base. The knowledge library, in an environment specification language, includes an architecture library for modeling hardware architectures; a system library modeling the operational and transactional systems supported by the hardware architectures; an access and operation method library modeling the algorithms used by the data management system; and a library of data base profiles collecting knowledge on the data base layout and statistics on the user application. A local optimizer uses a performance evaluator to evaluate the application and select an optimal plan for the execution thereof using the information in the knowledge library including information on the given architecture.

Abstract: A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

Abstract: A process for identifying a single item from a family of items presents a user with a feature screen having a series of groupings. Each grouping represents a feature having a set of alternatives from which to select. Selected alternatives are used as a selection criteria in a search operation. Results of the search operation is a revised feature screen indicating alternatives that remain available to the user for further selection and searching. The feature screen and search process, therefore, presents the user with a guided nonhierarchical parametric search to identify matching items based upon user specified criteria and priorities. Also disclosed is an adaptation of the claimed method and system appropriate in an Internet environment.

Abstract: A method of shortening a lock period of a shared buffer in a data processing system includes a step of securing a copy memory used when nonvolatilizing the contents of the shared buffer, a step of temporarily locking the shared buffer, a step of copying the contents of the shared buffer into the copy memory, a step of unlocking the shared buffer after the completion of the copying step and a step of nonvolatilizing the contents of the copy memory. The shared buffer is locked before the contents thereof are copied into the copy memory and is unlocked after the completion of the copying step and before the nonvolatilization of the contents of the copy memory.

Abstract: A multi-model database management system (DBMS) presents to its users a variety of logical models, or views of stored data, using industry-standard interfaces, while the physical storage of data is managed in a manner that closely follows the data model. Databases are built from sets of records using the entity-relationship data model. Space is reserved in each owner record for a set pointer pointing to either a member record or a Dynamic Pointer Array (DPA) structure that relates the owner record to member records. The DPA itself contains set pointers to all of the related member records. Each member record, in turn, has a set pointer pointing back to a particular owner record, or, in certain instances, to another DPA. In such cases, the DPA contains set pointers pointing to all of the related owner records. The DBMS supports a variety of logical models including the relational model, and further supports a plurality of industry-standard Application Program Interfaces using SQL query access language.

Abstract: A system (10) for compressing and decompressing records includes a decompressed file (12) and a compressed file (14). A first record is stored in a first buffer (18) and a second record is stored in a second buffer (20). A vertical compression technique compares the first record and the second record, on a field-by-field basis, and replaces the field of the second record with a vertical repeat indicator if the field of the second record matches the corresponding field of the first record. A horizontal compression technique further compresses the second record by replacing adjacent matching characters with a horizontal repeat indicator.