{"_buckets": {"deposit": "6ed33a0b-9364-4fe1-9fd8-96a25b39960e"}, "_deposit": {"id": "4376", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4376"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4376", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Graph Querying Using Graph Code and GC_Trie", "subitem_1551255648112": "en_US"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Graph datasets face a great challenge arisingfrom a massive increasing volume of new structuralgraphs in bio-informatics, chem-informatics,business processes, etc. One of the essentialfunctions in graph dataset is to query grapheffectively and efficiently. Given a graph query, it isdesirable to retrieve relevant graphs quickly from agraph dataset via efficient graph indices. In ourproposed system, there are two phases: indexconstructing and graph querying. In indexconstructing phase, a graph is representedholistically via graph code that is constructed basedon adjacent edge information and edge dictionary.The GC_Trie is constructed as index with graphcodes of data graphs. In graph querying phase,automorphic(duplicate) graphs and isomorphicgraphs of the query graph are queried by usingGC_Trie. AIDS antiviral screen compound dataset isused to test the effectiveness of proposed approach.The experimental results offer a positive response toour newly proposed approach."}]}, "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-10-15"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "NJPSC 2019 Proceedings-pages-163-168.pdf", "filesize": [{"value": "475 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 475000.0, "url": {"url": "https://meral.edu.mm/record/4376/files/NJPSC 2019 Proceedings-pages-163-168.pdf"}, "version_id": "849f936d-9825-499c-a4f4-dbe5aca6c8f5"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "National Journal of Parallel and Soft Computing", "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"}]}]}, "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": "2019-03"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/2313"}, "item_title": "Graph Querying Using Graph Code and GC_Trie", "item_type_id": "21", "owner": "1", "path": ["1597824304333"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004376", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-10-15"}, "publish_date": "2019-10-15", "publish_status": "0", "recid": "4376", "relation": {}, "relation_version_is_last": true, "title": ["Graph Querying Using Graph Code and GC_Trie"], "weko_shared_id": -1}