Aggregating and Disaggregating Flexibility Objects

In many scientific and commercial domains, we encounter flexibility objects, i.e., objects with explicit flexibilities in a time and an amount dimension (e.g., energy or product amount). Applications of flexibility objects require novel and efficient techniques capable of handling large amounts of such objects while preserving flexibility. Hence, this paper formally defines the concept of flexibility objects (flex-objects) and provides a novel and efficient solution for aggregating and disaggregating flex-objects. Out of the broad range of possible applications, this paper will focus on smart grid energy data management and discuss strategies for aggregation and disaggregation of flex-objects while retaining flexibility. This paperfurther extends these approaches beyond flex-objects originating from energy consumption by additionally considering flex-objects originating from energy production and aiming at energy balancing during aggregation. In more detail, this paper considers the complete life cycle of flex-objects: aggregation, disaggregation, associated requirements, efficient incremental computation, and balance aggregation techniques. Extensive experiments based on real-world data from the energy domain show that the proposed solutions provide good performance while satisfying the strict requirements.

[1]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[2]  Bongki Moon,et al.  Efficient Algorithms for Large-Scale Temporal Aggregation , 2003, IEEE Trans. Knowl. Data Eng..

[3]  M. Yue A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm , 1991 .

[4]  Won Suk Lee,et al.  Statistical grid-based clustering over data streams , 2004, SGMD.

[5]  Tian Zhang,et al.  BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.

[6]  Torben Bach Pedersen,et al.  Aggregating and Disaggregating Flexibility Objects , 2012, SSDBM.

[7]  H. Edelsbrunner,et al.  Efficient algorithms for agglomerative hierarchical clustering methods , 1984 .

[8]  Christian S. Jensen,et al.  A foundation for capturing and querying complex multidimensional data , 2001, Inf. Syst..

[9]  Jennifer Widom,et al.  Incremental computation and maintenance of temporal aggregates , 2003, The VLDB Journal.

[10]  Yin Yang,et al.  Continuous k-Means Monitoring over Moving Objects , 2008, IEEE Transactions on Knowledge and Data Engineering.

[11]  Richard E. Korf,et al.  A new algorithm for optimal bin packing , 2002, AAAI/IAAI.

[12]  Jaime G. Carbonell,et al.  Incremental Aggregation on Multiple Continuous Queries , 2006, ISMIS.

[13]  Chi-Yin Chow,et al.  Aggregate Location Monitoring for Wireless Sensor Networks: A Histogram-Based Approach , 2009, 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware.

[14]  Esteban Zimányi,et al.  Advanced Data Warehouse Design: From Conventional to Spatial and Temporal Applications , 2010 .

[15]  Richard T. Snodgrass,et al.  Main Memory-Based Algorithms for Efficient Parallel Aggregation for Temporal Databases , 2004, Distributed and Parallel Databases.

[16]  Xiang Yu,et al.  An incremental clustering algorithm based on grid , 2011, 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD).

[17]  Christian S. Jensen,et al.  How Would You Like to Aggregate Your Temporal Data? , 2006, Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06).

[18]  Robin Sibson,et al.  SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..

[19]  Jiadong Ren,et al.  A Clustering Algorithm Based on Matrix over High Dimensional Data Stream , 2010, WISM.

[20]  Walid G. Aref,et al.  SimDB: a similarity-aware database system , 2010, SIGMOD Conference.

[21]  Donghui Zhang,et al.  Aggregation computation over complex objects , 2002 .

[22]  Jennifer Widom,et al.  Resource Sharing in Continuous Sliding-Window Aggregates , 2004, VLDB.

[23]  M. Yue,et al.  A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm , 1991 .

[24]  Christian S. Jensen,et al.  Multi-dimensional Aggregation for Temporal Data , 2006, EDBT.

[25]  Michael H. Böhlen,et al.  Parsimonious temporal aggregation , 2009, EDBT.

[26]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[27]  Tea Tusar,et al.  Evolutionary scheduling of flexible offers for balancing electricity supply and demand , 2012, 2012 IEEE Congress on Evolutionary Computation.

[28]  Beng Chin Ooi,et al.  Continuous Clustering of Moving Objects , 2007, IEEE Transactions on Knowledge and Data Engineering.

[29]  Michael H. Böhlen,et al.  Parsimonious temporal aggregation , 2009, EDBT '09.

[30]  Walid G. Aref,et al.  Similarity Group-By , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[31]  Torben Bach Pedersen,et al.  Data management in the MIRABEL smart grid system , 2012, EDBT-ICDT '12.

[32]  Jordi Cabot,et al.  Specifying Aggregation Functions in Multidimensional Models with OCL , 2010, ER.