作者: TV Vijay Kumar , Santosh Kumar , V Singh
DOI: 10.1504/IJICA.2014.066499
关键词:
摘要: A data warehouse is designed for answering analytical queries. These queries are usually long, complex and ad hoc in nature their response time high when processed against an exponentially growing warehouse. Materialising views has been found to be effective tool reducing this time. All cannot materialised on account of resource constraints. Further, optimal view selection shown NP-complete problem. This necessitates appropriate set views, from amongst all possible that reduce the query Most algorithms greedy or evolutionary. In paper, a differential evolution algorithm (DEVSA) selects Top-K multi-dimensional lattice proposed. it DEVSA compared greedy, genetic memetic-based comparatively better quality higher dimensional datasets.