Abstract: A hardware/software system for analyzing memory dumps. The system collects data structures in a memory dump into logical tables, one logical table per selected type of data structure. The logical tables are generated by use of extraction logic for extracting data in data structures in the memory dump. The extraction logic is used in conjunction with a template library that contains data structure definitions for various types of data structures. The extraction logic, together with the template library, make possible populating logical tables with the contents of data structures found in the memory dump. Each row in a logical table is dedicated to one data structure of the selected type. Collecting data structures into logical tables makes available the power of a standard database management system for operating on the logical tables to determine the cause of a crash of a hardware/software system for which the memory dump was taken.

Abstract: A system and method is provided for defining equipment, in terms of components, such as modules, shelves and racks, down to the rackface level to be used for recording data related to the configuration of equipment within field sites. Once components are defined and stored in a database, they are configured by specifying interrelationships between components. Accordingly, shelves are configured by populating them with modules. Likewise, racks are configured by populating them with configured shelves. Graphical tools can be used to assist the user in configuring components. Data related to components, and configured equipment are stored in a central database.

Abstract: Search system and method for retrieving relevant documents from a text data base collection comprised of patents, medical and legal documents, journals, news stories and the like. Each small piece of text within the documents such as a sentence, phrase and semantic unit in the data base is treated as a document. Natural language queries are used to search for relevant documents from the data base. A first search query creates a selected group of documents. Each word in both the search query and in the documents are given weighted values. Combining the weighted values creates similarity values for each document which are then ranked according to their relevant importance to the search query. A user reading and passing through this ranked list checks off which documents are relevant or not. Then the system automatically causes the original search query to be updated into a second search query which can include the same words, less words or different words than the first search query.

Abstract: A method and apparatus for providing an optimized page-based electronic document file and downloading the optimized file. An optimized document file is created from a non-optimized electronic document. Page contents are contiguously written in the optimized file and a page offset table is provided in the optimized file that includes page offset information used to locate individual pages and objects of the document. Shared objects, such as fonts, are included in the file after the page contents. When downloading the optimized file from a host, the page offset information is read early and is used to download a specific page requested by the user without downloading other pages in the document. In one embodiment, a viewer downloads a first portion of the requested page, while all remaining portions of the requested page are located and requested by a finder process using the page offset table. In alternative embodiments, all objects for a full page may be requested at once.

Abstract: A method and apparatus for management of application programs in a computer network are disclosed. A modified hierarchical database which includes application objects that represent applications and their execution environments is utilized. Administrator tools support the creation, deletion, and modification of application objects. Each application object includes the location of an executable code for a given application, an icon, a working directory name, drive mappings, printer port captures, command line parameters, and similar information. An application launcher queries the database and updates a list of available applications which is kept in the user's desktop. The launcher automatically launches specified applications when a user runs the launcher. The launcher also uses the information in the application object to setup resources needed by the application, to create a process that executes the application, and to clean up after the application terminates.

Abstract: A workgroup organized network manager for controlling the operation of individual workstations within a computer network. The workgroup organized network manager organizes workstations into workgroups and controls the distribution of information to each of the workstations within a defined workgroup. The tasks each workstation performs are defined by a specification consisting of programs. A library of programs is maintained on a host workstation designated as a controlling workstation within the workgroup. The host workstation keeps track of activity occurring on the individual workstations within the workgroup. A file maintenance and inventory system compares the attributes of files, directories, and software located on the workstation to check for discrepancies between files, directories, or software intended to be identical and for locating missing or extra files, directories, and software.

Abstract: The processing of object-oriented queries so as to retrieve data from a relational database management system (RDBMS) is described. An object-oriented query and at least one prefetch path are received from an object-oriented source (such as an application or user). The prefetch path identifies one or more objects which are desired to be constructed. The object-oriented query is translated to a translated object query, where the translated object query is a relational database query capable of retrieving from the RDBMS data to initialize base attributes of top-level objects identified by the object-oriented query. A set of relational queries is generated from the translated object query and the prefetch path. These relational queries, which are capable of retrieving from the RDBMS data needed to construct the objects identified by the prefetch path, are processed by the RDBMS.

Abstract: A method and apparatus for providing an optimized page-based electronic document file and downloading the optimized file. An optimized document file is created from a non-optimized electronic document. Page contents are contiguously written in the optimized file and a page offset table is provided in the optimized file that includes page offset information used to locate individual pages and objects of the document. Shared objects, such as fonts, are included in the file after the page contents. When downloading the optimized file from a host, the page offset information is read early and is used to download a specific page requested by the user without downloading other pages in the document. A viewer preferably downloads a first portion of the requested page, while all remaining portions of the requested page are located and requested by a finder process using the page offset table. The requested page can thus be downloaded with only one connection to the host.

Abstract: An information processing system for creating a search data for an application-specific data is proposed. An application processing section inputs or edits data on the basis of an application program. An application-specific data storage section stores the application-specific data input or edited by the application processing section. A search data is created by a search data creating section for searching the application-specific data stored in the application-specific data storage section for a specific data. The search data creating section also creates a correspondence between the search data and the application-specific data. A search data storage section stores the search data created by the search data creating section. A correspondence storage section stores the correspondence between the search data and the application-specific data.

Abstract: The performance of a heterogeneous, distributed database system is optimized by supporting both block fetch operations and positioned update operations. Specifically, a data block is fetched from a target database management system (DBMS), and a positioned update instruction issued by a client is processed. The positioned update instruction, when executed by the target DBMS, enables the target DBMS to modify a row contained in the data block and addressed by a cursor as the cursor is perceived by the client. Also, performance of the database system is optimized by identifying database statements that reference invariant host variables, and modifying such database statements by replacing in the database statements the host variables with literal values equivalent to the host variables.

