支持非覆盖维的扩展多维数据模型

非覆盖维等复杂结构维的处理一直都是数据仓库领域的难题,本文在详细分析非覆盖维特性的基础上,提出了一个扩展的多维数据模型,改变了传统的级别间的映射关系的定义方式,定义了从父级别到子级别分区的映射关系,从而实现了对非覆盖维和非平衡维的支持,并能够完整地表达各种复杂维层次结构语义.同时,基于DAG图描述的维层次结构,定义了基于该多维模型的立方体代数和OLAP操作.将多维数据库概念模型中的维与度量的转换操作引入到OLAP操作集合中,使其支持复杂维的转化操作,进而丰富和增强基于该模型的OLAP系统的分析能力.     

数据仓库的多维数据模型研究

作为数据仓库设计的核心和基础,数据模型的研究直接影响到决策支持技术的发展。该文首先在对OLAP的需要分析基础上,提出了研究数据模型应该满足的六点约束,并分析了现有模型的优缺点。然后,针对这六点约束,引进分维函数建立多维模型视图,利用聚集偏序集族定义维的结构,提出了一种多维数据模型,并给出了以OLAP操作为核心的操作代数。     

复杂层次多维数据仓库中判断数据请求有解的一种方法

1 多维数据模型概述多维数据模型因为能够有效地支持联机分析处理(online analysis processing,OLAP)而引起了人们越来越多的注意。最近几年,人们提出了几种多维数据模型。这些数据模型把数据集合视为多维空间中的点集,把数据集合的属性分为维和度量两类。维属性用来描述度量属性,是多维空间的维度。度量属性的值用来做分析处理,是多维空间中的点。最初的模型不能表示维层次结构,进一步能够表达简单的维层次结构(即只有一条路径的层次结构),后来能够表示满足具有     

一种XML数据库的数据模型

数据模型是XML数据管理领域研究的核心问题之一.现有的数据模型在表达XML数据库复杂的数据结构和操作方面仍有不足.以映射为基础,提出了一种新的数据模型.该数据模型给出了XML数据库复杂的数据结构和语义的精确定义,并提供了数据结构上操作代数的定义,包括路径表达式操作和数据维护操作.该数据模型已应用于一个基于XML的信息集成系统中.事实表明,它能够有效地支持XML数据管理的应用.     

基于有向图描述数据仓库中复杂维层次结构的方法研究

针对数据仓库中复杂维结构的特点，提出建立基于有向图的维字典图以辅助联机分析中有关维层次的定义，并利用维字典图重新定义了数据仓库多维数据模型和关于维层次的重要OLAP操作．该方法能够在复杂维层次结构的情况下灵活地适应用户的分析需求，提高了联机分析系统的处理能力．     

企业数据仓库多维数据模型的建立

数据仓库是一种新的数据管理技术,能将企业内分散的原始操作型数据和来自外部的数据汇集和整理,为企业提供完整、及时和准确的决策信息.构建数据仓库系统的核心问题是如何建立复杂的企业数据模型.商务数据的本质是多维的,传统的ER模型已无法满足要求,而多维数据建模技术从维度、层次建模的角度有效地弥补了传统数据模型的不足.文章以多维数据建模技术为中心通过实例讨论了数据仓库中数据模型的一般建立方法,为解决构建企业信息系统提供了一种切实可行的方案.     

多维数据模型中维层次结构的自动生成算法及其实现

多维数据模型是数据仓库及联机分析处理的核心,目前主要有两种:星型模型和雪花模型。维层次结构是多维数据模型最重要的概念之一。该文提出了一个算法,它能够在雪花模型中根据维表间的依赖关系构造维的层次结构。指出使用该算法的前提并进行了证明,随后实现了算法。文章最后提出了在星型模型中构造维的层次结构的基本过程。     

数据仓库中维的建模和查询

维是数据仓库的重要组成部分，也是OLAP的主要查询对象，但标准的星形／雪花模型对实际应用中维的建模存在明显缺陷，而且SQL语言对维实体、维层次结构不能提供直接、有效的支持，使得OLAP查询的表达较为繁琐、冗长。为此，提出了一个基于关系数据库的SQL（D）数据模型，它给出了层次链、层次树、维的正式定义，支持不平衡、异构的维层次结构；并对SQL作了相应的扩充，支持维的定义、维层次比较、维的引用和维聚集层次的指定，使得原先冗长、复杂的OLAP查询表达式变得简洁、易于理解。最后对扩充的语义给出实现算法。     

