Abstract: A distributed object oriented computer system that has two classes of object references: strong references and weak references. Weak references (or pointers) allow users to refer to an object, but does not prevent the object manager from deleting the object. A weak object reference can be converted into a strong object reference by execution of a "MakeStrong" operation, which generates a strong reference, and then deleting the weak reference. A strong object reference can be converted into a weak object reference by execution of a "MakeWeak" operation, which returns a weak reference to the object referred to in the operation's argument, and then deleting the strong reference. When an object no longer has any outstanding strong object references, deletion of the object is enabled. In another aspect of the invention, a portion of the computer's memory is set aside for a primary linker cache and a secondary linker image cache.

Abstract: A method, apparatus, and article of manufacture for encapsulating data from non-object-oriented datastores as datastore persistent objects. A computerized system in accordance with the principles of the present invention includes a "bridge" for retrieving a logical unit of data from the external non-object-oriented datastore, for mapping the logical unit of data retrieved from the external datastore into a datastore persistent object, and for manipulating the mapped logical unit of data within the datastore persistent object using methods associated with the object.

Abstract: The initialization method used in an information communication system including a main station (5) in operative state connected through a transportation way (TW3) to N secondary stations 7 which are to be initialized by the main station, comprises the step of sending to each secondary station to be initialized a set of messages comprising initialization program modules common to all secondary stations and specific messages containing initialization code modules specific to each station and a table dedicated to each station representative of the set of messages.

Abstract: A method, apparatus, and article of manufacture for capturing and cataloging program characteristics for the usage of datastore persistent classes. A computerized system in accordance with the principles of the present invention includes an external non-object-oriented datastore and a class definition tool that defines a datastore persistent object class having methods for wrappering data from the datastore and defines a specification for an application program that interacts with datastore persistent objects. The class definition tool stores the application program specification in a catalog and augments the application program specification to constrain use of a datastore persistent object by the application program. The class definition tool further generates subschema mapper class definition and method source code using the application program specification.

Abstract: A high speed bus structure which makes the bus effective and practical to use for both single processor and multiple processor environments. This is achieved by providing an active bus wherein a number of logic functions which control the operation of the bus are removed from the modules and are centralized and incorporated into the bus. The amount of bus functionality provided by the modules is minimized therefore decreasing the complexity and computational overhead of the modules and traffic on the bus that are attributable to supporting the functionality to operate the bus. The number of bussed signal lines is minimized by eliminating the bussed lines relevant to the centralized bus functions. In place of the bussed signal lines, dedicated signal lines connect the modules inserted into the bus and the bus components providing the centralized logic functions.

Abstract: A method, apparatus, and article of manufacture for representing data from non-object-oriented external datastores as queryable datastore persistent objects. A computerized system in accordance with the principles of the present invention includes a "bridge" for locating a logical unit of data in a non-object-oriented datastore using a queryable persistent identifier, for retrieving the data from the datastore, and for mapping the data retrieved from the datastore into a datastore persistent object so that the data is encapsulated within the datastore persistent object.

Abstract: A computer animation production system (2) for processing digital image data is disclosed. The computer animation production system (2) contains at least one information processing device (44-76) for enabling at least one user to develop, utilize and enhance digital image data. The information processing device (44-76) is associated with a first (4) and a second (6, 8, 10, 12 and 14) global area network (4). The first global area network (4) is for communicating digital control information to at least one information processing device. The digital control information includes image database information. The second global area network (6, 8, 10, 12 and 14) is for communicating the digital image data to the at least one information processing device (44-76). The digital image data includes pixel characteristic information for image reproduction on the information processing device.

Abstract: A process to access an IMS transaction based computer system from a structured query language (SQL) application program without revising or migrating the transaction based system. Binary virtual table mappings are built. An SQL statement from the SQL application program is parsed. Virtual column to transaction utilization mappings are extracted from the SQL statement. A possible solution set or solution sets are generated which may be capable of satisfying the SQL statement. Thereafter, transaction costs for each potential solution set are determined. Finally, a solution set with the lowest cost to satisfy the SQL statement is executed.

Abstract: A method, apparatus, and article of manufacture for interfacing queryable datastore persistent objects to non-relational, non-object-oriented datastores. A computerized system in accordance with the principles of the present invention includes a "bridge" for receiving a request to access a datastore persistent object stored, for retrieving a logical unit of data from the external non-object-oriented datastore in response to the request, and for populating the datastore persistent object with the logical unit of data retrieved from the external non-object-oriented datastore, so that the logical unit of data is encapsulated within the datastore persistent object.

Abstract: When an automated data storage library includes the capability of storing and accessing more than one media type, it is necessary for the library manager to keep track of what media type is associated with each volume serial number ("VOLSER"), and where each is physically located in the library. For efficiency, VOLSERs will be grouped in sequential ranges, each range associated with a single media type (although a particular media type can be associated with different, non-contiguous ranges). When the number of VOLSERs and ranges is small, new ranges can be easily added, and existing ranges can be easily deleted or modified, manually by a system administrator. However, when the number of VOLSERs and ranges becomes large, it becomes burdensome for the administrator to track the VOLSER ranges and media types. An automated VOLSER range management system is provided which detects whether a new or modified range overlaps or is adjacent to an existing range with the same media type.

