首页> 外文会议>Pacific-Asia conference on knowledge discovery and data mining >An Optimization Problem in Data Cube System Design
【24h】

An Optimization Problem in Data Cube System Design

机译:数据多维数据集系统设计中的优化问题

获取原文

摘要

In an OLAP system, we can use data cubes (precomputed multidimensional views of data) to support real-time queries. To reduce the maintenance cost, which is related to the number of cubes materialized, some cubes can be merged, but the resulting larger cubes will increase the response time of answering some queries. In order to satisfy the maintenance bound and response time bound given by the user, we may have to sacrifice some of the queries and not to take them into our consideration. The optimization problem in the data cube system design is to optimize an initial set of cubes such that the system can answer a maximum number of queries and satisfy the bounds. This is an NP-complete problem. Approximate algorithms Greedy Removing and 2-Greedy Merging are proposed. Experiments have been done on a census database and the results show that our approach is both effective and efficient.
机译:在OLAP系统中,我们可以使用数据多维数据集(预先计算的数据的多维视图)来支持实时查询。为了降低与实现的多维数据数有关的维护成本,可以合并一些立方体,但是由此产生的更大的多维数据集将增加回答一些查询的响应时间。为了满足用户给出的维护和响应时间,我们可能不得不牺牲一些查询,而不是将它们带入我们的考虑因素。数据多维数据集系统设计中的优化问题是优化一组初始立方体,使得系统可以应答最大数量的查询并满足界限。这是一个NP完全的问题。提出了近似算法贪婪去除和2贪图合并。实验已经在人口普查数据库上完成,结果表明,我们的方法既有效又高效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号