With the base of proposing materialized view similarity function, the paper proposes clustering-based dynamic materialized view selection algorithm. It firstly clusters materialized views, and then dynamically adjusts materialized view set. So, it eliminates the "jitter", which dynamic materialized view selection algorithm generally has. The experimental results show that the algorithm not only improves the overall query response performance, but also reduces the computational cost which will be spent during updating materialized view.
K-means algorithm is sensitive to initial cluster centers and its solutions are apt to be trapped in local optimums. In order to solve these problems, we propose an optimized artificial bee colony algorithm for clustering. The proposed method first obtains optimized sources by improving the selection of the initial clustering centers; then, uses a novel dynamic local optimization strategy utilizing roulette wheel selection algorithm for further enhancing local optimization. To prove its effectiveness, we validate the proposed algorithm on four datasets from UCI and compared the results with K-means, K-means++ and Artificial Bee Colony algorithm. Experiment results show that the proposed algorithm performs better than other clustering algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.