Abstract: The present invention provides methods for operating a computer system that call for executing a plurality of modular processes, providing a data file for use by the plurality of the processes, and incorporating a view identification within each of the plurality of processes to define data accessible by each process within the data file. The processes can include, for example, two identical processes that are executed simultaneously to access the same data within the data file in accordance with the same incorporated view identification.

Abstract: The present invention is a system, method, and program product that comprises a computer with a collection of documents to be searched. The documents contain free form (natural language) text. We define a set of labels called QA-Tokens, which function as abstractions of phrases or question-types. We define a pattern file, which consists of a number of pattern records, each of which has a question template, an associated question word pattern, and an associated set of QA-Tokens. We describe a query-analysis process which receives a query as input and matches it to one or more of the question templates, where a priority algorithm determines which match is used if there is more than one. The query-analysis process then replaces the associated question word pattern in the matching query with the associated set of QA-Tokens, and possibly some other words. This results in a processed query having some combination of original query tokens, new tokens from the pattern file, and QA-Tokens, possibly with weights.

Abstract: A computer network system is set forth for bi-directionally communicating information in a predetermined format between a plurality of client computers and a server. The system includes an archive computer system having a mass storage database. The archive computer system can store and retrieve a number of client records to and from the mass storage database. Prior to storing each client record in the database, the record is appended with a transparent sector. The transparent sector includes software application and version related information which is associated with the software application and version used to generate the record. Upon retrieval of the record from the mass storage database, the contents of the transparent sector is compared to a table to insure the requesting client computer includes a software application and version compatible with the retrieved record.

Abstract: There is provided a text search apparatus capable of dividing a structured document such as an HTML document into segments, and presenting segments containing a given search key as the search result, thereby providing a part of the document matching the search condition as the result of search. The document is divided into segments by specified tags, and a level of association with an adjacent segment is calculated. A header is detected by a header tag, and the header information is added to the segment contained in the range of the header. Segments are divided and re-integrated according to the level of association therebetween, and indexes are prepared. A search is executed for two indexes, and the level of matching is calculated by weighting the search results for the indexes, and the search result judged according to such level of matching is stored or outputted for each segment.

Abstract: The invention is a common event monitoring, fusion and reasoning framework that integrates horizontally into many different application domain areas. The system includes a monitor for detecting occurrences of predetermined events from a monitored system, providing data in response to the occurrence and processing the data as a data relation in a database. Predetermined events are recorded in a database using an event pattern language that defines and compiles events in terms of first order logic over a universe of events. The language provides common patterns that allow event patterns (i.e., event rules and relations) to be specified by the client dynamically. These specified event patterns are then compiled into the database. The compiled code automatically triggers responses when specific event patterns are stored in the database. After compilation, additional event patterns may be recognized dynamically by formulating queries into the database using a standard query language such as SQL.

Abstract: A method of comparing parts by comparing metadata representing the part topologies to identify identical or near identical parts. Metadata representing the geometry of a plurality of parts is compiled into a database. Corresponding metadata of a subject part may be determined and compared to the metadata stored in the database. The metadata may include values representing the volume, surface area, and principal moments of inertia of the parts. The metadata may additionally contain values representing the location of the cross-sectional center of gravity with respect to the point of intersection of the principal moments, for each of the planes of the principal moments, thereby allowing mirrored parts to be differentiated. The comparison of complex parts may be performed by comparing as few as five metadata values using simple database management tools.

Abstract: File management information for managing logical sequence of files recorded in a recording medium is formed and stored in a file management information storing unit. Block management information which includes a file number for identifying a file, sequential order number indicative of the sequential order of the block storing data of the file and page length information indicative of the size of the data stored in the block is formed and stored in a block management information storing unit. Access to the file is ensured based on the block management information, even when the file management information indicative of the logical sequence of the files is lost by accident.

Abstract: File management information for managing logical sequence of files recorded in a recording medium is formed and stored in a file management information storing unit. Block management information which includes a file number for identifying a file, sequential order number indicative of the sequential order of the block storing data of the file and page length information indicative of the size of the data stored in the block is formed and stored in a block management information storing unit. Access to the file is ensured based on the block management information, even when the file management information indicative of the logical sequence of the files is lost by accident.

Abstract: Methods and a database for extending the columns of a record are provided. A record is provided having an extendible column wherein a tokenized string may be stored. Moreover, the tokenized string includes one or more tags, each tag logically representing an extendible column to associate with the record. Further, at least a portion of the tokenized string is delivered upon a request. The tokenized string may conform to at least one of XML, HTML, and SGML. Moreover, updates to the record occur without modifying a table definition associated with the record.

Abstract: A method, apparatus and program storage device for optimizing a relational database management system is provided. The method employs a replication solution wherein both Apply and Capture utilities are co-located on the target system. Changes detected by the Capture utility are entered in an internal staging area on the target system. The method allows the transformed database management system to perform more efficiently than the original system, while providing the same results.

