Abstract: A reverse-search function may accept user input and search back through previously executed and stored data forwarding device control instructions for a data forwarding device control instruction, at least a part of which matches a search string input by the user. The matching data forwarding device control instruction may be retrieved and rendered. A reverse-expand function may accept user input, and search back through previously executed and stored data forwarding device control instructions for a data forwarding device control instruction having an word or parameter, at least a part of which matches a search string input by the user. The first matching word or parameter may be retrieved and rendered.

Abstract: Described are techniques for performing compression and decompression of statistical data. This data may be used in connection with performing optimizations. A delta value for each statistic is determined representing a difference between a current value and a previous value. Delta values are stored in a statistics table in a compressed form using a monotonic compression scheme. Small tables are used to determine decompressed values estimating the observed values. Statistical information is stored and represented in a statistics table and an events table. Statistical information is selectively fetched and loaded into memory from a storage device. Indexing techniques are used to force physical continuity of the rows of the statistics table on a storage device in accordance with a specified retrieval order.

Abstract: A system and method are disclosed for implementing dynamic set operations on data stored in a sorted array using a hybrid red-black binary search tree as a data structure. More particularly, the subject invention facilitates the implementation of a binary search to access data items stored in a sorted array by position, rather than by key value. This is accomplished by generating a balanced red-black binary search tree for a sorted array of data items wherein the information stored at each node of the tree includes: a key value; a color; a left pointer to indicate the presence of a child to the left of the node; a right pointer to indicate the presence of a child to the right of the node; a count of descendents along a branch to the left of the node; and a count of descendants along a branch to the right of the node.

Abstract: A garbage collector that divides a dynamically allocated heap into car sections grouped into trains in accordance with the train algorithm subdivides large trains into subtrains. When an object that is reachable from the train-algorithm-managed generation of the heap is evacuated from a car being collected during a collection increment, it is placed into the last car in the subtrain in which the reference to it resides, even if that car is not the last car in the train to which the reference's subtrain belongs. The train-algorithm test for dead trains is performed not only on top-level trains but also on sub-trains.

Abstract: A system and method for managing a manufacturing processing operation by integrating one or more data retrieval systems with a user station. Data stored on one or more data retrieval systems is communicatively interfaced with the user station. The user stations controls one or more manufacturing processing operation in a manufacturing environment. The interfaced data is displayed on the user station to assist an operator that monitors or controls the user station in making changes in the manufacturing processing operation.

Abstract: A rules analyzer system and method is provided for an enterprise system to evaluate and rank exact and probabilistic search rules for searching a computer database of records according to the efficiency of each search rule. The rules analyzer collects statistics on the performance of each search rule and assigns a priority value for each search rule according to the collected statistics. The priority values are based on the efficiency or precision of each search rule. Thereafter, the rules analyzer ranks the search rules according to the assigned priority.

Abstract: According to the present invention, techniques for performing security functions in computer storage subsystems in order to prevent illegal access by the host computers according to logical unit (LU) identity are provided. In representative embodiments management tables can be used to disclose the Logical Unit in the storage subsystem to the host computers in accordance with the users operational needs. In a specific embodiment, accessibility to a storage subsystem resource can be decided when an Inquiry Command is received, providing systems and apparatus wherein there is no further need to repeatedly determine accessibility for subsequent accesses to the Logical Unit. Many such embodiments can maintain relatively high performance, while providing robust security for each LU.

Abstract: A method of thematically classifying documents, in particular for making up or updating thematic databases (42) for a search engine, includes the steps of selecting documents representative of each theme, identifying within the selected documents, elements that are characteristic of each theme, allocating a coefficient (R) to each identified element, said coefficient being representative of the relevance of said element relative to the corresponding theme, and for each document (50) for classification, identifying said elements characteristic of each theme contained in the document and, for each theme corresponding thereto, using the coefficients allocated to said elements to calculate the value of a characteristic representative of the relevance of the theme for the document (50), in order to decide whether or not the document relates to the theme.

Abstract: The present invention generally is directed to a system, method and article of manufacture for accessing data independent of the particular manner in which the data is physically represented. In one embodiment, a data repository abstraction layer provides a logical view of the underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs translation of an abstract query into a form that can be used against a particular physical data representation.

Abstract: Client 101 sends a function to be executed to server 102, and at the same time, sends information such as the send destination disk unit, function name, version, etc. The server stores the received function, uses the received information to create function information 127, creates function information 126 that contains access area list 124 to be sent to disk unit 103, and then sends the function and function information 126 to the disk unit. The disk unit stores the function and function information. When a function execution request is sent from the client to the server, if the server is also sent parameters, it creates additional function information 126 and sends said function information 126 together with the function execution request to the disk unit. The disk unit performs the function execution and restricts accesses during execution according to function information 126.

