閱讀全文 | |
篇名 |
Materialized Views Selection in Distributed Networks
|
---|---|
並列篇名 | Materialized Views Selection in Distributed Networks |
作者 | Zhenhua Huang、Zhenqi Zhao、Jiujun Cheng |
英文摘要 | Materialized views selection has recently received increasing attention in the database community. Although several greedy and heuristic algorithms for materialized views selection have already been proposed in centralized environments, their quality can not be guaranteed well in realistic distributed environments. Motivated by the above, under the constraint of maintenance and communication costs, this paper proposes two efficient algorithms in SPA (Super-Peer Architecture) distributed networks and uses the map/reduce distributed computation model to quickly find the optimal materialized views. For the first algorithm SMVSA, we first heuristically constructs the initial set of materialized views and then adjusts the set of materialized views based on simulated annealing. While for the second algorithm SMVMST, we reduce the materialized views selection to the problem of producing the minimum Steiner tree and obtain the approximate optimal set of materialized views. The detailed theoretical analyses and extensive experiments demonstrate that our proposed algorithms are both efficient and effective. |
起訖頁 | 423-434 |
關鍵詞 | Materialized views、Map/reduce、Distributed networks、Simulated annealing、Minimum steiner tree |
刊名 | 網際網路技術學刊 |
期數 | 201903 (20:2期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| Query Expansion Based on Formal Concept Analysis from Retrieved Documents |
該期刊 下一篇
| Face Recognition and Smart People-Counting System: Cases of Asian Trade Shows |