A Query Search Technique for Semantic Web Based on The Dynamic Distribution of Backjumping Method
Rubin Thottupurathu Jose1, Sojan Lal Poulose2

1Rubin Thottupurathu Jose, School of Computer Sciences, M G University, Kottayam, Kerala, India.
2Dr Sojan Lal Poulose, Principal, Mar-Baselious Institute of Technology and Science, Kothamangalam, Kerala, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 899-904 | Volume-8 Issue-6, August 2019. | Retrieval Number: F8223088619/2019©BEIESP | DOI: 10.35940/ijeat.F8223.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: In the resource description language of the semantic web, vagueness of Resource Description Framework (RDF) data is playing an important role. The effective querying of the RDF data is increasing importance in semantic web. In this research, the Dynamic Distribution of Back Jumping (DDBJ) algorithm is proposed in the fuzzy graph due to the ability of the algorithm to maintain its autonomy in the data. The fuzzy graph is generated from the triplets in the RDF and the vertices, edges are extracted from pattern matching techniques. The vertices and edges are applied in the DDBJ to suggest the query in the semantic web. To analyze the effectiveness of the proposed DDBJ, the two real datasets are used. The proposed DDBJ method has the f-measure of 59 %, while the state-of-art method such as backtracking has achieved 56 %. The result shows that the DDBJ method has the higher performance than existing method in query processing.
Keywords: Dynamic Distribution of Back Jumping, fuzzy graph, pattern matching, Resource Description Framework, and Semantic web.