Abstract: A method and system for interactively displaying error messages, such as parser or compiler messages, associated with a user's source code is described. The processors generating the messages may execute on a remote computer. Whether locally or remotely generated, the error messages are stored as error message data entries in an error list. Each entry designates an error type and specifies the location of the error in the source code. When the source code consists of multiple files the identifier of the specific file in which the error was found is also designated. When the error list is displayed for the user, the user may select one error message data entry in the error list and thereby cause the portion of the source code containing the error to be displayed for editing. When the user modifies or deletes the portion of the source code corresponding to a selected error message data entry, the Error List is updated to reflect the modification or deletion.

Abstract: A system, method and program product enabling applications to be dynamically bound to resources as required by an application. Resource access exceptions are intercepted and, where access is authorized, cause the application to be bound to one of a plurality of processors linked in an asymmetric multiple processor configuration which has access to the resource required. If access is not permitted, an error is generated. Applications may invoke operating system application programming interfaces to register requirements for access to particular resources and to receive operating system feedback on resource assignment conflicts and potential processor thrashing situations. The operating system maintains a list of mapping processors to resources and manages the authorization of resource access by applications. Application processes are dynamically bound to a particular processor as necessary to meet resource requirements.

Abstract: A method and system for enabling the monitoring of software executing on a computer system. The system inserts monitor instrumentation without recompiling the source code of the program. Encapsulation of the target routine does not disrupt the relative addressing of the target routine since an instruction is simply replaced. No instructions are added to the target routine. User specified entry and exit routines are used to collect selected performance and system state data. Instrumentation code is provided to link the target routines to the user specified entry and exit routines. The standard link interface allows the entry and exit routines to be written in high level languages.

Abstract: The present invention provides a system and method for retrieving data from a computerized database system. Prior to execution of a query statement, the system determines an optimal sequential execution plan for the query statement. The optimal sequential execution plan is used to determine an optimal parallel execution plan. During the execution of the query, run time variables are used to determine whether to use the sequential execution plan without modification or a modification of the parallel execution plan.

Abstract: This invention provides an integrated compiler for compiling SQL3 control statements having procedural, i.e., control, information packaged together with query, i.e., non-procedural, statements. A query extractor contained within the parser extracts the query statement from the control statement leaving a control skeleton. The query statement is processed as usual through a query compiler for generating executable plans with the exception that the name resolution function for resolving variables is modified for looking up local variables. This modification takes into account the mapping of local and host variables to create a unification of local and host variables. The control skeleton is processed through a control analyzer which generates a representation of the control flow and a scope and symbol table. The control analyzer also unifies the local and host variables.

