Abstract: A data warehouse is constructed using the relational mapping of a transactional database without reconstructing the data relationships of the transactional database. First, an application programmer analyzes an object model in order to describe facts and dimensions using the objects, attributes, and paths of the object model. Each of the dimensions has an identifier that correlates an item in the transactional database to a dimension record in the data warehouse. The fact and dimension descriptions are saved to a description file. Second, a Data Warehouse Engine (DWE) then access the description file and uses the object model, fact and dimension descriptions, and object-relational mapping to map transactional data to the data warehouse.

Abstract: A data warehouse is constructed using the relational mapping of a transactional database without reconstructing the data relationships of the transactional database. First, an application programmer analyzes an object model in order to describe facts and dimensions using the objects, attributes, and paths of the object model. Each of the dimensions has an identifier that correlates an item in the transactional database to a dimension record in the data warehouse. The fact and dimension descriptions are saved to a description file. Second, a Data Warehouse Engine (DWE) then access the description file and uses the object model, fact and dimension descriptions, and object-relational mapping to map transactional data to the data warehouse.

Abstract: The present invention is directed to a method and system for applying ratings to digital music and for playing back digital music conforming to a rating level. A method for playing back digital music conforming to a rating level, includes: sending a request for metadata from a music player to a metadata service; receiving metadata sent back from the metadata service in response to the request, the metadata comprising information regarding at least one explicit interval of the track; playing the track on the music player; and selectively applying an edit to each explicit interval of the playing track identified in the metadata, based on a predetermined rating level.

Abstract: Resources are typically stored in homogenous data structures by shredding resource data into database tables destroying a native format of the resources. Typical approaches to indexing the resources rely on users indicating properties that should be indexed, using full text searches to create resource index documents, and other such labor and computation intensive processes. Functionality can be implemented to dynamically generate the resource index documents based on resource properties with minimal user input. The resource index documents can be in a common format to facilitate access to resources stored in heterogeneous native resource formats.

Abstract: Resources are typically stored in homogenous data structures by shredding resource data into database tables destroying a native format of the resources. Typical approaches to indexing the resources rely on users indicating properties that should be indexed, using full text searches to create resource index documents, and other such labor and computation intensive processes. Functionality can be implemented to dynamically generate the resource index documents based on resource properties with minimal user input. The resource index documents can be in a_common format to facilitate access to resources stored in heterogeneous native resource formats.

Abstract: The present invention is directed to an improved mapping system and code generation system. Embodiments of the present invention separate the mapping of data elements into two metalevels. The first metalevel maps between types of elements (e.g., string, int, float, varchar, etc.). This first metalevel mapping is associated with an object that contains a method (i.e., a function) which performs the conversion between the type of the element from a first data structure to the type of element in a second data structure. The second metalevel describes the actual mapping between the data elements at issue. Accordingly, the second metalevel results in an instance of the first metalevel object. Source code or scripts generated in accordance with this separation provide numerous advantages including improved flexibility, reduced storage space usage and others. The two metalevel modeling of the invention can be embodied in source code (or script) generators to generate more efficient source code (or scripts).

Abstract: Embodiments of the present invention address deficiencies of the art in respect to cut and paste object processing for instant messaging and provide a method, system and computer program product for clipboard object sharing for instant messaging. In an embodiment of the invention, a method for clipboard object sharing in an instant messaging session can include requesting transfer of a clipboard object from a source instant messaging client to a target instant messaging client in an instant messaging session, determining whether or not the target instant messaging client supports a format of the clipboard object, and transferring the clipboard object to the target instant messaging client only if the target instant messaging client supports the format of the clipboard object.

Abstract: The present invention is directed to a method and system for applying ratings to digital music and for playing back digital music conforming to a rating level. A method for playing back digital music conforming to a rating level, includes: sending a request for metadata from a music player to a metadata service; receiving metadata sent back from the metadata service in response to the request, the metadata comprising information regarding at least one explicit interval of the track; playing the track on the music player; and selectively applying an edit to each explicit interval of the playing track identified in the metadata, based on a predetermined rating level.

Abstract: Mapping information that describes the mapping of referenced projects to their container project is included in the container project, using a “module mapping” file. A module mapping file is a simple meta-data file, for use at development time only, which stores data that maps relative URIs to IDE project names. The module mapping file contains entries for the location of nested archives, relative to the virtual archive defined by the container project, mapped to the uniquely named referenced project within the IDE. The paths of the archive files are computed “on the fly” just before the application server is started, rather than being simply written into an extensions file, located within the container project, in a fixed form when the enterprise application is written/developed.

