WEKO3
アイテム
{"_buckets": {"deposit": "2dde38a7-c5f1-43b4-85e8-9cab8b32d397"}, "_deposit": {"id": "48962", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "48962"}, "status": "published"}, "_oai": {"id": "oai:repository.dl.itc.u-tokyo.ac.jp:00048962", "sets": ["15", "96"]}, "item_2_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2000-12-25", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "12", "bibliographicPageEnd": "2698", "bibliographicPageStart": "2689", "bibliographicVolumeNumber": "E83-A", "bibliographic_titles": [{"bibliographic_title": "IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences"}]}]}, "item_2_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Two new algorithms for improving the speed of the LZ77 compression are proposed. One is based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting. The former is suitable for small dictionaries and it significantly improves the speed of gzip, which uses a naive hashing algorithm. The latter is suitable for large dictionaries which improve compression ratio for large files. We also experiment on the compression ratio and the speed of block sorting compression, which uses suffix sorting in its compression algorithm. The results show that the LZ77 using the two-level hash is suitable for small dictionaries, the LZ77 using suffix sorting is good for large dictionaries when fast decompression speed and efficient use of memory are necessary, and block sorting is good for large dictionaries.", "subitem_description_type": "Abstract"}]}, "item_2_description_6": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "PAPER", "subitem_description_type": "Other"}]}, "item_2_publisher_20": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers"}]}, "item_2_relation_25": {"attribute_name": "関係URI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "https://search.ieice.org/", "subitem_relation_type_select": "URI"}}]}, "item_2_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "copyright©2000 IEICE"}]}, "item_2_select_14": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_2_text_4": {"attribute_name": "著者所属", "attribute_value_mlt": [{"subitem_text_value": "the Department of Information Science, The University of Tokyo"}, {"subitem_text_value": "the Department of System Information Sciences, Graduate School of Information Sciences, Tohoku University"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "SADAKANE, Kunihiko"}], "nameIdentifiers": [{"nameIdentifier": "145492", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "IMAI, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "145493", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-12-15"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting 2000.pdf", "filesize": [{"value": "508.0 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 508000.0, "url": {"label": "Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting 2000.pdf", "url": "https://repository.dl.itc.u-tokyo.ac.jp/record/48962/files/Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting 2000.pdf"}, "version_id": "2b338a6c-5cbe-4356-91e1-205f98fed1b8"}]}, "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": "Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting"}]}, "item_type_id": "2", "owner": "1", "path": ["15", "96"], "permalink_uri": "http://hdl.handle.net/2261/00074087", "pubdate": {"attribute_name": "公開日", "attribute_value": "2017-12-14"}, "publish_date": "2017-12-14", "publish_status": "0", "recid": "48962", "relation": {}, "relation_version_is_last": true, "title": ["Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting"], "weko_shared_id": null}
Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting
http://hdl.handle.net/2261/00074087
http://hdl.handle.net/2261/000740879d63cbbc-1812-487a-99ad-9a91a3abd9fa
名前 / ファイル | ライセンス | アクション |
---|---|---|
Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting 2000.pdf (508.0 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2017-12-14 | |||||
タイトル | ||||||
タイトル | Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
SADAKANE, Kunihiko
× SADAKANE, Kunihiko× IMAI, Hiroshi |
|||||
著者所属 | ||||||
著者所属 | the Department of Information Science, The University of Tokyo | |||||
著者所属 | ||||||
著者所属 | the Department of System Information Sciences, Graduate School of Information Sciences, Tohoku University | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | Two new algorithms for improving the speed of the LZ77 compression are proposed. One is based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting. The former is suitable for small dictionaries and it significantly improves the speed of gzip, which uses a naive hashing algorithm. The latter is suitable for large dictionaries which improve compression ratio for large files. We also experiment on the compression ratio and the speed of block sorting compression, which uses suffix sorting in its compression algorithm. The results show that the LZ77 using the two-level hash is suitable for small dictionaries, the LZ77 using suffix sorting is good for large dictionaries when fast decompression speed and efficient use of memory are necessary, and block sorting is good for large dictionaries. | |||||
内容記述 | ||||||
内容記述タイプ | Other | |||||
内容記述 | PAPER | |||||
書誌情報 |
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences 巻 E83-A, 号 12, p. 2689-2698, 発行日 2000-12-25 |
|||||
権利 | ||||||
権利情報 | copyright©2000 IEICE | |||||
著者版フラグ | ||||||
値 | publisher | |||||
出版者 | ||||||
出版者 | Institute of Electronics, Information and Communication Engineers | |||||
関係URI | ||||||
識別子タイプ | URI | |||||
関連識別子 | https://search.ieice.org/ |