2026-06-24T22:50:50Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/00006636 2021-12-13T00:28:25Z 1582963342780:1605779935331 user-uit

RFSgIndex: Frequent Subgraph Index for Subgraph Matching in RDF Data Khin Myat Kyu Kay Thi Yar Kyawt Kyawt San Graphs are used to represent the relationships between objects in various domains such as bioinformatics, social networks, and Web exploration. With the rapid increase of RDF data, efficient graph data management technique is needed to store and retrieve these data. Indexing is an effective technique to reduce data searching space and retrieve them as fast as possible. In this paper, RDF frequent subgraph based approach (RFSgIndex) is proposed to find all the matches of a query graph (a SPARQL query) in a given single large graph (RDF data graph). Firstly, frequent sugraphs are extracted from the RDF data graph using Frequent Subgraph Mining algorithm. Given the query graph, the system finds all the possible occurrences of the query graph by using RFSgIndex. The proposed approach will reduce data searching space and speed up the query response time. 2017-11-02 https://meral.edu.mm/records/6636