Abstract: Some embodiments include determination and storage of a plurality of relational database tables based on class model representing tag-based data and non-tag-based data and on a plurality of objects instantiated based on the class model. Also included are reception of a selection of one object of the objects as a dimension of a logical model, reception of a first indication of a first plurality of members of the selected object to be associated with dimension data of the logical model, reception of a second indication of a second plurality of members of the selected object to be associated with fact data of the logical model, to create a dimension table associated with the selected object and including columns corresponding to the first plurality of members, and creation of a fact table including a foreign key column corresponding to the dimension table and including a column corresponding to each of the second plurality of members.

Abstract: The present invention relates to a method for generating an estimated value of a car, comprising the steps of receiving a user query specifying at least the type of a car; providing a database which comprises datasets having a car specification dataset specifying at least the type of the car and a car value field assigned to the respective car specification dataset representing the reference value of the car specified in the car specification dataset; searching in the database to find one or more datasets matching the user query; and calculating the estimated value of the car using the car value fields of the found datasets.

Abstract: A system and method is provided whereby, in one aspect, advertisements are displayed based on search terms that were selected based on the angle at which a user is viewing a street level image.

Abstract: According to an exemplary embodiment of the present invention, a method to configure a network of classifiers includes configuring a plurality of classifiers in a network of classifiers, such that the configuring associates a plurality of operating points with each output branch, associating a different quality profile with each output point for each output branch in the plurality of classifiers, and storing the configured network of classifiers and quality profile associations in the computer system to be used for classifying future input data according to the network configuration and quality profile association. Each classifier comprises executable code that classifies the data. Each of said classifiers has a plurality of the output branches that each output the data to another classifier. Each operating point comprises a probability of determining that a data item input to the classifier has a particular characteristic and a probability that said determination falsely detected the characteristic.

Abstract: A system and method of characterizing the status of a complex system provide for determining a combined status level of a pair of related objects in an architecture, wherein one of the pair of related objects is a destination object and another of the pair of related objects is a source object. The combined status level determination can be cascaded through the architecture toward a front-end object corresponding to the pair of related objects to obtain a set of combined status levels. A status output may also be generated based on the set of combined status levels.

Abstract: Clustering related objects in a region-based garbage collector is solved by associating one or more regions with each cluster, and allocating objects from a region belonging to the primary cluster for the object. Relatedness may refer to, e.g., proximity to a cluster center (such as topic) in a persistent knowledge base or a home node in a distributed object system. The cluster for an object may be determined, e.g., from reachability from particular roots or objects during global tracing. For new objects, the initial cluster may be guessed based on history of where objects allocated in that call site have recently been clustered (possibly several stack frames deep).

Abstract: Mechanisms are provided for mapping objects and object-relationships in an object-oriented programming language to a nested relational database. Entity metadata constructs for an object relational mapping framework are obtained, the entity metadata constructs mapping fields in entities of an object model to fields in a data table of the nested relational database and identifying relationships between entities in the object model. A nested relational data model of the nested relational database is obtained, the nested relational data model specifying tables and sub-tables of the nested relational database. Tables and sub-tables of the nested relational database are mapped to a plurality of separate entities of the object model. Data in the nested relational database is accessed using the plurality of separate entities. The mapping is performed without normalizing the data of the tables and sub-tables of the nested relational database to a non-nested representation.

Abstract: Methods, devices and systems which facilitate the conversion of database objects from one schema version (e.g., an earlier version) to another schema version (e.g., a newer version) without requiring the objects be unloaded and reloaded are described. In general, data object conversion applies to both table space objects and index space objects. The described transformation techniques may be used to convert any object whose schema changes occur at the page-level.

Abstract: A system may include a database of physical data tables, a logical database schema of logical entities associated with the physical data tables, and an abstraction layer comprising a plurality of dimension objects mapped to the logical entities, at least one of the plurality of dimension objects comprising one or more properties associating the at least one of the plurality of dimension objects to one or more others of the plurality of dimension objects.

Abstract: Described is a technology, such as for representing scientific data and information, in which a database table contains rows of type data representing types, and term data representing terms that inhabit the types. Types include composite types (e.g., that represent entities), and instances of relation types that express relationships between types, between a type and a term, or between terms. Types and/or terms may have multiple relationships with one another, and a relationship may span database tables. A new relationship may be established by adding a new row to the database table to represent a new relation term, along with one or more similar rows to represent the relation role terms associated with that relation term; relationships may be removed by removing rows. As a result, the database table may change its state rapidly, without needing to change the database schema.

Abstract: According to particular embodiments, a communications monitoring system includes agent servers that deploy automated agents into various group communications services and a central server that receives the event data collected by the automated agents using the unified communications protocol. The central server also transmits the event data and any alerts that were determined from the event data to operator interfaces according to operator profiles.

Abstract: Aspects of the subject matter described herein relate to configuring file shares. In aspects, a template is created that includes policies to apply to one or more shares. The template may derive or otherwise obtain policies from other templates and may also refer to other templates. The template may include opaque data to pass to a subsystem that configures a share with a policy corresponding to the data. After the template is created, the template may then be applied to one or more shares to configure the shares according to policies included in the template. When the template or any template upon which the template depends or to which the template refers is changed, shares associated with the template may also be automatically changed as appropriate.

