{"title":"使用时间粒度表进行逐步粒度数据聚合","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":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"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\":null,\"pages\":null},\"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}","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}
Using a Time Granularity Table for Gradual Granular Data Aggregation
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.
期刊介绍:
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.