元组数据集的动态属性添加方案

Yohsuke Chiba, Shogo Kitajima, T. Tsuji, K. Higuchi
{"title":"元组数据集的动态属性添加方案","authors":"Yohsuke Chiba, Shogo Kitajima, T. Tsuji, K. Higuchi","doi":"10.1145/3011141.3011164","DOIUrl":null,"url":null,"abstract":"Nowadays in response to the expansion and diversification of business operations, demands for dynamic change of dataset definitions (schema evolution) such as new attribute additions is increasing. However, in order to handle the tuples after the attribute additions efficiently, reorganization of the dataset is necessitated and high operation cost would be accompanied. History-pattern encoding scheme for dynamic multidimensional datasets is based on the notion of multidimensional extendible array. It can provide fast retrieval capability of the datasets while suppressing storage cost minimally. In this paper, using the history-pattern encoding scheme, we will presents the schemes of dynamic attribute addition for dynamically extending tuple datasets, and evaluate them.","PeriodicalId":247823,"journal":{"name":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A scheme of dynamic attributes addition for tuple datasets\",\"authors\":\"Yohsuke Chiba, Shogo Kitajima, T. Tsuji, K. Higuchi\",\"doi\":\"10.1145/3011141.3011164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays in response to the expansion and diversification of business operations, demands for dynamic change of dataset definitions (schema evolution) such as new attribute additions is increasing. However, in order to handle the tuples after the attribute additions efficiently, reorganization of the dataset is necessitated and high operation cost would be accompanied. History-pattern encoding scheme for dynamic multidimensional datasets is based on the notion of multidimensional extendible array. It can provide fast retrieval capability of the datasets while suppressing storage cost minimally. In this paper, using the history-pattern encoding scheme, we will presents the schemes of dynamic attribute addition for dynamically extending tuple datasets, and evaluate them.\",\"PeriodicalId\":247823,\"journal\":{\"name\":\"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3011141.3011164\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3011141.3011164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着业务运营的扩展和多样化,对数据集定义动态变化(模式演化)的需求日益增加,例如增加新的属性。然而,为了有效地处理添加属性后的元组,需要对数据集进行重组,并且会带来较高的操作成本。动态多维数据集的历史模式编码方案基于多维可扩展数组的概念。它可以提供数据集的快速检索能力,同时最大限度地降低存储成本。本文采用历史模式编码方案,提出了动态扩展元组数据集的动态属性添加方案,并对其进行了计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A scheme of dynamic attributes addition for tuple datasets
Nowadays in response to the expansion and diversification of business operations, demands for dynamic change of dataset definitions (schema evolution) such as new attribute additions is increasing. However, in order to handle the tuples after the attribute additions efficiently, reorganization of the dataset is necessitated and high operation cost would be accompanied. History-pattern encoding scheme for dynamic multidimensional datasets is based on the notion of multidimensional extendible array. It can provide fast retrieval capability of the datasets while suppressing storage cost minimally. In this paper, using the history-pattern encoding scheme, we will presents the schemes of dynamic attribute addition for dynamically extending tuple datasets, and evaluate them.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信