Abstract: Disclosed is a method and system for computing data security settings in a multi-dimensional system. The method includes receiving a query from a user to access a dataset, retrieving a membership tree of the user and determining a set of minimal branches of the membership tree. A minimal data security setting for the user is determined by computing a sum of products in the set of minimal branches. A data security setting for the user to access the dataset is determined based on the minimal data security setting and finally, the data security setting is embedded in the query to access the dataset.

Abstract: A system and techniques for executing queries of a sparse multidimensional data space in the presence of expressions. A dimension is associated with a set of data references, which reference stored data items. A query expression has dimension or a data reference as an operand. A result space with one or more result dimensions is defined based on the query. A plan is built and executed for retrieving the stored data items associated with the result dimensions, and forming “calculated data items” by evaluating the expression. Executing the plan produces a stream of data tuples, each having a set of data components storing the retrieved data items and/or the calculated data items. Data components are either empty or have data values. An iterative algorithm is employed on the stream to locate the data tuples that are empty at the intersection of each result dimension.

Abstract: A method and apparatus for real time datamining. In one embodiment, the method includes receiving a user request for datamining with respect to a value from a report associated with a specific pyramid level, identifying a datamining function to be performed for statistical analysis of lower level data pertaining to the value from the report, identifying dimensions to be used as variables for the statistical analysis, and determining criteria for selecting the lower level data associated with the value from the report. The method may further include submitting a request to one or more source databases, the request reflecting the identified dimensions and the determined criteria, performing the datamining function on a data set received from the source databases, and creating a datamining report based on a result of the performed datamining function.

Abstract: Particular embodiments store multidimensional block data using a value-bit format. A block of data is determined that includes a first dimension and a second dimension. The occurrences of unique values in the block of data is then determined. If the number of unique values does not violate a threshold, a value-bit format may be used instead of storing the data in a fully-exploded array. In this case, the value for the unique values is stored with an indication of where the unique values occur in the block of data. When a request for a value at an index position in the array is received, the value-bit format is used to retrieve the value requested. A bit that indicates the value that is associated with the index position in the array is determined and that value is returned.

Abstract: A system and method for facilitating data organization, for example in the organization of data in management of intellectual property records, is disclosed herein. Further, the present invention particularly provides a contextualization of information objects so that a full value of research and development (R&D) efforts can be accumulated by an organization. The system as disclosed herein collects information (raw) objects from a plurality of sources. Then, based on inferred context and user input, the system classifies each object in multiple dimensions according to needs of the application; and finally creates a high value, layer rich database embodying a context as well as a result to add value to a research process.

Abstract: The present invention relates to methods for representing multidimensional data. The methods of the present invention are well suited but not limited to the representation of multidimensional data in such a way as to enable the comparison and differentiation of data sets. For example, the invention may be applied to the representation of flow cytometric data. The invention further relates to a program storage device having instructions for controlling a computer system to perform the methods, and to a program storage device containing data structures used in the practice of the methods.

Abstract: A method including receiving a plurality of elements of a data stream, storing a multi-dimensional data structure in a memory, said multi-dimensional data structure storing the plurality of elements as a hierarchy of nodes, each node having a frequency count corresponding to the number of elements stored therein, comparing the frequency count of each node to a threshold value based on a total number of the elements stored in the nodes and identifying each node for which the frequency count is at least as great as the threshold value as a hierarchical heavy hitter (HHH) node and propagating the frequency count of each non-HHH nodes to its corresponding parent nodes.

Abstract: A method for automatic generation of a Neuro-Fuzzy Expert System (Fuzzy Logic Expert System implemented as a Neural Network) from data. The method comprising a Data Interface allowing description of location, type, and structure of the Data. The Interface also allows designation of input attributes and output attributes in the Data Structure; automatic Neuro-Fuzzy Expert System generation driven by the Data; Training of the Expert System's Neural Network on the Data and the presentation of results which include new knowledge embedded in the parameters and structure of the trained Neuro-Fuzzy Expert System to a user.

Abstract: Methods and apparatus for updating a database using a multi-dimensional data model in which data corresponding to the database are organized in multi-dimensional data blocks. Each data block has summary information associated therewith corresponding to a current state of evolution of the associated data block. Dependency information is maintained in the data model which identifies data dependencies within and among the data blocks. A list of change entries identifies changes made to the data blocks and times at which the changes were made. A request to apply a change entry to a data block is received. The change entry is applied to the data block, including generating a dependency list of data blocks whose data depends directly or indirectly from the updated data block. The data blocks in the dependency list are processed in accordance with a dependency update algorithm to update the data blocks in the dependency list.

