{"created":"2020-11-17T14:30:11.700810+00:00","id":6185,"links":{},"metadata":{"_buckets":{"deposit":"b81f43e6-04d3-40bc-b4df-5bc0f8653f76"},"_deposit":{"created_by":45,"id":"6185","owner":"45","owners":[45],"owners_ext":{"displayname":"","email":"dimennyaung@uit.edu.mm","username":""},"pid":{"revision_id":0,"type":"recid","value":"6185"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/6185","sets":["1582963342780:1596102355557"]},"communities":["uit"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Minimizing Query Execution Time of SPARQL Queries with CS-index Approach","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"RDF is a W3C’s standardized data model for Semantic Web, and provides a graph-based descriptive way for representing resources on the web and their relationships. With the increasing use of RDF data, SPARQL query processing over the data becomes a critical issue. This paper proposes an indexing and searching approach that can support both chain and star shaped SPARQL query. Our approach considers graph structural nature of the RDF data. The RDF data is firstly decomposed into chain and star shaped subgraph patterns based on nature of edges for each vertex. These subgraphs are stored as index, called CS-index. When a SPARQL query is given, it is decomposed into query subgraph patterns based on common join variable among all triple patterns. And the query results are finally obtained by matching these query subgraphs against with CS-index. The proposed approach tends to minimize data loading/indexing time, and query execution time by reducing number of join operations needed to perform for a query’s processing."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value_mlt":[{"interim":"Semantic Web"},{"interim":"RDF"},{"interim":"SPARQL"},{"interim":"graph-based index"},{"interim":"join optimization"}]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2020-11-17"}],"displaytype":"preview","filename":"Minimizing Query Execution Time of SPARQL Queries with CS-index Approach.pdf","filesize":[{"value":"305 Kb"}],"format":"application/pdf","licensetype":"license_0","url":{"url":"https://meral.edu.mm/record/6185/files/Minimizing Query Execution Time of SPARQL Queries with CS-index Approach.pdf"},"version_id":"5469dff6-11e0-4208-9a37-a4accb0aaa0b"}]},"item_1583103147082":{"attribute_name":"Conference papers","attribute_value_mlt":[{"subitem_acronym":"ICSE 2018","subitem_c_date":"December, 2018","subitem_conference_title":"The Ninth International Conference on Science and Engineering","subitem_place":"Yangon, Myanmar"}]},"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":"Aung Nway Oo"}]}]},"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":"2018-12-03"},"item_title":"Minimizing Query Execution Time of SPARQL Queries with CS-index Approach","item_type_id":"21","owner":"45","path":["1596102355557"],"publish_date":"2020-11-17","publish_status":"0","recid":"6185","relation_version_is_last":true,"title":["Minimizing Query Execution Time of SPARQL Queries with CS-index Approach"],"weko_creator_id":"45","weko_shared_id":-1},"updated":"2021-12-13T00:42:11.890399+00:00"}