Abstract: The present invention provides an associate document retrieving apparatus capable of associate document retrieval which reflects the relation among keywords connected by logical operators in a retrieval expression. In the apparatus, a document information storing element associates each of the documents with a keyword extracted from the document and stores the associated documents. A retrieval expression obtaining element receives a retrieval expression containing retrieval keywords that may be connected by logical operators. A number of documents calculating element specifies objective keywords from within the extracted keywords stored in the document information storing element and calculates several numbers of different kinds of documents.

Abstract: One system of a multisystem environment takes over log entries owned by another system of the environment. When a system owning entries on a primary log stream is inactive (or a sync point manager on the system is inactive), another system of the multisystem environment writes the log entries corresponding to the inactive system to other locations. The entries within the other locations are not owned by any system. Thus, the resource managers associated with those log entries are eligible for restarting on any system of the multisystem environment. However, all resource managers involved in a common set of transactions are to restart on the same system. The other resource managers can restart on another system. When one of the resource managers restarts on a system, the system takes back ownership of the entries associated with the common set of transactions.

Abstract: The present invention facilitates the transmission of a file to a computer where the receiving computer has a file (called the old file) that is related to the file being transmitted (called the new file) but where the sending computer does not know the status or content of the old file. As a preliminary step, one of the computers generates a Delimiter Selection Profile Table (DSPT). The DSPT is generated by first determining the number of times each delimiter in a set of delimiters appears in the file and the distance between the locations of the delimiters in the file. Next using the information in the DSPT one of the delimiters is chosen as the delimiter which will be used and this delimiter is transmitted to the computer which did not generate the DSPT. The receiving computer next generates a Segment Profile (SPT) of the old file and the sending computer generates an SPT the new file.

Abstract: A method and apparatus identifies backup files that will restore a file in a transactional system. A reset stamp and filename is used to identify all backup files of the file having the filename since the file was last restored. A smaller number of files necessary to restore the file are selected from these backup files by sorting the list of files and selecting certain files in sort order. If necessary, earlier reset stamps are identified and more files are identified and selected, until a file is selected that contains a full backup or datafile copy of the file. For the backup files selected, information such as the location of the file is stored in the order in which the backup files are selected. The information, such as the location of each file selected, is provided in an order that is the reverse of the order in which the files were selected so that the oldest file is listed first. The files may be restored in the order provided.

Abstract: A server computer is provided for representing and navigating the connectivity of Web pages. The Web pages include links to other Web pages. The links and Web page s have associated names (URLs). The names of the Web pages are sorted in a memory of the connectivity server. The sorted names are delta encoded while periodically storing full names as checkpoints in the memory. Each delta encoded name and checkpoint has a unique identification. A list of pairs of identifications representing existent links is sorted twice, first according to the first identification of each pair to produce an inlist, and second according to the second identification of each pair to produce an outlist. An array of elements is stored in the memory, there is one array element for each Web page. Each element includes a first pointer to one of the checkpoints, a second pointer to an associated inlist of the Web page, and a third pointer to an associated outlist of the Web page.

Abstract: A method and apparatus for expandable biometric searching are provided. A method preferably includes forming a plurality of biometric records. Each of the plurality of biometric records preferably includes at least one biometric index and biometric data associated with the at least one biometric index. The method also includes forming a multi-dimensional virtual space having a data structure with the plurality of biometric records stored therein and generally defined by a configuration of a tree. Each of the nodal regions at each level of the tree preferably has a generally spherical shape. The apparatus preferably includes a database having a plurality of biometric data groups. Each of the plurality of biometric data groups includes a plurality of records stored therein. The apparatus also includes a plurality of biometric searching engines.

Abstract: A method and apparatus are provided that enhance file system calls to a file system structure of an operating system. In particular, file system calls can be enhanced to provide real-time secure file deletion on an ongoing basis. A file system call that is intended to perform a function with respect to data stored on a storage device is intercepted. It is then determined whether the file system call is of a type that should be processed. If not, the original file system call is passed on through the file system. If the file system call should be processed, supplemental processing is performed to enhance the original file system call and the file system call is transparently returned to the calling system application. In embodiment, real-time secure file deletion is implemented using a vendor supplied driver (VSD) executing within the installable file system (IFS) of WINDOWS 95. Further, a method and system are disclosed for real-time secure data deletion in a system having an NTFS file system.

Abstract: A method and apparatus to synchronize recovery logs transmitted to a remote site for recovering related databases having different logical structuring. In one embodiment, the related databases are a hierarchial structured database such as IMS and a relational structured database such as DB2.

Abstract: This invention concerns a system and method for securely distributing subsetted fonts from a distributor to a client. The system includes a signing module to construct an authentication tree having leaves formed of glyphs, one or more intermediate levels of nodes computed as one-way functions of the glyphs, and a root computed as a one-way function of the nodes. The signing module digitally signs the root of the authentication tree using a private signing key unique to the font creator or distributor. The system has a subsetting module to construct a font subset file that contains selected glyphs and other data to be included in a font subset. The font subset file also holds the digitally signed root of the font authentication tree and one or more authentication values of the authentication tree that represents non-selected glyphs and data of the font that are not contained in the font subset. The font subset file is distributed to requesting clients.

Abstract: A system and a method for generating a find list of target-entries that can be searched based on a received search-entry. The techniques used to generate and search the find list allow meaningful results to be obtained even if the search-entry contains imperfections. Target-entries are selected from the find list based on the initial characters of the search-entry. The target-entries are then compared to the search-entry using a variety of scoring heuristics. Each scoring-heuristic assigns a value based on the results of the comparison. The value proportionately indicates the closeness of the match between the target-entry and the search entry. The value obtained from each scoring-heuristic is summed to identify the score for each target-entry. The selected target-entries are then ordered based on the scores.

