Abstract: A web-based system, method and program product are provided for adding content to a content object (e.g., a custom compilation or prepublished work) stored in a data repository as a group of hierarchically related content entities. Each content entity is also stored as a row in a digital library index class as a collection of attributes and references to related content entities and containers. As the user selects desired objects for inclusion in a content object, the system arranges the objects hierarchically, e.g., into volumes, chapters and sections according to the order specified by the user. Furthermore, prerequisite checking, wherein some entities are associated, e.g., by a set of rules, with content objects that are prerequisites to that objects, and wherein selection by the user of an entity having prerequisites causes automatic inclusion of all associated prerequisite objects in the final compilation.

Abstract: A web-based system, method and program product are provided for adding content to a content object stored (e.g., a custom compilation or prepublished work) in a data repository as a group of hierarchically related content entities. Each noncontainer content object is preferably stored as a separate entity in the data repository. Each content entity is also stored as a row in a digital library index class as a collection of attributes and references to related content entities and containers. As the user selects desired objects for inclusion in a content object, the system arranges the objects hierarchically, e.g., into volumes, chapters and sections according to the order specified by the user. The system then creates a file object (e.g., a CBO) defining the content object that contains a list or outline of the container and noncontainer entities selected, their identifiers, order and structure. This file object is stored separately in the data repository.

Abstract: A web-based system, method and program product are provided for storing content objects (e.g., a custom compilation or prepublished work) in a data repository as a group of hierarchically related content entities. Each noncontainer content object is preferably stored as a separate entity in the data repository. Each content entity is also stored as a row in a digital library index class as a collection of attributes and references to related content entities and containers. As content objects are input to the system or as a user selects desired objects for inclusion in a content object, the system arranges the content objects hierarchically, e.g., into volumes, chapters and sections according to the order specified by the input content object or by the user. The system then creates a file object (e.g., a CBO) defining the content object that contains a list or outline of the container and noncontainer entities selected, their identifiers, order and structure.

Abstract: A data structure and method are provided for storing a content object stored (e.g., a custom compilation or prepublished work) as a group of hierarchically related content entities Each content entity is contained in a separate file object. An attribute file object corresponding to each content entity file object contains attributes pertaining to that entity. A list or outline containing container and noncontainer identifiers defines the content, order and structure of the content object. This list or outline is stored as a separate file object (e.g., a CBO or the PSF file of a prepublished work).

Abstract: Database system (10) which comprises a fractal hierarchical index database (13), and a processing unit (19). The processing unit (19) is employed to evaluate an input string (12) describing an element (E1) that is to be added to the database system (10) in order to obtain an input network (18) comprising a semantical unit (SU1) representing the element (E1). Then the processing unit (19) updates the index database (13). Finally, either an existing access pointer (22) is maintained, or a new access pointer (22) is created between the element (E1) and the semantical unit (SU1) representing the element (E1) thereby rendering the element (E1) in the database system (10) accessible or retrievable.

Abstract: An intranet server, memory medium and process for handling requests for resources from a downstream intranet server or a user. The intranet server is configured by a data shadowing program to locally store resources that have a high usage frequency. If a resource has not been requested for a predetermined time out period, it is deleted from local memory. Resources stored in local memory are served in response to requests for them, thus avoiding the service of such resources over the internet each time they are requested. An inquiry procedure handles status requests for new versions in either an active or a passive mode. In the active mode, the intranet server that directly interfaces with the internet periodically checks the status and receives updated versions of resources stored in its local memory. The resources stored in local memory are then served upon request from a user.

Abstract: A web-based system, method and program product are provided for adding content to a content object stored (e.g., a custom compilation or prepublished work) in a data repository as a group of hierarchically related content entities. Each noncontainer content object is preferably stored as a separate entity in the data repository. Each content entity is also stored as a row in a digital library index class as a collection of attributes and references to related content entities and containers. As the user selects desired objects for inclusion in a content object, the system arranges the objects hierarchically, e.g., into volumes, chapters and sections according to the order specified by the user. The system then creates a file object (e.g., a CBO) defining the content object that contains a list or outline of the container and noncontainer entities selected, their identifiers, order and structure. This file object is stored separately in the data repository.

Abstract: The present invention provides a method and system for transforming image data from a present format to a requested format. A request for the image data is received wherein the request includes a requested format, the requested format includes a first plurality of parameters. A present format for the image data is determined in response to receiving a request for the image data, wherein the present format includes a second plurality of parameters describing the image data. The first plurality of parameters within the requested format is compared to the second plurality of parameters within the present format describing the image data, wherein each parameter within the first plurality of parameters corresponds to a parameter within the second plurality of parameters. Parameters from the first and second plurality of parameters are identified, wherein a match between a parameter within the first plurality of parameters and a corresponding parameter within the second plurality of parameters is absent.

Abstract: A method, computer product, and system for rewriting database without decreasing pushdownability is provided. First, a pushdown analysis of the query in its entirety is performed prior to the application of any query rewrite rules in order to establish a baseline on pushdownability for the query. The results of this analysis is stored with the internal query representation. After each rule is applied to rewrite a portion of a query, that rewritten portion is analyzed again for pushdownability. If pushdownability is not decreased, then the rewritten query remains and the internal representation of the query is updated to reflect the pushdownability of that portion. If pushdownability is decreased, then an undo operation is applied to the rewritten portion of the query to back out the effects of the rule and leave the query in the same state as before the rewrite. Finally, additional rewrite rules that are directed to the heterogeneous database environment are also provided.

