WEKO3
アイテム
{"_buckets": {"deposit": "8ed223b8-d5fd-4854-8823-00ff385ef57c"}, "_deposit": {"id": "51833", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "51833"}, "status": "published"}, "_oai": {"id": "oai:tsukuba.repo.nii.ac.jp:00051833", "sets": ["1453", "1229", "1063"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2019-03", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "135", "bibliographicPageStart": "117", "bibliographicVolumeNumber": "81", "bibliographic_titles": [{"bibliographic_title": "Information systems"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Keyword search over relational streams is useful when allowing users to query on streams without understanding the details about the streams and query language as well. There have been several research works on this direction, and the state-of-the-art approaches exploit Candidate Networks (CNs), which are schema-level descriptions of possible joining networks of tuples, and generate query plans based on CNs. However, in fact, the performance of these approaches seriously degrades in particular when the maximum size of CNs () and/or the number of query keywords are large due to the explosive increase in the number of CNs. To cope with this problem, we propose a novel query plan called MX-structure to consolidate CNs as much as possible. We suppress explosive blowup of nodes in query plans by consolidating all common edges among CNs. The experimental results prove that the proposed algorithm performs much better than the state-of-the-art approaches.", "subitem_description_type": "Abstract"}]}, "item_5_publisher_27": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Elsevier"}]}, "item_5_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1016/j.is.2018.12.004", "subitem_relation_type_select": "DOI"}}]}, "item_5_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "©2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ "}]}, "item_5_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_5_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "03064379", "subitem_source_identifier_type": "ISSN"}]}, "item_5_source_id_9": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA00227103", "subitem_source_identifier_type": "NCID"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "天笠, 俊之"}, {"creatorName": "アマガサ, トシユキ", "creatorNameLang": "ja-Kana"}, {"creatorName": "AMAGASA, Toshiyuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "108908", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "70314531", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000070314531"}, {"nameIdentifier": "0000000969", "nameIdentifierScheme": "筑波大学研究者総覧", "nameIdentifierURI": "http://trios.tsukuba.ac.jp/researcher/0000000969"}]}, {"creatorNames": [{"creatorName": "北川, 博之"}, {"creatorName": "キタガワ, ヒロユキ", "creatorNameLang": "ja-Kana"}, {"creatorName": "KITAGAWA, Hiroyuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "377", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "00204876", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000000204876"}, {"nameIdentifier": "0000000911", "nameIdentifierScheme": "筑波大学研究者総覧", "nameIdentifierURI": "http://trios.tsukuba.ac.jp/researcher/0000000911"}]}, {"creatorNames": [{"creatorName": "Bou, Savong", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "213079", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2021-04-01"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "IS_81-117.pdf", "filesize": [{"value": "3.3 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_11", "mimetype": "application/pdf", "size": 3300000.0, "url": {"label": "IS_81-117", "url": "https://tsukuba.repo.nii.ac.jp/record/51833/files/IS_81-117.pdf"}, "version_id": "1621b8d1-6116-447a-b4d0-1817346b21bb"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Scalable keyword search over relational data streams by aggressive candidate network consolidation", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Scalable keyword search over relational data streams by aggressive candidate network consolidation"}]}, "item_type_id": "5", "owner": "1", "path": ["1453", "1229", "1063"], "permalink_uri": "http://hdl.handle.net/2241/00157263", "pubdate": {"attribute_name": "公開日", "attribute_value": "2019-08-01"}, "publish_date": "2019-08-01", "publish_status": "0", "recid": "51833", "relation": {}, "relation_version_is_last": true, "title": ["Scalable keyword search over relational data streams by aggressive candidate network consolidation"], "weko_shared_id": 5}
Scalable keyword search over relational data streams by aggressive candidate network consolidation
http://hdl.handle.net/2241/00157263
http://hdl.handle.net/2241/001572637e459976-76b3-4904-a6db-9643335bf0f5
名前 / ファイル | ライセンス | アクション |
---|---|---|
IS_81-117 (3.3 MB)
|
Item type | Journal Article(1) | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2019-08-01 | |||||||||||
タイトル | ||||||||||||
タイトル | Scalable keyword search over relational data streams by aggressive candidate network consolidation | |||||||||||
言語 | ||||||||||||
言語 | eng | |||||||||||
資源タイプ | ||||||||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
タイプ | journal article | |||||||||||
著者 |
天笠, 俊之
× 天笠, 俊之
WEKO
108908
× 北川, 博之× Bou, Savong |
|||||||||||
抄録 | ||||||||||||
内容記述タイプ | Abstract | |||||||||||
内容記述 | Keyword search over relational streams is useful when allowing users to query on streams without understanding the details about the streams and query language as well. There have been several research works on this direction, and the state-of-the-art approaches exploit Candidate Networks (CNs), which are schema-level descriptions of possible joining networks of tuples, and generate query plans based on CNs. However, in fact, the performance of these approaches seriously degrades in particular when the maximum size of CNs () and/or the number of query keywords are large due to the explosive increase in the number of CNs. To cope with this problem, we propose a novel query plan called MX-structure to consolidate CNs as much as possible. We suppress explosive blowup of nodes in query plans by consolidating all common edges among CNs. The experimental results prove that the proposed algorithm performs much better than the state-of-the-art approaches. | |||||||||||
書誌情報 |
Information systems 巻 81, p. 117-135, 発行日 2019-03 |
|||||||||||
ISSN | ||||||||||||
収録物識別子タイプ | ISSN | |||||||||||
収録物識別子 | 03064379 | |||||||||||
書誌レコードID | ||||||||||||
収録物識別子タイプ | NCID | |||||||||||
収録物識別子 | AA00227103 | |||||||||||
DOI | ||||||||||||
識別子タイプ | DOI | |||||||||||
関連識別子 | 10.1016/j.is.2018.12.004 | |||||||||||
権利 | ||||||||||||
権利情報 | ©2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | |||||||||||
著者版フラグ | ||||||||||||
値 | author | |||||||||||
出版者 | ||||||||||||
出版者 | Elsevier |