Abstract: The objects stored in computer's memory include a directed graph of object directories. Each object directory stores object names and object pointers for locating and accessing other objects. A root directory object, which is the starting point for locating any specified object, stores object names and object pointers to a set of first level object directories. Each object has an associated pathname that defines a path through the directed graph of object directories for accessing that object. More particularly, each pathname is a succession of path elements, proceeding from a first path element to a last path element. A default pathname parsing procedure is used for parsing any specified object's pathname, starting with said first path element, until the default pathname parsing procedure accesses an object directory having its own distinct pathname parsing procedure.

Abstract: The computer system has its parallel and serial implementations, its serial and parallel network and multi-processor configurations, with tight and loose coupling among processors. The computer system has a CAM coupled to the computer system or imbedded therein. CAM requests may be processed serially, or as parallel queries and coupled with PAPS (Parallel Associative Processor System) capabilities (P-CAM). The computer system may be configured as an expert system preferably having combined tuple space (TS) and CAM (content addressable memory) resources, an inference engine and a knowledge base. As an expert system, improvements for production processing are provided which surpass prior ad performance represented by RETE and CLIPS. An inferencing process for production systems is disclosed, and a process for working memory element assertions.

Abstract: A transaction, consisting of a compilation of changes made to one or more data objects of a database, is transfered to a primary transaction engine of a primary database for processing. A copy of the transaction is sent by the primary transaction engine to a shadow transaction engine of a mirror database for processing in the local store. The transactions are then processed by the respective transaction engines. If the transaction is successfully processed by both transaction engines, the respective databases are updated from the local data store. If one of the transactions is not successfully processed, the system takes corrective action and optionally notifies the user.

Abstract: A method of searching a database uses a plurality of search criteria each having an implicit logical operation associated therewith. After one or more of the search criteria is selected, a computer system with appropriate software formulates the search including the implicit logical operation to search the database, all without the need for the user to input any logical operation connecting the one or more of the selected desired search criterion.

Abstract: A method is provided in a versioned database management system for allowing parts to be versioned according to different variant hierarchies, and for maintaining correct configurations of versions of parts as those parts are drawn down, changed, and promoted. Each version of a part is associated with a variant domain. Each variant domain is represented by a single variant hierarchy whose levels can be used to reference versions of parts in that variant domain and controls how versions of parts in that variant domain are drawn down, changed, and promoted. Variant domain default groups are provided so that tools may add new parts without specifying the variant domains to which the parts are to belong. In order to control which versions of parts and from which version domains are visible, variant maps are defined by the user installation. When a change is made for one configuration, it is simultaneously made in any other configuration identified by a variant map which includes the same variant ID.

Abstract: An adapter for attachment to the bus or video display of a personal computer, workstation or like devices to a high performance parallel interface (HIPPI)channel of a host computer. In a system having at least three devices to be connected to a high performance parallel interface in a "Daisy chain," each of the devices has an adapter capable of both sending and receiving bursts of data with a data click. Each adapter includes an inbound receiver connected to the channel for receiving bursts of data and data clock and a decoder for decoding routing information contained in the bursts of data. A pass through logic circuit is connected to the decoder for interpreting the routing information. A first latch is connected to the inbound receiver for temporarily storing data bursts. A second latch is connected to the first latch for accepting data bursts when the routing information identifies a device to which the adapter is connected.

Abstract: An object-oriented audio signal processing system is disclosed. The signal processing system is capable of converting virtually any sound resource into a format which can be used by associated sound hardware to produce a sound. A signal processing system incorporating the invention comprises one or more chains formed by a plurality of sound objects serially connected. A sound object is a specialized task which performs a particular operation such as, for example, sample rate conversion of a sound resource, decompression of a sound resource, mixing multiple sound resources or retrieving sound resources from a software application. The sound objects are preferably modular and use substantially the same calling conventions and interface. A chain of sound objects processes digital audio signals into an output which can be maintained in a storage area, e.g. memory or disk or played on sound hardware.

Abstract: In a computer including at least one caller adapted to request access to a storage media, the storage media being organized according to one of at least one file system format, a system for handling requests for access to the storage media.

Abstract: A storage management is carried out in an information processing system in which a program including functions each treating a list structure data is executed. The storage management method includes the steps of generating list cells in a cell storage area so that the list cells are successively arranged therein while a function is being executed, and of collecting disused list cells from the cell storage area when execution of the function is completed, each of the disused cells being defined as a list cell that will not be used in the program, so that the disused list cells may be reclaimed in the cell storage area.

