Abstract: The invention provides a system and method of retrieving data associated with a file from a database by a field name into local memory. It comprises calculating an address reference for a storage location in the local memory for the data; fetching the data from the database; and utilizing the address reference to map the data to an address in the local memory. The address reference is an offset value from a base address of the storage location. Several files may be accessed using a cross reference table containing pointers to field tables. Entries in the cross reference table point to a field table. Each field table is a list of fields associated with the file. Each entry in the field table is a calculated offset value providing an address offset of a particular field from the base address of the file.

Abstract: A connection manager 112 manages, for each client, a set of object data (contexts #0, #1, #2, . . . ) subjected to arbitrary processing executed by clients C1, C2, C3, . . . . An entity manager 111 manages, for each context, the relationship between object data constituting the context and entities corresponding to the object data, and the parentage (context tree) between contexts.

Abstract: Disclosed is a method, system, program, and data structure for performing a clean operation on an input table. The input table to clean is indicated in an input data table name. At least one rule definition is processed to clean the input table. Each rule definition indicates a find criteria, a replacement value, and an input data column in the input table. For each rule definition, the input data column is searched for any fields that match the find criteria. The replacement value for the particular rule definition is inserted in the fields in the input data column that match the find criteria. Subsequent applications of additional rule definitions applied to the same input data column operate on replacement values inserted in the input data column during previously applied rule definitions.

Abstract: An image managing apparatus for managing a plurality of image data units includes: an image data acquiring unit for acquiring the image data units; an attribute information acquiring unit for acquiring attribute information units respectively associated with the image data units in such a manner that each attribute information unit corresponds to an associated one of the image data units; an image data classifying unit for classifying the image data units into a plurality of image-data groups based on the attribute information units; a thumbnail image creating unit for creating thumbnail image data units in order to display the image data units as thumbnail images; and a display unit for displaying the thumbnail images for each image-data group.

Abstract: Embodiments of the present invention generally provide a system, method and article of manufacture for managing federated queries. In general, the availability of one or more databases targeted by a federated query may be determined prior to running the federated query against the targeted databases. In response to determining one or more of the targeted databases are unavailable, a user may be notified. The user may also be presented with options for running the federated query. The options may include being notified when all of the targeted databases are available, automatically running the federated query (in the background) when all of the targeted databases are available, and modifying the query to run against currently available databases.

Abstract: A system and a method for managing user and data profiles utilizing a web-enabled interactive database to organize, store and retrieve the information to create a consistent security model through centralized administration, are disclosed. The system captures various rules and pre-determined methodologies to provide on-line, up-to-date decisions to the users when users request access to a set of specific data or an application. The system further provides the capability to the user to request access to information that the user currently does not have access to, tracks the status of the request, obtains approval/disapproval decision from the data owner, implements the decision, and notifies requester within a reasonable time.

Abstract: A method of storing data in a database organizes the data in electronic objects and enriches the objects with ‘cognitive elements’. These elements allow a search of objects in the database which is similar to the human thinking process. One or more cognitive elements may be selected, leading to a list of objects with a relevance score based on the number of cognitive elements found for each object in the list. Computer programs allow to create such a database, to retrieve information from it, and to view information contained in it.

Abstract: A system and methods for the automatic transmission of new, high affinity media to a user are provided. In connection with a system that convergently merges perceptual and digital signal processing analysis of media entities for purposes of classifying the media entities, various means are provided to a user for automatically extracting media entities that represent a high (or low) affinity state/space for the user in connection with the generation of a high affinity playlist, channel or station. Techniques for providing a dynamic recommendation engine and techniques for rating media entities are also included are also included. Once a high affinity state/space is identified, the high affinity state/space may be persisted for the user from experience to experience.

Abstract: A decision tree clustering procedure is provided which employs a unified approach to extracting both the decision tree and (preferably fuzzy) clusters. The decision tree is built by subsequent clustering of single dimensions or features, and the choice of the winning separation is based on cluster validity. In one embodiment, the clustering employs a fuzzy c-means (FCM) model and the partition coefficient (PC) to determine the selected separations.

Abstract: An architecture and implementation of a dynamic RMI server configuration hierarchy to support federated search and update across heterogeneous datastores. The RMI server configuration hierarchy supports searching for data in one or more heterogeneous data sources within a computer system. A request for data is received at a federated data source. Then, a server is selected to process the request based on a load of the server and based on whether the server can satisfy the request for data.

Abstract: A method of providing directed search for a web site address identified via a media channel and a method for creating a database for such directed search are disclosed. A database is created by providing each information provider a plurality of identifier categories, and allowing each information provider to store on the database at least one identifier per applicable category that is associated with the identification of the web site address. A user may search the database and only retrieves a search response by inputting at least one of the identifiers already stored on the database.

Abstract: A data representation and retrieval method and apparatus enables to quickly locate and extract specified data from a data file with use of supplemental data stored in a small storage file. The method includes the steps of providing a primary data file which stores a large volume of recorded data where a location of each piece of recorded data is represented by an offset value, providing a secondary data file which stores supplemental data for assisting to search and retrieve the recorded data from the primary data file, accessing the secondary data file to retrieve supplemental data corresponding to search data specified by a user, and accessing the primary data file at locations specified by offset values derived from the supplemental data and retrieving the recorded data therefrom.

Abstract: A base table and related auxiliary table spaces are reorganized concurrently via a database utility. The database utility determines which auxiliary tables are related to the base table and automatically includes their respective auxiliary table in the same invocation of the utility. The reorganization is performed via allocated shadow data sets. The original data sets are switched with the newly built shadow data sets including the LOB shadows.

Abstract: A dynamic database management system includes a data dictionary, a data importer and a query front-end. The data importer automatically imports data from an input file into a database, while adding new tables for new attributes as necessary, and updating parameters and folders tables in the data dictionary accordingly, so that end-users may access the imported data by database queries through the query front-end.

Abstract: A method and apparatus for a fault tolerant network element is described. In one embodiment of the invention, a computer implemented method comprises storing an operation and executing the operation idempotently with a network resource process.

Abstract: The present invention provides a computer implemented collaboration system and method for accessing multiple domain data sources and allowing data from those sources to be analyzed and manipulated within a multi-user distributed environment where all visualization, processing, and agent applications work collaboratively. In one embodiment, the collaboration system (10) is organized into an N-tier infrastructure including a data management tier (50), an information access tier (52), a services tier (54), and a user interface tier (56). The infrastructure of the collaboration system (10) rides upon a CORBA communications framework. The data management tier (50) includes data sources (112) and provides data management capabilities normally supplied by database management systems.

Abstract: A system, method, and computer program product are provided for automatically linking items with multiple attributes to multiple levels of folders within a content management system. The present system extends automatic linking to support multiple levels of folders and multiple attributes. One feature of the present system is to supplement the implementation of the automatic linking plan without user involvement so that the user is not required to know the rules for creating or nesting folders. A system defined attribute is used to indicate that the folder item was created by the present system. In addition, the present system automatically moves an item from one folder to another when the item is changed to a different type if the item was first added to the folder by the present system. When an item's attributes are changed or the item is redefined as a different type, the item is re-indexed.

Abstract: Euclidean analysis is used to define queries in terms of a multi-axis query space where each of the keywords T1, T2, . . . Ti, . . . Tn is assigned an axis in that space. Sets of test queries St for each one from one of a plurality of server sources, are plotted in the query space. Clusters of the search terms are identified based on the proximity of the plotted query vectors to one another. Predominant servers are identified for each of the clusters. When a search query Ss is received, the location of its vector is determined and the servers accessed by the search query Ss are those that are predominant in the cluster which its vector may fall or is in closest proximity to.

Abstract: An apparatus and method for managing data on a storage device. In one embodiment, the apparatus is embodied in computer readable program code and comprises a management interface. The apparatus and method may identify and categorize data on the storage device. In one embodiment, the data is checked against one or more thresholds on a programmed and periodic basis. When one or more of the thresholds are satisfied, the user is alerted, and at least a portion of the data may be reallocated based on the category thereof.

Abstract: Machine automated techniques are described for a method of data processing called Relationships Processing. A computing system is disclosed which provides for the high speed recording and extraction of data objects (entities) and for the development of data representing a queried relationship between the entities. Furthermore, methods and systems are disclosed to detect mandatory relations violation between entities by examining whether certain relations exist. The system is expandable to handle the relatively voluminous data bases of large commercial data repositories. A user defines a set of entities and allowed relationships between the entities. The user can expand this set of allowed entities and relationships at any time during the life of the system without reprogramming or compiling of computer program code or disrupting concurrent operational use of the system. Large systems can now be built that are no longer limited to the scope of design requirements known during initial system development.