{"_buckets": {"deposit": "2712ffdc-2b68-4e99-80c9-dec9cf1a01b2"}, "_deposit": {"created_by": 45, "id": "6636", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "depid", "value": "6636"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00006636", "sets": ["user-uit"]}, "communities": ["uit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "RFSgIndex: Frequent Subgraph Index for Subgraph Matching in RDF Data", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Graphs are used to represent the relationships between\nobjects in various domains such as bioinformatics, social\nnetworks, and Web exploration. With the rapid increase\nof RDF data, efficient graph data management technique\nis needed to store and retrieve these data. Indexing is an\neffective technique to reduce data searching space and\nretrieve them as fast as possible. In this paper, RDF\nfrequent subgraph based approach (RFSgIndex) is\nproposed to find all the matches of a query graph (a\nSPARQL query) in a given single large graph (RDF data\ngraph). Firstly, frequent sugraphs are extracted from the\nRDF data graph using Frequent Subgraph Mining\nalgorithm. Given the query graph, the system finds all the\npossible occurrences of the query graph by using\nRFSgIndex. The proposed approach will reduce data\nsearching space and speed up the query response time."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "RDF data"}, {"interim": "SPARQL query"}, {"interim": "graph indexing"}, {"interim": "frequent subgraph mining"}, {"interim": "subgraph isomorphism"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-11-26"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "RFSgIndex- Frequent Subgraph Index for Subgraph Matching in RDF Data.pdf", "filesize": [{"value": "626 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_0", "mimetype": "application/pdf", "size": 626000.0, "url": {"url": "https://meral.edu.mm/api/files/2712ffdc-2b68-4e99-80c9-dec9cf1a01b2/RFSgIndex-%20Frequent%20Subgraph%20Index%20for%20Subgraph%20Matching%20in%20RDF%20Data.pdf"}, "version_id": "b8d334cd-ab6b-469c-b5b0-d9ebd24b1e5b"}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "ICAIT-2017", "subitem_c_date": "1-2 November, 2017", "subitem_conference_title": "1st International Conference on Advanced Information Technologies", "subitem_place": "Yangon, Myanmar", "subitem_session": "Workshop Session", "subitem_website": "https://www.uit.edu.mm/icait-2017/"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Khin Myat Kyu"}, {"subitem_authors_fullname": "Kay Thi Yar"}, {"subitem_authors_fullname": "Kyawt Kyawt San"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Conference paper"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2017-11-02"}, "item_title": "RFSgIndex: Frequent Subgraph Index for Subgraph Matching in RDF Data", "item_type_id": "21", "owner": "45", "path": ["1605779935331"], "permalink_uri": "https://meral.edu.mm/records/6636", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-11-26"}, "publish_date": "2020-11-26", "publish_status": "0", "recid": "6636", "relation": {}, "relation_version_is_last": true, "title": ["RFSgIndex: Frequent Subgraph Index for Subgraph Matching in RDF Data"], "weko_shared_id": -1}