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": "45bba7ea-7314-41c2-bcbb-a4fe659b287a"}, "_deposit": {"id": "4162", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4162"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4162", "sets": ["1597824273898", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "An Efficient Indexing Mechanism for Graph Queries in Graph Databases", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "In recent years, graph has become a powerfultool for representing and modeling objects and theirrelationships in various application domains such asprotein interactions, chemical compounds, socialnetworks, XML documents and so on. The volume ofgraph data increases rapidly and the graph databasebecomes an essential role to store graph data.However, the performance of query processing ongraph databases is still inadequate due to the highcomplexity of processing graph data. As a result, it isimportant to develop efficient indexing structure forquery processing on the graph databases. In this paper,we propose both algorithms for graph indexing andsubgraph isomorphism query for subgraph queryprocessing in the graph database. We also propose aproficient index structure (AdE) to support bothalgorithms to quickly index and identify the isomorphicgraphs for the given query graph. Like canonical code,AdE checks whether the query graph is a subgraphisomorphic to the database graph. Our proposed indexstructure significantly reduces the computational timecomplexity compared to the DGIndex structure."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Graph Database"}, {"interim": "Graph Decomposition"}, {"interim": "Graph Indexing"}, {"interim": "Graph Query Processing"}, {"interim": "Chemical Compound"}]}, "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": "9054.pdf", "filesize": [{"value": "426 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 426000.0, "url": {"url": "https://meral.edu.mm/record/4162/files/9054.pdf"}, "version_id": "6d1885e9-e4fc-40be-a930-7f03212ba90e"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Ninth International Conference On Computer Applications (ICCA 2011)", "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": "2011-05-05"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/186"}, "item_title": "An Efficient Indexing Mechanism for Graph Queries in Graph Databases", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004162", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-03"}, "publish_date": "2019-07-03", "publish_status": "0", "recid": "4162", "relation": {}, "relation_version_is_last": true, "title": ["An Efficient Indexing Mechanism for Graph Queries in Graph Databases"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

An Efficient Indexing Mechanism for Graph Queries in Graph Databases

http://hdl.handle.net/20.500.12678/0000004162
http://hdl.handle.net/20.500.12678/0000004162
2bafb18c-34f2-47e1-9e9e-7ab15599040c
45bba7ea-7314-41c2-bcbb-a4fe659b287a
None
Preview
Name / File License Actions
9054.pdf 9054.pdf (426 Kb)
Publication type
Article
Upload type
Publication
Title
Title An Efficient Indexing Mechanism for Graph Queries in Graph Databases
Language en
Publication date 2011-05-05
Authors
Thaing, Aye Nwe
Description
In recent years, graph has become a powerfultool for representing and modeling objects and theirrelationships in various application domains such asprotein interactions, chemical compounds, socialnetworks, XML documents and so on. The volume ofgraph data increases rapidly and the graph databasebecomes an essential role to store graph data.However, the performance of query processing ongraph databases is still inadequate due to the highcomplexity of processing graph data. As a result, it isimportant to develop efficient indexing structure forquery processing on the graph databases. In this paper,we propose both algorithms for graph indexing andsubgraph isomorphism query for subgraph queryprocessing in the graph database. We also propose aproficient index structure (AdE) to support bothalgorithms to quickly index and identify the isomorphicgraphs for the given query graph. Like canonical code,AdE checks whether the query graph is a subgraphisomorphic to the database graph. Our proposed indexstructure significantly reduces the computational timecomplexity compared to the DGIndex structure.
Keywords
Graph Database, Graph Decomposition, Graph Indexing, Graph Query Processing, Chemical Compound
Identifier http://onlineresource.ucsy.edu.mm/handle/123456789/186
Journal articles
Ninth International Conference On Computer Applications (ICCA 2011)
Conference papers
Books/reports/chapters
Thesis/dissertations
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 14:15:24.228028
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