IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

RDF Query Path Optimization Using Hybrid Genetic Algorithms: Semantic Web vs. Data-Intensive Cloud Computing

RDF Query Path Optimization Using Hybrid Genetic Algorithms: Semantic Web vs. Data-Intensive Cloud Computing
View Sample PDF
Author(s): Qazi Mudassar Ilyas (King Faisal University, Saudi Arabia), Muneer Ahmad (University of Malaya, Malaysia), Sonia Rauf (COMSATS University Islamabad, Abbottabad, Pakistan) and Danish Irfan (COMSATS University Islamabad, Abbottabad, Pakistan)
Copyright: 2022
Volume: 12
Issue: 1
Pages: 16
Source title: International Journal of Cloud Applications and Computing (IJCAC)
Editor(s)-in-Chief: B. B. Gupta (National Institute of Technology Kurukshtra, India)
DOI: 10.4018/IJCAC.2022010101

Purchase

View RDF Query Path Optimization Using Hybrid Genetic Algorithms: Semantic Web vs. Data-Intensive Cloud Computing on the publisher's website for pricing and purchasing information.

Abstract

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.

Related Content

Tariq Umar. © 2022. 17 pages.
Tao Zhou. © 2022. 16 pages.
Jingshi He, Jiali Zhu. © 2022. 18 pages.
Myint Zaw, Pichaya Tandayya. © 2022. 22 pages.
Hung-Fu Huang, Ching-Chang Lee. © 2022. 15 pages.
Sunday Chinedu Eze, Vera Chinwendu Chinedu-Eze, Hart O. Awa. © 2022. 16 pages.
Qazi Mudassar Ilyas, Muneer Ahmad, Sonia Rauf, Danish Irfan. © 2022. 16 pages.
Body Bottom