Abstract: According to the present invention, techniques for performing security functions in computer storage subsystems in order to prevent illegal access by the host computers according to logical unit (LU) identity are provided. In representative embodiments management tables can be used to disclose the Logical Unit in the storage subsystem to the host computers in accordance with the users operational needs. In a specific embodiment, accessibility to a storage subsystem resource can be decided when an Inquiry Command is received, providing systems and apparatus wherein there is no further need to repeatedly determine accessibility for subsequent accesses to the Logical Unit. Many such embodiments can maintain relatively high performance, while providing robust security for each LU.

Abstract: In the present invention, a database structure is defined such that a database table having a plurality of objects each having an associated data is formed. A second table containing the relationship of one of the objects to another of the objects in a parent-child relationship is formed. A summary database table receives the data from the second database table and summarizes the data therefrom. By separating the relationship from the underlying data, and with the definition of each parent and child, execution of retrieval of information from the database structure is extremely efficient and fast.

Abstract: A CORBA-compliant computer network includes a registration server on which an AAR service resides, a registry database and an ORB which couples the registry server to the registry database. A CORBA-compliant interceptor residing on the ORB intercepts each message, generated by the AAR service, invoking the registry database and each message, generated by the registry database, responding to the invocation message generated by the service of the client server. The interceptor selects information useful in determining the cause of a failed usage of the service residing in the client server from each intercepted invocation and response messages, writes the selected information to a data store residing in the client server and then re-invokes the intercepted invocation and response messages. In the event of a network failure, the data written to the data store may be reviewed to obtain useful information regarding the network failure.

Abstract: A rules analyzer system and method is provided for an enterprise system to evaluate and rank exact and probabilistic search rules for searching a computer database of records according to the efficiency of each search rule. The rules analyzer collects statistics on the performance of each search rule and assigns a priority value for each search rule according to the collected statistics. The priority values are based on the efficiency or precision of each search rule. Thereafter, the rules analyzer ranks the search rules according to the assigned priority.

Abstract: An extensible database system is disclosed for storing data in a plurality of separate, lower-level databases. A top-level database is used to manipulate the data. The top-level database has a property dictionary file that stores the names of properties in the database system, along with references to their locations. An initial database system is created having a plurality of separate databases, each of which may store one or more fields, or properties. References to each of the initial databases are stored in the dictionary file. Thereafter, an added database may be used to add a property, or field, to the database system. The name of the added properties is stored in the dictionary file along with an address pointer to the memory location of the added database. To delete a properties, the reference to that properties is deleted from the property dictionary file and the properties data is removed from memory.

Abstract: A distributed cache management system controls individual cache objects so they are selectively updated if messages are received at another cache in an expected order and selectively invalidated if messages are received with certain error state, thus causing reference to be made to the central database. In specific embodiments of the invention, each change to an object in the central database is assigned a unique version number with an inherent ordering to serialize all changes, and the version number is used as a key to determine if messages have been lost or otherwise received at a cache out of order. In a further specific embodiment, full object state information is communicated among caches without need for verification through the central database. Thus if messages are lost or received out of order, the state can be applied to the targeted objects in the local cache assuring full synchronization.

Abstract: A method and system for processing and managing requests for concurrent use of data. Nested databases are utilized in order to create different environments in which the data can be accessed and modified. For each transaction which is in existence, there is an indication or reference to a database or subdatabase associated with that transaction. There are also data structures which indicate, for each data item at issue, which database or subdatabase is associated with that item. The use of data structures relating the transactions, subdatabases, and data items allows the creation of spheres of control for the various transactions and subdatabases. Thus, data can be readily shared among a plurality of users. The creation of the subdatabases does not require plural copies of data and the database management system may be implemented using one copy of the data, although multiple copies may be utilized, if desired.

Abstract: A query pushdown system determines whether all, some or none of the query predicates of an object-oriented query received at an object level of a database may be executed in a relational level of the database. The determined query predicates are pushed down to the relational level and executed in the relational level. The results of the query execution are transferred to the object level. In addition, data sets corresponding to query predicates that could not be executed in the relational level are also transferred to the object level. Any results and data sets are applied to the remaining query predicates which are executed in the object level.

Abstract: A data processor comprises a number of databases for storing records and a plurality of user systems capable of accessing the databases. The user systems each include a datastore/application environment instance with which users can interface. Host systems may include more than one instance. The datastores contain time-versioned views of records. The data processor is operable in at least two modes, a normal operation mode in which an evaluation in response to a user enquiry can be carried out using records relevant to a current viewpoint time and time span, and a recovery operation mode in which records relevant to a viewpoint time and time span for a previous evaluation are accessed and used to exactly reproduce the previous evaluation.

Abstract: A method of deriving a sub-class from a remote objects contained on a remote computer and from local objects contained on a local computer to produce a hierarchy of objects distributed across the local and remote computers. Further disclosed is a method of processing a request message from a calling computer program in a distributed object computing system containing a hierarchy of objects distributed across computers.