MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "e7012ace-820e-4602-9dc2-e5b6107ed66c"}, "_deposit": {"id": "4476", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4476"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4476", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "XML Twig Pattern Matching Processing", "subitem_1551255648112": "en_US"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Finding all occurrences of a twig patternquery is a core operation of XML queryprocessing system. Many algorithms have beenproposed. Existing algorithms generateindividual path matches and then stitch themtogether through a merge operation to form twigmatches. Due to the merging operation they havevery expensive cost. To avoid the merging cost,many one phase algorithms have been proposed.However, these algorithms are quite efficient forqueries with only ancestor-descendentrelationship. TwigMMatch algorithm isproposed. Like Holistic TwigStack, a chain oflinked stacks is applied to process the twigmatches. The proposed algorithm not only avoidsthe merging process but also process the twigqueries with mixed edges."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "a twig pattern query"}, {"interim": "parent-child and ancestor-descendant relationship"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-11-14"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "10049.pdf", "filesize": [{"value": "615 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 615000.0, "url": {"url": "https://meral.edu.mm/record/4476/files/10049.pdf"}, "version_id": "9b737ef9-08e8-442b-a7ab-6533a1e7331e"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Tenth International Conference On Computer Applications (ICCA 2012)", "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": "Thet, Yi Mon"}]}]}, "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": "2012-02-28"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/2405"}, "item_title": "XML Twig Pattern Matching Processing", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004476", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-11-14"}, "publish_date": "2019-11-14", "publish_status": "0", "recid": "4476", "relation": {}, "relation_version_is_last": true, "title": ["XML Twig Pattern Matching Processing"], "weko_shared_id": -1}
XML Twig Pattern Matching Processing
http://hdl.handle.net/20.500.12678/0000004476
http://hdl.handle.net/20.500.12678/0000004476699845b2-4104-4e13-a905-7bbe41831294
e7012ace-820e-4602-9dc2-e5b6107ed66c
Name / File | License | Actions |
---|---|---|
![]() |
|
Publication type | ||||||
---|---|---|---|---|---|---|
Article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | XML Twig Pattern Matching Processing | |||||
Language | en_US | |||||
Publication date | 2012-02-28 | |||||
Authors | ||||||
Thet, Yi Mon | ||||||
Description | ||||||
Finding all occurrences of a twig patternquery is a core operation of XML queryprocessing system. Many algorithms have beenproposed. Existing algorithms generateindividual path matches and then stitch themtogether through a merge operation to form twigmatches. Due to the merging operation they havevery expensive cost. To avoid the merging cost,many one phase algorithms have been proposed.However, these algorithms are quite efficient forqueries with only ancestor-descendentrelationship. TwigMMatch algorithm isproposed. Like Holistic TwigStack, a chain oflinked stacks is applied to process the twigmatches. The proposed algorithm not only avoidsthe merging process but also process the twigqueries with mixed edges. | ||||||
Keywords | ||||||
a twig pattern query, parent-child and ancestor-descendant relationship | ||||||
Identifier | http://onlineresource.ucsy.edu.mm/handle/123456789/2405 | |||||
Journal articles | ||||||
Tenth International Conference On Computer Applications (ICCA 2012) | ||||||
Conference papers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |