Abstract: Cache structures of a shared storage processor of a computing environment are copied. A copy operation for a cache structure of the shared storage processor is initiated. Although the cache structure is owned by an exploiter of the cache structure, one or more objects of the cache structure are copied via an operating system of the computing environment. The one or more objects are copied from the cache structure to another cache structure of the computing environment. Both cache structures may be located within the same shared storage processor or within different shared storage processors.

Abstract: List structures of a shared storage processor of a computing environment are copied. A copy operation for a list structure of the shared storage processor is initiated. Although the list structure is owned by an exploiter of the list structure, one or more objects of the list structure are copied via an operating system of the computing environment. The one or more objects are copied from the list structure to another list structure of the computing environment. Both list structures may be located within the same shared storage processor or within different shared storage processors.

Abstract: A method and apparatus allows files stored on a mainframe computer system to be manipulated from a client computer system such as a personal computer. The mainframe may be represented by a UNC identifier or drive letter and a hierarchical folder structure may be arranged for the UNC identifier or drive letter in a manner consistent with the manner for arranging folders for locally stored files. Filenames or templates capable of describing multiple filenames may be associated with each folder to allow files on the mainframe to be manipulated using the hierarchical folder structure in a manner similar to that of locally stored files.

Abstract: Query results and statistics regarding them are generated using a novel representation of an n-attribute relation as an order n relational tensor. Orders of the relational tensor respectively correspond to each of the attributes, and each coordinate along an order relates to a key value of the corresponding attribute. Numeric values are stored in the relational tensor, each numeric value representing a count of tuples having the attribute key values that correspond to the coordinate of the numeric value along the orders of the relational tensor. This storage representation is useful in a variety of contexts for enhancing the performance of a RDBMS system. Specifically, in a first aspect of the invention, a tensor representation can be used to generate statistics for a user query so that the relational database system can determine, from among two candidate approaches, an approach to use in processing the user query based on the statistic.

Abstract: The present invention is directed to a method for dynamically changing objects to be cached in accordance with the processes performed. More particularly, the method for selecting objects to be cached in a data structure of classes of objects hierarchically arranged in a plurality of levels (L1, L2, L3, . . . ) comprises the steps of: in response to that a first object (a) of a first class at a specific level (L2) refers to a second object (b) of a second class at a different level (L3), detecting classes belonging to the different level (L3); and specifying, as objects to be cached, objects (b, c, d and e) at the different level (L3) that have not yet been cached and that can be traced, starting at the first object (a) of the first class.

Abstract: A number of partitions of a cellular multiprocessor (CMP) are connected to respective databases and form respective nodes of a data warehouse. Heterogeneous data stored across the nodes is accessed automatically in parallel at high speed from a user site using a simple script request containing a data source object name wherein the heterogeneous data is treated as a single data source object, the script further containing at least one method to be performed on the data source object. Respective agent processes are stored in memory dedicated to each partition and automatically generate descriptor files containing metadata corresponding to the data source object from a repository available to each partition. A messenger process transmits the new scripts to the appropriate nodes via memory-based messaging using a shared portion of the CMP memory. Respective agent processes at each node respond to automatically access the appropriate data and execute specified methods upon it.

Abstract: The present invention provides a method and system for sequential pattern mining with a given constraint. A Regular Expression (RE) is used for identifying the family of interesting frequent patterns. A family of methods that enforce the RE constraint to different degrees within the generating and pruning of candidate patterns during the mining process is utilized. This is accomplished by employing different relaxations of the RE constraint in the mining loop. Those sequences which satisfy the given constraint are thus identified most expeditiously.

Abstract: Input apparatus for a data processing system includes a processor, storage and graphical display in which a free-form source document is input and processed to parse a source document to locate semantically meaningful entities and to store corresponding content data. The graphical display is arranged to generate a visual representation of the source document in which the semantically meaningful entities are represented by pictorial elements.

Abstract: Query results and statistics regarding them are generated using a novel representation of an n-attribute relation as an order n relational tensor. Orders of the relational tensor respectively correspond to each of the attributes, and each coordinate along an order relates to a key value of the corresponding attribute. Numeric values are stored in the relational tensor, each numeric value representing a count of tuples having the attribute key values that correspond to the coordinate of the numeric value along the orders of the relational tensor. This storage representation is useful in a variety of contexts for enhancing the performance of a RDBMS system. Specifically, in a first aspect of the invention, a tensor representation can be used to generate statistics for a user query so that the relational database system can determine, from among two candidate approaches, an approach to use in processing the user query based on the statistic.

Abstract: A management information database (MIB) of network manager (NM) 200 and network elements (NE) 220-22N each store management information and database identifiers that indicate the update history of the management information. Database information is updated each time NM 200 sets or manipulates management information of each of NE 220-22N, and includes the identifiers of the NM and NE, that are subject to manipulation as well as access time 401 that indicates the time operations were carried out. When the management information database within the NM is substituted (overwritten) by back-up data due to, for example, damage, the database information stored by each of the NM and the NE is compared upon subsequent access of the NE, and in the event of discrepancies, the management information stored in the NE is uploaded and the management information stored in the management information database of the NM is updated by that management information to synchronize the management information of the MIB and the NE.