Abstract: Not all facts in a data warehouse are described by the same set of dimensions. However, there can be associations between the data dimensions and other dimensions. By maintaining a set of relationships that are capable of linking the dimensional keys used in existing data to the keys of an associated dimension, a data transformation can be constructed that summarizes by the original and by the associated dimensions in feeds in an analytical data mart (cube) that includes all the dimensions. This cube can then be consolidated and analyzed in a slice-and-dice fashion as though all the dimensions were independent. Data transformed in this manner can be analyzed alongside data from a source that is keyed by all of the dimensions.

Abstract: OLAP navigation is simplified by optimizing the displayed hierarchies. An OLAP navigation user interface displays the hierarchies that are navigable and can be drilled down into. In this way, a user is shown the items within the OLAP data that may be drilled down into instead of being shown every item. When determining the items to display for navigation, any hierarchies with a single level and/or any attributes that also are used as levels are not shown within the user interface. This helps the user choose the displayed item that will have be most capabilities for OLAP interaction. Navigation of the OLAP data is simplified for the user since the number of items displayed is reduced.

Abstract: A tool for creating a multi-dimensional data structure in order to integrate data from disparate data sources. The tool facilitates the mapping of a new multi-dimensional data structure to one or more disparate data sources and allows the documentation of gaps and methods for bridging those gaps that may be implemented at the disparate data source sites. The tool may also facilitate the creation of mapping files for historical data conversation. The tool may be used in many types of environments across multiple industries including financial and insurance industries.

Abstract: System and method of simultaneously creating and managing a plurality of OLAP cubes in real time, each from a different tabular data source, comprising, for each cube, defining the table columns as either dimensions or measures of the cube using at least one of predefined semantics and data formats, generating the cube using said defined dimensions and measures, updating the cube when the respective data source is modified and deleting the cube according to predefined criteria.

Abstract: Techniques are described for automatically generating a reporting model based on a relational database storing multidimensional data in accordance with a relational database schema. A model generator may, for example, produce a base reporting model from the database schema, and subsequently generate a user reporting model by importing the base reporting model. The model generator updates the user reporting model in response to modifications requested by a user, and maintains an activity log to record the modifications. The model generator regenerates the base reporting model and the user reporting model in the event the database schema changes, and reapplies the modifications from the activity log to the user reporting model to automatically update the user reporting model. The database schema may be a relational star schema as described herein.

Abstract: An apparatus and method for capturing and organizing information spatio-temporally utilizes a standardized time reference and geographical locations to associate a time and a place to each event that is captured. These events are placed in a coordinate system according to the associated times and places. The apparatus and method may use a meridial clock. A series of related events forms an event path that progresses chronologically. Plural event paths are illustrated in a coordinate system based image of a user interface. Events from different event paths are synchronized so that events that occur in a particular moment are placed in the same time plane. As time progresses, the events emit from the plane into a region representing the past, and a relationship of events with their times and places is illustrated. A map in the plane of the image may facilitate visualization of places and times with events.

Abstract: Disclosed is directed to a system and method for presenting mixed media. The system at least comprises location component, time component, and event component. Event component provides specified records or incidents. Location component provides specified places or areas. Time component provides specified time or time intervals. Disclosed embodiments create the multi-dimensional information retrieval, which is useful for user to obtain the relevant location and time while inquiring about a specific interesting event. Disclosed embodiments also present the interaction and relation of multi-dimensional information retrieval.

Abstract: A solution is provided in which regions are formed incrementally as points are added to a database. Each time a point is added to the database, it may be assigned to a new region. This new region may then be compared against each of the current set of regions until one is found with which it can be successfully merged. Then, this newly merged region may be compared against each of the other regions until one is found with which it can be successfully merged. This process repeats until there are no more regions that can be merged. Determining whether or not a region can be merged with another region may involve determining whether or not the points in one region differ from the points in the other region only along one dimension. If so, then the point can be successfully merged with the region.

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 and a system for analyzing a data value of interest in a multidimensional database. The data value of interest is first identified in a structured report. The data source for the structured report is retrieved. A context for the data value of interest in the data source is collected, for example, by extracting a slicer from the structured report, by extracting members of master-detail pages, or by extracting a default measure from the structured report. An analysis specification based on the collected context is then built, and the data value of interest is analyzed using the analysis specification. The result from analyzing the data value of interest may be presented in an analysis view.

