Using a Time Granularity Table for Gradual Granular Data Aggregation

IF 0.4 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
N. Iftikhar, T. Pedersen
{"title":"Using a Time Granularity Table for Gradual Granular Data Aggregation","authors":"N. Iftikhar, T. Pedersen","doi":"10.3233/FI-2014-1039","DOIUrl":null,"url":null,"abstract":"The majority of today's systems increasingly require sophisticated data management as they need to store and to query large amounts of data for analysis and reporting purposes. In order to keep more \"detailed\" data available for longer periods, \"old\" data has to be reduced gradually to save space and improve query performance, especially on resource-constrained systems with limited storage and query processing capabilities. A number of data reduction solutions have been developed, however an effective solution particularly based on gradual data reduction is missing. This paper presents an effective solution for data reduction based on gradual granular data aggregation. With the gradual granular data aggregation mechanism, older data can be made coarse-grained while keeping the newest data fine-grained. For instance, when data is 3 months old aggregate to 1 minute level from 1 second level, when data is 6 months old aggregate to 2 minutes level from 1 minute level and so on. The proposed solution introduces a time granularity based data structure, namely a relational time granularity table that enables long term storage of old data by maintaining it at different levels of granularity and effective query processing due to a reduction in data volume. In addition, the paper describes the implementation strategy derived from a farming case study using standard technologies.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"17 1","pages":"219-233"},"PeriodicalIF":0.4000,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fundamenta Informaticae","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3233/FI-2014-1039","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 10

Abstract

The majority of today's systems increasingly require sophisticated data management as they need to store and to query large amounts of data for analysis and reporting purposes. In order to keep more "detailed" data available for longer periods, "old" data has to be reduced gradually to save space and improve query performance, especially on resource-constrained systems with limited storage and query processing capabilities. A number of data reduction solutions have been developed, however an effective solution particularly based on gradual data reduction is missing. This paper presents an effective solution for data reduction based on gradual granular data aggregation. With the gradual granular data aggregation mechanism, older data can be made coarse-grained while keeping the newest data fine-grained. For instance, when data is 3 months old aggregate to 1 minute level from 1 second level, when data is 6 months old aggregate to 2 minutes level from 1 minute level and so on. The proposed solution introduces a time granularity based data structure, namely a relational time granularity table that enables long term storage of old data by maintaining it at different levels of granularity and effective query processing due to a reduction in data volume. In addition, the paper describes the implementation strategy derived from a farming case study using standard technologies.
使用时间粒度表进行逐步粒度数据聚合
当今的大多数系统越来越需要复杂的数据管理,因为它们需要存储和查询用于分析和报告目的的大量数据。为了在更长的时间内保持更“详细”的数据可用,必须逐步减少“旧”数据,以节省空间并提高查询性能,特别是在存储和查询处理能力有限的资源受限系统上。已经开发了一些数据缩减的解决方案,但是缺少一种特别基于逐步数据缩减的有效解决方案。本文提出了一种基于逐步粒度数据聚合的有效数据约简方法。通过渐进式粒度数据聚合机制,可以使旧数据变得粗粒度,同时保持最新数据的细粒度。例如,当数据为3个月时,从1秒级聚合到1分钟级,当数据为6个月时,从1分钟级聚合到2分钟级,等等。提出的解决方案引入了一种基于时间粒度的数据结构,即关系时间粒度表,通过在不同粒度级别上维护旧数据来实现旧数据的长期存储,并且由于数据量减少而实现有效的查询处理。此外,本文还描述了从使用标准技术的农业案例研究中得出的实施策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Fundamenta Informaticae
Fundamenta Informaticae 工程技术-计算机:软件工程
CiteScore
2.00
自引率
0.00%
发文量
61
审稿时长
9.8 months
期刊介绍: Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing: solutions by mathematical methods of problems emerging in computer science solutions of mathematical problems inspired by computer science. Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, algebraic and categorical methods.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信