Abstract: A method for retrieving data with a more intuitive manner of specifying search conditions is disclosed. The method is implemented as an application on a computing device. The method is suitable for retrieving information stored as records in the computing device in a search operation. Records are retrieved if they meet a set of search conditions. The search conditions comprise a search text and other conditions. The application accepts a search command which contains the search text and any other search conditions. This search command consists of words entered in a free-form manner. Words which match predetermined keywords are translated into search conditions using information related to the predetermined keywords. Non-matching words form the search text. In a search operation, the application communicates with a user through a set of screens which are bidirectionally linked to one another.

Abstract: The present invention relates to a method of delaying space allocation for parallel copying garbage collection in a data processing system comprising a memory divided in a current area (from-space) used by at least a program thread during current program execution and reserve area (to-space), and wherein a copying garbage collection is run in parallel by several collector threads, the garbage collection consisting in stopping the program threads and flipping the roles of the current area and reserved area before copying into the reserved area the live objects stored in the current area.

Abstract: Disclosed is a method and mechanism for duration-based management of temporary large objects (“LOBs”) in a database system. According to one aspect, temporary LOBs are associated with a duration having a lifespan that corresponds to the lifespan of the temporary LOBs. When the duration ends, the associated temporary LOBs, and any resources allocated to the temporary LOBs, are automatically released. According to another aspect multiple durations of varying, and possibly overlapping lifespans, can exist in the database system. According to yet another aspect, a tree of durations can be created having multiple ancestor and descendant durations.

Abstract: In a distributed method of data gathering, connotative meanings of terms are selected from predefined emotional descriptors organized into a plurality of emotional categories. Respective judges select zero or one emotional descriptors from a given category and rate the term for intensity. Each term is evaluated by a plurality of judges for each emotional category. The results are processed to assure that the selected emotional descriptors were not selected by chance. Retained associations become part of a database of terms, including connotative meanings and related intensity. A self-calibration method is used during intensity evaluation to assure uniformity among intensity ratings. The judges select among anchor terms for each intensity rating in a given emotional category, picking the anchor terms which most accurately reflects the rating level being checked. The completed data base is accessed through a computer interface to implement an electronic language reference tool.

Abstract: Waiting prior to engaging an automated service, for enhancement thereof, is disclosed. In one embodiment, a computer-implemented method first determines an automated service to be performed. The method waits a predetermined time between a minimum time and a maximum time, before performing the automated service. In one embodiment, the method determines the predetermined time by performing a statistical regression as to the predetermined time that should be waited based on a length of a received text.

Abstract: Enhanced content data is supplied in association with a media selection. The enhanced content data is customized responsive to a user profile. The uncustomized enhanced content is stored as a data structure having levels of nodes. Each node within a given level represents an alternative version of a shared enhanced content sub-topic. A processor chooses between nodes within the levels and assembles the chosen nodes to produce the customized enhanced content data.

Abstract: Name Type Value Storage (“NTV”) provides a very flexible technique for storing data for use in the Internet and in World Wide Web based applications. NTV provides a list of values or names, referred to as triplets, that is used to identify a correspondence. In the triplet, NTV provides both an identifier and a name of a type, where a type can be one of several things, e.g. a type can be an integer, a floating point number, a string, an array of any of those values, or an another NTV object. A third part of the triplet is the actual value itself, which is stored in its native type.

Abstract: A method for searching for data in a data network comprising hyperlinked pages comprising the steps of (1) receiving an initial set of network addresses for pages in the data network; (2) receiving a non-negative integer, N, specifying a chain length; (3) receiving a set of at least one search argument comprising search criteria; and (4) performing a search wherein all pages linked to said initial set of addresses by a chain of distance less than or equal to N are examined for compliance with the search criteria, and all pages meeting such criteria are returned as successful objects of the search. According to optional embodiments, the foregoing method can be implemented as a computer readable medium with instructions for performing the above steps, as an application program, or a browser resident at an end user's computer system. It is also possible to implement as a special purpose information handling system.

Abstract: According to the invention, network code (for example, in HTML or XML) corresponding to a displayable portion of network content (such as an Internet Web site) is retrieved into a users' local processing system. A list of identifiers is then stored, by specific user choice, in the local system. Each identifier corresponds to a participating provider. In the user's local processing system, the network code is then parsed and any occurrence in the network code of any identifier stored in the list of identifiers is detected. For each detected identifier, a marker code is then inserted into the network code, the marker code indicating to the user the presence in the network code of each detected identifier. Both the network code and each inserted marker code are then displayed, whereby the presence in the network code of each detected identifier is made visible to the user. The identifiers include network address links and text strings.

Abstract: Internal database validation system comprises a database having a data table and a validation table. The data table has at least one data column and at least one data row and the validation table has a plurality of validation columns and a validation row. Also included is a database engine module for maintaining the database and a database validation module operative to read a validation value from the validation column of the validation row and for using the validation value to validate a data value in the data column of the data row.