Heuristic Methods for the Data Placement Problem
作者:
McCleanS. I.,
BellD. A.,
McErleanF. J.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1991)
卷期:
Volume 42,
issue 9
页码: 767-774
ISSN:0160-5682
年代: 1991
DOI:10.1057/jors.1991.147
出版商: Taylor&Francis
关键词: Information Systems;Optimization
数据来源: Taylor
摘要:
AbstractDatabases require a management system which is capable of retrieving and storing information as efficiently as possible. The data placement problem is concerned with obtaining an optimal assignment of data tuples onto secondary storage devices. Such tuples have complicated interrelationships which make it difficult to find an exact solution to our problem in a realistic time.We therefore consider heuristic methods—three of which are discussed and compared—the‘greedy’graph-collapsing method, the probabilistic hill-climbing method of simulated annealing and a third‘greedy’heuristic, the random improvement method, which is a local search heuristic. Overall, the best performance is obtained from the graph-collapsing method for the less complicated situations, but for larger-scale problems with complex interrelationships between tuples the simulated annealing and random improvement algorithms give better results.
点击下载:
PDF (4167KB)
返 回