Welcome to the InfoSci Platform
Reference Hub2
Materialized View Selection Using Self-Adaptive Perturbation Operator-Based Particle Swarm Optimization

Materialized View Selection Using Self-Adaptive Perturbation Operator-Based Particle Swarm Optimization

Amit Kumar, T. V. Vijay Kumar
Copyright: © 2020 |Volume: 11 |Issue: 3 |Pages: 18
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781799806233|DOI: 10.4018/ijaec.2020070104
Cite Article Cite Article

MLA

Kumar, Amit, and T. V. Vijay Kumar. "Materialized View Selection Using Self-Adaptive Perturbation Operator-Based Particle Swarm Optimization." IJAEC vol.11, no.3 2020: pp.50-67. http://doi.org/10.4018/ijaec.2020070104

APA

Kumar, A. & Kumar, T. V. (2020). Materialized View Selection Using Self-Adaptive Perturbation Operator-Based Particle Swarm Optimization. International Journal of Applied Evolutionary Computation (IJAEC), 11(3), 50-67. http://doi.org/10.4018/ijaec.2020070104

Chicago

Kumar, Amit, and T. V. Vijay Kumar. "Materialized View Selection Using Self-Adaptive Perturbation Operator-Based Particle Swarm Optimization," International Journal of Applied Evolutionary Computation (IJAEC) 11, no.3: 50-67. http://doi.org/10.4018/ijaec.2020070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

A data warehouse is a central repository of time-variant and non-volatile data integrated from disparate data sources with the purpose of transforming data to information to support data analysis. Decision support applications access data warehouses to derive information using online analytical processing. The response time of analytical queries against speedily growing size of the data warehouse is substantially large. View materialization is an effective approach to decrease the response time for analytical queries and expedite the decision-making process in relational implementations of data warehouses. Selecting a suitable subset of views that deceases the response time of analytical queries and also fit within available storage space for materialization is a crucial research concern in the context of a data warehouse design. This problem, referred to as view selection, is shown to be NP-Hard. Swarm intelligence have been widely and successfully used to solve such problems. In this paper, a discrete variant of particle swarm optimization algorithm, i.e. self-adaptive perturbation operator based particle swarm optimization (SPOPSO), has been adapted to solve the view selection problem. Accordingly, SPOPSO-based view selection algorithm (SPOPSOVSA) is proposed. SPOPSOVSA selects the Top-K views in a multidimensional lattice framework. Further, the proposed algorithm is shown to perform better than the view selection algorithm HRUA.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.