Abstract: A database system providing a methodology, implemented as an “Abstract Plan on Disc” technology (referred to herein as, “Ariadne”), is described for turning cost based optimization decisions into stored, reusable items. In particular, the present invention provides a novel language interface to the optimizer, through an Abstract Plan, through which it can be given a description of the desired query execution plan (QEP). The language interface defines a declarative language syntax that allows description of the QEP. It does not specify the sequence of operations the database system's optimizer and code generator should accomplish to generate the QEP, but rather describes the desired outcome. Such an approach provides an abstraction barrier between an optimizer directives language and some specific optimizer and code generator. In this manner, the present invention allows a database system the ability to generate a better execution plan, and thereby realize better query performance.

Abstract: A method and mechanism for data replication is disclosed. One embodiment of the invention relates to an efficient and effective replication system using LDAP replication components. Another embodiment of the invention pertains to a schema and format independent method for data replication. Procedures for adding, deleting, and modifying replicated data, and for replicating conflict resolution are also disclosed. A further embodiment of the invention is directed to improved methods and mechanisms for adding and removing nodes from a replication system.

Abstract: A method, apparatus, article of manufacture, and a memory structure for providing access to an array-based data object to a client is disclosed. The method comprises the steps of receiving a database query from a client; generating a first execution plan from the database query; transmitting at least a portion of the first execution plan to a data server; compiling a query result from the execution of the first execution plan; and transmitting the query result to the client on a first communication path wherein the query result comprises an identification for a master data object responsive to the database query and the master data object comprises an identification for a plurality of array-based objects associated with the master data object. Further, the method comprises the establishment of a second communication path between the data server and the client and the transmission of the master data object to the client via this second communication path.

Abstract: Storage structures of a shared storage processor of a computing environment are modified. One or more target maximum counts are specified, which are to be used in modifying a storage structure of the shared storage processor. The one or more target maximum counts are then used to modify the storage structure.

Abstract: A database system providing an efficient methodology for performing an online rebuild of a B+-tree index is described. From a high-level perspective, the method operates by copying the index rows to newly-allocated pages in the key order so that good space utilization and clustering are achieved. The old pages are deallocated during the process. This approach differs from the previously-published online index rebuild algorithms in two ways. First, it rebuilds multiple leaf pages and then propagates the changes to higher levels. Also, while propagating the leaf level changes to higher levels, level 1 pages (i.e., the level immediately above the leaf level) are reorganized, eliminating the need for a separate pass. The methodology provides high concurrency, does minimal amount of logging, has good performance and does not deadlock with other index operations. Performance study shows that the approach results in significant reduction in logging and CPU time.

Abstract: A system that uses inferencing to deal with complex authentication problems such as those that occur when users authenticate themselves by means of tokens. A troubleshooter responds to a user's request for help by inputting an identification code for the user's token into the system. The system uses the identification code to obtain the current authentication state for the token from an authentication database and then inputs the authentication state to an inferencing system such as a knowledge base. The inferencing system uses the authentication state to make inferences concerning the problem. The inferencing process may involve obtaining further information from the troubleshooter an/or the authentication database and may also provide warnings of particular security problems to the troubleshooter. Eventually, the inferencing system reaches a solution, which may include advice that the troubleshooter is to give to the user.

Abstract: A hierarchical relational definition system (26) for defining an object is provided in which a user is presented with a plurality of menus from which selections are made, whereupon the system references a database (10) to obtain information about an object corresponding to said selections, the data including control data to determine whether a formula is to be referenced to calculate further data, and provides an output including information about said object. The system is useful in cost estimate engineering to provide estimates of man-hours to install materials. The system also has a formula adjustment mechanism (44,46) to refine the formulae according to any variation between the actual man-hours and the calculated man-hours.

Abstract: The invention relates to automated methods for creating offers for items to a customer. According to the invention, an automated system queries an user interface of a customer's product catalog database. The user interface can be for example a www (world wide web) server of the customer's internet site, which allows searching for products available at the customer's service. The system queries each item in a set of items, and examines the resulting output from the user interface. Internet commerce sites typically allow a user to enter a query for a product, and then reply with a response document detailing the results of the query, i.e. if the queried product was found, and if any such products are presently available and possibly also in how large numbers. The system receives the response document after each query, and examines the response document to find out, if the response indicates that the customer has the queried product available or not.

Abstract: A modification may be specified for several segments sharing a common attribute. Such a shared modification may be combined with other modifications made to a composition or part of a composition. A modification may be applied to section of digital media, where a first segment of a media composition represents at least a section of a digital media source. An indication of the modification is stored such that the modification is applied to other segments on the system having an attribute in common with the first segment. Such attributes may be related to the source from which the segment originates or the composition in which the segment is used.

Abstract: Internal database validation is disclosed. In one embodiment, the system comprises a database having a data table and a validation table. The data table has at least one data column and at least one data row and the validation table has a plurality of validation columns and a validation row. Also included is a database engine module for maintaining the database and a database validation module operative to read a validation value from the validation column of the validation row and using the validation value to validate a data value in the data column of the data row.