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 BackJumping (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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Engineering and Advanced Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
