Abstract: Disclosed is a method for determining database queries to be sent by an analytical server to a Relational Dababase Monitoring System (RDBMS) by using hierarchical level metadata to describe the various structures within the database.

Abstract: The present invention introduces the concept of a super-trigger to allow for multi-level hierarchical triggers in a database application. The super-trigger may be created by identifying one or more triggers as sub-triggers, and defining a condition in the super-trigger, the result of the condition depending from a result of one or more of the sub-triggers. Upon execution, information may be retrieved regarding a result for each of the sub-triggers. The condition may then be evaluated using these results, and an action may be performed if the condition is met.

Abstract: A solution is provided wherein the apparent dimensionality of a data set is reduced by ranking combinations of dimensions and parts of dimensions in terms of their suitability for mapping to the axes of a grid display. A user may then be presented with dense lower dimensional views of the data that are much easier to understand than sparse high dimensional views. The user may then make further refinements, groupings, and analyses as needed.

Abstract: A method of operating a multi-dimensional database is disclosed. In this method, a multi-dimensional portion of the data is transferred to a multi-dimensional database. A relational portion of the cube is kept in the relational database. When data from the relational portion needs to be accessed, the system produces the SQL queries to obtain data from the relational database.

Abstract: A solution is provided wherein multiple instances of source data measures are displayed in individual cells by utilizing a slicing mechanism that allows the user to select a range of values for certain dimensions known as slicers. The source data measures to be displayed in a cell may then be filtered using these ranges of values for the slicers, and then displayed inside the cell.

Abstract: Selection of certain views of a multidimensional database to materialize may be accomplished using an efficient and effective solution. A set of all potential views may be stored in a structure. A path in the structure may then be traversed in an indicated direction through the structure, the path including two or more potential views and beginning at an indicated view. Then two or more immaterialized views in the path may be compared to each other to determine which immaterialized view is the optimum choice for maximizing benefit if selected to be materialized. Then the traversing and comparing may be continually iterated through, each iteration utilizing an indicated direction different than the last, each iteration also utilizing an indicated view set at the optimum choice determined by the last iteration, the iterating continuing until it converges on a single view. That single view may then be selected for materialization.

Abstract: The cost of running a query (having a query range) on a multidimensional database may be estimated using a process factors criteria beyond merely the number of affected records. First, a materialized view of the database may be represented as a container of tuples, sorted by key. Then keys may be stepped through, each key representing a mapping of a combination of tuples from the container. At each step, the process may request the next smallest key in the query range greater than or equal to the key of the current step, which results in the tuple in the database whose key is the smallest, greater than or equal to the requested key, and determine if the resulting tuple is in the query range. The cost of the query may then be estimated as the number of tuples upon which the range check was performed.

Abstract: A multi-dimensional database query to be sent to a data source may be split into multiple smaller queries by a mid-tier solution and sent individually to the data source(s) for calculation and retrieval of data. This may be accomplished by creating row and column tree structures representing title and header rows and header columns in the query grid. The operation to be performed by the query may then be performed on these tree structures. The grid may then be split based on the resulting tree structures, and forwarded independently to one or more data servers. The results may be merged to generate the complete result or cursored. This allows the system to pass multiple smaller grids to data servers.

Abstract: A method and apparatus for processing jobs on an enterprise-wide computer system. The computer system uses a portal architecture to allow a user to view a wide variety of content retrieved from a variety of different computer systems. The computer system is configured such that a plurality of users can access the system at the same time through a computer network such as the Internet. Users may access the computer system by using a standardized browser program, thus simplifying the user interface. The computer system may also be connected to one or more back-end databases that correspond to the different computer systems within the enterprise. The computer system is configured to run predefined jobs to process data. These jobs can perform a variety of tasks such as retrieving data from a back-end database, preparing a report based upon retrieved data, processing data already resident within the portal system, or notifying a user when a particular condition occurs within the portal system.

Abstract: Sampling may be supported in a multidimensional database by integrating it into metadata and/or data navigation requests. Additionally, biasing may be introduced to allow a user to focus results.

