Abstract: System, method, and program product for managing transactions on a plurality of Database Management Systems residing on separate participant servers and a coordinator server. A single transaction proceeds by multiple steps across more then one of the plurality of Database Management Systems as participants. Savepoints are assigned to the participants across the Database Management System, with at least one savepoint within a multiple step transaction. The DBMS responds to application requests to rollback to savepoint by rolling back the transaction, across the Database Management System participants, to the savepoint Further disclosed is a program product that contains code, which, either as written on the medium, or as instantiated in RAM, or both, controls the operation of a distributed database management system.

Abstract: A computer-implemented method and system providing both query-specific bookmarking and query-specific data collection. These features allow users to search more efficiently on the WWW by allowing users to explicitly maintain their search context. In addition, users can also collect query-specific relevance and usage data. User marked search results are saved as leads, which are displayed on a user interface such as a SearchPad. One embodiment of the invention involves extending HTML to include a Query attribute that saves the query context and returns it with a search result page. Another embodiment involves the use of cookies to save the query context. Saved query-specific bookmarks and query-specific data can be periodically saved to a central site, although not all embodiments perform this task.

Abstract: A system and method for unorchestrated determination of data sequences using “sticky byte” factoring to determine breakpoints in digital sequences such that common sequences can be identified. Sticky byte factoring provides an efficient method of dividing a data set into pieces that generally yields near optimal commonality. This is effectuated by employing a rolling hashsum and, in an exemplary embodiment disclosed herein, a threshold function to deterministically set divisions in a sequence of data. Both the rolling hash and the threshold function are designed to require minimal computation. This low overhead makes it possible to rapidly partition a data sequence for presentation to a factoring engine or other applications that prefer subsequent synchronization across the data set.

Abstract: The present invention provides for storage of data items with dissimilar structures in a single database table while minimizing the problems associated with prior approaches. In one aspect of the invention, a method of efficiently storing data items in a database management system (DBMS) is provided wherein each data item has at least one attribute associated with it, the method comprising identifying a set of attributes associated with each data item, creating, for use with all of the data items, a common data structure that excludes those attributes unique to any one of the data items, and associating each data item with attributes excluded from the data structure.

Abstract: A multimedia data keyword management method and a keyword data structure which can be applied to a search system is disclosed. According to the present invention, the search system includes a data table having a plurality of multimedia objects mapped with one or more keywords and can additionally register a new keyword to a data table through a feedback of a user according to a search result when a particular multimedia object is to be searched with a specific keyword. Each newly registered keyword can be weighted based on the keyword feedback authorization level of the user providing the feedback.

Abstract: A method of directing a patient to a source of health care information. The method comprises placing on a prescription sheet an address for the Internet web site, identifying an ailment of the patient and ascertaining an ICD or CPT code associated with the ailment. A key word or an ICD or CPT code associated with the ailment is placed on the prescription sheet and the sheet is given to the patient. The patient is instructed to input the key word or ICD or CPT code into a computer communicating with an Internet web site to obtain information about the ailment. The Internet web site and computer are configured in such a manner that the input of the key word or ICD or CPT code into the computer results in retrieval via the Internet web site of information about the ailment.

Abstract: A method and apparatus is disclosed for making predictions about entities represented in documents and for information analysis of text documents or the like, from a large number of such documents. Predictive models are executed responsive to variables derived from canonical documents to determine documents containing desired attributes or characteristics. The canonical documents are derived from standardized documents, which, in turn, are derived from original documents.

Abstract: The present invention provides a method for keeping a file system in a consistent state and for creating read-only copies of a file system. Changes to the file system are tightly controlled. The file system progresses from one self-consistent state to another self-consistent state. The set of self-consistent blocks on disk that is rooted by the root inode is referred to as a consistency point. To implement consistency points, new data is written to unallocated blocks on disk. A new consistency point occurs when the fsinfo block is updated by writing a new root inode for the inode file into it. Thus, as long as the root inode is not updated, the state of the file system represented on disk does not change. The present invention also creates snapshots that are read-only copies of the file system. A snapshot uses no disk space when it is initially created. It is designed so that many different snapshots can be created for the same file system.

Abstract: An apparatus for and method of utilizing an internet terminal coupled to the world wide web to request calculations on an existing proprietary data base management system having a dialog-based request format. The user fills in and transmits an HTML form defining the requested calculation. A data wizard converts the requested calculation definition to a script which is executable by the data base management system. The desired calculations are made and the results are returned to the user as one or more HTML pages.

Abstract: An improved document and image management system (“DIM system”) is provided for use by a digital computer in combination with a video display or other suitable output means to provide an system that operates, preferably, under the Microsoft Windows® shell environment and which, further, is cross-platform capable and application independent. With respect to the data, document, or image to be managed, the invention operates independently of both the computer platform and the application software therein operating that was used to create the data, document, or image. The programming method of the present invention obtains the indices needed to create an image from the application running on the Windows® desktop; and, thereafter, electronically files, or otherwise processes, the image. Such functionality is provided by targeting a data stream that is refreshing the graphical user interface (“GUI”) of a screen running on the Windows® desktop.