Abstract: A business intelligence and data management system is disclosed comprising a database for storing multi-dimensional business data from multiple online educational institutions; a usage tracking engine for recording within a user profile the time and duration of access to disparate system features. A reporting engine provides periodic and custom reports and a benchmarking engine facilitates comparison of internal institution data with aggregate data from multiple institutions, to compare student retention, course completion, student satisfaction, and student performance. The reporting engine provides reports on course retention rates, course evaluations, faculty evaluations, enrollment, student performance, and course run rates. The usage tracking engine, benchmarking engine, and reporting engine facilitate determination of best practices to improve student enrollment, student retention, course completion, student performance, and student satisfaction.

Abstract: The Quantum Matrix system is a multi-dimensional, multi-threaded exchange environment for data organization, management, and manipulation. Data is organized into a multi-dimensional structure of nodes. Nodes may represent data, absence of data, or another set of nodes. The multi-dimensional structure or portions of it can be automatically created from a file system. One or more associations are also defined for the multi-dimensional structure. An association indicates a relationship between a node and another node, data, or a set of nodes. The multi-dimensional structure is then displayed three-dimensionally and navigated. Relational logic, Boolean algebra, or a scripting language can be applied to the nodes, data, and associations to produce a resultant set of nodes. Furthermore, portions of the multi-dimensional structure can be isolated with the use of planes to ease navigation.

Abstract: Techniques are described for automatically selecting default dimensions of multidimensional data for publication. A computer-implemented system, for example, includes a data store having multidimensional data. The multidimensional data includes one or more data cubes having dimensions. The system further includes a publish module for accessing the data store and publishing the multidimensional data associated with the data cubes. The publish module selects a default dimension for publication for each of the data cubes based on attributes of the dimensions.

Abstract: This disclosure describes techniques of validating data that a user enters into an enterprise system for storage within a multidimensional data cube. The data cube includes one or more data hyperplanes associated with members of a dimension having cells that contain data. In addition, the data cube includes a validation rule hyperplane of the dimension. Cells in the validation rule hyperplane contain data that indicate whether data in corresponding cells of the data hyperplanes comply with a validation rule. In accordance with these techniques, data in the cells of the data hyperplanes may be submitted if the data in the cells of the validation results hyperplane indicate that data contained in corresponding cells of the data hyperplanes complies with the validation rule.

Abstract: The present invention describes a method for receiving data within an aggregation facility, precalculating, and fixing a dimension of the data table. The data may be aggregated, wherein at least one data dimension remains flexible. An analytic query may be received that is associated with at least one data dimension. An analytic query may be processed by accessing the aggregated data.

Abstract: A source multidimensional data model is associated with a target multidimensional data model, for purposes of, for example, copying or linking data between the source and the target. Individual dimensions are mapped from the source to the target. Within each mapped dimension, individual dimension members are mapped from the source to the target. The resulting association may be stored and utilized to generate executable statements for copying or linking data between the source and the target.

Abstract: A data processing apparatus includes an input section configured to receive data to be encoded, a first pseudo-random-number generating section configured to generate a first pseudo-random number, a second pseudo-random-number generating section configured to a second pseudo-random number, an address determining section configured to determine matrix address candidate values on the basis of a bit string of the second pseudo-random number generated by the second pseudo-random-number generating section, a matrix generating section configured to generate a matrix in which pixel values based on constituent bit values of the first pseudo-random number generated by the first pseudo-random-number generating section are set at matrix positions designated on the basis of the matrix address candidate values, and an encoding section configured to generate encoded data by executing exclusive OR operations between corresponding positional data in the matrix generated by the matrix generating section and the received data.

Abstract: A method for finding sets of data (SDDs) for presentation in two-dimensions, which are similar to a target SDD, is invented. The method leverages a new category of signatures, called equivalence signatures, to characterize the SDDs. The equivalence signature is computed as the action for the motion of a string which sweeps out a sheet specified by the values of the digital data. These signatures have the salient feature that, at worst, they change in a bounded manner when small changes are made to the SDDs and when used to find SDDs that are similar to a target SDDs, they allow for a significant reduction in the number of SDDs to be compared with the target. This is an improvement over the state of the art wherein the computational expensive process of performing a complete search against the entire corpus must be applied.