Abstract: A program product is described in which a class library is provided to permit object oriented applications to access and to manipulate, in accordance with the object model, nontraditional data values of a relational table. Nontraditional datatypes of a relational table include multimedia and large object datatypes. The data is manipulable by virtue of extended data objects that each represent a cell of a relational row, and that each inherit type-specific behaviors from the class library. Special handling is provided for large objects.

Abstract: A computer-implemented system for matching people with each other includes a main computer server connectable to a network such as the Internet; a plurality of local servers connectable to the main computer server via a proprietary network, each of the local servers accessible via a telephone connected to a telephone network; and a database of user information distributed over the main computer server and the local servers. Each of the local servers and the main computer server has means for a particular user to update and read at least a portion of the database so as to match the particular user with at least one other user of the system. The main computer server provides means to update and read the database via a user computer connected to the Internet to access a server page. The local servers provide means to update and read the database via a telephone connected via the telephone network.

Abstract: The invention includes an information retrieval system having a server and a plurality of clients. The server has access to one or more data storage media on which the server maintains a database. The database has a plurality of records that can be searched based on key values. The server maintains a page definition table in addition to the database. The page definition table has a plurality of entries, each indicating pairs of key values. To perform an information search, a client submits a search value to the server. The server responds by identifying an entry from the page definition table that corresponds to the search value. The server then identifies a set of database records whose key values are bounded by the pair of key values of the identified entry. Data from these database records are returned as search results to the client.

Abstract: A method that regulates the access of a plurality of computers onto data of a central computer. Operations on local copies of a true subset by computers are thereby generally possible in the method. For synchronization, log files that contain the operations on the replicated data are sent to the central computer. When numerous conflicts due to the access of a plurality of computers to the same datasets on the central computer occur in the synchronization, the method can offer regulated access to the shared data and, thus, the resolution of the conflicts. This change in the operating mode for resolving conflicts given access to shared data can also ensue automatically with prescribable thresholds for acceptable and unacceptable numbers of collisions. When conflicts are to be generally avoided, the offers the service of transactions that are either completely executed or can be completely cancelled.

Abstract: The present invention is a scalar quantity implemented as a process-pair resource manager. The process-pair implementation includes a concurrent aspect and a serial aspect. The concurrent aspect provides an object-like interface to the scalar quantity. Threads and processes access the scalar quantity by passing messages to the concurrent aspect. The concurrent aspect adds a description of each message as well as the result of processing each message to a transaction record. At the conclusion of a transaction, the concurrent aspect passes the transaction record to the serial aspect. The serial aspect then replays the transaction, using the transaction record. If the replay of the transaction is consistent with the transaction as recorded in the transaction record, the serial aspect sends a message to the concurrent aspect voting to commit the transaction. In turn, the concurrent aspect sends a message to the transaction manager forwarding the commit message.

Abstract: A computer structure for storing and manipulating information includes a processor, a table facility, a command facility and a memory. The table facility generates a table of prime numbers and associates a unique data structure with each prime number. The data structures include container data types such as heaps, strings, trees, tables, or any combination thereof. The table facility may further incorporate an ordered pair and a display font associated with each prime numbers. The command facility translates an inbound command from an external structure and provides a command to the processor. The processor manipulates the memory to provide a response to the inbound command. Advantages of the invention include a standard method and apparatus for creating, manipulating, and displaying data structures and container data types. The structures created are adaptable to imitate known data structures and are flexible enough to describe and manipulate new data structures.

Abstract: A method for superimposing attributes on files stored in a hierarchically organized file system, having at least one file and at least one directory, is disclosed. The method initializes an attribute data base (ADB) with one or more entries having a path descriptor referencing a file in a hierarchical database, an attribute, and an attribute association option describing how the attribute is associated with the file referenced by the path descriptor. The method simplifies maintaining systems employing file attributes to describe files by using the hierarchy of the file system to superimpose attributes on the files. The method provides for handling explicit, implicit, and static associations of attributes with files in the file hierarchy. The method is invoked by a file manager, such as an attribute supplying file hierarchy (ASFH), which resides in the operating system of a computer system having a processor, memory, and a system bus for passing data between the processor and memory.

Abstract: A document is read as an image file and stored. At this time, a table is updated. On the table, each of words included in text information obtained by character-recognizing image information output from the read means is associated with a page number of a page including each word and a storage position of the image information. With this table, not only the image information is provided by a full-text search, but also the page number of the page including the search keyword can be provided. The provision of the page number has a potential to facilitate search operations.

Abstract: A method and system for moving disparate data objects type into database applications is disclosed. The disparate data objects can be either retrievable locally or retrievable remotely. The method consists of: (1) creating a moving object; (2) locating a specified source data type; (3) creating sub-data objects associated with the moving object where in the sub-data objects further comprise a source data object for receiving a specified source data type and a target data object associated with said database application; and (4) converting the specified source data type to be compatible with the target data object; and moving the moving object with the specified source data after being translated into the database application.

Abstract: A system for allowing consistent execution of a workflow process in a computer-enabled workflow management system is described. The workflow process includes at least one sequence of workflow actions, having at least one set of parallel workflow actions and being configured as a number of nodes interconnected by arcs. Each node defines and executes at least one of the workflow actions. The system includes a workflow process database accessible by the nodes of the workflow process to read and write data items when executing the workflow actions. The system also includes a module for maintaining execution consistency among the workflow actions when the nodes access the workflow process database to read and write the data items in carrying out the workflow actions. A computer-implemented method for consistently executing a workflow process in a workflow management system is also described.