Abstract: A Data Management System has a plurality of data managers and is of a layered architecture. The system performs with a data manager and with a user input via an API a plurality of process on data residing in heterogeneous data repositories of said computer system including promotion, check-in, check-out, locking, library searching, setting and viewing process results, tracking aggregations, and managing parts, releases and problem fix data under management control of a virtual control repository having one or more physical heterogeneous repositories. The system provides for storing, accessing, tracking data residing in said one or more data repositories managed by the virtual control repository. User Interfaces provide a combination of command line, scripts, GUI, Menu, Web Browser, and other interactive means which maps the user's view to a PFVL paradigm. Configurable Managers include a query control repository for existence of peer managers and provide logic switches to dynamically interact with peers.

Abstract: A computer program product is provided as a system for querying a repository of XML documents. The data in the XML documents are viewed by a query system as a graph that allows queries on content, structure, inter-document links, and intra-document links. The query language uses XML syntax and is based on tree pattern match semantics. The features of the query language allow the query system to compute a DTD for the query language and to use it to validate the user query formulation. Query optimization is done using schema-based optimization and index based optimization. Optimization uses the schema for (a) minimizing the number of documents on which the query need to be executed; (b) eliminating redundant conditions specified in the query; and (c) simplifying expensive query constructs.

Abstract: A system and method is provided for managing information. Information is aggregated from multiple data sources into a data warehouse wherein the information can be provided to software applications. Disparate information from multiple sources is processed and stored in the data warehouse. Processing may include filtering, collation, compression, and mapping information into database fields of the warehouse. In one aspect, information stored in the warehouse may be network management data.

Abstract: The present invention discloses a method of managing lists in a multiprocessor system without the use of locks that prevent contention for the list. List management in a linear list with a front and a back of the list has applications where it is desirable to manage the list in a Last In First Out (LIFO) and a First In First Out (FIFO) or a combination of LIFO and FIFO. LIFO and FIFO list management can be done by restrictively adding data elements to the front, back and removing data elements from the front of a managed list. At certain times there can be contention for a list and either locking routines are in place to prevent contention or some other method is used to guarantee data element integrity. The present invention discloses a set of operations that when used with certain protocols allow two or more processors to access a list as a LIFO or FIFO in a multiprocessor system without the use of locks.

Abstract: An automated method for periodically evaluating media streams on a network of computers. The invention is used to determine the availability of various media streams and identify various characteristics of each stream. By repeatedly obtaining the addresses, attempting to establish communication with each media stream, and then reporting the results the system can verify that each media stream is accessible and report various characteristics of the stream.

Abstract: A system, method, program, and data structure for performing a backup operation of a target file. At least one operation is initiated to perform at least one delta backup of the target file to at least one delta backup set. A delta backup set includes changes made to a version of a full backup set of the target file generated at a first time, such as an incremental or differential backup operation. The at least one delta backup set is assigned a name component indicating the version of the full backup set generated at the first time subject to the delta backup and an operation is initiated to perform a full backup of the target file to a version of the full backup set at a second time. The second time follows the first time. A determination is made of all delta backup sets having the name component indicating the version of the full backup set generated at the first time during the full backup operation at the second time.

Abstract: A replication occurs upon the re-configuration of a partial database to update an additional attribute of an object, and is divided into two sub-requests for replication. The first requests the new attribute from update sequence number zero and the second requests the existing attributes according to their known up-to-date vectors. To facilitate this request, a destination server sends an up-to-date vector table to a source server along with the request for replication. Because the existing attributes are requested from their known up-to-date vectors, rather than from update sequence number zero, this replication request results in less attributes being sent between servers and therefore, provides a more efficient replication.

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: A system for the management of media data and binding of media data to requests for pieces of media, which includes a plurality of procedures that can establish and write storage of new media, and make requests for media based on media source identification and range on the specified media source. A system for the management of relational information between media sources, which includes a plurality of procedures to set and query the information. Relations are established either via interaction with the sources or by user's specifications. Relations are based on positions in the source, labels on these positions and ranges from the labels indicating the length of the relation. Information concerning source relations, actual media stored for these sources, and binding of media to specific needs for the media within the system are separated. Media data is identified source identifiers and range specification on the source.