Abstract: A method and system for calculating the lowest cost join permutation for queries which involve multiple database tables is disclosed. A method and system comprises building all initial table composites and determining the cost of building each member of the set of composites one table at a time. The method and system includes comparing the cost of building each member of the composites to a threshold value and skipping any member of the set of composites that has a value greater than the threshold value. The method and system includes calculating the cost of building all possible members of the next successively larger set of composites which can be built from members which do not exceed the threshold value and saving the lowest cost means for building each member of the next successively larger composites. The method and system includes determining if a final composite has been built and stepping to the next composites if the final composite has not been built.

Abstract: A computer implemented method is described for enabling a user to transfer, via a graphical user interface, an item from one displayed window to another displayed window. Initially, a first window is displayed with an item to be moved and a second window is displayed with one or more destinations to which the item can be moved. Thereafter, the user selects the item to be moved, causing a further window to be displayed which includes one or more commands, one of which manifests a movement action. Upon selection of the movement command, the graphical interface displays a list of destinations with which the item to be moved can be associated by actuating the movement command. Thereafter, responding to a selection of one of the displayed destinations, the computer which operates the graphical view user interface associates the item being moved with the selected destination and alters the display so that at least one of the displayed windows manifests the movement action.

Abstract: In a database processing system with a partitioned database that provides relational extenders to support storage of and access to complex data types, metadata table rows are collocated with corresponding relational table partitions. Image indexes are generated and stored at system nodes with their corresponding relational table partitions. Image query processing is conditioned to account for the partitioned structure of the database.

Abstract: The present invention provides a method and system for controlling a device. The system includes a personal digital assistant with a computer program for receiving a program information from a source and selecting a program based upon the program information; and an emulator for sending a signal to a device based upon the selected program. The personal digital assistant receives the program information from a source and selects a program based upon the program information. In the preferred embodiment, the device includes a television and a video cassette recorder. With the method and system of the present invention, a user can place into use the program schedule information in the personal digital assistant without the need for a separate remote control. This simplifies the use of the program schedule information in the personal digital assistant.

Abstract: A method of performing design synchronization in a computer system is described. At least a portion of a source schema and at least a portion of a target schema are compared. The target schema is modified based on the differences therebetween. In a preferred fashion, design changes are made at the target with target-specific syntax and the minimum number of equivalent operations.

Abstract: The present invention provides a method and system for converting a source document into a plurality of documents, each of the plurality of documents having one of a plurality of formats. The method and system comprise providing a document type definition for formatting the source document. The method and system further comprise providing a transform to convert the source document into the plurality of documents. At least one of the plurality of documents has a binary code format. The method and system enable production of the plurality of documents, each representing a version of the source document, such that the versions are consistent with each other.

Abstract: A system and method that communicates with archive systems that use various query languages. The system includes an interpreter, which receives an inquiry in a non-archive-system-specific form, converts the inquiry into an archive-system-specific form or allocates it to an archive-system-specific form and executes the inquiry in a selected archive system. Processing of the search results, management of the interface with the archive system and the pertinent administrative work is undertaken by the interpreter. The knowledge required of a user regarding the individual archive systems is reduced to a minimum. The various interfaces of the interpreter make it possible to use source code for different archive systems with few modifications.

Abstract: A system and method for processing a request utilizing a database management system in a computer system is disclosed. The database management system manages at least one database. At least one database subsystem corresponding to the database management system is available. The computer system includes a plurality of worker threads. The method and system include assigning the request to a worker thread of the plurality of worker threads. The worker thread is for aiding in execution of the request. The method and system also include providing a connection to a particular database subsystem for the worker thread and associating the connection with the worker thread if the worker thread has not previously used the particular database subsystem. The method and system further include reusing the connection to the particular database subsystem that is associated with the worker thread if the worker thread has previously used the particular database subsystem.

Abstract: A method and system for handling foreign key database updates. The database includes one or more tables where each table includes at least one row and a primary key or foreign key. The method and system include evaluating a list of row operations for foreign key relationships. After evaluating the foreign key relationships, the tables determined to have acyclic foreign key relationships are grouped into a first set of tables and the tables determined to have cyclic foreign key relationships are grouped into a second set of tables. The method and system further include ordering the first set of tables into a list based on the foreign key relationships among the set of tables, such that a parent table will be processed before a child table. The row operations are then applied to each table in the list in the specified order.

Abstract: The security evaluation method of the invention utilizes multiple levels of security evaluation before certain user's can gain access to system resources. Upon receiving a user access request, the method acquires qualification data regarding the access request and determines a security level that is applicable to a selected system resource which is indicated by the user access request. Thereafter, the method performs at least one of a plurality of security tests to determine if the qualification data matches the security level applicable to the selected system resource. At least some of the plurality of security tests are arranged to be performed in an order of speed of execution, with a fastest executable security evaluation test being performed first and a slowest executable security test being performed last.

Abstract: A method for localizing execution of subqueries and determining collocation of execution of subqueries in a shared-nothing database. The concept of compatible partitioning is used to localize database operations in order to eliminate excess processes and communication, and thereby improve response time and throughput for the database management system. The method reduces the number of process by reducing the number of nodes involved in processing a query and by combining multiple processes.