多维数据模型的变粒度存储策略研究

提高联机分析处理(OLAP)的响应速度是数据仓库研究的核心问题之一.文中根据多维数据模型的结构特点以及OLAP需求提出了一种变粒度存储策略.实验表明该策略能有效地减少存储空间,提高OLAP响应速度.     

企业数据仓库多维数据模型的建立

数据仓库是一种新的数据管理技术,能将企业内分散的原始操作型数据和来自外部的数据汇集和整理,为企业提供完整、及时和准确的决策信息。构建数据仓库系统的核心问题是如何建立复杂的企业数据模型。商务数据的本质是多维的,传统的ER模型已无法满足要求,而多维数据建模技术从维度、层次建模的角度有效地弥补了传统数据模型的不足。文章以多维数据建模技术为中心通过实例讨论了数据仓库中数据模型的一般建立方法,为解决构建企业信息系统提供了一种切实可行的方案。     

联机分析处理中的非规则维建模

预聚集技术通过预先计算并保存原始数据上的查询结果以实现联机分析处理系统的快速查询响应能力．然而，在实际应用中，许多非规则维的结构难以使用传统多维模型进行建模，从而影响了预聚集技术的使用．为此，基于子级别到父级别的部分映射定义级别之间的部分序关系，进而提出了一个支持非覆盖、非映上等非规则雏中维级别关系建模的维模型．同时，在维模型基础上，定义了支持非规则维的立方体模型以及典型的联机分析处理操作．多维模型与关系模式的转换定义和实例分析证明了该多维模型可以实现对各种非规则维的建模支持，保证了预聚集技术在联机分析处理中的使用．     

数据仓库的多维数据模型的研究

多维数据模型是数据仓库和联机分析处理研究中的一个重要问题,该文根据电力负荷数据集的特点,提出了一种新模型,解决不同维公用一个底层层次属性,把系统中不完全的低粒度数据集和完全的粗粒度数据集在逻辑上无缝地结合起来支持联机分析处理的问题,这是其他多维数据模型所没有解决的。     

Specifying OLAP Cubes on XML Data

On-Line Analytical Processing (OLAP) enables analysts to gain insight about data through fast and interactive access to a variety of possible views on information, organized in a dimensional model. The demand for data integration is rapidly becoming larger as more and more information sources appear in modern enterprises. In the data warehousing approach, selected information is extracted in advance and stored in a repository, yielding good query performance. However, in many situations a logical (rather than physical) integration of data is preferable. Previous web-based data integration efforts have focused almost exclusively on the logical level of data models, creating a need for techniques focused on the conceptual level. Also, previous integration techniques for web-based data have not addressed the special needs of OLAP tools such as handling dimensions with hierarchies. Extensible Markup Language (XML) is fast becoming the new standard for data representation and exchange on the World Wide Web. The rapid emergence of XML data on the web, e.g., business-to-business (B2B) e-commerce, is making it necessary for OLAP and other data analysis tools to handle XML data as well as traditional data formats.Based on a real-world case study, this paper presents an approach to specification of OLAP DBs based on web data. Unlike previous work, this approach takes special OLAP issues such as dimension hierarchies and correct aggregation of data into account. Also, the approach works on the conceptual level, using Unified Modeling Language (UML) as a basis for so-called UML snowflake diagrams that precisely capture the multidimensional structure of the data. An integration architecture that allows the logical integration of XML and relational data sources for use by OLAP tools is also presented.     

Efficient aggregation algorithms for compressed data warehouses