Abstract: The present described embodiments are embodied in a system and method for generating and validating reference handles for consumers requiring access to resources in a computer system. The system of the present described embodiments includes a resource manager having a handle administrator, a plurality of consumers, and a plurality of resources. The handle administrator includes an assignment routine, a release routine, and a dereference routine. The assignment routine issues new handles, the release routine releases handles that are no longer required (thus rendering the handle invalid), and the dereference routine dereferences handles into a pointer to a resource, which entails verifying that the handle is valid.

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 method and apparatus provide the ability to generate and use a database representing all solutions (legal combinations) satisfying all constraints of configuration problems on finite domains and/or intervals. The configuration space with all legal combinations is stored in a compact way in terms of nested arrays, where each legal Cartesian subspace has a unique index. Thus, the complete configuration space (which can be extended with object functions for optimization) is easily addressable by parallel indexing techniques and the database is therefore suitable for run-time applications (e.g. configuration on the Internet), which must be performed in real time.

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 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.

Abstract: A methods and apparatus for providing an OLE automation interface to transactions services is provided. The method and apparatus includes an OLE/TP gateway. The OLE/TP gateway dynamically creates OLE objects that correspond to one or more transaction services. Client programs manipulate the methods and properties included in the OLE objects to perform transactions involving the transaction services. The present invention also includes a visual development environment that allows the user to visually select the type of OLE objects that the OLE/TP gateway makes available to client programs.

Abstract: A keyword assignment system is provided to assign keywords when a digitized image of a document is created. The keyword assignment system includes a digitizer to generate the digitized image from the input document. A keyword entry system determines a keyword to be associated with the digitized image. A linker generates linking information that associates the keyword with the digitized image. A database is provided to store the digitized image and linking information.

Abstract: The method for providing a “Don't Care” bit to improve the speed of information matching in a digital information processing system. After the match information is input, it will be divided into multiple sub-bit-streams and then input to a correspondent selector for obtaining the content of a selected memory bank. The output of each selector is forwarded to the product module to compute an unencoded match result. Finally, the priority encoder receives the unencoded match result and performs priority encoding to generate an encoded match result and a match flag. If the match flag is positive, it indicates that there is a hit in the rule table for the match information. Thus, the match result serves as an index for looking up an information table.

Abstract: A method for deleting files on a UNIX file system, so that they may subsequently be undeleted, without any possibility of loss or damage. A file deleted with the “rm” command, or targeted by the “cp” or “mv” commands, is deleted simply by marking its directory record “deleted”, while its inode and data blocks are not freed. The “ls” command is adjusted so as not to display files whose directory records are marked as deleted. A indexed system of deleted-file records of such deleted files is maintained by the UNIX kernel, such that a record for each deleted file contains a pointer to the file's inode, a pointer to the file's directory inode, and the file's deletion time. A deleted file may be undeleted simply by calling an “unrm <file>” command, which uses a kernel system call to undo “deleted” mark in the file's directory record.

Abstract: A mark management server embeds a mark ID and so on in a specified mark image in response to a mark request from a WWW server, registers information related to a Web page corresponding to this mark ID in a mark management DB, and sends the mark embedded with the information to the server. The server attaches this mark to a created Web page, and registers the Web page in a Web page DB. A client terminal acquires a Web page from the server, reads information embedded in a mark, and issues a request for a search according to the mark to the server. The server references the DB, and sends information associated with a Web page corresponding to a specified mark ID to the terminal.

Abstract: The backup/restore method as described in this invention has a “backup copy generating process” to generate backup copy(ies) and a “restore process” to restore the original file(s) from the backup copy(ies) generated by the “backup copy generating process,” and includes a process to instruct the execution of the “restore process” by designating the file (name) and the time period backing from the current time (S801-S803), and when the execution of “restore process” is instructed, a process to control the execution of the “restore process” (S804) by selecting the corresponding backup copy file(s), according to the designated file (name) and designated time period.