Abstract: A way to define an access control that scales to component architectures. Specifically, the present invention allows annotations to be added to objects, for example in the javadoc section of a Java object, to restrict access to that object. Each annotation comprises a tag that specifies a designated privilege and one or more designees to which the privilege applies. The annotations may designate access options such as which packages, classes, interfaces, fields and/or operations may be visible to another package, class, interface, field and/or operation; which classes are allowed to implement a particular interface; which classes are allowed to instantiate a particular class; and/or which classes/interfaces are allowed to extend a particular class/interface. The annotation may refer to allowed objects directly, may refer to a group of classes having similar names, and/or may use an alias, which refers to an external object designation.

Abstract: Application configurations, including applications themselves, application components, and modules associated with the application are installed on an application-server machine and stored in system-determined locations. These locations, or absolute paths, are then stored in a “loose configuration”. As new versions of applications, components, and/or modules are installed, they are placed in unique locations and given unique version numbers. A record of each application configuration version is stored and is referred to as “snapshots”. These snapshots provide a record of and pointers to the various elements that make up the various application configuration versions, so that at any time, a current version of an application configuration can be “rolled back” to a previous version of an application configuration. The methodology can be utilized to provide a self-healing configuration, whereby a faulty version of an application configuration can be rolled back to a previous version automatically.

Abstract: Methods, systems, and computer program products for programmatically enforcing referential integrity constraints defined for classes of an arbitrary modeling framework (such as the Meta Object Facility, or “MOF”) when associations among class instances are modified. The present invention relieves the application programmer of the burden of writing code to maintain the links between instances, and applications are therefore considerably easier to write and to maintain, and programmatically maintains inverse links. This reduces the amount of data to be serialized, as the other link can be automatically resolved at the time the inverse link is reconstituted, and also helps in maintaining referential integrity among serialized instances (e.g. where associations are specified in one or more XML Metadata Interchange, or “XML”, documents) because redundant information about the values of the same association will not have to be written across different documents or storage repositories.

Abstract: Application configurations, including applications themselves, application components, and modules associated with the application are installed on an application-server machine and stored in system-determined locations. These locations, or absolute paths, are then stored in a “loose configuration”. As new versions of applications, components, and/or modules are installed, they are placed in unique locations and given unique version numbers. A record of each application configuration version are stored and are referred to as “snapshots”. These snapshots provide a record of and pointers to the various elements that make up the various application configuration versions, so that at any time, a current version of an application configuration can be “rolled back” to a previous version of an application configuration.

Abstract: Mapping information that describes the mapping of referenced projects to their container project is included in the container project, using a “module mapping” file. A module mapping file is a simple meta-data file, for use at development time only, which stores data that maps relative URIs to IDE project names. The module mapping file contains entries for the location of nested archives, relative to the virtual archive defined by the container project, mapped to the uniquely named referenced project within the IDE. The paths of the archive files are computed “on the fly” just before the application server is started, rather than being simply written into an extensions file, located within the container project, in a fixed form when the enterprise application is written/developed.

Abstract: The present invention is directed to an improved mapping system and code generation system. Embodiments of the present invention separate the mapping of data elements into two metalevels. The first metalevel maps between types of elements (e.g., string, int, float, varchar, etc.). This first metalevel mapping is associated with an object that contains a method (i.e., a function) which performs the conversion between the type of the element from a first data structure to the type of element in a second data structure. The second metalevel describes the actual mapping between the data elements at issue. Accordingly, the second metalevel results in an instance of the first metalevel object. Source code or scripts generated in accordance with this separation provide numerous advantages including improved flexibility, reduced storage space usage and others. The two metalevel modeling of the invention can be embodied in source code (or script) generators to generate more efficient source code (or scripts).

Abstract: Methods, systems, and computer program products for programmatically enforcing referential integrity constraints defined for classes of an arbitrary modeling framework (such as the Meta Object Facility, or “MOF”) when associations among class instances are modified. The present invention relieves the application programmer of the burden of writing code to maintain the links between instances, and applications are therefore considerably easier to write and to maintain, and programmatically maintains inverse links. This reduces the amount of data to be serialized, as the other link can be automatically resolved at the time the inverse link is reconstituted, and also helps in maintaining referential integrity among serialized instances (e.g. where associations are specified in one or more XML Metadata Interchange, or “XML”, documents) because redundant information about the values of the same association will not have to be written across different documents or storage repositories.