Abstract: Embodiments of the present invention provide systems and methods of managing hierarchical reference data. According to one embodiment of the present invention, a hierarchical data management program can maintain a master set of reference data corresponding to the reference data being managed. From the master set of reference data, the hierarchy management program can instantiate centralized hierarchies, validate changes to the centralized hierarchies and enforce business rules with respect to the centralized hierarchies. The hierarchy management program can publish the centralized hierarchies to subscribing systems for use by the subscribing systems in managing data of interest.

Abstract: A solution may be provided in which a cache may assign a version to each object that it caches. The version may be saved in a database along with the object. Each time the business logic accesses the cache for a dependent object, such as a read from the bit mask field of the new parent member, the version of the object checked in the cache and its identification may be saved on a dependency list. Once changes to the object are performed, the business logic may issue a commit command. The cache may then verify that the version of each object on the dependency list matches the version that is in the database. If an object on the dependency list either does not exist in the database, or exists with another version, then the transaction may be canceled.

Abstract: A method and apparatus for processing jobs on an enterprise-wide computer system. The computer system uses a portal architecture to allow a user to view a wide variety of content retrieved from a variety of different computer systems. The computer system is configured such that a plurality of users can access the system at the same time through a computer network such as the Internet. Users may access the computer system by using a standardized browser program, thus simplifying the user interface. The computer system may also be connected to one or more back-end databases that correspond to the different computer systems within the enterprise. The computer system is configured to run predefined jobs to process data. These jobs can perform a variety of tasks such as retrieving data from a back-end database, preparing a report based upon retrieved data, processing data already resident within the portal system, or notifying a user when a particular condition occurs within the portal system.

Abstract: Disclosed is a system, method, and apparatus for calculating metrics by using hierarchical level metadata to describe the various structures within the database. The hierarchical level metadata permit calculation of complex metrics by an analytical server which would otherwise be difficult or impossible. As a result of the way that the analytical server calculates the metrics, slicing and drilling are supported. Additionally, dimension and fact level security are also supported.

Abstract: Disclosed is a system, method, and apparatus for calculating metrics by using hierarchical level metadata to describe the various structures within the database. The hierarchical level metadata permit calculation of complex metrics by an analytical server which would otherwise be difficult or impossible. As a result of the way that the analytical server calculates the metrics, slicing and drilling are supported. Additionally, dimension and fact level security are also supported.

Abstract: Disclosed is a system, method, and apparatus for calculating metrics by using hierarchical level metadata to describe the various structures within the database. The hierarchical level metadata permit calculation of complex metrics by an analytical server which would otherwise be difficult or impossible. As a result of the way that the analytical server calculates the metrics, slicing and drilling are supported. Additionally, dimension and fact level security are also supported.

Abstract: Disclosed is a method for determining database queries to be sent by an analytical server to a Relational Database Monitoring System (RDBMS) by using hierarchical level metadata to describe the various structures within the database.

Abstract: A method of operating a multi-dimensional database is disclosed. In this method, a multi-dimensional portion of the data is transferred to a multi-dimensional database. A relational portion of the cube is kept in the relational database. When data from the relational portion needs to be accessed, the system produces the SQL queries to obtain data from the relational database.

Abstract: A framework is provided that enables data mining algorithms to be plugged into it without any change to algorithm software implementations, while still providing all the standard data mining tasks. It may be implemented by the data source provider. It also then allows for the complete separation of data storage and algorithms. When the user initiates a mining session and picks an algorithm for build task or a model for an apply or test task, the framework may become responsible for preparing a set of “prompts” to the user asking him to provide some expression which is specific to the particular kind of data the user is working with.

Abstract: A database manager and a corresponding method for having a database manager extract information from a relational database having, e.g., a star configuration (i.e. having a hub table and related so-called dimension tables) in response to what is called a joining query (one that would require that dimension tables be joined to the hub table), and, in addition, a query according to the invention. The method includes the steps of: having the database manager provide an alias table for a field from at least one dimension table that would be joined to the hub table according to the joining query, the alias table including each value of the field occurring in the dimension table (the aliased field) and also including an alias for each value of the aliased field; and having the database manager transform the joining query into a reduced query in which the aliased field is replaced by the alias.