Abstract: A server computer for a data communication system and adapted to transmit a document via a network, such as the Internet or an intranet, to a client computer in response to a request. The server includes an article memory for storing a plurality of article documents and respective bibliographic data; processing circuitry for receiving from a system administrator and storing an article document selection rule, and for retrieving from the article memory a subset of the plurality of article documents and assembling a table of contents-type document from at least part of each of the subset of article documents. The subset of article documents is selected according to the respective bibliographic data using the article document selection rule. Transmission circuitry is responsive to the request for transmitting the assembled document onto the network for delivery to the client computer.

Abstract: The present invention is a method for operating a computer system to minimize the number of disk storage access operations used in creating an inverted database. This method divides a database into several smaller subdatabases. The documents of the subdatabases are decomposed into subdocuments. A postings list for each subdatabase is then created in which all the terms for the subdatabase are associated with the identity of each subdocument of the subdatabase in which the terms occur. The resulting postings lists for the subdatabases are then merged. The merge process sorts the postings of the subdatabases and merges common terms. The non-common terms are merged after the common terms. The process of sorting the postings list and then merging the common terms followed by the non-common terms minimizes the number of disk storage access operations required for creating the inverted database from a series of inverted subdatabases.

Abstract: One or more important sentence structural functional units are extracted from an important portion of each of a plurality of documents, and one or more input sentence structural functional units are extracted from an input sentence. Each of the functional units is a noun phrase, a verb phrase, a pair of nouns connected each other through a preposition or the like. The important sentence structural functional units of each document are collated with the input sentence structural functional units to detect a matching degree, and a similarity level is determined from the matching degree for each document.

Abstract: A computerized image and document management system for tent-based retrieval integrating content-based retrieval support directly into the compressed files. The system minimizes a weighted sum of the expected size of the compressed files and the expected query response time. Object searching of documents stored by the system is possible on a scalable resolution basis. The system includes a novel object representation based on embedded prototypes that provides for high-quality browsing of retrieval images at low bit rates.

Abstract: A technique for efficiently joining multiple large tables in a database system which utilizes a join index. The technique uses a join index and minimizes the number of input/output operations while maximizing the use of the small main memory through a buffer allocation process based on the join index entries. The technique uses multi-dimensional partitioning and assigns partition identifiers to each buffer which are used to coordinate the resultant output files when the technique is complete. The output is vertically fragmented with one fragment for each input table which further allows the individual processing of each input table. The technique performs self-joins in a very efficient manner by requiring the records of the input table to be read only once.

Abstract: A virtual structured information system or a virtual database is developed and presented in the framework of an information theory for multiple source information systems such as databases. A virtual tree structure is built from virtual nodes in main memory which contain no raw data. The virtual nodes and virtual trees provide general non-data virtual structure, like cross-table nodes, for systematic information manipulations such as on-line analytical processing in a structured information system.

Abstract: To facilitate accurate document searching, electronically accessible documents are provided with abstracts written in a highly constrained artificial grammar. The artificial grammar is capable of expressing the thoughts and information ordinarily conveyed in a natural grammar, but in a structured format that restricts the number of possible alternative meanings. Accordingly, while the grammar is clear in the sense of being easily understood by native speakers of the vocabulary and complex in its ability to express sophisticated concepts, sentences are derived from an organized vocabulary according to fixed rules. A query, preferably formulated in accordance with these rules, is employed by a search engine in the usual fashion. Due to the highly constrained meaning of the search query, and the likelihood that relevant documents have similar or matching abstracts in their headers, keyword searches are likely to identify the most relevant documents.

Abstract: In a database management system including a request reception server and a plurality of execution servers, each having a plug-in program module incorporated by a user, the request reception server analyzes a processing request from the user to determine whether or not the plurality of execution servers require currently unidentified input parameters when executing external functions in their plug-in modules, based on a definition information table created from descriptions of interface specifications for the plug-in program modules. When it is determined that the execution servers require such input parameters, an external function in the plug-in program module in the request reception server is executed to previously acquire the unidentified input parameters.

Abstract: A method and apparatus is provided for automatically retrieving and displaying supplemental information about a called party on the customer premise equipment (CPE) of a calling party. When a caller places a call, the number called is used to look up and return to the caller the Universal Resource Locator (URL) of the called party. Application software resident in the caller's CPE uses the URL to retrieve the home page of the called party from the Internet.

Abstract: A method and apparatus for reapplying changes to a database uses a recovery log for recording all changes applied to the database so that the changes may be reapplied to the database during database recovery. Whenever a change is written to a storage device, the recovery log is updated to indicate that the particular change has been written to the storage device. During recovery, the data in the recovery log is sorted by file ID, data block ID, record type and version ID.