Aggregation and cube are important operations for online analytical processing (OLAP). Many efficient algorithms to compute aggregation and cube for relational OLAP have been developed. Some work has been done on efficiently computing cube for multidimensional data warehouses that store data sets in multidimensional arrays rather than in tables. However, to our knowledge, there is nothing to date in the literature describing aggregation algorithms on compressed data warehouses for multidimensional OLAP. This paper presents a set of aggregation algorithms on compressed data warehouses for multidimensional OLAP. These algorithms operate directly on compressed data sets, which are compressed by the mapping-complete compression methods, without the need to first decompress them. The algorithms have different performance behaviors as a function of the data set parameters, sizes of outputs and main memory availability. The algorithms are described and the I/O and CPU cost functions are presented in this paper. A decision procedure to select the most efficient algorithm for a given aggregation request is also proposed. The analysis and experimental results show that the algorithms have better performance on sparse data than the previous aggregation algorithms     

Improving the performance and functionality of Mondrian open‐source OLAP systems

For a long time, the design of relational databases has focused on the optimization of atomic transactions (insert, select, update or delete). Currently, relational databases store tactical information of data warehouses, mainly for select‐like operations. However, the database paradigm has evolved, and nowadays on‐line analytical processing (OLAP) systems handle strategic information for further analysis. These systems enable fast, interactive and consistent information analysis of data warehouses, including shared calculations and allocations. OLAP and data warehouses jointly allow multidimensional data views, turning raw data into knowledge. OLAP allows ‘slice and dice’ navigation and a top‐down perspective of data hierarchies. In this paper, we describe our experience in the migration from a large relational database management system to an OLAP system on top of a relational layer (the data warehouse), and the resulting contributions in open‐source ROLAP optimization. Existing open‐source ROLAP technologies rely on summarized tables with materialized aggregate views to improve system performance (in terms of response time). The design and maintenance of those tables are cumbersome. Instead, we intensively exploit cache memory, where key data reside, yielding low response times. A cold start process brings summarized data from the relational database to cache memory, subsequently reducing the response time. We ensure concurrent access to the summarized data, as well as consistency when the relational database updates data. We also improve the OLAP functionality, by providing new features for automating the creation of calculated members. This makes it possible to define new measures on the fly using virtual dimensions, without re‐designing the multidimensional cube. We have chosen the XML/A de facto standard for service provision. Copyright © 2008 John Wiley & Sons, Ltd.     

Efficient aggregation algorithms on very large compressed data warehouses

Multidimensional aggregation is a dominant operation on data warehouses for on-line analytical processing(OLAP).Many efficinet algorithms to compute multidimensional aggregation on relational database based data warehouses have been developed.However,to our knowledge,there is nothing to date in the literature about aggregation algorithms on multidimensional data warehouses that store datasets in mulitidimensional arrays rather than in tables.This paper presents a set of multidimensional aggregation algorithms on very large and compressed multidimensional data warehouses.These algorithms operate directly on compressed datasets in multidimensional data warehouses without the need to first decompress them.They are applicable to a variety of data compression methods.The algorithms have different performance behavior as a function of dataset parameters,sizes of out puts and ain memory availability.The algorithms are described and analyzed with respect to the I/O and CPU costs,A decision procedure to select the most efficient algorithm ,given an aggregation request,is also proposed.The analytical and experimental results show that the algorithms are more efficient than the traditional aggregation algorithms.     

High Performance OLAP and Data Mining on Parallel Computers

On-Line Analytical Processing (OLAP) techniques are increasingly being used in decision support systems to provide analysis of data. Queries posed on such systems are quite complex and require different views of data. Analytical models need to capture the multidimensionality of the underlying data, a task for which multidimensional databases are well suited. Multidimensional OLAP systems store data in multidimensional arrays on which analytical operations are performed. Knowledge discovery and data mining requires complex operations on the underlying data which can be very expensive in terms of computation time. High performance parallel systems can reduce this analysis time. Precomputed aggregate calculations in a Data Cube can provide efficient query processing for OLAP applications. In this article, we present algorithms for construction of data cubes on distributed-memory parallel computers. Data is loaded from a relational database into a multidimensional array. We present two methods, sort-based and hash-based for loading the base cube and compare their performances. Data cubes are used to perform consolidation queries used in roll-up operations using dimension hierarchies. Finally, we show how data cubes are used for data mining using Attribute Focusing techniques. We present results for these on the IBM-SP2 parallel machine. Results show that our algorithms and techniques for OLAP and data mining on parallel systems are scalable to a large number of processors, providing a high performance platform for such applications.