Abstract: A file system including an input/output unit for inputting data from and outputting data to an external system; a controller connected to the input/output unit for dividing the data into an optional number of parallel data; a management table for storing the number of divisions of the data; a head group for writing the divided parallel data into a storage medium at the same time; and a unit for reading the data from the storage medium while referring to information stored in management device.

Abstract: A method and device provide a unique and efficient scheme for utilizing a linked list data structure for encoding and decoding user data, thereby improving the efficiency and speed of data communication. In addition, processor use for computation is minimized, throughput delay is minimized, and throughput performance is maximized in a data communication system.

Abstract: The invention concerns a system for managing resources, which can take the form of (a) computer-compatible information, such as data files and programs, and (b) non-computer-compatible information, such as data contained on microfiche, and (c) physical objects. The resources are located at geographically diverse sites. The invention contains a descriptive profiles, profile for each resource, and allows any user to search all profiles, and to search the profiles according to "fields" (a database term), such as by location of the resources, or by category of the resources. The user can order delivery of a selected resource, and the system causes delivery of the resource to be executed, irrespective of the form (e.g., physical object) of the resource. The invention allows a provider of a new resource to limit access to the resource, by identifying users who are authorized to obtain access to the resource. Non-authorized users cannot obtain access to the profiles of these resources.

Abstract: A management system for a file server having a system board, an expansion board, a disk storage system and a server manager for collecting management information from the system board.

Abstract: A computer server for storing and managing a digitized generic form of multiple heterogeneously formatted data objects (e.g. multi-media files). The system uniquely identifies both the generic form of the data and a description relating the stored generic form to the original formatted data. Through the management of the unique identifiers a requester need only specify an identifier to quickly access a data object regardless of platform incongruencies, particular stored format, location or addressing structure (i.e. particular file path). Once identified and located the generic data object form is transformed into a format usable by the requestor.

Abstract: Database manipulation, data processing and report output processing are supplied as software parts referred to as methods, respectively. In a procedure, the methods are arrayed in a sequence in which they are to be executed, and input/output files and conditions are defined for the methods, respectively. A control unit executes the methods in accordance with the conditions for thereby executing the procedure.

Abstract: A database processing system using a multi-processor including a plurality of processor modules each having a local memory connected to an external shared memory. The database processing system includes a composite structure definition control part for defining an administrative processor module for controlling an access to a composite structure of a database which has a storage structure independent of a logical structure; and a maintenance/selection control part in an optimum control processor for providing a function of access-controlling a shared process and a local process when an access request arises for a database composite structure, and for dynamically switching the access control process for the composite structure according to the access frequency notified by each processor module.

Abstract: The current methods and systems sort three-dimensional data with a reduced number of buffer memories at an increased speed. Based upon the Z-dimension data, the three-dimensional data is sorted in ascending order via two intermediate tables. Since a first intermediate table holds only one set of unique Z values, when there is a recurrence of Z values, a second intermediate table holds these multiply occurring data. At the end, the contents of these intermediate tables are merged into a single result holding table.

Abstract: User specification of cultural bias during creation of a database allows for managing cultural bias of the database on a distributed data processing system. Upon creation of a database, it is determined if a cultural tag is specified by the user. A default cultural tag is provided if it is determined that no user specified cultural tag is provided. In some embodiments, the cultural tag is subject to validation. The user specified cultural tag or default cultural tag is then placed in a configuration file for the database. Query, change, or reset of the default cultural tag is also provided.

Abstract: Database applications typically need to invoke foreign functions or to access data that is not stored in the database. The invention provides a comprehensive approach to cost-based optimization of relational queries in the presence of such foreign functions. The optimization takes into account semantic information about foreign functions using a declarative rule language (e.g., SQL) to express such semantics. Procedures for applying the rewrite rules and for generating the execution space of equivalent queries are described. Procedures to obtain an optimal plan from this enriched execution space are also described. Moreover, necessary extensions to the cost model that are needed in the presence of foreign functions are described.

Abstract: The security of data elements which represent an industrial process, which are manipulated by users on a data processing system and in which the industrial process includes a series of industrial process steps, are controlled by permitting groups of users to access predetermined data elements based on the industrial process step at which the industrial process is currently active. A user is prevented from accessing the requested element if the industrial process is not at an industrial process step corresponding to one of the industrial process steps for which the user has authority to access the data element. Thus, access to data is prevented based on the status of the data, in addition to the type of data. When selected database elements are associated with one of many locations, access is also denied to a user based on the location. Security access based on status and location may be provided in response to a change in the current industrial process step.