Abstract: In a computer network system, a user-defined file modification request is communicated to a primary server, which communicates the request to a secondary server. The file modification request is saved in a non-volatile storage media associated with the primary server, and the file modification request is executed and saved in a non-volatile storage media associated with the secondary server.

Abstract: A device and method for recovering data in a file system. The method includes the steps of performing a given function that effects a change in a control structure of the file system and concurrently saving data relevant to the function in a state as data for a recovery, and recovering the interrupted function by using the data saved for a recovery, to prevent the loss of file data and maintain the consistency of the file system. The device includes a flash memory to store the control structure.

Abstract: A method of fast clipping, despite of large number of users, can be achieved through analyzing query expressions, storing the number of query terms included in the query expressions in a term number count table, generating a finite automaton for matching the terms occurring in text data with all terms included in the query expressions, generating a user identifier table for storing the identifiers of users in association with the terms included in the query expressions, matching the terms by scanning the text data by the finite automaton, calculating for each user the occurrence count of terms occurring in the text data as substrings coincident with the terms included in the query expressions made to the user identifier table, storing the calculated occurrence count in the term occurrence count region of the table, comparing the calculated term occurrence count of the table with the number of terms included the query expressions, and when a match is found from the comparison, delivering the text data to the u

Abstract: A software tool that allows a user to combine a number of smaller documents and then to index the combined documents. A bookfile contains one or more documents, each document containing its own indexing information. The user can drag and drop names of bookfiles into the tool. The invention also compensates for various formats and versions of the documents. A preferred embodiment of the present invention operates on FrameMaker 4.0 documents and can also handle mixed FrameMaker version 3.0 and version 4.0 documents. The software tool combines the documents and generates a master index for all the documents. The software tool also allows the user to specify abbreviations and long titles to use in the index generated for each bookfile.

Abstract: A method for enhancing the presentation of data received by a client computer from a server computer. Data blocks characterized by varying levels of complexity or appropriateness for particular audiences, that are associated with a base data set, are selected for transmission to a client requesting the base data set, for subsequent presentation to a user along with presentation of the base data set. Selection of an associated data block is based on a specific level established by the client and communicated to the server. Options are provided for the client to establish levels by such means as login IDs, express selection, usage profiling, and visual imaging. In alternative embodiments, a range of levels may be specified, or a rule set for taking action when associated data is present but does not match the level specification.

Abstract: The invention comprises a method and system for managing computer database connections. In accordance with the method of the invention, a database operation request is received for a first database. The first database comprises a first database type and the first database operation request comprises at least a portion of a first transaction A pool of interface objects is maintained, each interface object comprising an interface to a database of the first database type. Interface object status information is maintained, either by the interface object itself or externally, indicating whether or not the interface object is connected to the first database and whether or not the interface object is currently being used for a transaction. If a first interface object is connected to the first database and is assigned to the first transaction, then the first database operation request is processed using that first interface object.

Abstract: A method and system for mapping an object and an associated handle between the object-oriented schema of an application program and the relational schema of a database in which the object is persisted. The handle is reconstructed in response to a run-time request by an application program to instantiate the object. The handle may be an independent handle or an embedded handle. The relationships afforded by primary keys and foreign keys in a legacy, i.e., existing, relational database, can be preserved by mapping them to the independent and embedded handles, respectively. The mapping is performed prior to application program run-time, and is defined in a high-level schema mapping language, which may be generated with the aid of a schema mapping software tool.

Abstract: A STOP AFTER clause for a relational database management system (RDBMS) structured query language (SQL) causes the RDBMS, in response to a query, to return a query result having at most a predetermined cardinality specified in the query. A query with a STOP AFTER clause is processed by the RDBMS by provision of one or more STOP operators that are inserted into a query execution plan generated by the RDBMS to execute the query. In a conservative policy, STOP operators are inserted in the query execution plan such that no tuples that might be required in the query result are discarded. In contrast, an aggressive policy inserts a STOP operator in the query execution plan wherever it is able to provide a beneficial cardinality reduction.

Abstract: A medical fluid processing device for processing blood or other fluids includes a plurality of hardware elements that perform specific functions. Different processing procedures are achieved by performing the specific functions in appropriately arranged sequences and combinations. A user accessible menu permits user selection of the desired processing procedure. A dual region, user accessible screen provides user interaction with the processing device.

Abstract: A method, system, and program storage device for detecting object leakages in a computer system. Objects that are not properly deallocated by a computer system are detected by maintaining history logs for objects allocated during execution of a computer system and discarding those history logs associated with objects that are deallocated by the computer system. A wide variety of objects may be detecting, e.g., message blocks in a computer system streams subsystem.