期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2018
卷号：96
期号：22
出版社：Journal of Theoretical and Applied
摘要：Resource Description Framework (RDF) is a data model to represent and store the web contents and their association in the form of a graph. This will enable the web (semantic web) to answer queries in a meaningful way as compared to the current web of keyword locator. Querying is required to retrieve any information from the semantic web (RDF data). In this context several algorithms have been proposed which can be classified in different categories. There are mainly two ways to query RDF data, one �on the fly� and the other is �index query�. The indexing method requires lot of offline work on RDF data to make the query run faster over it but at the cost of increased space. On the other hand, the �on the fly query� algorithms� takes more time to execute. In this research, an algorithm with reduced time and space complexity is proposed. The data graph is being stored in an Adjacency Matrix and Adjacency List. Our algorithm tries to match the query graph with the data graph (graph pattern matching) with lesser cost. By comparing the results, it is observed that proposed technique�s results are more accurate with reduced complexity.
