A Method for Dynamic Packing of Data Blocks for Over-the-Network Indexing

• Item type: SIG Technical Reports(1)
• 公開日: 2015-09-21
• タイトル: A Method for Dynamic Packing of Data Blocks for Over-the-Network Indexing
• タイトル / 言語: en
• タイトル: A Method for Dynamic Packing of Data Blocks for Over-the-Network Indexing
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Computer Science and Systems Engineering Kyushu Institute of Technology
• 著者所属(英): en
• 著者所属(英): Computer Science and Systems Engineering Kyushu Institute of Technology
• 著者名: Marat, Zhanikeev
• 著者名(英): Marat, Zhanikeev
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: The problem of over-the-network indexing has been raised in recent literature. Indexing is traditionally done on a local filesystem. When processing/access and storage are separated by network, traditional methods perform poorly, even if rewritten for over-the-network logic. The new engine called Stringex was newly proposed with over-the-network efficiency in mind. However, although blocksize is optimized by the method, it is fixed for the entire index. This paper looks into a way to allow for dynamic blocksize. The problem is formulated as dynamic packing of unit blocks for optimal over-the-network access. The new method also takes into account the issue of atomicity of operations in multiuser environments, where each of the multiple users can experience drastically different performance on end-to-end network paths.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: The problem of over-the-network indexing has been raised in recent literature. Indexing is traditionally done on a local filesystem. When processing/access and storage are separated by network, traditional methods perform poorly, even if rewritten for over-the-network logic. The new engine called Stringex was newly proposed with over-the-network efficiency in mind. However, although blocksize is optimized by the method, it is fixed for the entire index. This paper looks into a way to allow for dynamic blocksize. The problem is formulated as dynamic packing of unit blocks for optimal over-the-network access. The new method also takes into account the issue of atomicity of operations in multiuser environments, where each of the multiple users can experience drastically different performance on end-to-end network paths.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN1009593X
• 書誌情報: 研究報告アルゴリズム（AL）; 巻 2015-AL-154, 号 3, p. 1-4, 発行日 2015-09-21
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 2188-8566
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会