A Metaheuristic Based Approach for Solving the Index Selection Problem in Data Warehouses
dc.contributor.author | Bahache, Anwar Nour Eddine | |
dc.date.accessioned | 2018-07-08T10:14:30Z | |
dc.date.available | 2018-07-08T10:14:30Z | |
dc.date.issued | 2018 | |
dc.description.abstract | Analytical queries defined on a star schema modeled data warehouse are very complex and time consuming due to the join operations between the fact and dimension tables. Several techniques to reduce the cost and response time has been emerged in the past decades such as indexes. Binary Join Indexes (BJI) are one of the well-known indexes and its selection is considered as a problem itself (noted Index Selection Problem: ISP). this problem is crucial in data warehousing physical design. To solve this problem two approaches exists statistics-based approach and metaheuristic-based approach. In this dissertation we propose a new metaheuristic-basedapproach. This approach is based on the improved version of the artificial fish swarm algorithm for solving the binary join index selection problem. This approach aims to select the optimal set of BJI based on a mathematical cost model. This method was tested against a datamining constraint-based method and proved its effectiveness and even its superiority to the datamining constraint method. | en_US |
dc.identifier.uri | http://dspace.univ-msila.dz:8080//xmlui/handle/123456789/5178 | |
dc.language.iso | en | en_US |
dc.publisher | FACULTE Mathématique et Informatique DEPARTEMENT D’ Informatique | en_US |
dc.subject | Keywords: Analytical queries, Data warehouse, Binary join index, Artificial fish swarm algorithm. | en_US |
dc.title | A Metaheuristic Based Approach for Solving the Index Selection Problem in Data Warehouses | en_US |
dc.type | Thesis | en_US |