849 results about "Multidimensional data" patented technology

The invention discloses a data validation, mirroring and error/erasure correction method for the dispersal and protection of one and two-dimensional data at the micro level for computer, communication and storage systems. Each of 256 possible 8-bit data bytes are mirrored with a unique 8-bit ECC byte. The ECC enables 8-bit burst and 4-bit random error detection plus 2-bit random error correction for each encoded data byte. With the data byte and ECC byte configured into a 4 bit×4 bit codeword array and dispersed in either row, column or both dimensions the method can perform dual 4-bit row and column erasure recovery. It is shown that for each codeword there are 12 possible combinations of row and column elements called couplets capable of mirroring the data byte. These byte level micro-mirrors outperform conventional mirroring in that each byte and its ECC mirror can self-detect and self-correct random errors and can recover all dual erasure combinations over four elements. Encoding at the byte quanta level maximizes application flexibility. Also disclosed are fast encode, decode and reconstruction methods via boolean logic, processor instructions and software table look-up with the intent to run at line and application speeds. The new error control method can augment ARQ algorithms and bring resiliency to system fabrics including routers and links previously limited to the recovery of transient errors. Image storage and storage over arrays of static devices can benefit from the two-dimensional capabilities. Applications with critical data integrity requirements can utilize the method for end-to-end protection and validation. An extra ECC byte per codeword extends both the resiliency and dimensionality.

An interactive visualization of stored data includes a representation of a three-dimensional generally helical path extending between spaced apart ends of the path. Selected parts of the stored data are mapped to corresponding parts of the helical path to facilitate visualization of the stored data. The stored data may include an unbounded dimension (e.g., time) that is mapped along the helical path. One or more user interface elements may be associated with the helical path to effect display of additional information associated with a selected part of the path.

A method and system for performing data analysis where multiple, categorical dimensions and statistical measures are used. The method includes preparing multi-dimensional data into nodes and arranging them logically in the form of a partial-order database. The database may then be traversed by a data-mining tool, or queried in an OLAP manner. Queries are answered through a process of associative partial-order search, which includes optional support for “children-of” requests, and optional support for fuzzy pattern-matching. By aggregating measures on-the-fly, this method is able to preform well without requiring a large number of summary nodes, when taken as a percentage of the total node count.

A system, method, and software product provide for unsupervised identification of complex, nonlinear subspaces in high dimensional data. The system includes a vector quantization module, a weighted topology representing graph module, and an encoding module. The vector quantization module takes vector data inputs and extracts a group of inputs about a number of cluster centers, using a globally optimized clustering process. The weighted topology representing graph module creates a weighted graph of the vector space, using the cluster centers as nodes, weighting edges between nodes as a function of the density of the vectors between the linked nodes. The encoding module uses the weighted graph to recode the input vectors based on their proximity to the cluster centers and the connectedness of the graph. The recoded vectors are reinput into the vector quantization module, and the process repeated until termination, for example at a limited number of cluster centers. Upon termination, the clusters thus identified may be highly nonlinear in the original data space.

An entity-relationship modelling system for modelling a multi-dimensional data source in an entity-relationship model is provided. The entity-relationship system comprises an import module for performing translations on multi-dimensional data, a translation module for translating multi-dimensional data into an entity-relationship schema, and a repository for storing the entity-relationship schema.

The present invention provides an automated data warehousing and OLAP cube building process. The invention allows a person who is not a database query language expert to build validated data warehouses, and OLAP cubes based on such data warehouses.

The invention discloses a method and a system for making multi-dimensional analysis to message class service data. The steps of the invention comprise a data collection step and a data integration step; a data conversion and loading module is responsible for converting the data in a middle database into a relational database with star framework characteristic, settles various data to be analyzed of message class service, classifies the data with common or similar characteristics and brings the data into a unified dimension hierachy; the data in the middle database is further cleaned and converted to be processed into another multi-dimensional database; and a data analysis and presentation step is included. The corresponding system comprises a data collection module which is independently arranged, the data conversion and loading module and a data analysis and presentation module. With the invention, the multi-dimensional data model can be shared in similar value-added service system, the development cycle and cost of the system can be reduced. To apply the function of multi-dimensional data analysis possessed by the system established by the model can provide operators and equipment manufacturers with more flexible and convenient data statistic method and decision support.

Methods and apparatus are described for updating a database using a multi-dimensional data model in which data corresponding to the database are organized in multi-dimensional blocks. Each block has summary information associated therewith corresponding to a current state of evolution of the associated block. Dependency information is maintained in the data model which identifies data dependencies within and among the blocks. Change information is maintained which identifies changes made to particular ones of the blocks and times at which the changes were made. The database is updated with reference to the dependency information, the summary information, and the change information. At least some of the blocks are updated without reference to all dependents thereof. In some implementations, the underlying database may be a relational database, the data from the relational database being mapped to the multi-dimensional data model.

A system and method for generation of URL context queries. A request is received over a network from a user for generation a URL based context query, wherein the request comprises at least one query generation criteria. A multidimensional datapace having a spatial axis, a temporal axis, a topical axis and a social axis is searched for clusters of related data objects using the query generation criteria, wherein at least one cluster of data objects relating to the query generation criteria is identified. Permissions are checked relating to each data object cluster of related data objects. If the user does not have permission to view the data object, it is removed from the cluster. A URL having a context query comprising at least one context criteria is generated from the properties of the cluster of data objects. The URL having a context query is then transmitted to the end user.

