.png){kind=icon}
返回
Optimization approach for data allocation in multidisk database
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00336-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the last decade, many parallel process mechanisms have been developed in information systems for enhancing their performance. But I/O throughput rates are still the bottleneck for data processing in the systems. In particular, relational database systems encounter this performance problem dealing with expensive operations such as the join operation. To treat a class of two-way join problems in database, Rotem et al. proposed a linearization method for finding the optimal allocation of relations to multidisk database such that the expected query cost is minimized. For the multidisk allocation problem with N relations and M disks, their model needs MN +N(N - 1)/2 +MN(N - 1;)/2 0-1 variables. This paper proposes a concise method to reformulate the same problem, which requires only MN +N(N - 1) /2 0-1 variables. The problem can hence be more efficiently solved by the concise method. The analytical superiority of the concise method in terms of the number of iterations and execution times can be seen, through a computational experiment conducted on a set of generated test examples. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
optimization
data allocation
linearization
mixed 0-1
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Antifungal effect of the essential oil ofThymus broussonetiiBoiss endogenous species of Morocco
PREAI
分享收藏
没有更多内容
没有更多内容