Abstract: The system, method, and program of this invention avoids potential write/write conflicts and read/write conflicts when a subcomponent of a composite object (e.g., an ADT) is mutated. The embodiments of this invention define a copy semantic for the mutation function. In one embodiment, a copy function is inserted prior to any mutation function. In a another embodiment, a global compile-time analysis is performed to determine if a write/write or read/write conflict exists; and to eliminate redundant copy constructors if a conflict does exist. In a preferred embodiment, only a local analysis is performed during the parsing phase, thereby avoiding a global compile-time analysis. A mutation safe flag is associated with each parse tree node. A read target leaf parse tree node is set to false while non-leaf parse tree nodes (functions) derive their value from an incoming node, except that constructors and copy constructor functions are always true. Whether or not a copy is made of the composite object (i.e.

Abstract: A system and method for allowing communication of a large number of parameters from a computer user to an application program with a relatively small amount of interaction. The system uses a plurality of graphical metaphors to represent a collection of known personality or collective knowledge representations to extract a computer user's preferences. A computer user expresses how much likeness exists between themselves and a set of metaphoric graphical objects which is translated into an intermediary format which enables the computer to provide a higher quality of pattern matching and differentiation.

Abstract: A system, method, and program enables database management systems for relational and object-oriented databases to recognize a quantifier in a query as being designated as optional. An optional quantifier will participate in a query depending upon certain conditions. If the columns (or objects) projected out in the view that are dependent upon the quantifier are not used by the query, the quantifier is dropped from the definition of the view. The query is processed using only the relations in the view not associated with the optional quantifier. The results returned are as if a left outer join operation with duplicate elimination had been performed, although the actual processing of the query was independent of, i.e., did not involve, a left outer join operation. If the columns (or objects) projected out in the view that are dependent upon the quantifier are used by the query, the optional quantifier remains in the definition of the view and the query is processed using a join operation.

Abstract: The system and method of this invention provides an approach for automatically indicating what property a current set of documents possesses, and an approach for retrieving a set of similar documents by specifying a document rather than a keyword. First, in a set of keywords attached to the set of documents narrowed in response to user retrieval processing, a system according to the present invention counts the number of documents to which each of the keywords is attached to and displays the keywords in order of decreasing frequency. Next, a user specifies the document(s) of interest among the set of documents. In response to this, out of the keywords attached to the documents specified by the user, a keyword is able to retrieve any documents other than the one(s) specified.

Abstract: The system, method, and program of this invention provides for a new type of quantifier that is useful for object-oriented queries that reference collections and nested collections of objects. The invention is applicable to any other type of database where the data has a hierarchical relationship, also. This new type of quantifier is called an outer quantifier. The outer quantifier appears in the language of the query (in the FROM clause) and creates a new runtime semantic. The function and semantics provided by outer quantifiers is similar to that provided partly by left outer joins in relational systems. Outer quantifiers are bound to a null instance if the collection over which they are defined is empty. Outer quantifiers are a simple way of expressing queries so that objects having empty collections of nested objects are included in the result, also.

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 coherent method for the creating, capturing, and retrieving of ideas, concepts, data, and/or multi-media information The system establishes a framework in which knowledge can be represented. The system is a computer-based system which utilizes multimedia, databases, and mass storage to implement this framework. It has an architecture and an open-ended-set of functional elements that combine to support knowledge processing. Knowledge is created by uniquely identifying and interrelating heterogeneous datasets located locally on a user's workstation or dispersed across computer networks. By uniquely identifying and storing the created interrelationships, the datasets themselves need not be locally stored. Datasets may therefore be located, interrelated and accessed across computer networks. In addition, an almost unlimited number of relationships can be created and stored as knowledge to be selectively filtered and collected by the end user.

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: The present invention includes reorganization of a Database Management System (DBMS) The reorganization of the present invention is implemented by recording a first current Relative Byte Address (RBA) Then, data is copied from the old area in the table space to a new area in the table space in reorganized form. In the present invention, throughout most of reorganization a user maintains access to the DBMS's normal facilities to read and write to the old area. The DBMS uses its normal facilities to record writing, which occurs during reorganization, in,a log. The reorganization in accordance with the present invention reads the log (that has been written to during reorganization) and processes the log to the new area to bring the new area up to date. This process is performed with the use of a RID mapping table. Finally, at the end of reorganization, the user's access is switched from the old area to the new area.

Abstract: An extension of an information cataloging metadata model allows metadata users to link objects in a linear or peer-to-peer relationship (not hierarchical). Additional elements include adding a metadata functional category whoes object instances logically attach to other metadata objects in an information catalog (or information directory). Finally, the information cataloging metadata model is extended to enable metadata users to launch applications which can use values from any metadata object type as parameters to applications.

Abstract: Two polygon fill algorithms are presented for filling polygons on a graphics display. The first polygon fill algorithm fills polygons that are strictly convex. The second polygon fill algorithm fills a larger class of polygons than the first polygon fill algorithm which includes polygons being concave in the x direction, and polygons having crossing lines. The first polygon fill algorithm tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill algorithm then stores the maximum and minimum value of the pel selected by the Bresenham algorithm for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second polygon fill algorithm tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon.

Abstract: The system implementation of a computer system which implements multiple virtual machines, and forms one station in a network including at least one other station running a program for which the one station can, on request, perform host processes using virtual machines which it implements, and which has the resources to provide a pool of preconfigured virtual machines to service such requests, includes a routine to manage conversations associated with such requests by responding to events relating to such conversations. The conversation management routine includes a main task and a sub-task spawned by the main task to preestablish an exit from the routine in the event of error. The sub-task also includes routines called selectively to handle different events relating to conversations, and is associated with an array, which contains data as to the identity and status of virtual machines in said pool of preconfigured machines, and is established and maintained by the sub-task in accordance with said events.

Abstract: A mechanism and method for accessing remote data objects in a distributed memory environment is disclosed. In the distributed memory environment, a number of parallel processors are remote from each other and each has memory storage capacity with parallel address locations. For each data object stored in the local memory of a processor, that processor stores a variable at a specific location pointing to the address of the data object in its local memory. At the same (parallel) location in the local memories of all remote parallel processors, a variable pointing to the home processor for the data object is stored. In order to access the data object, it is only necessary to locate the identifier variable in the processor processing a program pointing to the processor having the data object in storage.

Abstract: A method and system are provided for continuously maintaining replicas of an active database in a backup system for disaster recovery purposes. Redo records transmitted from an active system are received into a dataspace work area in a backup system memory. Redo records in the work area for an uncommitted database transaction are grouped together. When a transaction becomes a committed transaction, the redo records for the transaction are sorted with redo records from other committed transactions according to database, block number within a database, offset location within a block, and sequence of occurrence. A plurality of update blocks from a backup database are read into a buffer in the backup system memory. The sorted redo records are sequentially applied to corresponding data records in the update blocks. The update blocks are then immediately written back to the database.

Abstract: In a computer database system, a method and system are provided for interactively and iteratively constructing a query using a table metaphor displayed on a user display. Alterations are made directly to the table metaphor by the database user. The alterations relate to adding, deleting, or combining columns of attributes and limiting ranges of attribute values. The alterations are registered and the table metaphor updated to reflect the registered alterations. The table metaphor can be repeatedly used to further register additional alterations. The query corresponding to the table metaphor in its final form is run against the full database to generate a report in the format indicated by the table metaphor.