A system, method, and a computer program product for caching multi-dimensional data based on an assumption of locality of reference. A user sends a query for data. A described compilation module converts the query into a set of cubelet addresses and canonical addresses. In the described embodiment, if the data corresponding to the cubelet address is found in a data cache, the data cache returns the cubelet, which may contain the requested data and data for "nearby" cells. The data corresponding to the canonical addresses is extracted from the returned cubelet. If the data is not found in a data cache, a fault handler queries a back-end database for the cubelet identified by the cubelet address. This cubelet includes the requested data and data for "nearby" cells. The requested data and the data for "nearby cells" are in the form of values of measure attributes and associated canonical addresses. The returned cubelet is then cached and the data corresponding to the canonical addresses is extracted.

A system is disclosed that allows a multi-dimensional data set to be mined as a single dimension data set so that useful information can be derived from that data set in an efficient manner. In one embodiment, the present invention allows for association rules and/or sequential patterns to be generated from M-dimensional data using a 1-dimensional mining process. In one implementation, one or more conditional items are appended to a data item in order to transform the multi-dimensional data to one-dimensional data.

A method, apparatus, and article of manufacture for improving multi-dimensional restructure performance by selecting a technique to modify a relational database based on a type of restructure. A command is executed in a computer to perform a database operation on a relational database stored on a data store connected to the computer. It is determined that a multi-dimensional database has been modified. Modifications to one or more original tables in a relational database corresponding to the multi-dimensional database are identified. A technique for modifying the relational database to correspond to the multidimensional database is selected based on the identified modifications.

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.

The invention provides a full space-time three-dimensional visualization method. The method includes the following steps: real-time video data collected by a camera are packaged and converted in terms of a format; real-time fixed angle video data are spliced and fused in 3D GIS spatial data, so as to form a panoramic three-dimensional video; an event target of the panoramic three-dimensional video serves as a driving force to realize a camera cooperative pursuit; according to a result by the packet and format conversion, the real-time video data are stored in a storage device to form history video data; and the fixed angle video data are spliced and fused in the 3D GIS spatial data, so as to realize the full space-time three-dimensional visualization display of the history video. In addition, in order to realize video intelligent analysis and realize multidimensional data fusion and three-dimensional visualization display in a full scene, the invention also provides a full scene video intelligent analysis method and a multi-type data full space-time three-dimensional visualization method. The full space-time three-dimensional visualization method provides an effective means for the macro command monitoring, overall correlation, and comprehensive scheduling, and is high in applicability.

A method for maintaining consistent unit relationships during graphical pharmacological computational model construction is disclosed. A graphical user interface is presented through which a user may place and connect objects representing pharmacokinetic and pharmacodynamic elements. The user may specify units definitions for variables and constants using unit expressions. As the objects are converted into an internal format representing the statements of the corresponding computational model, the unit expressions are included in this internal format as multidimensional data type information. This multidimensional data type information is regularly and automatically propagated for each statement in the internal format to identify inconsistent units. When such inconsistent units are identified, a warning message is generated to notify the user, substantially immediately after the inconsistent units are created.

A method of indexing data in a multidimensional database includes creating a multidimensional logical access model, creating a multidimensional data storage model in which data is located in cells that are stored and retrieved in blocks, gathering data access information derived from one or more user queries of the database, and reorganizing one or more selected cells in the multidimensional data storage model based on the data access information to reduce the time taken to access the one or more selected cells in response to a user query of the database. A computerized apparatus in communication with a multidimensional database includes a program to perform the method. A computer readable medium contains instructions to cause a computer to perform the method.

The invention relates to data warehouses and the ability to create and maintain data cubes of multi-dimensional data. More specifically, the invention pertains to data cube architectures that permit significant reduction of storage, exhibit very efficient retrieval and provide a very efficient incremental update of the data cubes.

Methods, systems, and computer-readable medium are provided for constructing multi-dimensional data models for distribution networks. Geometric features are extricated from a 2D representation of a distribution network comprising a plurality of objects having a relationship to each other within a network. Distribution network elements are generated from the geometric elements according to a network distribution model. The distribution network elements comprise objects and components of the network and include semantic information on associated attributes and relationships thereof. The distribution network element(s) can be validated using rules to detect errors in the generation of the distribution network element(s). The distribution networks element(s) can be refined and a multi-dimensional digital model constructed from the distribution network elements according to the distribution network model.

Methods and systems for displaying data retrieved from a multi-dimensional data source via an interactive data diagram. A graphical user interface is responsive to input from a user to retrieve multi-dimensional data for display via an interactive data diagram. The interactive data diagram displays multi-dimensional data in a hierarchical structure that includes a plurality of dimension levels and one or more member levels within each dimension level. A user specifies a change to the display structure by selecting a displayed member level in the hierarchical structure. The interactive data diagram is responsive to the user specified change to generate a drilled down data diagram displaying detailed dimension and member levels related to the selected member level.

Accessing results of calculations on multidimensional data using relational database statements, such as SQL commands, involves a relational database server communicating with a multidimensional database server to cause the multidimensional database server to extract, and to perform calculations on, the multidimensional data. In response to a relational database statement in a language supported by the relational server, which includes an expression of an operation on the multidimensional data in a language supported by the multidimensional server, the multidimensional server extracts the required multidimensional data, performs the requested operation (e.g., an OLAP DML operation) on the data according to the specified expression, and provides results of the multidimensional operation to the relational database server. In one embodiment, the relational server passes information to the multidimensional server that uniquely identifies the location of the particular multidimensional data in the n-dimensional objects.