A hypergraph based approach to declustering problems

檔案

日期

2001

作者

類型

期刊名稱

DISTRIBUTED AND PARALLEL DATABASES

卷期與頁次

第 10 卷第 3 期,頁 269–288

ISSN

0926-8782

語言

英文

摘要

Parallelizing I/O operations via effective declustering of data is becoming essential to scale up the performance of parallel databases or high performance systems. Declustering has been shown to be a NP-complete problem in some contexts. Some heuristic methods have been proposed to solve this problem. However, most methods are not effective in several cases such as queries with different access frequencies or data with different sizes. In this paper, we propose a hypergraph model to formulate the declustering problem. Several interesting theoretical results are achieved by analyzing the proposed model. The proposed approach will allow modeling a wide range of declustering problems. Furthermore, the hypergraph declustering model is used as the basis to develop new heuristic methods, including a greedy method and a hybrid declustering method. Experiments show that the proposed methods can achieve better performance than several declustering methods.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Liu, D., & Wu, M. (2001). A hypergraph based approach to declustering problems. DISTRIBUTED AND PARALLEL DATABASES, 10(3), 269–288. https://doi.org/10.1023/A:1019269409432

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30045