{"_buckets": {"deposit": "0886256f-0604-4787-a937-d1956de642c8"}, "_deposit": {"id": "3506", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3506"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3506", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Compact Graph Representative Structure for Efficient Graph Querying in Chemical Compound Graph Databases", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Graph has become a powerful tool for representingand modeling objects and their relationships in variousapplication domains such as protein interaction, social networksand chemical informatics. With the emergence of theseapplications, developments of graph databases are very useful tostore graph data. However, performance query processing ongraph database (GDB) is still inadequate due to the highcomplexity of processing graph data. As a result, effective graphstructures to store graphs are the current research area tocomplete efficient query processing on the graph databases. Inthis paper, a new compact graph representative structure(CGRS)is proposed to perform efficient graph query processing. InCGRS, a graph is represented holistically via its edge code usingedge dictionary. The idea of graph decomposition is used tospecify all connected, induced subgraphs of a given graphwithout changing the structure of the original graphs. UsingCGRS, two types of graph queries can be processed: graphisomorphism query and subgraph isomorphism query. Chemicalcompound dataset is applied to test the effectiveness of ourproposed CGRS. The analysis of storage space, graphconstruction time and query response time offers a positiveresponse to our newly proposed CGRS structure."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "graph databases"}, {"interim": "graph query processing"}, {"interim": "graph isomorphism query"}, {"interim": "subgraph isomorphism query"}]}, "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": "12044.pdf", "filesize": [{"value": "287 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 287000.0, "url": {"url": "https://meral.edu.mm/record/3506/files/12044.pdf"}, "version_id": "101e5947-dd1b-4bd7-89f6-9adae30c0432"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Twelfth International Conference On Computer Applications (ICCA 2014)", "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": "Thaing, Aye Nwe"}]}]}, "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": "2014-02-17"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/125"}, "item_title": "Compact Graph Representative Structure for Efficient Graph Querying in Chemical Compound Graph Databases", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003506", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-03"}, "publish_date": "2019-07-03", "publish_status": "0", "recid": "3506", "relation": {}, "relation_version_is_last": true, "title": ["Compact Graph Representative Structure for Efficient Graph Querying in Chemical Compound Graph Databases"], "weko_shared_id": -1}