Abstract: A method for finding sets of data (SDDs) for presentation in one-dimension, which are similar to a target SDD, is invented. The method leverages a new category of signatures, called equivalence signatures, to characterize the SDDs and is applicable to all types of data with special interpretation for data that may be presented in two-dimensions. These signatures have the salient feature that, at worst, they change in a bounded manner when small changes are made to the SDDs and when used to find SDDs that are similar to a target SDDs, they allow for a significant reduction in the number of SDDs to be compared with the target. This is an improvement over the state of the art wherein the computational expensive process of performing a complete search against the entire corpus must be applied.

Abstract: A method for managing a performance of an organization, comprising a data input step (11) for gathering strategic data concerning the organization, an analysis step (12) for based on the gathered strategic data analyzing strengths and weaknesses of the organization, a strategic planning step (13) for based on the strengths and weaknesses defining at least one strategic objective for the organization, an organization planning step (14) for division of the at least one strategic objective into multiple partial objectives, and a personal planning step (15) for subdivision of the multiple partial objectives into personal objectives for the persons in the organization.

Abstract: An example method to process multi-dimensional data is provided. Example operations include detecting a request to generate a multi-dimensional data structure and determining that the multi-dimensional data structure is to include a multi-dimensional key figure. A first dimension of the key figure may be based primarily on a first characteristic and a second dimension of the key figure may be based primarily on a second characteristic. The method may further include augmenting a set of members associated with the second characteristic with a NULL member and generating a value for each dimension of the key figure. A value of the key figure may be determined by a pair made up from a member of the first characteristic and a member of the second characteristic. The key figure, the first characteristic, and the second characteristic may be then arranged into the requested multi-dimensional data structure.

Abstract: A system and associated computer product improve the search of multidimensional databases. The present system determines a near-optimal grid index that is used to locate a geometric shape in a spatial database. More particularly, the present system improves the technique of sampling data for defining the grid cell size in a grid for a given data set, minimizing the number times the data set needs to be sampled, thereby reducing the time to compute the cost of alternative grid index parameters.

Abstract: The present invention relates to a method and system for evaluating at least one abnormality in one or more medical images of a subject comprising: (a) determining the location of each abnormality from pre-defined selection, (b) determining the pattern of each abnormality from pre-defined selection, (c) accessing a multidimensional database comprising data of patterns, locations, and conditions associated therewith, in which the database comprises data of each of patterns, locations, and conditions is comprised in separate dimension(s), and characteristic information for patterns, locations, and conditions is organised in the database into discrete categories, (d) extracting from the multidimensional database a list of conditions corresponding to the imaging data determined in steps (a) and (b), (e) providing an evaluation of abnormality using list obtained in step (d). The invention also relates to a database, computer program, system for navigating the database, a method for entering data into a database.

Abstract: A non-relational transactional and analytical database is described. It has a novel data architecture that allows data to persist without requiring any schema definition. The database also provides a file system with in-built versioning, reliability and security and can be deployed in a distributed environment. The approach adopted is to break down data into its fundamental atomic components, called memes, and use a special type of graph (utilizing non-standard vertices and edges) to create logical relationships, represented by links, between these components. The database operational functionality is deployed through an application program interface (API). The underlying query language is based on recursive triplets of the form (subject, verb, object) and can be easily augmented with different query parsers, which translate from some source syntax to this syntax. The memes and links may be identified with Universally Unique Identifiers (UUIDs).

Abstract: A database management system (DBMS) for servicing query statements through one or more client machines. The DBMS comprises a query interface adapted to receive query statements from the client machines. The query handling mechanism (i) receives each request from the query interface, (ii) extracts a set of dimensions associated with the request, (iii) uses the dimensions to retrieve aggregated fact data from a multi-dimensional database (MDDB), and (iv) forwards retrieved aggregated fact data to the query processing mechanism for subsequent processing. When the query processing mechanism determines that servicing of one or more query requests require data stored in the relational tables, then the query processing mechanism automatically routes the requests to the relational data tables, so that data can be accessed from the relational tables and forwarded to the query processing mechanism for use in servicing the requests, in a manner transparent to the client machine.