Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "cc874fd8-03bc-4ab3-9ac1-133739d0ca4c"}, "_deposit": {"created_by": 45, "id": "6183", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "recid", "value": "6183"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/6183", "sets": ["user-uit"]}, "communities": ["uit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "A Propos al of CS index Approach for SPARQL Queries Considering Chain and Star Shaped Subgraphs", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "The interlinking nature of web scale RDF data mak es a challenge on storage and retrieving of these data efficiently. Even though different storage and query processing techniques have been proposed, query processing on complex linking structured ( RDF data requires many join operations when the input query is large (with respect to number of triple patterns). One solution to this problem is to reduce the number of joins by indexing. Indexing is an effective technique to reduce data searching space and retrieve data as fast as possible. In this paper, we propose an indexing scheme of chain and star (CS index) and querying\napproach for SPARQL queries . The proposed approach could support both chain and star shaped queries . It employs graph pattern based technology: the RDF data graph is firstly decomposed into chain an d star shaped subgraphs based on the structural information of each vertex. These subgraphs are stored as index, called CS index. When a SPARQL query is given, it is decomposed into query subgraphs based on common join variable among all triple patterns. A nd the query results are retrieved by matching these query subgraphs against with CS index. The proposed approach tends to minimize the query\nexecution time by reducing the number of join operations as well as reduce memory usage for storing data."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "RDF"}, {"interim": "SPARQL query"}, {"interim": "graph based index"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_no", "date": [{"dateType": "Available", "dateValue": "2020-11-17"}], "displaytype": "preview", "filename": "A Propos al of CS index Approach for SPARQL Queries Considering Chain and Star Shaped Subgraphs.pdf", "filesize": [{"value": "476 Kb"}], "format": "application/pdf", "licensefree": "© 2018 Association for Computing Machinery", "licensetype": "license_free", "url": {"url": "https://meral.edu.mm/record/6183/files/A Propos al of CS index Approach for SPARQL Queries Considering Chain and Star Shaped Subgraphs.pdf"}, "version_id": "3ba16a97-ada7-49fa-8469-ac4d43196615"}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "IAIT 2018", "subitem_c_date": "December 10–13, 2018", "subitem_conference_title": "The 10th International Conference on Advances in Information Technology", "subitem_place": "Bangkok, Thailand"}]}, "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-13"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "10.1145/3291280.3291789"}, "item_title": "A Propos al of CS index Approach for SPARQL Queries Considering Chain and Star Shaped Subgraphs", "item_type_id": "21", "owner": "45", "path": ["1596102355557"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000006183", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-11-17"}, "publish_date": "2020-11-17", "publish_status": "0", "recid": "6183", "relation": {}, "relation_version_is_last": true, "title": ["A Propos al of CS index Approach for SPARQL Queries Considering Chain and Star Shaped Subgraphs"], "weko_shared_id": -1}
  1. University of Information Technology
  2. Faculty of Computer Science

A Propos al of CS index Approach for SPARQL Queries Considering Chain and Star Shaped Subgraphs

http://hdl.handle.net/20.500.12678/0000006183
http://hdl.handle.net/20.500.12678/0000006183
ce6375f6-997c-4b75-9c81-02fc2e9b912a
cc874fd8-03bc-4ab3-9ac1-133739d0ca4c
Publication type
Conference paper
Upload type
Publication
Title
Title A Propos al of CS index Approach for SPARQL Queries Considering Chain and Star Shaped Subgraphs
Language en
Publication date 2018-12-13
Authors
Khin Myat Kyu
Kay Thi Yar
Aung Nway Oo
Description
The interlinking nature of web scale RDF data mak es a challenge on storage and retrieving of these data efficiently. Even though different storage and query processing techniques have been proposed, query processing on complex linking structured ( RDF data requires many join operations when the input query is large (with respect to number of triple patterns). One solution to this problem is to reduce the number of joins by indexing. Indexing is an effective technique to reduce data searching space and retrieve data as fast as possible. In this paper, we propose an indexing scheme of chain and star (CS index) and querying
approach for SPARQL queries . The proposed approach could support both chain and star shaped queries . It employs graph pattern based technology: the RDF data graph is firstly decomposed into chain an d star shaped subgraphs based on the structural information of each vertex. These subgraphs are stored as index, called CS index. When a SPARQL query is given, it is decomposed into query subgraphs based on common join variable among all triple patterns. A nd the query results are retrieved by matching these query subgraphs against with CS index. The proposed approach tends to minimize the query
execution time by reducing the number of join operations as well as reduce memory usage for storing data.
Keywords
RDF, SPARQL query, graph based index
Identifier 10.1145/3291280.3291789
Conference papers
IAIT 2018
December 10–13, 2018
The 10th International Conference on Advances in Information Technology
Bangkok, Thailand
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-11-17 14:19:17.094096
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL