{"_buckets": {"deposit": "7dc2e0c6-2efe-46ab-bd82-70bc6ea99ee8"}, "_deposit": {"created_by": 45, "id": "5400", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "email": "dimennyaung@uit.edu.mm", "username": ""}, "pid": {"revision_id": 0, "type": "recid", "value": "5400"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/5400"}, "control_number": "5400", "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "EFFICIENT SCHEMA BASED KEYWORD SEARCH IN RELATIONAL DATABASES", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Keyword search in relational databases allows user to search information without knowing database\nschema and using structural query language (SQL). In this paper, we address the problem of generating\nand evaluating candidate networks. In candidate network generation, the overhead is caused by raising the\nnumber of joining tuples for the size of minimal candidate network. To reduce overhead, we propose\ncandidate network generation algorithms to generate a minimum number of joining tuples according to the\nmaximum number of tuple set. We first generate a set of joining tuples, candidate networks (CNs). It is\ndifficult to obtain an optimal query processing plan during generating a number of joins. We also develop a\ndynamic CN evaluation algorithm (D_CNEval) to generate connected tuple trees (CTTs) by reducing the\nsize of intermediate joining results. The performance evaluation of the proposed algorithms is conducted\non IMDB and DBLP datasets and also compared with existing algorithms."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Candidate Network"}, {"interim": "Connected Tuple Tree"}, {"interim": "Joining Tuples"}, {"interim": "Keyword Query"}, {"interim": "Keyword Search"}, {"interim": "Relational Database"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_no"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_journal_title": "International Journal of Computer Science, Engineering and Information Technology", "subitem_pages": "13-32", "subitem_volume": "Volume 2, No. 6"}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "IJCSEIT", "subitem_c_date": "December, 2012", "subitem_conference_title": "International Journal of Computer Science, Engineering and Information Technology"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Myint Myint Thein"}, {"subitem_authors_fullname": "Mie Mie Su Thwin"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_name_i18n": "Upload type", "attribute_value": "Publication"}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_name_i18n": "Publication type", "attribute_value": "Journal article"}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_name_i18n": "Publication date", "attribute_value": "2012-12-01"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "10.5121/ijcseit.2012.2602"}, "item_title": "EFFICIENT SCHEMA BASED KEYWORD SEARCH IN RELATIONAL DATABASES", "item_type_id": "21", "owner": "45", "path": ["1582963342780/1596102391527"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000005400", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-09-16"}, "publish_date": "2020-09-16", "publish_status": "0", "recid": "5400", "relation": {}, "relation_version_is_last": true, "title": ["EFFICIENT SCHEMA BASED KEYWORD SEARCH IN RELATIONAL DATABASES"], "weko_shared_id": -1}