Abstract: Reconciliation of corresponding groupings of data for processing by application programs ("sections") which are contained within files ("documents") is performed using history lists. In particular, a section in one document which corresponds to a section in another document is reconciled. Each section has a history list which identifies versions of that section. The reconciliation is performed by using the history lists to compare versions of corresponding sections in order to determine which section has been modified. When one of the corresponding sections has been modified and the other has not been modified, the unmodified section is modified with the other section. When both sections have been modified, then the user is provided with options for reconciling the sections. In addition, when one document has a new section which is not in the other document, the new section is added to the other document.

Abstract: A data management system should relieve the user of data management tasks as much as possible and nevertheless be flexible with respect to user-individual forms of the user data.This aim is achieved according to the invention by a generic database (GDB) having a central control system (CU) and generic data modules (GM), the generic data modules already containing all the functionality to carry out access control and data maintenance in cooperation with the central control system, and the generic data modules nevertheless allowing a user-individual form of the user data.

Abstract: A compactly stored word list that includes a directed graph data structure is used for word to number (W/N) and number to word (N/W) mapping. Each word accepted by the data structure is mapped to a unique corresponding number within a dense set of numbers ranging from zero to one less than the total number of acceptable words. Some common suffixes are collapsed into shared branches, which is possible because the numbers are not stored within the word list. In addition, some branches of the data structure can be skipped during mapping because of information associated with branch points. That information permits the mapping scan to continue with a next branch or with an alternative branch. That information also indicates the number of suffix endings in the next branch; this number is used to keep a count of the word endings during word to number mapping; it is also used both to determine whether to continue with the next branch and also to reduce the number being mapped during number to word mapping.

Abstract: A method of dynamically interfacing an application processor with a plurality of peripheral ports is shown, including the use of an expanded memory interface for controlling a plurality of memory components for an application processor external to the interface. The application processor is connected to the expanded memory interface, which is in turn coupled to at least one status port to facilitate communication between the application processor and the status port.

Abstract: The present invention provides a method and apparatus for concurrency control in an object oriented database management system having a plurality of users accessing the system at the same time, and allowing editing of the database while other users are concurrently searching the database. The present invention may be advantageously used in a client/server architecture comprising a knowledge base client and a knowledge base server. In a preferred embodiment, the knowledge base server may include an object oriented lock manager, a dynamic class manager, a connection manager, a query manager, a handle manager, a units manager, a database manager, and a file manager. The concurrency control mechanism includes a lock holder table. The present invention provides a method and apparatus for providing concurrency control in an object oriented database managemant system using only three types of lock modes: a class share lock, a tree update lock, and a tree exclusive lock.

Abstract: A method of cleaning-up a solid state memory disk is described. Clean-up begins with the selection of a focus block for clean-up. Next, on a sector-by-sector basis, memory is allocated within a destination block to store valid sectors of user data. User data is then copied into the destination block on a sector-by-sector basis. Afterward, the focus block is erased, converting dirty sectors into free memory without loss of valid sectors of data.

Abstract: In a client/server computing system, a method and apparatus for efficiently storing entries in a log file during disconnected client operations. An encoder utilizes a log file and a write file table for logging the write operations performed by the client during disconnected operations. The logging method employed by the encoding module logs in the log file only writes associated for different files. The encoding module tracks the status of the entries in the log file with a write file table containing the most recent sequence number associated with a file entry of the log file. Upon reconnection of the client to the server, a decoding module replays the events in the correct chronological order by transferring the file data modified during the period of disconnection in the order dictated by the write file table. A deferred write list is accessed by the decoding module for temporary storage any write operations whose replay should be delayed to preserve the relative order of events.

Abstract: A system for accessing data distributed on databases in an integrated computer system includes a distributed data port, which initiates a XRef server query, generates a virtual table having a first result set including at least one data row responsive to the XRef server query, initiates Populate queries each having one of the data rows as an argument, and updates the virtual table with data responsive to the Populate queries. The system also includes a XRef server, which receives the XRef server query from the distributed data port and identifies at least one of the databases having a data row responsive to the XRef server query. A temporary virtual table relays each Populate query to a data directory server, and the data directory server is linked to each of the databases.

Abstract: There is disclosed an information processing system and method capable of coping with a wider range of subjects and intricate changes. In client server structure, time-varying database altering information received from external systems is pooled in servers and distributed to a number of distributed terminals or clients, using broadcasting communication.

Abstract: A method, apparatus, and article of manufacture for cataloging datastore characteristics and defining and generating datastore persistent objects. A computerized system includes an external non-object-oriented datastore and a class definition tool that defines a specification for the external non-object-oriented datastore, defines a specification for a datastore persistent object class using the specification for the external non-object-oriented datastore, and defines a specification for an application program that interacts with the datastore persistent object class. The class definition tool stores the datastore specification, the datastore persistent object class specification, and the application program specification in a catalog.