Abstract: A method and apparatus for providing an optimized page-based electronic document file and downloading the optimized file. An optimized document file is created from a non-optimized electronic document. Page contents are contiguously written in the optimized file and a page offset table is provided in the optimized file that includes page offset information used to locate individual pages and objects of the document. Shared objects, such as fonts, are included in the file after the page contents. When downloading the optimized file from a host, the page offset information is read early and is used to download a specific page requested by the user without downloading other pages in the document. In one embodiment, a viewer downloads a first portion of the requested page, while all remaining portions of the requested page are located and requested by a finder process using the page offset table. In alternative embodiments, all objects for a full page may be requested at once.

Abstract: A method and apparatus for processing at a remote workstation, data files that are compressed and collected into groups on a local area network at a central location. The files of a group are transferred to the workstation over an ISDN switched telephone network in response to an automatic requests from the workstations. The workstation requests depend on the inventory of unprocessed files at the workstation as well as the time and date, in order to reduce the connection time. When files are received at the workstation the first is immediately decompressed and presented to the operator. In the meantime the next file which the operated is expected to need is decompressed in the background and is ready for processing as soon as the operator finishes with the first. When the operator switches to the next file the processing results are automatically saved and a further file is decompressed an held in a que for the operator.

Abstract: A data processing system and method for generating a representation of an electronic document, for indexing the electronic document, for navigating the electronic document using its representation and for displaying the electronic document on an output device. The system and method are used with electronic documents having descriptive markup which describes the content or meaning of the document rather than its appearance. Such documents may be represented by a tree. Each markup element defines a node or element in a tree. The tree is represented by providing a unique identifier for each element and for accessing a descriptor of the element. An element descriptor preferably includes indications of the parent, first child, last child, left sibling, right sibling, type name and text location for the element. The document representation is used to facilitate navigation of the text for constructing navigational aids such as table of contents and full text indexing.

Abstract: A system and method for compensating for functional differences between heterogeneous database management systems, wherein data associated with a client is distributed among the heterogeneous database management systems, is discussed. The system simulates support of multiple pending actions on a single connection in any of the heterogeneous database management systems which does not support multiple pending actions on a single connection. Also, the system: (1) simulates support of cursors declared "with hold" in any of the heterogeneous database management systems which does not support cursors declared "with hold"; (2) simulates support of positioned update actions in any of the heterogeneous database.

Abstract: A memory for storing data for access by an application program being executed in a processing system of a distributed computing environment includes an object-oriented data structure. The data structure include a plurality of base data objects having predetermined instances including a directory object and an entry object, and a plurality of attribute data objects storing information about particular resources. The plurality of base and attribute data objects are configurable into a namespace, e.g., a tree structure, that enables the application program to locate resources in the distributed computing environment. The predetermined instances of the base data objects may also include a link object that points to another object in the tree structure, thereby transforming the namespace into a directed graph.

Abstract: A method and apparatus for management of application programs in a computer network are disclosed. A modified hierarchical database which includes application objects that represent applications and their execution environments is utilized. Administrator tools support the creation, deletion, and modification of application objects. Each application object includes the location of an executable code for a given application, an icon, a working directory name, drive mappings, printer port captures, command line parameters, and similar information. An application launcher queries the database and updates a list of available applications which is kept in the user's desktop. The launcher automatically launches specified applications when a user runs the launcher. The launcher also uses the information in the application object to setup resources needed by the application, to create a process that executes the application, and to clean up after the application terminates.

Abstract: A system and method for asynchronously processing SQL language statements in a database management system. A process assigns a unique database handle to each requested connection between an application program and a database, Each application can be concurrently connected to multiple databases. Databases are alternately activated for synchronous or asynchronous processing using the database handle. Following an asynchronous connection, SQL statements are dispatched for asynchronous processing. The application program dispatches an asynchronous statement, performs other processing and then periodically polls the database system to determine whether the statement has completed processing. SQL statement dispatch for synchronous processing performs like current synchronous SQL language systems by waiting for completion of SQL statement processing before continuing.

Abstract: The present invention relates to a latest managing system of terminal database DB. The present invention curtails the waiting time for using a map at a terminal by deleting undefined map data from the map data of the terminal data base DB and transmitting defined map number and version number of the host at a predetermined time or according to an instruction from the host to update map data of the terminal data base to the latest map data provided by the host. A plurality of terminals are connected with a host through transmission lines. Map data of the map number other than those defined in the distribution defining file is deleted from the map data of the terminal data base either at the predetermined time or according to an instruction from the host.

Abstract: Records in the relational database are converted into ordinal numbers. The numbers are then sorted by a predetermined ordering rule. Next, for each record, the difference between the number and the preceding number is computed and this difference is then used to represent that record. Alternatively, for each record, the difference between the number and some other record's number that is within the same block is computed and the difference is then used to represent that record. The compression technique results in highly compressed data that can still be handled by conventional relational database software for record insertion, deletion and other standard database operations.

Abstract: A query optimizer for optimizing join queries in a relational database system by iterative application of dynamic programming (DP) to select optimal subgraph join execution plans. Unlike traditional DP optimization methods, bounds on search space time and space complexity can be established and adjusted by imposing a subgraph threshold. Each bounded subgraph is selected using a greedy heuristic (GH) hill-climbing procedure or other similarly useful technique to build a low-cost execution plan. The low-cost GH subgraph execution plan is then discarded in favor of an optimal DP subgraph execution plan selected by a dynamic programming optimizer for each subgraph identified by the bounded GH optimization process. The complexity bound may be dynamically tuned to improve execution plan quality responsive to changes in query complexity.