Abstract: In an embodiment of the present invention, a method for playing media items on a home network device in a home network is provided, the method comprising: retrieving, from a content directory service in the home network, a first object in a series of objects representing a first list in which the first object is a member, wherein the first object contains metadata regarding a first media item, a link to a next object in the first list, and relationship information regarding members of the first list, wherein the relationship information includes information about how members of the first list are related, wherein the next object contains metadata regarding a second media item; and playing the first media item.

Abstract: Methods, systems and articles of manufacture are provided for migrating entity relationship data residing in an object oriented program environment to a relational database schema. Further, functionality is provided to facilitate more efficient searching and reconstruction of the entity relationship data in the relational database.

Abstract: Techniques are provided which enable relaxed transactional isolation and optimistic concurrency control in a distributed client-server architecture, and which address the problems of server overloading and network delays known to exist in conventional distributed client-server architectures. In particular, the invention preferably provides client-side caching techniques which advantageously serve to reduce server overloading and effects of network delay.

Abstract: An apparatus and method for referencing physical location of data objects stored within a logical container. The method may include receiving an access request from a client for a particular data object stored in a logical container having a plurality of data objects stored collectively in the logical container, and referencing a physical location of the particular data object within the logical container in response to the access request. The logical container includes at least one block, and each block of the logical container includes multiple extents to store data from at least one data object. The block is a fundamental unit of storage space.

Abstract: Provided are a method, system, program, and data structure for controlling access to a sensitive function in a class. A friend object is generated indicating at least one external function from at least one external class external to the class including the sensitive function. A call from a calling function in a class external to the class including the sensitive function is processed and the calling function is permitted access to the sensitive function in response to determining that the friend object indicates that the calling function can access the sensitive function.

Abstract: A system and method for common storage object model is provided. In one aspect, one or more classes representing respective one or more storage devices are provided. One or more plugin modules are operable to discover and provision one or more storage devices connected to a storage network using the one or more classes. A wrapper module is operable to handle selecting and loading of the one or more plugin modules.

Abstract: A cache coherency maintenance system and method of a user file manager in an object-based storage system are provided. According to the cache coherence maintenance system and method, by maintaining the coherency of a writeback cache based on time using a timer, metadata and data information are efficiently managed. Accordingly, even when accesses by users increase, the cost of maintaining the coherency of the cache is distributed to respective user file managers. In this way the performance of the entire object-based storage system is enhanced and the consistency and efficiency of information increase.

Abstract: A method for creating a data warehousing scheme having optimally selected components. A mathematical model of a goal for the data warehousing scheme is input into an optimization engine. At least one constraint on the data warehousing scheme is input into the optimization engine. A mathematical optimization algorithm is performed using the optimization engine, wherein an output of the optimization engine is an optimized data warehousing scheme having optimally selected components. The optimized data warehousing scheme can be stored.

Abstract: Methods, systems and apparatus for implementing behavior of a user defined type (UDT) in a database by providing a data table with multiple rows and generating a UDT table having only a single row. An instance of a UDT is created and stored in the single row of the UDT table. A query having a Cartesian product is implemented to join the UDT table and data table for invoking behavior of the UDT and generating a resultant data table without increasing cardinality thereof. The single instance of the UDT may be shared amongst several users of the database as a result of all required persisted objects of the UDT residing within only a single row of the UDT table.

Abstract: A computer system and a relational database management system (RDMS) computer program product are described for interfacing a number of concurrently running database sessions with a large database in which a plurality of local temporary object database descriptors are used in lieu of a single global temporary object database descriptor where the global and each of the local temporary object database descriptors include identifiers for temporary objects, each of the local temporary object database descriptors is associated with a single database session and each of the global database descriptors is shared among multiple database sessions.

Abstract: Apparatus, system, method and computer-readable media for organizing a listing of key pairs to increase the likelihood that key pairs more likely to satisfy database queries will be examined in the course of the query execution before key pairs that are less likely to satisfy a database query.

Abstract: The present invention provides system, methods, and apparatus for organizing objects obtained from data retrieval. It provides a method to assemble the objects into a set based upon their relevance ranking, associated metadata including categories, and the proximity of these categories in a graph. The method provides for selecting objects according to estimated difficulty, resource type, media format, or other criteria. It also provides for connecting objects into a best path in the graph. It also provides for selecting objects to fit a desired total duration and coverage of relevant categories in the graph. It also provides for organizing the objects into a particular sequence according to the particular metadata. The system, methods, and apparatus are suitable for use in information systems, learning management systems, and other systems employing data retrieval.

Abstract: A database management protocol exchanges update tokens between a client and a server on which the database resides. When a client requests data to be read from a database, an update manager either reads an update token stored therein or generates one dynamically. The update token represents a current state of the data object being read. Sometime thereafter, if the client requests new data to be stored in the object, the client may furnish the update token back to the update manager. The update manager compares the client's update token to a local update token representing a current state of the database and, if they match, determines that the state has not changed. If they do not match, an error results.