{"created":"2021-03-01T07:08:57.369218+00:00","id":30365,"links":{},"metadata":{"_buckets":{"deposit":"56910a60-3aa8-4b8e-93ec-bb5bdcc89d52"},"_deposit":{"id":"30365","owners":[],"pid":{"revision_id":0,"type":"depid","value":"30365"},"status":"published"},"_oai":{"id":"oai:tsukuba.repo.nii.ac.jp:00030365","sets":["3:2658:2664"]},"item_11_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2014","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"21","bibliographicPageStart":"1","bibliographic_titles":[{}]}]},"item_11_creator_3":{"attribute_name":"著者別名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"森嶋, 厚行"}],"nameIdentifiers":[{},{},{}]},{"creatorNames":[{"creatorName":"杉本, 重雄"}],"nameIdentifiers":[{},{},{}]},{"creatorNames":[{"creatorName":"北川, 博之"}],"nameIdentifiers":[{},{},{}]}]},"item_11_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Data integrity constraints are fundamental in various applications, such as data management,\nintegration, cleaning, and schema extraction. This paper presents the results of a first comprehensive\nstudy on finding inclusion dependencies on the Web. The problem is important because\n(1) applications of inclusion dependencies, such as data quality management, are beneficial in\nthe Web context, and (2) such dependencies are not explicitly given in general. In our approach,\nwe enumerate pairs of HTML/XML elements that possibly represent inclusion dependencies and\nthen rank the results for verification. First, we propose a bit-based signature scheme to efficiently\nselect candidates (element pairs) in the enumeration process. The signature scheme is unique\nin that it supports Jaccard containment to deal with the incomplete nature of data on the Web,\nand preserves the semiorder inclusion relationship among sets of words. Second, we propose a\nranking scheme to support a user in checking whether each enumerated pair actually suggests\ninclusion dependencies. The ranking scheme sorts the enumerated pairs so that we can examine a\nsmall number of pairs for simultaneously verifying many pairs. Finally, we prove that there exist\nefficient algorithms for the ranking scheme. In addition to the theoretical results for the signature\nand ranking schemes, we present a comprehensive set of experimental results using various real\nWeb sites. The results show that in the enumeration process the signature scheme reduces the\nnumber of candidate pairs by orders of magnitude, and that the ranking scheme allows a small\nnumber of higher ranked results to cover many other pairs.","subitem_description_type":"Abstract"}]},"item_11_identifier_34":{"attribute_name":"URI","attribute_value_mlt":[{"subitem_identifier_type":"HDL","subitem_identifier_uri":"http://hdl.handle.net/2241/121239"}]},"item_11_publisher_27":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"筑波大学図書館情報メディア系"}]},"item_11_relation_36":{"attribute_name":"シリーズ","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"SLIS-TR;2014-001"}]}]},"item_11_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"author"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Morishima, Atsuyuki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yumiya, Erika"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takahashi, Masami"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Sugimoto, Shigeo"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kitagawa, Hiroyuki"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2014-05-09"}],"displaytype":"detail","filename":"SLIS-TR-2014-001.pdf","filesize":[{"value":"613.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"SLIS-TR-2014-001.pdf","url":"https://tsukuba.repo.nii.ac.jp/record/30365/files/SLIS-TR-2014-001.pdf"},"version_id":"d32c143f-342d-4b06-a6aa-e1fbb9b223e9"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"technical report","resourceuri":"http://purl.org/coar/resource_type/c_18gh"}]},"item_title":"Efficient Filtering and Ranking Schemes for Finding Inclusion Dependencies on the Web","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Efficient Filtering and Ranking Schemes for Finding Inclusion Dependencies on the Web"}]},"item_type_id":"11","owner":"1","path":["2664"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-04-11"},"publish_date":"2014-04-11","publish_status":"0","recid":"30365","relation_version_is_last":true,"title":["Efficient Filtering and Ranking Schemes for Finding Inclusion Dependencies on the Web"],"weko_creator_id":"1","weko_shared_id":5},"updated":"2022-04-27T09:46:01.479760+00:00"}