Abstract: A method for indexing and managing a searchable community of non-HTML information. The method utilizes an electronic search engine which indexes data files used by sites created by website generation software. The indexing process of the search engine indexes HTML and non-HTML information from websites enrolled in an electronic community. The non-HTML data includes a database from which enrolled websites operate. This information is downloaded over HTTP, parsed, and indexed with unique parameters into a database running on the search engine. The search portion of the search engine process operates like standard search engines. A user submits a request over HTTP to the search engine. The search engine processes the search request and presents the results to the user in a dynamically created HTML page.

Abstract: Each network of data processing systems within a system of networks is assigned a unique network identifier when connected to the system. Each data processing system within a given network is assigned a unique host system identifier when the data processing system is added to the network. When a new object is added to a given data processing system, a unique object identifier is constructed with three fields, including a high order field containing the network identifier for the network in which the object is being added, a next order field containing a host system identifier for the data processing system to which the object is being added, and an object identifier unique for all objects within the host data processing system. The combination of the three identifiers results in a single, unique object identifier which is unique for all objects across the system of networks and data processing systems.

Abstract: A system and method for estimating the point of diminishing returns for additional information in data mining processing applications. The present invention provides a convenient method of estimating the extent to which a data mining algorithm captures useful information in raw feature data. First, the input data is processed using a forward transform. A region of overlap Yo in the forward transformed data is identified and quantified. The region of overlap Yo is processed with a reverse transform to create an overlap region Z in an original feature space. The degree of overlap in region Z is quantified and compared to a level of overlap in the Yo region, such that the comparison quantifies the extent to which a data mining algorithm captures useful information in the input data.

Abstract: A method and apparatus are provided for managing changes to a directory of electronic documents. A custom directory is created and stored based on the contents of a master directory. The master directory comprises a taxonomy of categories. A plurality of electronic documents are classified in one or more of the categories. One or more mappings defines how the documents of categories of the master directory map to categories of the custom directory. Mappings may express merges or splits of categories. One or more judgements may be created and stored in the custom directory in association with documents in the categories of the custom directory. Each judgement expresses whether a document is in or not in a category, or locked out of all categories. Modifications to the master directory are automatically propagated to the custom directory, according to the mapping, but without overriding the judgements in the custom directory.

Abstract: A method for searching for a query word in a database of automatically recognized text generated, for example by an optical character recognition (OCR) system or a speech recognition (SR) system finds entries that most closely match the query word. The database is indexed into a trie data structure, which represents all possible words in the database. The trie data structure has a plurality of branch nodes, each representing a letter of at least one word, and a plurality of leaf nodes, each representing a respective word. The trie data structure is searched for each query word by selecting the first letter of the query word and also selecting a root node in the trie data structure as the current node. All possible child nodes of the current node are identified. Respective estimated probability values for matching respective letters of the query word with the letters associated with the nodes in the path taken through the trie data structure are calculated for each identified child node.

Abstract: A system and method for optimizing I/O to low-level index access during bulk-routing through a taxonomy to classify documents, e.g., Web pages, in the taxonomy. In a first optimization, bulk-routing is regarded as a generalized join operation in a relational database framework. In a second optimization, instead of processing each document individually through nodes of the taxonomy, a group of documents are processed node by node in a wavefront-style routing scheme for better amortization of index probes.

Abstract: When a predetermined number of pieces of data are retrieved, a retrieving process is performed first on a local database 7 in a LAN 1, and a response counter 8 counts the number of pieces of response data accumulated in a response accumulation device 9. When it is determined that the predetermined number of pieces of response data cannot be obtained from the local database, a remote database 3 is searched by a retrieval device 6 through a communications device 2. Therefore, requests to search unnecessary databases can be reduced, and the load on a network and the remote database 3 can also be reduced successfully.

Abstract: A system for performing a mindflow process includes a memory coupled to a processor. The memory stores a number of knowledge modules. Each knowledge module comprises a process having a number of subprocesses. The processor stores a knowledge item generated by a first knowledge worker in the memory based upon the results of a first query session. The processor further retrieves the knowledge item generated by the first knowledge worker based upon the results of a second query session with a second knowledge worker. The processor further initiates a graphical user interface having a number of displays. Each display corresponds to a subprocess of a selected knowledge module and at least one display is operated by the second knowledge worker to perform a portion of the process using the retrieved knowledge item.

Abstract: A command line interface for a network management platform includes a parser that parses and validates inputs entered at a command line, a command processor that, responsive to validation of a command, causes an operation specified by the command to be performed, and an output facility that presents outputs of the command line interface. The parser preferably enforces a syntax addressing a plurality of attributes of a network device as a tree-like hierarchy including at least two containers. The parser permits network device attributes, which are each contained in at least one container, to be contained by multiple containers of the same type so that such attributes are addressable via a plurality of different access paths. The output facility preferably provides one or more outputs for operations specified by processed input commands, and the one or more outputs preferably include at least one output command specifying a network management operation to be performed.

Abstract: A system, method, and data structure are delineated for use in data storage and retrieval. An array of records stored in shared memory contains data entries, and associated hash codes computed from a predetermined hash function. A search request, consisting of one or more data entries, uses the same hash function to generate user codes. The records are searched to find one with hash codes that equal the user codes. This search involves comparisons of native data type entry, which are much faster than character string comparisons. Only after a record is identified with hash codes matching the user codes will a more time-consuming comparison be made between the selected record and the respective data entries of the search request.