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": "4a874597-71bd-40b2-92f0-f575f37ff429"}, "_deposit": {"id": "3495", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3495"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3495", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "A Graph Representative Structurefor Efficient Querying", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Graphs are prevalently used to model therelationships between objects in various domains. Withthe increasing usage of graph data, it has become moreand more demanding to efficiently process graphqueries. Querying graph data is costly since it involvesexhausted graph isomorphism testing. In Ph.Dresearch work, we propose a graph representation andquerying approach. There are 2 main phases in ourapproach: code generation phase and query phase. Inthis paper, an efficient graph representative structurethat is generated by code generation phase ispresented. In code generation phase, there are twomain processes: preprocessing of graph data and codegeneration. Our proposed graph representativestructure is called graph code.Edge dictionary isefficiently used to narrow down the search space ofgraph codes. To generate graph code, edge dictionaryand adjacent edge information are used.Ourexperiment also shows that for storage space requiredby our graph code is smaller than other formats suchas XML file and image file."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-03"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "3.A Graph Representative Structurefor Efficient Querying.pdf", "filesize": [{"value": "119 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 119000.0, "url": {"url": "https://meral.edu.mm/record/3495/files/3.A Graph Representative Structurefor Efficient Querying.pdf"}, "version_id": "4afe986f-1c40-4341-b3b5-0f95c73d641d"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Thirteenth International Conferences on Computer Applications(ICCA 2015)", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Hlaing, Yu Wai"}, {"subitem_authors_fullname": "Oo, Kyaw May"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2015-02-05"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/124"}, "item_title": "A Graph Representative Structurefor Efficient Querying", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003495", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-03"}, "publish_date": "2019-07-03", "publish_status": "0", "recid": "3495", "relation": {}, "relation_version_is_last": true, "title": ["A Graph Representative Structurefor Efficient Querying"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

A Graph Representative Structurefor Efficient Querying

http://hdl.handle.net/20.500.12678/0000003495
http://hdl.handle.net/20.500.12678/0000003495
8c74d321-9089-4f7f-87f6-695edd678f5f
4a874597-71bd-40b2-92f0-f575f37ff429
None
Preview
Name / File License Actions
3.A 3.A Graph Representative Structurefor Efficient Querying.pdf (119 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 13:03:37.838721
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