RDF Query Path Optimization Using Hybrid Genetic Algorithms
| Autor: | Muneer Ahmad, Qazi Mudassar Ilyas, Sonia Rauf, Danish Irfan |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Theoretical computer science
Computer Networks and Communications business.industry Computer science Hybrid genetic algorithms InformationSystems_DATABASEMANAGEMENT Cloud computing Computer Science Applications Human-Computer Interaction Path (graph theory) business Semantic Web computer RDF query language computer.programming_language |
| Zdroj: | International Journal of Cloud Applications and Computing. 12:1-16 |
| ISSN: | 2156-1826 2156-1834 |
| DOI: | 10.4018/ijcac.2022010101 |
| Popis: | Resource Description Framework (RDF) inherently supports data mergers from various resources into a single federated graph that can become very large even for an application of modest size. This results in severe performance degradation in the execution of RDF queries. As every RDF query essentially traverses a graph to find the output of the Query, an efficient path traversal reduces the execution time of RDF queries. Hence, query path optimization is required to reduce the execution time as well as the cost of a query. Query path optimization is an NP-hard problem that cannot be solved in polynomial time. Genetic algorithms have proven to be very useful in optimization problems. We propose a hybrid genetic algorithm for query path optimization. The proposed algorithm selects an initial population using iterative improvement thus reducing the initial solution space for the genetic algorithm. The proposed algorithm makes significant improvements in the overall performance. We show that the overall number of joins for complex queries is reduced considerably, resulting in reduced cost. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|